Unnamed: 0
int64 0
350k
| ApplicationNumber
int64 9.75M
96.1M
| ArtUnit
int64 1.6k
3.99k
| Abstract
stringlengths 7
8.37k
| Claims
stringlengths 3
292k
| abstract-claims
stringlengths 68
293k
| TechCenter
int64 1.6k
3.9k
|
|---|---|---|---|---|---|---|
4,900 | 14,691,402 | 2,168 | Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for managing search results. In one aspect, a method includes receiving a set of search results. The set of search results is responsive to a search query received from a user. The method includes determining whether the search query is a navigational query or an exploratory query. The method also includes determining a number of search results to be presented to the user depending on whether the search query is determined to be a navigational query or an exploratory query. | 1. A computer-implemented method comprising:
receiving a set of search results, wherein the set of search results is responsive to a search query received from a user; determining whether the search query is a navigational query or an exploratory query; and determining a number of search results to be presented to the user depending on whether the search query is determined to be a navigational query or an exploratory query. 2. The computer-implemented method of claim 1 wherein determining whether the search query is a navigational query or an exploratory query comprises analyzing a score associated with at least one search result from the set of search results, wherein the score is associated with ranking the at least one search result in the set of search results and includes at least one of a title component and a category component. 3. The computer-implemented method of claim 1 further comprising displaying the entire set of search results if the search query is determined to be an exploratory query. 4. The computer-implemented method of claim 1 further comprising displaying a subset of the set of search results if the search query is determined to be a navigational query. 5. The computer-implemented method of claim 2 wherein analyzing the score includes comparing the title component of the score to a predetermined threshold. 6. The computer-implemented method of claim 2 wherein analyzing the score includes comparing the category component of the score to a second predetermined threshold. 7. The computer-implemented method of claim 1, wherein determining whether the search query is a navigational query or an exploratory query comprises analyzing stored user responses, wherein the stored user responses include user selections of search results previously presented in response to a previously submitted search query similar to the search query. 8. The computer-implemented method of claim 7 wherein analyzing the stored user responses includes:
determining a degree of entropy associated with user selections of the previously presented search results. 9. A system, comprising:
one or more memories storing instructions; and one or more processors, coupled to the one or more memories, and configured to execute the instructions stored on the one or more memories in order to:
receive a set of search results, wherein the set of search results is responsive to a search query received from a user;
determine whether the search query is a navigational query or an exploratory query; and
determine a number of search results to be presented to the user depending on whether the search query is determined to be a navigational query or an exploratory query. 10. The system of claim 9 wherein determining whether the search query is a navigational query or an exploratory query comprises analyzing a score associated with at least one search result from the set of search results, wherein the score is associated with ranking the at least one search result in the set of search results and includes at least one of a title component and a category component. 11. The system of claim 9 wherein the one or more processors are further configured to execute the instructions stored on the one or more memories in order to:
display the entire set of search results if the search query is determined to be an exploratory query. 12. The system of claim 9 wherein the one or more processors are further configured to execute the instructions stored on the one or more memories in order to:
display a subset of the set of search results if the search query is determined to be a navigational query. 13. The system of claim 10 wherein analyzing the score includes comparing the title component of the score to a predetermined threshold. 14. The system of claim 10 wherein analyzing the score includes comparing the category component of the score to a second predetermined threshold. 15. The system of claim 9 wherein determining whether the search query is a navigational query or an exploratory query comprises analyzing stored user responses, wherein the stored user responses include user selections of search results previously presented in response to a previously submitted search query similar to the search query. 16. The system of claim 15 wherein analyzing the stored user responses includes:
determining a degree of entropy associated with user selections of the previously presented search results. | Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for managing search results. In one aspect, a method includes receiving a set of search results. The set of search results is responsive to a search query received from a user. The method includes determining whether the search query is a navigational query or an exploratory query. The method also includes determining a number of search results to be presented to the user depending on whether the search query is determined to be a navigational query or an exploratory query.1. A computer-implemented method comprising:
receiving a set of search results, wherein the set of search results is responsive to a search query received from a user; determining whether the search query is a navigational query or an exploratory query; and determining a number of search results to be presented to the user depending on whether the search query is determined to be a navigational query or an exploratory query. 2. The computer-implemented method of claim 1 wherein determining whether the search query is a navigational query or an exploratory query comprises analyzing a score associated with at least one search result from the set of search results, wherein the score is associated with ranking the at least one search result in the set of search results and includes at least one of a title component and a category component. 3. The computer-implemented method of claim 1 further comprising displaying the entire set of search results if the search query is determined to be an exploratory query. 4. The computer-implemented method of claim 1 further comprising displaying a subset of the set of search results if the search query is determined to be a navigational query. 5. The computer-implemented method of claim 2 wherein analyzing the score includes comparing the title component of the score to a predetermined threshold. 6. The computer-implemented method of claim 2 wherein analyzing the score includes comparing the category component of the score to a second predetermined threshold. 7. The computer-implemented method of claim 1, wherein determining whether the search query is a navigational query or an exploratory query comprises analyzing stored user responses, wherein the stored user responses include user selections of search results previously presented in response to a previously submitted search query similar to the search query. 8. The computer-implemented method of claim 7 wherein analyzing the stored user responses includes:
determining a degree of entropy associated with user selections of the previously presented search results. 9. A system, comprising:
one or more memories storing instructions; and one or more processors, coupled to the one or more memories, and configured to execute the instructions stored on the one or more memories in order to:
receive a set of search results, wherein the set of search results is responsive to a search query received from a user;
determine whether the search query is a navigational query or an exploratory query; and
determine a number of search results to be presented to the user depending on whether the search query is determined to be a navigational query or an exploratory query. 10. The system of claim 9 wherein determining whether the search query is a navigational query or an exploratory query comprises analyzing a score associated with at least one search result from the set of search results, wherein the score is associated with ranking the at least one search result in the set of search results and includes at least one of a title component and a category component. 11. The system of claim 9 wherein the one or more processors are further configured to execute the instructions stored on the one or more memories in order to:
display the entire set of search results if the search query is determined to be an exploratory query. 12. The system of claim 9 wherein the one or more processors are further configured to execute the instructions stored on the one or more memories in order to:
display a subset of the set of search results if the search query is determined to be a navigational query. 13. The system of claim 10 wherein analyzing the score includes comparing the title component of the score to a predetermined threshold. 14. The system of claim 10 wherein analyzing the score includes comparing the category component of the score to a second predetermined threshold. 15. The system of claim 9 wherein determining whether the search query is a navigational query or an exploratory query comprises analyzing stored user responses, wherein the stored user responses include user selections of search results previously presented in response to a previously submitted search query similar to the search query. 16. The system of claim 15 wherein analyzing the stored user responses includes:
determining a degree of entropy associated with user selections of the previously presented search results. | 2,100 |
4,901 | 14,010,316 | 2,131 | Techniques are described for storing a virtual disk in an object store comprising a plurality of physical storage devices housed in a plurality of host computers. A profile is received for creation of the virtual disk wherein the profile specifies storage properties desired for an intended use of the virtual disk. A virtual disk blueprint is generated based on the profile such that that the virtual disk blueprint describes a storage organization for the virtual disk that addresses redundancy or performance requirements corresponding to the profile. A set of the physical storage devices that can store components of the virtual disk in a manner that satisfies the storage organization is then determined. | 1. A method for storing a virtual disk in an object store comprising a plurality of physical storage devices housed in a plurality of host computers, the method comprising:
receiving a profile for creation of the virtual disk, wherein the profile specifies storage properties desired for an intended use of the virtual disk; generating a virtual disk blueprint based on the profile, wherein the virtual disk blueprint describes a storage organization for the virtual disk that addresses redundancy or performance requirements corresponding to the profile; and determining a set of the physical storage devices that can store components of the virtual disk in a manner that satisfies the storage organization. 2. The method of claim 1, wherein the storage properties include at least one of a capacity of the virtual disk, uptime availability desired for the virtual disk or an IOPS performance rate desired for the virtual disk. 3. The method of claim 1, wherein the determining step further comprises consulting a database that tracks current states of the physical storage devices, wherein each of the plurality of host computers that houses at least one of the physical storage devices updates the database whenever there is a change to the state of its corresponding physical storage devices. 4. The method of claim 3, wherein the database tracks at least one of throughput of the physical storage devices, IOPS of the physical storage devices, CPU cycles of the host computers and memory usage of the host computers. 5. The method of claim 3, wherein the storage organization describes a distribution of data stored in the virtual disk in accordance with one or more RAID levels. 6. The method of claim 3, wherein the storage organization describes a distribution of data stored in the virtual disk in accordance with erasure codes. 7. The method of claim 5, wherein components of the virtual disk that may be stored in the determined set of physical storage devices correspond to stripes in a RAID stripe set described in the storage organization and are each represented by a corresponding component object of the virtual disk within the object store. 8. The method of claim 7, further comprising the steps of:
requesting host computers that house the determined set of physical storage devices to allocate storage locations in the set of physical storage devices for the corresponding component objects of the virtual disk; and upon receiving a confirmation that a storage location has been allocated by one of the host computer, updating the database with a mapping of the allocated storage location to the corresponding component object. 9. The method of claim 8, further comprising the steps of:
monitoring the current states of the physical storage devices to identify any changes in the operation of the physical storage devices that would result in an inability of the virtual disk to satisfy the profile based the storage locations of the component objects; and determining new storage locations for component objects that would satisfy the profile based on the current states of the physical storage devices. 10. A non-transitory computer readable storage medium storing instructions, which, when executed on a processor, performs an operation for storing a virtual disk in an object store comprising a plurality of physical storage devices housed in a plurality of host computers, the operation comprising:
receiving a profile for creation of the virtual disk, wherein the profile specifies storage properties desired for an intended use of the virtual disk; generating a virtual disk blueprint based on the profile, wherein the virtual disk blueprint describes a storage organization for the virtual disk that addresses redundancy or performance requirements corresponding to the profile; and determining a set of the physical storage devices that can store components of the virtual disk in a manner that satisfies the storage organization. 11. The computer readable storage medium of claim 10, wherein the storage properties include at least one of a capacity of the virtual disk, uptime availability desired for the virtual disk or an IOPS performance rate desired for the virtual disk. 12. The computer readable storage medium of claim 10, wherein the determining step further comprises consulting a database that tracks current states of the physical storage devices, wherein each of the plurality of host computers that houses at least one of the physical storage devices updates the database whenever there is a change to the state of its corresponding physical storage devices. 13. The computer readable storage medium of claim 12, wherein the storage organization describes a distribution of data stored in the virtual disk in accordance with one or more RAID levels. 14. The computer readable storage medium of claim 13, wherein components of the virtual disk that may be stored in the determined set of physical storage devices correspond to stripes in a RAID stripe set described in the storage organization and are each represented by a corresponding component object of the virtual disk within the object store. 15. The computer readable storage medium of claim 14, wherein the operation further comprises:
requesting host computers that house the determined set of physical storage devices to allocate storage locations in the set of physical storage devices for the corresponding component objects of the virtual disk; and upon receiving a confirmation that a storage location has been allocated by one of the host computer, updating the database with a mapping of the allocated storage location to the corresponding component object. 16. The computer readable storage medium of claim 15, wherein the operation further comprises:
monitoring the current states of the physical storage devices to identify any changes in the operation of the physical storage devices that would result in an inability of the virtual disk to satisfy the profile based the storage locations of the component objects; and determining new storage locations for component objects that would satisfy the profile based on the current states of the physical storage devices. 17. A computer system, comprising:
a processor and a memory hosting a module, which, when executed on the processor, performs an operation for storing a virtual disk in an object store comprising a plurality of physical storage devices housed in a plurality of host computers, the operation comprising:
receiving a profile for creation of the virtual disk, wherein the profile specifies storage properties desired for an intended use of the virtual disk;
generating a virtual disk blueprint based on the profile, wherein the virtual disk blueprint describes a storage organization for the virtual disk that addresses redundancy or performance requirements corresponding to the profile; and
determining a set of the physical storage devices that can store components of the virtual disk in a manner that satisfies the storage organization. 18. The computer system of claim 17 wherein the determining step further comprises consulting a database that tracks current states of the physical storage devices, wherein each of the plurality of host computers that houses at least one of the physical storage devices updates the database whenever there is a change to the state of its corresponding physical storage devices. 19. The computer system of claim 18, wherein the storage organization describes a distribution of data stored in the virtual disk in accordance with one or more RAID levels. 20. The computer system of claim 19, wherein components of the virtual disk that may be stored in the determined set of physical storage devices correspond to stripes in a RAID stripe set described in the storage organization and are each represented by a corresponding component object of the virtual disk within the object store. 21. The computer system of claim 20, wherein the operation further comprises:
requesting host computers that house the determined set of physical storage devices to allocate storage locations in the set of physical storage devices for the corresponding component objects of the virtual disk; and upon receiving a confirmation that a storage location has been allocated by one of the host computer, updating the database with a mapping of the allocated storage location to the corresponding component object. 22. The computer system of claim 21, wherein the operation further comprises:
monitoring the current states of the physical storage devices to identify any changes in the operation of the physical storage devices that would result in an inability of the virtual disk to satisfy the profile based the storage locations of the component objects; and determining new storage locations for component objects that would satisfy the profile based on the current states of the physical storage devices. | Techniques are described for storing a virtual disk in an object store comprising a plurality of physical storage devices housed in a plurality of host computers. A profile is received for creation of the virtual disk wherein the profile specifies storage properties desired for an intended use of the virtual disk. A virtual disk blueprint is generated based on the profile such that that the virtual disk blueprint describes a storage organization for the virtual disk that addresses redundancy or performance requirements corresponding to the profile. A set of the physical storage devices that can store components of the virtual disk in a manner that satisfies the storage organization is then determined.1. A method for storing a virtual disk in an object store comprising a plurality of physical storage devices housed in a plurality of host computers, the method comprising:
receiving a profile for creation of the virtual disk, wherein the profile specifies storage properties desired for an intended use of the virtual disk; generating a virtual disk blueprint based on the profile, wherein the virtual disk blueprint describes a storage organization for the virtual disk that addresses redundancy or performance requirements corresponding to the profile; and determining a set of the physical storage devices that can store components of the virtual disk in a manner that satisfies the storage organization. 2. The method of claim 1, wherein the storage properties include at least one of a capacity of the virtual disk, uptime availability desired for the virtual disk or an IOPS performance rate desired for the virtual disk. 3. The method of claim 1, wherein the determining step further comprises consulting a database that tracks current states of the physical storage devices, wherein each of the plurality of host computers that houses at least one of the physical storage devices updates the database whenever there is a change to the state of its corresponding physical storage devices. 4. The method of claim 3, wherein the database tracks at least one of throughput of the physical storage devices, IOPS of the physical storage devices, CPU cycles of the host computers and memory usage of the host computers. 5. The method of claim 3, wherein the storage organization describes a distribution of data stored in the virtual disk in accordance with one or more RAID levels. 6. The method of claim 3, wherein the storage organization describes a distribution of data stored in the virtual disk in accordance with erasure codes. 7. The method of claim 5, wherein components of the virtual disk that may be stored in the determined set of physical storage devices correspond to stripes in a RAID stripe set described in the storage organization and are each represented by a corresponding component object of the virtual disk within the object store. 8. The method of claim 7, further comprising the steps of:
requesting host computers that house the determined set of physical storage devices to allocate storage locations in the set of physical storage devices for the corresponding component objects of the virtual disk; and upon receiving a confirmation that a storage location has been allocated by one of the host computer, updating the database with a mapping of the allocated storage location to the corresponding component object. 9. The method of claim 8, further comprising the steps of:
monitoring the current states of the physical storage devices to identify any changes in the operation of the physical storage devices that would result in an inability of the virtual disk to satisfy the profile based the storage locations of the component objects; and determining new storage locations for component objects that would satisfy the profile based on the current states of the physical storage devices. 10. A non-transitory computer readable storage medium storing instructions, which, when executed on a processor, performs an operation for storing a virtual disk in an object store comprising a plurality of physical storage devices housed in a plurality of host computers, the operation comprising:
receiving a profile for creation of the virtual disk, wherein the profile specifies storage properties desired for an intended use of the virtual disk; generating a virtual disk blueprint based on the profile, wherein the virtual disk blueprint describes a storage organization for the virtual disk that addresses redundancy or performance requirements corresponding to the profile; and determining a set of the physical storage devices that can store components of the virtual disk in a manner that satisfies the storage organization. 11. The computer readable storage medium of claim 10, wherein the storage properties include at least one of a capacity of the virtual disk, uptime availability desired for the virtual disk or an IOPS performance rate desired for the virtual disk. 12. The computer readable storage medium of claim 10, wherein the determining step further comprises consulting a database that tracks current states of the physical storage devices, wherein each of the plurality of host computers that houses at least one of the physical storage devices updates the database whenever there is a change to the state of its corresponding physical storage devices. 13. The computer readable storage medium of claim 12, wherein the storage organization describes a distribution of data stored in the virtual disk in accordance with one or more RAID levels. 14. The computer readable storage medium of claim 13, wherein components of the virtual disk that may be stored in the determined set of physical storage devices correspond to stripes in a RAID stripe set described in the storage organization and are each represented by a corresponding component object of the virtual disk within the object store. 15. The computer readable storage medium of claim 14, wherein the operation further comprises:
requesting host computers that house the determined set of physical storage devices to allocate storage locations in the set of physical storage devices for the corresponding component objects of the virtual disk; and upon receiving a confirmation that a storage location has been allocated by one of the host computer, updating the database with a mapping of the allocated storage location to the corresponding component object. 16. The computer readable storage medium of claim 15, wherein the operation further comprises:
monitoring the current states of the physical storage devices to identify any changes in the operation of the physical storage devices that would result in an inability of the virtual disk to satisfy the profile based the storage locations of the component objects; and determining new storage locations for component objects that would satisfy the profile based on the current states of the physical storage devices. 17. A computer system, comprising:
a processor and a memory hosting a module, which, when executed on the processor, performs an operation for storing a virtual disk in an object store comprising a plurality of physical storage devices housed in a plurality of host computers, the operation comprising:
receiving a profile for creation of the virtual disk, wherein the profile specifies storage properties desired for an intended use of the virtual disk;
generating a virtual disk blueprint based on the profile, wherein the virtual disk blueprint describes a storage organization for the virtual disk that addresses redundancy or performance requirements corresponding to the profile; and
determining a set of the physical storage devices that can store components of the virtual disk in a manner that satisfies the storage organization. 18. The computer system of claim 17 wherein the determining step further comprises consulting a database that tracks current states of the physical storage devices, wherein each of the plurality of host computers that houses at least one of the physical storage devices updates the database whenever there is a change to the state of its corresponding physical storage devices. 19. The computer system of claim 18, wherein the storage organization describes a distribution of data stored in the virtual disk in accordance with one or more RAID levels. 20. The computer system of claim 19, wherein components of the virtual disk that may be stored in the determined set of physical storage devices correspond to stripes in a RAID stripe set described in the storage organization and are each represented by a corresponding component object of the virtual disk within the object store. 21. The computer system of claim 20, wherein the operation further comprises:
requesting host computers that house the determined set of physical storage devices to allocate storage locations in the set of physical storage devices for the corresponding component objects of the virtual disk; and upon receiving a confirmation that a storage location has been allocated by one of the host computer, updating the database with a mapping of the allocated storage location to the corresponding component object. 22. The computer system of claim 21, wherein the operation further comprises:
monitoring the current states of the physical storage devices to identify any changes in the operation of the physical storage devices that would result in an inability of the virtual disk to satisfy the profile based the storage locations of the component objects; and determining new storage locations for component objects that would satisfy the profile based on the current states of the physical storage devices. | 2,100 |
4,902 | 13,872,159 | 2,141 | A user can select content on an interface screen and provide an associated directional placement instruction to launch a new application window that displays the selected content or information associated with the selected content. The directional placement instruction may indicate an area of the screen where the user prefers to display the new application window. Responsive to the initiation of the directional placement instruction, a conversion module converts the selected content into a placeable representation of the new application. Responsive to receipt of the directional placement instruction, a window management system presents the new application window in the user interface in a location based on the directional placement instruction. | 1. A method comprising:
converting selected visible content of a first application window within a user interface into a placeable representation of an application associated with the selected visible content responsive to initiation of a directional placement instruction; and presenting a second application window associated with the application within the user interface based on the directional placement instruction. 2. The method of claim 1, wherein the second application window displays the selected visible content. 3. The method of claim 1, wherein the second application window displays different content associated with the selected visible content. 4. The method of claim 1, wherein placement of the second application window within the user interface is determined based on the directional placement instruction. 5. The method of claim 1, wherein the directional placement instruction includes a selected area of the user interface screen. 6. The method of claim 1, further comprising:
displaying the second application window within the user interface in place of another application window indicated by the directional placement instruction. 7. The method of claim 1, wherein the directional placement instruction includes dragging the selected visible content to a selected area. 8. The method of claim 1, wherein the placeable representation displays the second application window launched in response to initiation of the directional placement instruction. 9. The method of claim 1, wherein the directional placement instruction includes selection of another application window to be replaced by the second application window. 10. 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:
converting selected visible content of a first application window within a user interface into a placeable representation of an application associated with the selected visible content responsive to initiation of a directional placement instruction; and presenting a second application window associated with the application within the user interface based on the directional placement instruction. 11. The one or more tangible computer-readable storage media of claim 10, wherein the second application window displays the selected visible content. 12. The one or more tangible computer-readable storage media of claim 10, wherein placement of the second application window within the user interface is determined based on the directional placement instruction. 13. The one or more tangible computer-readable storage media of claim 10, wherein the directional placement instruction includes a selected area of the user interface screen. 14. The one or more tangible computer-readable storage media of claim 10, wherein the process further comprises:
displaying the second application window within the user interface in place of another application window indicated by the directional placement instruction. 15. The one or more tangible computer-readable storage media of claim 10, wherein the second application window is not a window of an already-executing application. 16. The one or more tangible computer-readable storage media of claim 10, wherein the directional placement instruction includes dragging the selected visible content to a selected area. 17. The one or more tangible computer-readable storage media of claim 10, wherein the directional placement instruction includes keyboard input. 18. The one or more tangible computer-readable storage media of claim 10, wherein the directional placement instruction includes selection of another application window to be replaced by the second application window. 19. A system comprising:
a computing device presenting a user interface; a conversion module configured to convert selected visible content of a first application window within the user interface into a placeable representation of an application associated with the selected visible content responsive to initiation of a directional placement instruction; and a window management module configured to present a second application window associated with the application within the user interface based on the directional placement instruction. 20. The system of claim 19, wherein the window management system is further configured to display the second application window in the user interface in place of another application window indicated by the directional placement instruction. | A user can select content on an interface screen and provide an associated directional placement instruction to launch a new application window that displays the selected content or information associated with the selected content. The directional placement instruction may indicate an area of the screen where the user prefers to display the new application window. Responsive to the initiation of the directional placement instruction, a conversion module converts the selected content into a placeable representation of the new application. Responsive to receipt of the directional placement instruction, a window management system presents the new application window in the user interface in a location based on the directional placement instruction.1. A method comprising:
converting selected visible content of a first application window within a user interface into a placeable representation of an application associated with the selected visible content responsive to initiation of a directional placement instruction; and presenting a second application window associated with the application within the user interface based on the directional placement instruction. 2. The method of claim 1, wherein the second application window displays the selected visible content. 3. The method of claim 1, wherein the second application window displays different content associated with the selected visible content. 4. The method of claim 1, wherein placement of the second application window within the user interface is determined based on the directional placement instruction. 5. The method of claim 1, wherein the directional placement instruction includes a selected area of the user interface screen. 6. The method of claim 1, further comprising:
displaying the second application window within the user interface in place of another application window indicated by the directional placement instruction. 7. The method of claim 1, wherein the directional placement instruction includes dragging the selected visible content to a selected area. 8. The method of claim 1, wherein the placeable representation displays the second application window launched in response to initiation of the directional placement instruction. 9. The method of claim 1, wherein the directional placement instruction includes selection of another application window to be replaced by the second application window. 10. 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:
converting selected visible content of a first application window within a user interface into a placeable representation of an application associated with the selected visible content responsive to initiation of a directional placement instruction; and presenting a second application window associated with the application within the user interface based on the directional placement instruction. 11. The one or more tangible computer-readable storage media of claim 10, wherein the second application window displays the selected visible content. 12. The one or more tangible computer-readable storage media of claim 10, wherein placement of the second application window within the user interface is determined based on the directional placement instruction. 13. The one or more tangible computer-readable storage media of claim 10, wherein the directional placement instruction includes a selected area of the user interface screen. 14. The one or more tangible computer-readable storage media of claim 10, wherein the process further comprises:
displaying the second application window within the user interface in place of another application window indicated by the directional placement instruction. 15. The one or more tangible computer-readable storage media of claim 10, wherein the second application window is not a window of an already-executing application. 16. The one or more tangible computer-readable storage media of claim 10, wherein the directional placement instruction includes dragging the selected visible content to a selected area. 17. The one or more tangible computer-readable storage media of claim 10, wherein the directional placement instruction includes keyboard input. 18. The one or more tangible computer-readable storage media of claim 10, wherein the directional placement instruction includes selection of another application window to be replaced by the second application window. 19. A system comprising:
a computing device presenting a user interface; a conversion module configured to convert selected visible content of a first application window within the user interface into a placeable representation of an application associated with the selected visible content responsive to initiation of a directional placement instruction; and a window management module configured to present a second application window associated with the application within the user interface based on the directional placement instruction. 20. The system of claim 19, wherein the window management system is further configured to display the second application window in the user interface in place of another application window indicated by the directional placement instruction. | 2,100 |
4,903 | 13,156,244 | 2,179 | In one implementation, user's browser loads the web site document containing reference to an advertisement and one or more site elements; browser issues request for an advertisement to the ad server and starts positioning one or more site elements; ad server responds with a script, containing computer instructions; first set of instructions is executed after the browser determines which site elements should be positioned inside the browser window, first instructions shifting positions of at least some of such elements by a shift vector, thereby creating en empty space near the site content, and second set of instruction is executed to display advertisement inside that space. | 1. A computer-implemented method executed on a computer system comprising a central processing unit and a memory, the method comprising:
a. a user browser loading a web site document containing a reference to an advertisement and one or more site elements, the browser displaying a browser window; b. the user browser issuing a request for an advertisement to an advertisement server and starting positioning one or more site elements within the browser window; and c. the user browser receiving from the advertisement server in response to the issued request a script, the script containing a first and a second sets of computer instructions; the first set of computer instructions being executed after the user browser determines which site elements should be positioned inside the browser window, first set of instructions shifting positions of at least some of the site elements by a shift vector, thereby creating an additional space near the site content, and the second set of computer instructions being executed to display an advertisement inside the additional space. 2. The method of claim 1, wherein some of the site elements are shifted down. 3. The method of claim 1, wherein the advertisement is positioned within the browser window above the shifted site elements. 4. The method of claim 1, wherein the advertisement is positioned within the browser window above the shifted site elements. 5. The method of claim 1, wherein the script is operable to cause an interactive element to be displayed within or near the displayed advertisement, the interactive element instructing the script to reverse the shift and hide the displayed advertisement. 6. The method of claim 1, wherein the first set of computer instructions comprises instructions for detecting whether the some elements of the site can be successfully shifted and if the detection indicates that the site cannot be successfully shifted, no shift is performed. 7. The method of claim 1, wherein the first set of computer instructions comprises instructions for marking of already sifted elements and periodic checking of the document object for the new unmarked elements and either shifting these new unmarked elements or canceling display of the advertisement and removing the additional space if the new unmarked elements cannot be successfully shifted. 8. A computer-readable medium comprising computer instructions, which, when executed by one or more processors of a computer system, cause the one or more processors to perform a computer-implemented method comprising:
a. a user browser loading a web site document containing a reference to an advertisement and one or more site elements, the user browser displaying a browser window; b. the user browser issuing a request for an advertisement to an advertisement server and starting positioning one or more site elements within the browser window; and c. the user browser receiving from the advertisement server in response to the issued request a script, the script containing a first and a second sets of computer instructions; the first set of computer instructions being executed after the user browser determines which site elements should be positioned inside the browser window, first set of instructions shifting positions of at least some of the site elements by a shift vector, thereby creating an additional space near the site content, and the second set of computer instructions being executed to display an advertisement inside the additional space. 9. The computer-readable medium of claim 8, wherein some of the site elements are shifted down. 10. The computer-readable medium of claim 8, wherein the advertisement is positioned within the browser window above the shifted site elements. 11. The computer-readable medium of claim 8, wherein the advertisement is positioned within the browser window above the shifted site elements. 12. The computer-readable medium of claim 8, wherein the script is operable to cause an interactive element to be displayed within or near the displayed advertisement, the interactive element instructing the script to reverse the shift and hide the displayed advertisement. 13. The computer-readable medium of claim 8, wherein the first set of computer instructions comprises instructions for detecting whether the some elements of the site can be successfully shifted and if the detection indicates that the site cannot be successfully shifted, no shift is performed. 14. The computer-readable medium of claim 8, wherein the first set of computer instructions comprises instructions for marking of already sifted elements and periodic checking of the document object for the new unmarked elements and either shifting these new unmarked elements or canceling display of the advertisement and removing the additional space if the new unmarked elements cannot be successfully shifted. 15. A computerized system comprising:
a. a memory unit; b. a central processing unit for executing a user browser for loading a web site document containing a reference to an advertisement and one or more site elements, the browser displaying a browser window, wherein the user browser issues a request for an advertisement to an advertisement server and starts positioning one or more site elements within the browser window; and c. a network interface for receiving from the advertisement server in response to the issued request a script, the script containing a first and a second sets of computer instructions; the first set of computer instructions being executed after the user browser determines which site elements should be positioned inside the browser window, first set of instructions shifting positions of at least some of the site elements by a shift vector, thereby creating an additional space near the site content, and the second set of computer instructions being executed to display an advertisement inside the additional space. 16. The computer-readable medium of claim 15, wherein the advertisement is positioned within the browser window above the shifted site elements. 17. The computer-readable medium of claim 15, wherein the advertisement is positioned within the browser window above the shifted site elements. 18. The computer-readable medium of claim 15, wherein the script is operable to cause an interactive element to be displayed within or near the displayed advertisement, the interactive element instructing the script to reverse the shift and hide the displayed advertisement. 19. The computer-readable medium of claim 15, wherein the first set of computer instructions comprises instructions for detecting whether the some elements of the site can be successfully shifted and if the detection indicates that the site cannot be successfully shifted, no shift is performed. 20. The computer-readable medium of claim 15, wherein the first set of computer instructions comprises instructions for marking of already sifted elements and periodic checking of the document object for the new unmarked elements and either shifting these new unmarked elements or canceling display of the advertisement and removing the additional space if the new unmarked elements cannot be successfully shifted. | In one implementation, user's browser loads the web site document containing reference to an advertisement and one or more site elements; browser issues request for an advertisement to the ad server and starts positioning one or more site elements; ad server responds with a script, containing computer instructions; first set of instructions is executed after the browser determines which site elements should be positioned inside the browser window, first instructions shifting positions of at least some of such elements by a shift vector, thereby creating en empty space near the site content, and second set of instruction is executed to display advertisement inside that space.1. A computer-implemented method executed on a computer system comprising a central processing unit and a memory, the method comprising:
a. a user browser loading a web site document containing a reference to an advertisement and one or more site elements, the browser displaying a browser window; b. the user browser issuing a request for an advertisement to an advertisement server and starting positioning one or more site elements within the browser window; and c. the user browser receiving from the advertisement server in response to the issued request a script, the script containing a first and a second sets of computer instructions; the first set of computer instructions being executed after the user browser determines which site elements should be positioned inside the browser window, first set of instructions shifting positions of at least some of the site elements by a shift vector, thereby creating an additional space near the site content, and the second set of computer instructions being executed to display an advertisement inside the additional space. 2. The method of claim 1, wherein some of the site elements are shifted down. 3. The method of claim 1, wherein the advertisement is positioned within the browser window above the shifted site elements. 4. The method of claim 1, wherein the advertisement is positioned within the browser window above the shifted site elements. 5. The method of claim 1, wherein the script is operable to cause an interactive element to be displayed within or near the displayed advertisement, the interactive element instructing the script to reverse the shift and hide the displayed advertisement. 6. The method of claim 1, wherein the first set of computer instructions comprises instructions for detecting whether the some elements of the site can be successfully shifted and if the detection indicates that the site cannot be successfully shifted, no shift is performed. 7. The method of claim 1, wherein the first set of computer instructions comprises instructions for marking of already sifted elements and periodic checking of the document object for the new unmarked elements and either shifting these new unmarked elements or canceling display of the advertisement and removing the additional space if the new unmarked elements cannot be successfully shifted. 8. A computer-readable medium comprising computer instructions, which, when executed by one or more processors of a computer system, cause the one or more processors to perform a computer-implemented method comprising:
a. a user browser loading a web site document containing a reference to an advertisement and one or more site elements, the user browser displaying a browser window; b. the user browser issuing a request for an advertisement to an advertisement server and starting positioning one or more site elements within the browser window; and c. the user browser receiving from the advertisement server in response to the issued request a script, the script containing a first and a second sets of computer instructions; the first set of computer instructions being executed after the user browser determines which site elements should be positioned inside the browser window, first set of instructions shifting positions of at least some of the site elements by a shift vector, thereby creating an additional space near the site content, and the second set of computer instructions being executed to display an advertisement inside the additional space. 9. The computer-readable medium of claim 8, wherein some of the site elements are shifted down. 10. The computer-readable medium of claim 8, wherein the advertisement is positioned within the browser window above the shifted site elements. 11. The computer-readable medium of claim 8, wherein the advertisement is positioned within the browser window above the shifted site elements. 12. The computer-readable medium of claim 8, wherein the script is operable to cause an interactive element to be displayed within or near the displayed advertisement, the interactive element instructing the script to reverse the shift and hide the displayed advertisement. 13. The computer-readable medium of claim 8, wherein the first set of computer instructions comprises instructions for detecting whether the some elements of the site can be successfully shifted and if the detection indicates that the site cannot be successfully shifted, no shift is performed. 14. The computer-readable medium of claim 8, wherein the first set of computer instructions comprises instructions for marking of already sifted elements and periodic checking of the document object for the new unmarked elements and either shifting these new unmarked elements or canceling display of the advertisement and removing the additional space if the new unmarked elements cannot be successfully shifted. 15. A computerized system comprising:
a. a memory unit; b. a central processing unit for executing a user browser for loading a web site document containing a reference to an advertisement and one or more site elements, the browser displaying a browser window, wherein the user browser issues a request for an advertisement to an advertisement server and starts positioning one or more site elements within the browser window; and c. a network interface for receiving from the advertisement server in response to the issued request a script, the script containing a first and a second sets of computer instructions; the first set of computer instructions being executed after the user browser determines which site elements should be positioned inside the browser window, first set of instructions shifting positions of at least some of the site elements by a shift vector, thereby creating an additional space near the site content, and the second set of computer instructions being executed to display an advertisement inside the additional space. 16. The computer-readable medium of claim 15, wherein the advertisement is positioned within the browser window above the shifted site elements. 17. The computer-readable medium of claim 15, wherein the advertisement is positioned within the browser window above the shifted site elements. 18. The computer-readable medium of claim 15, wherein the script is operable to cause an interactive element to be displayed within or near the displayed advertisement, the interactive element instructing the script to reverse the shift and hide the displayed advertisement. 19. The computer-readable medium of claim 15, wherein the first set of computer instructions comprises instructions for detecting whether the some elements of the site can be successfully shifted and if the detection indicates that the site cannot be successfully shifted, no shift is performed. 20. The computer-readable medium of claim 15, wherein the first set of computer instructions comprises instructions for marking of already sifted elements and periodic checking of the document object for the new unmarked elements and either shifting these new unmarked elements or canceling display of the advertisement and removing the additional space if the new unmarked elements cannot be successfully shifted. | 2,100 |
4,904 | 14,486,485 | 2,175 | A method includes, within a Graphical User Interface (GUI), displaying a contact list and a conversation container to a user, the contact list including a plurality of contact objects, the conversation container being an active object used to represent an ongoing conversation, receiving input from a user through the GUI, the input instructing the client computing system to move a first contact object from the plurality of contact objects over the conversation container and drop the first contact object into the conversation container, in response to dropping the first contact object into the conversation container, instructing a server to open a first communication session between the client system and a first device associated with the one of the contact objects, the first communication session being of a first media type, and engaging in communication through the first communication session with the first device. | 1. A method performed by a client computing system in a communications network, the method comprising:
within a Graphical User Interface (GUI), displaying a contact list and a conversation container to a user, the contact list including a plurality of contact objects, the conversation container being an active object used to represent an ongoing conversation; receiving input from a user through the GUI, the input instructing the client computing system to move a first contact object from the plurality of contact objects over the conversation container and drop the first contact object into the conversation container; in response to dropping the first contact object into the conversation container, instructing a server to open a first communication session between the client system and a first device associated with the one of the contact objects, the first communication session being of a first media type; and engaging in communication through the first communication session with the first device. 2. The method of claim 1, further comprising, receiving input from a user to move a second contact object from the plurality of contact objects over the conversation container and drop the second contact object into the conversation container. 3. The method of claim 2, further comprising, in response to dropping the second contact object into the conversation container, instructing the server to open a second communication session between the client system and a second device associated with the second contact object to create a multi-party communication session between the client computing system, the first device, and the second device. 4. The method of claim 1, further comprising, receiving input from a user indicating a request to add a second communication session of a second media type, the second media type using a different communication protocol than the first media type. 5. The method of claim 4, wherein the input is received through a user selection of an icon in the conversation container. 6. The method of claim 4, wherein the input is received through a user selection of an object in a toolbar adjacent the conversation container. 7. The method of claim 4, further comprising, in response to the request, instructing the server to open a second communication session between the client computing system and the first device, the second communication session being of the second media type. 8. The method of claim 1, further comprising, within the conversation container, displaying a first active interface object representing the first communication session. 9. The method of claim 8, further comprising:
in response to user input, instructing the server to put the first communication session on hold; and instructing the server to establish a second communication session between the client system and a second device. 10. The method of claim 9, further comprising, displaying a second active interface object representing the second communication session. 11. The method of claim 9, further comprising, in response to user input, instructing the server to put the second communication session on hold and reactivate the first communication session. 12. A client computing system comprising:
a processor; and a memory comprising machine readable instructions that when executed by the processor cause the system to:
render a Graphical User Interface (GUI), the GUI being configured to display a conversation container and a plurality of contact objects, the conversation container comprising an active object that represents a conversation;
receive a first input from a user to move a first contact object from the plurality of contact objects over the conversation container;
receive a second input from the user to drop the contact object into the conversation container;
in response to the second input, instruct a server to open a first communication session between the client system and a first device associated with the one of the contact objects, the first communication session being of a first media type; and
transmit media data to the first device via the communication session. 13. The system of claim 12, wherein the system is further to:
receive a third input from a user to move a second contact object from the plurality of contact objects over the conversation container and drop the contact object into the conversation container; and in response to dropping the second contact object into the conversation container, instruct the server to open a second communication session between the client system and a second device associated with the second contact object to create a multi-party communication session between the client computing system, the first device, and the second device. 14. The system of claim 12, wherein the system is further to:
receive a third input from a user indicating a request to add a second communication session of a second media type, the second media type using a different communication protocol than the first media type; and in response to the request, instructing the server to open a second communication session between the client computing system and the first device, the second communication session being of the second media type. 15. The system of claim 12, wherein the system is further to:
display a first active interface object representing the first communication session within the conversation container; in response to a third input, instruct the server to put the first communication session on hold; and instruct the server to establish a second communication session between the client system and a second device. 16. The system of claim 15, wherein the system is further to display a second active interface object representing the second communication session; and
in response to a fourth input, instructing the server to put the second communication session on hold and reactivate the first communication session. 17. The system of claim 12, wherein the system is further to:
after the first contact object is dropped into the conversation container, display a conversation object within the conversation container, the conversation object being associated with a contact associated with the first contact object. 18. A computer program product comprising machine readable instructions stored on a non-transitory computer readable medium, the machine readable instructions comprising code to:
render a conversation container within a Graphical User Interface (GUI), the conversation container being an active object within the GUI, the active object being used to represent ongoing conversations; provide a contact list within the GUI, the contact list including a plurality of contact objects; receive input from a user to move one of the contact objects from the contact list to the conversation container; and in response to moving the one of the contact objects into the conversation container, instruct a server to open a first communication session between the client system and a first device associated with the one of the contact objects, the first communication session being of a first media type. 19. The computer program product of claim 18, further comprising machine readable code to:
receive input from a user to move a second contact object from the plurality of contact objects over the conversation container; and in response to dropping the second contact object into the conversation container, instruct the server to open a second communication session between the client system and a second device associated with the second contact object to create a multi-party communication session between the client computing system, the first device, and the second device. 20. The computer program product of claim 18, further comprising machine readable code to:
receive input from a user indicating a request to add a second communication session of a second media type, the second media type using a different communication protocol than the first media type; and in response to the request, instructing the server to open a second communication session between the client computing system and the first device, the second communication session being of the second media type. | A method includes, within a Graphical User Interface (GUI), displaying a contact list and a conversation container to a user, the contact list including a plurality of contact objects, the conversation container being an active object used to represent an ongoing conversation, receiving input from a user through the GUI, the input instructing the client computing system to move a first contact object from the plurality of contact objects over the conversation container and drop the first contact object into the conversation container, in response to dropping the first contact object into the conversation container, instructing a server to open a first communication session between the client system and a first device associated with the one of the contact objects, the first communication session being of a first media type, and engaging in communication through the first communication session with the first device.1. A method performed by a client computing system in a communications network, the method comprising:
within a Graphical User Interface (GUI), displaying a contact list and a conversation container to a user, the contact list including a plurality of contact objects, the conversation container being an active object used to represent an ongoing conversation; receiving input from a user through the GUI, the input instructing the client computing system to move a first contact object from the plurality of contact objects over the conversation container and drop the first contact object into the conversation container; in response to dropping the first contact object into the conversation container, instructing a server to open a first communication session between the client system and a first device associated with the one of the contact objects, the first communication session being of a first media type; and engaging in communication through the first communication session with the first device. 2. The method of claim 1, further comprising, receiving input from a user to move a second contact object from the plurality of contact objects over the conversation container and drop the second contact object into the conversation container. 3. The method of claim 2, further comprising, in response to dropping the second contact object into the conversation container, instructing the server to open a second communication session between the client system and a second device associated with the second contact object to create a multi-party communication session between the client computing system, the first device, and the second device. 4. The method of claim 1, further comprising, receiving input from a user indicating a request to add a second communication session of a second media type, the second media type using a different communication protocol than the first media type. 5. The method of claim 4, wherein the input is received through a user selection of an icon in the conversation container. 6. The method of claim 4, wherein the input is received through a user selection of an object in a toolbar adjacent the conversation container. 7. The method of claim 4, further comprising, in response to the request, instructing the server to open a second communication session between the client computing system and the first device, the second communication session being of the second media type. 8. The method of claim 1, further comprising, within the conversation container, displaying a first active interface object representing the first communication session. 9. The method of claim 8, further comprising:
in response to user input, instructing the server to put the first communication session on hold; and instructing the server to establish a second communication session between the client system and a second device. 10. The method of claim 9, further comprising, displaying a second active interface object representing the second communication session. 11. The method of claim 9, further comprising, in response to user input, instructing the server to put the second communication session on hold and reactivate the first communication session. 12. A client computing system comprising:
a processor; and a memory comprising machine readable instructions that when executed by the processor cause the system to:
render a Graphical User Interface (GUI), the GUI being configured to display a conversation container and a plurality of contact objects, the conversation container comprising an active object that represents a conversation;
receive a first input from a user to move a first contact object from the plurality of contact objects over the conversation container;
receive a second input from the user to drop the contact object into the conversation container;
in response to the second input, instruct a server to open a first communication session between the client system and a first device associated with the one of the contact objects, the first communication session being of a first media type; and
transmit media data to the first device via the communication session. 13. The system of claim 12, wherein the system is further to:
receive a third input from a user to move a second contact object from the plurality of contact objects over the conversation container and drop the contact object into the conversation container; and in response to dropping the second contact object into the conversation container, instruct the server to open a second communication session between the client system and a second device associated with the second contact object to create a multi-party communication session between the client computing system, the first device, and the second device. 14. The system of claim 12, wherein the system is further to:
receive a third input from a user indicating a request to add a second communication session of a second media type, the second media type using a different communication protocol than the first media type; and in response to the request, instructing the server to open a second communication session between the client computing system and the first device, the second communication session being of the second media type. 15. The system of claim 12, wherein the system is further to:
display a first active interface object representing the first communication session within the conversation container; in response to a third input, instruct the server to put the first communication session on hold; and instruct the server to establish a second communication session between the client system and a second device. 16. The system of claim 15, wherein the system is further to display a second active interface object representing the second communication session; and
in response to a fourth input, instructing the server to put the second communication session on hold and reactivate the first communication session. 17. The system of claim 12, wherein the system is further to:
after the first contact object is dropped into the conversation container, display a conversation object within the conversation container, the conversation object being associated with a contact associated with the first contact object. 18. A computer program product comprising machine readable instructions stored on a non-transitory computer readable medium, the machine readable instructions comprising code to:
render a conversation container within a Graphical User Interface (GUI), the conversation container being an active object within the GUI, the active object being used to represent ongoing conversations; provide a contact list within the GUI, the contact list including a plurality of contact objects; receive input from a user to move one of the contact objects from the contact list to the conversation container; and in response to moving the one of the contact objects into the conversation container, instruct a server to open a first communication session between the client system and a first device associated with the one of the contact objects, the first communication session being of a first media type. 19. The computer program product of claim 18, further comprising machine readable code to:
receive input from a user to move a second contact object from the plurality of contact objects over the conversation container; and in response to dropping the second contact object into the conversation container, instruct the server to open a second communication session between the client system and a second device associated with the second contact object to create a multi-party communication session between the client computing system, the first device, and the second device. 20. The computer program product of claim 18, further comprising machine readable code to:
receive input from a user indicating a request to add a second communication session of a second media type, the second media type using a different communication protocol than the first media type; and in response to the request, instructing the server to open a second communication session between the client computing system and the first device, the second communication session being of the second media type. | 2,100 |
4,905 | 13,804,849 | 2,142 | Multiple User Interface (UI) states may be identified and encoded into encoded UI states. Each of the encoded UI states may comprise an image of one or more of the UI states and metadata associating the encoded UI state with one or more other encoded UI states that comprise an image of a UI state that is navigationally related to one or more of the UI states encoded in the encoded UI state. A portion of the encoded UI states may be communicated to one or more user devices. | 1. A method, comprising:
identifying a plurality of user interface states of a user interface application; encoding the plurality of user interface states into a plurality of encoded user interface states, each of the plurality of encoded user interface states comprising metadata associating the encoded user interface state with at least one other encoded user interface state of the plurality of encoded user interface states that is navigationally related to one or more user interface states encoded in the encoded user interface state; and communicating at least a portion of the plurality of encoded user interface states to one or more user devices. 2. The method of claim 1, wherein the plurality of encoded user interface states comprises a plurality of static images, and wherein encoding the plurality of user interface states into the plurality of encoded user interface states comprises encoding each of the plurality of user interface states into one or more of the plurality of static images. 3. The method of claim 1, wherein the plurality of encoded user interface states comprises a plurality of video clips, and wherein encoding the plurality of user interface states into the plurality of encoded user interface states comprises encoding each of the plurality of user interface states into one or more of the plurality of video clips. 4. The method of claim 1, wherein each of the plurality of user interface states comprises at least a program listing or program guide element. 5. The method of claim 1, wherein each of the plurality of encoded user interface states comprises metadata associating the encoded user interface state with one or more navigationally related encoded user interface states of the plurality of encoded user interface states. 6. The method of claim 5, wherein the one or more navigationally related encoded user interface states comprises an encoded user interface state of the plurality of encoded user interface states that corresponds to a user at least one of navigating right, navigating left, navigating up, navigating down, selecting an option on the encoded user interface state, or indicating that an encoded user interface state displayed immediately preceding the encoded user interface state should be displayed. 7. The method of claim 1, wherein communicating the at least a portion of the plurality of encoded user interface states to the one or more user devices comprises:
communicating a first portion of the plurality of encoded user interface states to a first network edge cache associated with a first portion of the one or more user devices; and communicating a second portion of the plurality of encoded user interface states to a second network edge cache associated with a second portion of the one or more user devices. 8. The method of claim 7, wherein the first portion of the plurality of encoded user interface states comprises one or more of the plurality of encoded user interface states and one or more additional encoded user interface states of the plurality of encoded user interface states that are navigationally related to the one or more of the plurality of encoded user interface states, and wherein the second portion of the plurality of encoded user interface states comprises one or more other encoded user interface states of the plurality of encoded user interface states and one or more additional encoded user interface states of the plurality of encoded user interface states that are navigationally related to the one or more other of the plurality of encoded user interface states. 9. The method of claim 7, wherein a quantity of the first portion of the plurality of encoded user interface states to be communicated to the first network edge cache is based on a current utilization of the first network edge cache, and a quantity of the second portion of the plurality of encoded user interface states to be communicated to the second network edge cache is based on a current utilization of the second network edge cache. 10. A method, comprising:
identifying a plurality of user interface states of a user interface application; encoding the plurality of user interface states into a plurality of encoded user interface states, each of the plurality of encoded user interface states comprising at least one image of one or more of the plurality of user interface states, and each of the plurality of encoded user interface states comprising metadata associating the encoded user interface state with at least one other encoded user interface state of the plurality of encoded user interface states that comprises at least one image of one or more other of the plurality of user interface states that is navigationally related to one or more user interface states encoded in the encoded user interface state; and communicating at least a portion of the plurality of encoded user interface states to one or more user devices. 11. The method of claim 10, wherein each of the plurality of user interface states comprises at least a program listing or program guide element. 12. The method of claim 10, wherein identifying the plurality of user interface states of the user interface application comprises identifying each possible user interface state permutation of the user interface application. 13. The method of claim 10, wherein the plurality of encoded user interface states comprises a plurality of static images, and wherein encoding the plurality of user interface states into the plurality of encoded user interface states comprises encoding each of the plurality of user interface states into one or more of the plurality of static images. 14. The method of claim 10, wherein the plurality of encoded user interface states comprises a plurality of video clips, and wherein encoding the plurality of user interface states into the plurality of encoded user interface states comprises encoding each of the plurality of user interface states into one or more of the plurality of video clips. 15. The method of claim 10, wherein each of the plurality of encoded user interface states comprises metadata associating the encoded user interface state with one or more navigationally related encoded user interface states of the plurality of encoded user interface states. 16. The method of claim 15, wherein the one or more navigationally related encoded user interface states comprises an encoded user interface state of the plurality of encoded user interface states that corresponds to a user at least one of navigating right, navigating left, navigating up, navigating down, selecting an option on the encoded user interface state, or indicating that an encoded user interface state displayed immediately preceding the encoded user interface state should be displayed. 17. The method of claim 10, comprising:
communicating a first portion of the plurality of encoded user interface states to a first network edge cache associated with a first portion of the one or more user devices; and communicating a second portion of the plurality of encoded user interface states to a second network edge cache associated with a second portion of the one or more user devices. 18. The method of claim 17, wherein the first portion of the plurality of encoded user interface states comprises one or more of the plurality of encoded user interface states and one or more additional encoded user interface states of the plurality of encoded user interface states that are navigationally related to the one or more of the plurality of encoded user interface states, and wherein the second portion of the plurality of encoded user interface states comprises one or more other encoded user interface states of the plurality of encoded user interface states and one or more additional encoded user interface states of the plurality of encoded user interface states that are navigationally related to the one or more other of the plurality of encoded user interface states. 19. The method of claim 17, wherein a quantity of the first portion of the plurality of encoded user interface states to be communicated to the first network edge cache is based on a current utilization of the first network edge cache, and a quantity of the second portion of the plurality of encoded user interface states to be communicated to the second network edge cache is based on a current utilization of the second network edge cache. 20. One or more non-transitory computer-readable media having instructions stored thereon, that when executed by one or more computers, cause the one or more computers to:
identify a plurality of user interface screens of a user interface application; encode the plurality of user interface screens into a plurality of images, each of the plurality of images comprising one or more of the plurality of user interface screens, and each of the plurality of images comprising metadata associating the image with at least one other image of the plurality of images that comprises one or more other of the plurality of user interface screens that is navigationally related to one or more user interface screens encoded in the image; and communicate at least a portion of the plurality of images to one or more user devices. | Multiple User Interface (UI) states may be identified and encoded into encoded UI states. Each of the encoded UI states may comprise an image of one or more of the UI states and metadata associating the encoded UI state with one or more other encoded UI states that comprise an image of a UI state that is navigationally related to one or more of the UI states encoded in the encoded UI state. A portion of the encoded UI states may be communicated to one or more user devices.1. A method, comprising:
identifying a plurality of user interface states of a user interface application; encoding the plurality of user interface states into a plurality of encoded user interface states, each of the plurality of encoded user interface states comprising metadata associating the encoded user interface state with at least one other encoded user interface state of the plurality of encoded user interface states that is navigationally related to one or more user interface states encoded in the encoded user interface state; and communicating at least a portion of the plurality of encoded user interface states to one or more user devices. 2. The method of claim 1, wherein the plurality of encoded user interface states comprises a plurality of static images, and wherein encoding the plurality of user interface states into the plurality of encoded user interface states comprises encoding each of the plurality of user interface states into one or more of the plurality of static images. 3. The method of claim 1, wherein the plurality of encoded user interface states comprises a plurality of video clips, and wherein encoding the plurality of user interface states into the plurality of encoded user interface states comprises encoding each of the plurality of user interface states into one or more of the plurality of video clips. 4. The method of claim 1, wherein each of the plurality of user interface states comprises at least a program listing or program guide element. 5. The method of claim 1, wherein each of the plurality of encoded user interface states comprises metadata associating the encoded user interface state with one or more navigationally related encoded user interface states of the plurality of encoded user interface states. 6. The method of claim 5, wherein the one or more navigationally related encoded user interface states comprises an encoded user interface state of the plurality of encoded user interface states that corresponds to a user at least one of navigating right, navigating left, navigating up, navigating down, selecting an option on the encoded user interface state, or indicating that an encoded user interface state displayed immediately preceding the encoded user interface state should be displayed. 7. The method of claim 1, wherein communicating the at least a portion of the plurality of encoded user interface states to the one or more user devices comprises:
communicating a first portion of the plurality of encoded user interface states to a first network edge cache associated with a first portion of the one or more user devices; and communicating a second portion of the plurality of encoded user interface states to a second network edge cache associated with a second portion of the one or more user devices. 8. The method of claim 7, wherein the first portion of the plurality of encoded user interface states comprises one or more of the plurality of encoded user interface states and one or more additional encoded user interface states of the plurality of encoded user interface states that are navigationally related to the one or more of the plurality of encoded user interface states, and wherein the second portion of the plurality of encoded user interface states comprises one or more other encoded user interface states of the plurality of encoded user interface states and one or more additional encoded user interface states of the plurality of encoded user interface states that are navigationally related to the one or more other of the plurality of encoded user interface states. 9. The method of claim 7, wherein a quantity of the first portion of the plurality of encoded user interface states to be communicated to the first network edge cache is based on a current utilization of the first network edge cache, and a quantity of the second portion of the plurality of encoded user interface states to be communicated to the second network edge cache is based on a current utilization of the second network edge cache. 10. A method, comprising:
identifying a plurality of user interface states of a user interface application; encoding the plurality of user interface states into a plurality of encoded user interface states, each of the plurality of encoded user interface states comprising at least one image of one or more of the plurality of user interface states, and each of the plurality of encoded user interface states comprising metadata associating the encoded user interface state with at least one other encoded user interface state of the plurality of encoded user interface states that comprises at least one image of one or more other of the plurality of user interface states that is navigationally related to one or more user interface states encoded in the encoded user interface state; and communicating at least a portion of the plurality of encoded user interface states to one or more user devices. 11. The method of claim 10, wherein each of the plurality of user interface states comprises at least a program listing or program guide element. 12. The method of claim 10, wherein identifying the plurality of user interface states of the user interface application comprises identifying each possible user interface state permutation of the user interface application. 13. The method of claim 10, wherein the plurality of encoded user interface states comprises a plurality of static images, and wherein encoding the plurality of user interface states into the plurality of encoded user interface states comprises encoding each of the plurality of user interface states into one or more of the plurality of static images. 14. The method of claim 10, wherein the plurality of encoded user interface states comprises a plurality of video clips, and wherein encoding the plurality of user interface states into the plurality of encoded user interface states comprises encoding each of the plurality of user interface states into one or more of the plurality of video clips. 15. The method of claim 10, wherein each of the plurality of encoded user interface states comprises metadata associating the encoded user interface state with one or more navigationally related encoded user interface states of the plurality of encoded user interface states. 16. The method of claim 15, wherein the one or more navigationally related encoded user interface states comprises an encoded user interface state of the plurality of encoded user interface states that corresponds to a user at least one of navigating right, navigating left, navigating up, navigating down, selecting an option on the encoded user interface state, or indicating that an encoded user interface state displayed immediately preceding the encoded user interface state should be displayed. 17. The method of claim 10, comprising:
communicating a first portion of the plurality of encoded user interface states to a first network edge cache associated with a first portion of the one or more user devices; and communicating a second portion of the plurality of encoded user interface states to a second network edge cache associated with a second portion of the one or more user devices. 18. The method of claim 17, wherein the first portion of the plurality of encoded user interface states comprises one or more of the plurality of encoded user interface states and one or more additional encoded user interface states of the plurality of encoded user interface states that are navigationally related to the one or more of the plurality of encoded user interface states, and wherein the second portion of the plurality of encoded user interface states comprises one or more other encoded user interface states of the plurality of encoded user interface states and one or more additional encoded user interface states of the plurality of encoded user interface states that are navigationally related to the one or more other of the plurality of encoded user interface states. 19. The method of claim 17, wherein a quantity of the first portion of the plurality of encoded user interface states to be communicated to the first network edge cache is based on a current utilization of the first network edge cache, and a quantity of the second portion of the plurality of encoded user interface states to be communicated to the second network edge cache is based on a current utilization of the second network edge cache. 20. One or more non-transitory computer-readable media having instructions stored thereon, that when executed by one or more computers, cause the one or more computers to:
identify a plurality of user interface screens of a user interface application; encode the plurality of user interface screens into a plurality of images, each of the plurality of images comprising one or more of the plurality of user interface screens, and each of the plurality of images comprising metadata associating the image with at least one other image of the plurality of images that comprises one or more other of the plurality of user interface screens that is navigationally related to one or more user interface screens encoded in the image; and communicate at least a portion of the plurality of images to one or more user devices. | 2,100 |
4,906 | 13,873,349 | 2,153 | A search engine system, including a slash-tag server. The server can be configured to receive a query including at least one key word from a user, generate an alternative search query, based on the at least one key word in the search query received from the user. The alternative search query may include at least one slashtag associated with the at least one key word for use in searching unaltered internet documents. Also, it may launch a search query using the alternative search query. Further, a web server could be configured to retrieve content from one or more nodes of at least one database cluster, based on the launched search query, generate a first search result, based on the alternative search query, and cause display of the first search result in a web browser. | 1. A search engine system, comprising:
a slash-tag server configured to: receive a query including at least one key word from a user; generate an alternative search query, based on the at least one key word in the search query received from the user, wherein the alternative search query includes at least one slashtag associated with the at least one key word for use in searching unaltered internet documents; and launch a search query using the alternative search query; a web server configured to: retrieve content from one or more nodes of at least one database cluster, based on the launched search query; generate a first search result, based on the alternative search query, and cause display of the first search result in a web browser. 2. The system of claim 1, wherein the alternative search query includes the at least one key word and the slashtag. 3. The system of claim 1, wherein the web server is further configured to provide a link to select a second search result, the second search result being based on the at least one key word in the search query. 4. The system of claim 3, wherein the web server is further configured to:
detect a selection of the link to the second search result; generate the second search result based on the at least one key word in the search query; and display the second search result in the web browser. 5. The system of claim 4, wherein the first search result and the second search result are displayed next to each other on the same web browser. 6. The system of claim 1, wherein each result item of the first search result or second search result comprises a two-line format, wherein the first line is dedicated to a page URL title that hyperlinks to the respective page URL; and
the second line is dedicated to at least a subset of a group consisting of a website title, one or more content tags, one or more site tags, and an optional snippet. 7. The system of claim 1, wherein the one or more site tags include, displayed at a web browser, at least a subset of a group consisting of: links, seo, rss, cache, source, ip, rank, hostrank, and adsense. 8. The system of claim 1, wherein the one or more site tags include a social network indicator to enable a user to indicate a preference of the respective result item. 9. The system of claim 8, wherein the social network indicator is a “likes” link. 10. The system of claim 8, wherein the social network indicator is a “checkin” link. 11. The system of claim 2, wherein the slashtag is a “/likes” slashtag. 12. The system of claim 2, wherein the slashtag is a “/checkin” slashtag. 13. The system of claim 1, wherein the alternative search query is generated based on one or more intelligence criteria that adds or deletes a keyword in the search query. 14. The system of claim 13, wherein the intelligence criteria includes at least one from a group consisting of: order and rank information associated with one or more search terms of the first search result, age of a document, frequency of hits or use of a document, user profile of a user providing the search query, user history of a user providing the search query, and geographic location. 15. The system of claim 13, wherein the intelligence criteria is based on heuristics. 16. The system of claim 1, further comprising a first storage and a second storage, each configured to interface with the web server, wherein the first storage is configured to store search engine index data, and wherein the second storage is configured to store a subset of search engine index data determined to be more important. 17. The system of claim 16, wherein the second storage includes solid state disks. 18. A method for processing content to be displayed, comprising:
detecting at least one key word in a search query; automatically generating an alternative search query, based on the at least one key word, the alternative search query including a search operator associated with the at least one key word for use in searching unaltered internet documents; generating a first search result based on the alternative search query; and causing display of the first search result in a web browser. 19. The method of claim 18, wherein the alternative search query includes the at least one key word and the search operator. 20. The method of claim 18, wherein the search operator is a slashtag. 21. The method of claim 18, further comprising:
providing a link to select a second search result, the second search result being based on the at least one key word in the search query. 22. The method of claim 21, further comprising:
detecting a selection of the link to the second search result; generating the second search result based on the at least one key word in the search query; and displaying the second search result in the web browser. 23. The method of claim 22, wherein the first search result and the second search result are displayed next to each other on the same web page. 24. The method of claim 18, wherein each result item of the first search result or second search result comprises a two-line format, wherein
the first line is dedicated to a page URL title that hyperlinks to the respective page URL; and the second line is dedicated to at least a subset of a group consisting of a website title, one or more content tags, one or more site tags, and an optional snippet. 25. The method of claim 18, wherein the one or more site tags include, displayed at a web browser, at least a subset of a group consisting of: links, seo, rss, cache, source, ip, rank, hostrank, and adsense. 26. The method of claim 18, wherein the one or more site tags include a social network indicator to enable a user to indicate a preference of the respective result item. 27. The method of claim 26, wherein the social network indicator is a “likes” link. 28. The method of claim 26, wherein the social network indicator is a “checkin” link. 29. The method of claim 19, wherein the slashtag is a “/likes” slashtag. 30. The method of claim 19, wherein the slashtag is a “/checkin” slashtag. 31. The method of claim 18, wherein the alternative search query is generated based on one or more intelligence criteria that adds or deletes a keyword in the search query. 32. The method of claim 31, wherein the intelligence criteria includes at least one from a group consisting of: order and rank information associated with one or more search terms of the first search result, age of a document, frequency of hits or use of a document, user profile of a user providing the search query, user history of a user providing the search query, and geographic location. 33. The method of claim 31, wherein the intelligence criteria is based on heuristics. 34. A method for processing content to be displayed in a web browser, comprising:
detecting at least one key word in a search query; generating an alternative search query, based on the at least one key word, the alternative search query including a search operator associated with the at least one key word for use in searching unaltered internet documents; generating a first search result based on the alternative search query; and causing display of the first search result in the web browser. | A search engine system, including a slash-tag server. The server can be configured to receive a query including at least one key word from a user, generate an alternative search query, based on the at least one key word in the search query received from the user. The alternative search query may include at least one slashtag associated with the at least one key word for use in searching unaltered internet documents. Also, it may launch a search query using the alternative search query. Further, a web server could be configured to retrieve content from one or more nodes of at least one database cluster, based on the launched search query, generate a first search result, based on the alternative search query, and cause display of the first search result in a web browser.1. A search engine system, comprising:
a slash-tag server configured to: receive a query including at least one key word from a user; generate an alternative search query, based on the at least one key word in the search query received from the user, wherein the alternative search query includes at least one slashtag associated with the at least one key word for use in searching unaltered internet documents; and launch a search query using the alternative search query; a web server configured to: retrieve content from one or more nodes of at least one database cluster, based on the launched search query; generate a first search result, based on the alternative search query, and cause display of the first search result in a web browser. 2. The system of claim 1, wherein the alternative search query includes the at least one key word and the slashtag. 3. The system of claim 1, wherein the web server is further configured to provide a link to select a second search result, the second search result being based on the at least one key word in the search query. 4. The system of claim 3, wherein the web server is further configured to:
detect a selection of the link to the second search result; generate the second search result based on the at least one key word in the search query; and display the second search result in the web browser. 5. The system of claim 4, wherein the first search result and the second search result are displayed next to each other on the same web browser. 6. The system of claim 1, wherein each result item of the first search result or second search result comprises a two-line format, wherein the first line is dedicated to a page URL title that hyperlinks to the respective page URL; and
the second line is dedicated to at least a subset of a group consisting of a website title, one or more content tags, one or more site tags, and an optional snippet. 7. The system of claim 1, wherein the one or more site tags include, displayed at a web browser, at least a subset of a group consisting of: links, seo, rss, cache, source, ip, rank, hostrank, and adsense. 8. The system of claim 1, wherein the one or more site tags include a social network indicator to enable a user to indicate a preference of the respective result item. 9. The system of claim 8, wherein the social network indicator is a “likes” link. 10. The system of claim 8, wherein the social network indicator is a “checkin” link. 11. The system of claim 2, wherein the slashtag is a “/likes” slashtag. 12. The system of claim 2, wherein the slashtag is a “/checkin” slashtag. 13. The system of claim 1, wherein the alternative search query is generated based on one or more intelligence criteria that adds or deletes a keyword in the search query. 14. The system of claim 13, wherein the intelligence criteria includes at least one from a group consisting of: order and rank information associated with one or more search terms of the first search result, age of a document, frequency of hits or use of a document, user profile of a user providing the search query, user history of a user providing the search query, and geographic location. 15. The system of claim 13, wherein the intelligence criteria is based on heuristics. 16. The system of claim 1, further comprising a first storage and a second storage, each configured to interface with the web server, wherein the first storage is configured to store search engine index data, and wherein the second storage is configured to store a subset of search engine index data determined to be more important. 17. The system of claim 16, wherein the second storage includes solid state disks. 18. A method for processing content to be displayed, comprising:
detecting at least one key word in a search query; automatically generating an alternative search query, based on the at least one key word, the alternative search query including a search operator associated with the at least one key word for use in searching unaltered internet documents; generating a first search result based on the alternative search query; and causing display of the first search result in a web browser. 19. The method of claim 18, wherein the alternative search query includes the at least one key word and the search operator. 20. The method of claim 18, wherein the search operator is a slashtag. 21. The method of claim 18, further comprising:
providing a link to select a second search result, the second search result being based on the at least one key word in the search query. 22. The method of claim 21, further comprising:
detecting a selection of the link to the second search result; generating the second search result based on the at least one key word in the search query; and displaying the second search result in the web browser. 23. The method of claim 22, wherein the first search result and the second search result are displayed next to each other on the same web page. 24. The method of claim 18, wherein each result item of the first search result or second search result comprises a two-line format, wherein
the first line is dedicated to a page URL title that hyperlinks to the respective page URL; and the second line is dedicated to at least a subset of a group consisting of a website title, one or more content tags, one or more site tags, and an optional snippet. 25. The method of claim 18, wherein the one or more site tags include, displayed at a web browser, at least a subset of a group consisting of: links, seo, rss, cache, source, ip, rank, hostrank, and adsense. 26. The method of claim 18, wherein the one or more site tags include a social network indicator to enable a user to indicate a preference of the respective result item. 27. The method of claim 26, wherein the social network indicator is a “likes” link. 28. The method of claim 26, wherein the social network indicator is a “checkin” link. 29. The method of claim 19, wherein the slashtag is a “/likes” slashtag. 30. The method of claim 19, wherein the slashtag is a “/checkin” slashtag. 31. The method of claim 18, wherein the alternative search query is generated based on one or more intelligence criteria that adds or deletes a keyword in the search query. 32. The method of claim 31, wherein the intelligence criteria includes at least one from a group consisting of: order and rank information associated with one or more search terms of the first search result, age of a document, frequency of hits or use of a document, user profile of a user providing the search query, user history of a user providing the search query, and geographic location. 33. The method of claim 31, wherein the intelligence criteria is based on heuristics. 34. A method for processing content to be displayed in a web browser, comprising:
detecting at least one key word in a search query; generating an alternative search query, based on the at least one key word, the alternative search query including a search operator associated with the at least one key word for use in searching unaltered internet documents; generating a first search result based on the alternative search query; and causing display of the first search result in the web browser. | 2,100 |
4,907 | 13,738,686 | 2,164 | A computer-implemented method for generating a notification from an in-memory database update includes: detecting an in-memory database event that inserts, deletes or modifies a first record in an in-memory database; executing a first database trigger that corresponds to the detected in-memory database event; identifying a first business event definition that is mapped to the executed first database trigger; and generating a first notification that corresponds to the identified first business event definition, the first notification generated for a first subscriber to the identified first business event definition. | 1. A computer-implemented method for generating a notification from an in-memory database update, the method comprising:
detecting an in-memory database event that inserts, deletes or modifies a first record in an in-memory database; executing a first database trigger that corresponds to the detected in-memory database event; identifying a first business event definition that is mapped to the executed first database trigger; and generating a first notification that corresponds to the identified first business event definition, the first notification generated for a first subscriber to the identified first business event definition. 2. The computer-implemented method of claim 1, wherein the first database trigger is executed using a trigger engine operating in a server hosting the in-memory database, wherein the first business event definition is identified by an event publisher operating in an application server associated with the server, and wherein the notification is generated by a notification publisher operating in a gateway system hosted by the application server. 3. The computer-implemented method of claim 1, wherein:
an application is operated by executing custom code in an application container hosted by an application server; the first subscriber to the first identified business event includes at least the application; the application generates an alert to a gateway system hosted by the application server, the alert generated using an API of the gateway system; a subscription manager in the gateway system identifies a second subscriber to the generated alert; and a notification publisher hosted by the gateway system generates a second notification that corresponds to the generated alert, the second notification generated for the identified second subscriber. 4. The computer-implemented method of claim 1, wherein the executed first database trigger further inserts, deletes or modifies a second record in the in-memory database, and wherein the insertion, deletion or modification of the second record further causes a second database trigger to be executed. 5. The computer-implemented method of claim 4, wherein the first subscriber to the identified business event definition is not a subscriber to a second business event definition that is mapped to the executed second database trigger. 6. The computer-implemented method of claim 1, further comprising specifying, before the first database trigger is executed, whether the first database trigger is executed (i) once for each affected record in the in-memory database, or (ii) once for each execution of an operation that affects one or more records in the in-memory database. 7. The computer-implemented method of claim 1, further comprising presenting a subscription control adjacent a user interface feature regarding at least the first record in the in-memory database, wherein activation of the subscription control establishes subscription to the first business event definition. 8. A computer program product embodied in a non-transitory computer-readable storage medium and comprising instructions that when executed by a processor perform a method for generating a notification from an in-memory database update, the method comprising:
detecting an in-memory database event that inserts, deletes or modifies a first record in an in-memory database; executing a first database trigger that corresponds to the detected in-memory database event; identifying a first business event definition that is mapped to the executed first database trigger; and generating a first notification that corresponds to the identified first business event definition, the first notification generated for a first subscriber to the identified first business event definition. 9. The computer program product of claim 8, wherein the first database trigger is executed using a trigger engine operating in a server hosting the in-memory database, wherein the first business event definition is identified by an event publisher operating in an application server associated with the server, and wherein the notification is generated by a notification publisher operating in a gateway system hosted by the application server. 10. The computer program product of claim 8, wherein:
an application is operated by executing custom code in an application container hosted by an application server; the first subscriber to the first identified business event includes at least the application; the application generates an alert to a gateway system hosted by the application server, the alert generated using an API of the gateway system; a subscription manager in the gateway system identifies a second subscriber to the generated alert; and a notification publisher hosted by the gateway system generates a second notification that corresponds to the generated alert, the second notification generated for the identified second subscriber. 11. The computer program product of claim 8, wherein the executed first database trigger further inserts, deletes or modifies a second record in the in-memory database, and wherein the insertion, deletion or modification of the second record further causes a second database trigger to be executed. 12. The computer program product of claim 11, wherein the first subscriber to the identified business event definition is not a subscriber to a second business event definition that is mapped to the executed second database trigger. 13. The computer program product of claim 8, the method further comprising specifying, before the first database trigger is executed, whether the first database trigger is executed (i) once for each affected record in the in-memory database, or (ii) once for each execution of an operation that affects one or more records in the in-memory database. 14. The computer program product of claim 8, the method further comprising presenting a subscription control adjacent a user interface feature regarding at least the first record in the in-memory database, wherein activation of the subscription control establishes subscription to the first business event definition. 15. A system comprising:
one or more processors; and a computer program product embodied in a non-transitory computer-readable storage medium and comprising instructions that when executed by a processor perform a method for generating a notification from an in-memory database update, the method comprising:
detecting an in-memory database event that inserts, deletes or modifies a first record in an in-memory database;
executing a first database trigger that corresponds to the detected in-memory database event;
identifying a first business event definition that is mapped to the executed first database trigger; and
generating a first notification that corresponds to the identified first business event definition, the first notification generated for a first subscriber to the identified first business event definition. 16. The system of claim 15, wherein the first database trigger is executed using a trigger engine operating in a server hosting the in-memory database, wherein the first business event definition is identified by an event publisher operating in an application server associated with the server, and wherein the notification is generated by a notification publisher operating in a gateway system hosted by the application server. 17. The system of claim 15, wherein:
an application is operated by executing custom code in an application container hosted by an application server; the first subscriber to the first identified business event includes at least the application; the application generates an alert to a gateway system hosted by the application server, the alert generated using an API of the gateway system; a subscription manager in the gateway system identifies a second subscriber to the generated alert; and a notification publisher hosted by the gateway system generates a second notification that corresponds to the generated alert, the second notification generated for the identified second subscriber. 18. The system of claim 15, wherein the executed first database trigger further inserts, deletes or modifies a second record in the in-memory database, and wherein the insertion, deletion or modification of the second record further causes a second database trigger to be executed. 19. The system of claim 18, wherein the first subscriber to the identified business event definition is not a subscriber to a second business event definition that is mapped to the executed second database trigger. 20. The system of claim 15, the method further comprising presenting a subscription control adjacent a user interface feature regarding at least the first record in the in-memory database, wherein activation of the subscription control establishes subscription to the first business event definition. | A computer-implemented method for generating a notification from an in-memory database update includes: detecting an in-memory database event that inserts, deletes or modifies a first record in an in-memory database; executing a first database trigger that corresponds to the detected in-memory database event; identifying a first business event definition that is mapped to the executed first database trigger; and generating a first notification that corresponds to the identified first business event definition, the first notification generated for a first subscriber to the identified first business event definition.1. A computer-implemented method for generating a notification from an in-memory database update, the method comprising:
detecting an in-memory database event that inserts, deletes or modifies a first record in an in-memory database; executing a first database trigger that corresponds to the detected in-memory database event; identifying a first business event definition that is mapped to the executed first database trigger; and generating a first notification that corresponds to the identified first business event definition, the first notification generated for a first subscriber to the identified first business event definition. 2. The computer-implemented method of claim 1, wherein the first database trigger is executed using a trigger engine operating in a server hosting the in-memory database, wherein the first business event definition is identified by an event publisher operating in an application server associated with the server, and wherein the notification is generated by a notification publisher operating in a gateway system hosted by the application server. 3. The computer-implemented method of claim 1, wherein:
an application is operated by executing custom code in an application container hosted by an application server; the first subscriber to the first identified business event includes at least the application; the application generates an alert to a gateway system hosted by the application server, the alert generated using an API of the gateway system; a subscription manager in the gateway system identifies a second subscriber to the generated alert; and a notification publisher hosted by the gateway system generates a second notification that corresponds to the generated alert, the second notification generated for the identified second subscriber. 4. The computer-implemented method of claim 1, wherein the executed first database trigger further inserts, deletes or modifies a second record in the in-memory database, and wherein the insertion, deletion or modification of the second record further causes a second database trigger to be executed. 5. The computer-implemented method of claim 4, wherein the first subscriber to the identified business event definition is not a subscriber to a second business event definition that is mapped to the executed second database trigger. 6. The computer-implemented method of claim 1, further comprising specifying, before the first database trigger is executed, whether the first database trigger is executed (i) once for each affected record in the in-memory database, or (ii) once for each execution of an operation that affects one or more records in the in-memory database. 7. The computer-implemented method of claim 1, further comprising presenting a subscription control adjacent a user interface feature regarding at least the first record in the in-memory database, wherein activation of the subscription control establishes subscription to the first business event definition. 8. A computer program product embodied in a non-transitory computer-readable storage medium and comprising instructions that when executed by a processor perform a method for generating a notification from an in-memory database update, the method comprising:
detecting an in-memory database event that inserts, deletes or modifies a first record in an in-memory database; executing a first database trigger that corresponds to the detected in-memory database event; identifying a first business event definition that is mapped to the executed first database trigger; and generating a first notification that corresponds to the identified first business event definition, the first notification generated for a first subscriber to the identified first business event definition. 9. The computer program product of claim 8, wherein the first database trigger is executed using a trigger engine operating in a server hosting the in-memory database, wherein the first business event definition is identified by an event publisher operating in an application server associated with the server, and wherein the notification is generated by a notification publisher operating in a gateway system hosted by the application server. 10. The computer program product of claim 8, wherein:
an application is operated by executing custom code in an application container hosted by an application server; the first subscriber to the first identified business event includes at least the application; the application generates an alert to a gateway system hosted by the application server, the alert generated using an API of the gateway system; a subscription manager in the gateway system identifies a second subscriber to the generated alert; and a notification publisher hosted by the gateway system generates a second notification that corresponds to the generated alert, the second notification generated for the identified second subscriber. 11. The computer program product of claim 8, wherein the executed first database trigger further inserts, deletes or modifies a second record in the in-memory database, and wherein the insertion, deletion or modification of the second record further causes a second database trigger to be executed. 12. The computer program product of claim 11, wherein the first subscriber to the identified business event definition is not a subscriber to a second business event definition that is mapped to the executed second database trigger. 13. The computer program product of claim 8, the method further comprising specifying, before the first database trigger is executed, whether the first database trigger is executed (i) once for each affected record in the in-memory database, or (ii) once for each execution of an operation that affects one or more records in the in-memory database. 14. The computer program product of claim 8, the method further comprising presenting a subscription control adjacent a user interface feature regarding at least the first record in the in-memory database, wherein activation of the subscription control establishes subscription to the first business event definition. 15. A system comprising:
one or more processors; and a computer program product embodied in a non-transitory computer-readable storage medium and comprising instructions that when executed by a processor perform a method for generating a notification from an in-memory database update, the method comprising:
detecting an in-memory database event that inserts, deletes or modifies a first record in an in-memory database;
executing a first database trigger that corresponds to the detected in-memory database event;
identifying a first business event definition that is mapped to the executed first database trigger; and
generating a first notification that corresponds to the identified first business event definition, the first notification generated for a first subscriber to the identified first business event definition. 16. The system of claim 15, wherein the first database trigger is executed using a trigger engine operating in a server hosting the in-memory database, wherein the first business event definition is identified by an event publisher operating in an application server associated with the server, and wherein the notification is generated by a notification publisher operating in a gateway system hosted by the application server. 17. The system of claim 15, wherein:
an application is operated by executing custom code in an application container hosted by an application server; the first subscriber to the first identified business event includes at least the application; the application generates an alert to a gateway system hosted by the application server, the alert generated using an API of the gateway system; a subscription manager in the gateway system identifies a second subscriber to the generated alert; and a notification publisher hosted by the gateway system generates a second notification that corresponds to the generated alert, the second notification generated for the identified second subscriber. 18. The system of claim 15, wherein the executed first database trigger further inserts, deletes or modifies a second record in the in-memory database, and wherein the insertion, deletion or modification of the second record further causes a second database trigger to be executed. 19. The system of claim 18, wherein the first subscriber to the identified business event definition is not a subscriber to a second business event definition that is mapped to the executed second database trigger. 20. The system of claim 15, the method further comprising presenting a subscription control adjacent a user interface feature regarding at least the first record in the in-memory database, wherein activation of the subscription control establishes subscription to the first business event definition. | 2,100 |
4,908 | 13,937,608 | 2,145 | An electronic device includes a touchscreen and an electrical circuit. The electrical circuit controls a display of the touchscreen and detects user contact with a surface of the touchscreen. The electrical circuit divides the display into at least two distinct display zones including an informational display zone and a command display zone. The informational display zone displays informational content including functional objects, each of the functional objects being associated with a data processing function. The command display zone displays a graphic representation of a command pad. In response to detecting a first predetermined tactile action on the command pad, the electrical circuit graphically modifies one of the functional objects of the informational display zone to indication selection of the one of the functional objects. In response to detecting a second predetermined tactile action, the electrical circuit initiates execution of the data processing function associated with the selected functional object. | 1. An electronic device comprising:
a touchscreen; and an electrical circuit that controls a display of the touchscreen and detects user contact with a surface of the touchscreen, wherein: the electrical circuit generates a user interface on said display and wherein the user interface supports two views, a mosaic view and a site navigation view, alternately selectable by the user in manipulating the touchscreen; and wherein the user interface has a display zone and a command zone that remain in substantially consistent size and position when selecting between the mosaic view and the site navigation view; wherein the display zone and command zone each enclose content and permit user interaction, some of which content and the manner of user interaction remains substantially consistent when switching between views, as follows:
(a) the command zone encloses a player menu button that is present in both mosaic view and site navigation view;
(b) the display zone encloses information content based at least in part on user selection in both mosaic view and site navigation view;
wherein the display zone and command zone each enclose content and permit user interaction, some of which content and the manner of user interaction differs when switching between views, as follows:
(c) in the mosaic view, the command zone encloses at least one additional button actuable by the user to control what information content is presented in the display zone;
(d) in the site navigation view, the command zone encloses a command pad actuable by side-to-side sliding tactile motion by the user and further actuable by tapping motion by the user;
(e) in the mosaic view, information content corresponds to items of information associated with different information sites;
(f) in the site navigation view, information content is selected from the group consisting of objects having an associated function and passive content having no associated function;
(g) in the mosaic view, content is selectable by the user through touching items of information content at a displayed location;
(h) in the site navigation view, information content includes objects not activated by touch at the display location; and
(i) in the site navigation view, objects not activated by touch at the display location are selected by sliding touch manipulation of the command pad to selectively identify one of the objects and then by tapping manipulation of the command pad to confirm selection. 2. The device of claim 1 wherein in the site navigation view the command zone does not enclose said at least one additional button actuable by the user to control what information content is presented in the display zone. 3. The device of claim 1 wherein in the mosaic view the command zone does not enclose said command pad. 4. The device of claim 1 wherein, in the site navigation view, information content does not correspond to items of information associated with different information sites. 5. The device of claim 1 wherein, in the mosaic view, information content is selected other than from the group consisting of objects having an associated function and passive content having no associated function. 6. The device of claim 1 wherein, in the site navigation view, content is not selectable by the user through touching items of information content at the displayed location. 7. The device of claim 1 wherein the electrical circuit switches from the mosaic view to the site navigation view in response to selection by the user through touching items of information content at the displayed location. 8. The device of claim 1 wherein the electrical circuit switches from the mosaic view to the site navigation view in response to selection by the user through touching a specific item of information content at the displayed location and thereafter displays information content associated with said specific item of content selected while in the mosaic view. 9. The device of claim 1 wherein the function associated with an object includes a link to effect navigation to another item of information content. 10. The device of claim 1 wherein the function associated with an object includes a link to effect navigation at least one of: another page in an information site, an input form, a web page, and an email address. 11. The device of claim 1 wherein the electrical circuit generates a destination flag visible in the site navigation view which provides visual indication that an object has an associated function that effects navigation to another item of information content. 12. The device of claim 1 wherein the command zone in the site navigation view includes a site menu button. 13. The device of claim 1 wherein the command zone in the mosaic view includes a plurality of buttons actuable by the user to perform functions selected from the group consisting of: address input, favorites, recently viewed, and theme selector. 14. The device of claim 1 wherein the electrical circuit generates a progress bar visible in the site navigation view providing a visual indication that navigation to a selected site has started. 15. The device of claim 1 wherein the electrical circuit is configured to present the mosaic and site navigation views in both landscape and portrait orientation. 16. The device of claim 1 wherein sliding manipulation of the command pad causes individual ones of plural displayed content within the display zone of the site navigation view to be selectively highlighted, indicating that it may be selected by tapping of the command pad. | An electronic device includes a touchscreen and an electrical circuit. The electrical circuit controls a display of the touchscreen and detects user contact with a surface of the touchscreen. The electrical circuit divides the display into at least two distinct display zones including an informational display zone and a command display zone. The informational display zone displays informational content including functional objects, each of the functional objects being associated with a data processing function. The command display zone displays a graphic representation of a command pad. In response to detecting a first predetermined tactile action on the command pad, the electrical circuit graphically modifies one of the functional objects of the informational display zone to indication selection of the one of the functional objects. In response to detecting a second predetermined tactile action, the electrical circuit initiates execution of the data processing function associated with the selected functional object.1. An electronic device comprising:
a touchscreen; and an electrical circuit that controls a display of the touchscreen and detects user contact with a surface of the touchscreen, wherein: the electrical circuit generates a user interface on said display and wherein the user interface supports two views, a mosaic view and a site navigation view, alternately selectable by the user in manipulating the touchscreen; and wherein the user interface has a display zone and a command zone that remain in substantially consistent size and position when selecting between the mosaic view and the site navigation view; wherein the display zone and command zone each enclose content and permit user interaction, some of which content and the manner of user interaction remains substantially consistent when switching between views, as follows:
(a) the command zone encloses a player menu button that is present in both mosaic view and site navigation view;
(b) the display zone encloses information content based at least in part on user selection in both mosaic view and site navigation view;
wherein the display zone and command zone each enclose content and permit user interaction, some of which content and the manner of user interaction differs when switching between views, as follows:
(c) in the mosaic view, the command zone encloses at least one additional button actuable by the user to control what information content is presented in the display zone;
(d) in the site navigation view, the command zone encloses a command pad actuable by side-to-side sliding tactile motion by the user and further actuable by tapping motion by the user;
(e) in the mosaic view, information content corresponds to items of information associated with different information sites;
(f) in the site navigation view, information content is selected from the group consisting of objects having an associated function and passive content having no associated function;
(g) in the mosaic view, content is selectable by the user through touching items of information content at a displayed location;
(h) in the site navigation view, information content includes objects not activated by touch at the display location; and
(i) in the site navigation view, objects not activated by touch at the display location are selected by sliding touch manipulation of the command pad to selectively identify one of the objects and then by tapping manipulation of the command pad to confirm selection. 2. The device of claim 1 wherein in the site navigation view the command zone does not enclose said at least one additional button actuable by the user to control what information content is presented in the display zone. 3. The device of claim 1 wherein in the mosaic view the command zone does not enclose said command pad. 4. The device of claim 1 wherein, in the site navigation view, information content does not correspond to items of information associated with different information sites. 5. The device of claim 1 wherein, in the mosaic view, information content is selected other than from the group consisting of objects having an associated function and passive content having no associated function. 6. The device of claim 1 wherein, in the site navigation view, content is not selectable by the user through touching items of information content at the displayed location. 7. The device of claim 1 wherein the electrical circuit switches from the mosaic view to the site navigation view in response to selection by the user through touching items of information content at the displayed location. 8. The device of claim 1 wherein the electrical circuit switches from the mosaic view to the site navigation view in response to selection by the user through touching a specific item of information content at the displayed location and thereafter displays information content associated with said specific item of content selected while in the mosaic view. 9. The device of claim 1 wherein the function associated with an object includes a link to effect navigation to another item of information content. 10. The device of claim 1 wherein the function associated with an object includes a link to effect navigation at least one of: another page in an information site, an input form, a web page, and an email address. 11. The device of claim 1 wherein the electrical circuit generates a destination flag visible in the site navigation view which provides visual indication that an object has an associated function that effects navigation to another item of information content. 12. The device of claim 1 wherein the command zone in the site navigation view includes a site menu button. 13. The device of claim 1 wherein the command zone in the mosaic view includes a plurality of buttons actuable by the user to perform functions selected from the group consisting of: address input, favorites, recently viewed, and theme selector. 14. The device of claim 1 wherein the electrical circuit generates a progress bar visible in the site navigation view providing a visual indication that navigation to a selected site has started. 15. The device of claim 1 wherein the electrical circuit is configured to present the mosaic and site navigation views in both landscape and portrait orientation. 16. The device of claim 1 wherein sliding manipulation of the command pad causes individual ones of plural displayed content within the display zone of the site navigation view to be selectively highlighted, indicating that it may be selected by tapping of the command pad. | 2,100 |
4,909 | 14,793,652 | 2,128 | Systems and methods for managing a sanitary sewer infrastructure. In an embodiment, a plurality of representations of infrastructure assets are re-projected from a plane coordinate system into a geospatial coordinate system, such that each of the re-projected plurality of representations of infrastructure assets is associated with a geospatial coordinate. Each of the re-projected plurality of representations of infrastructure assets and its associated geospatial coordinate is stored in one or more databases. Subsequently, geospatial coordinates, collected in the field, may be received from one or more user devices, wherein each geospatial coordinate corresponds to a geospatial location of an infrastructure asset. A stored geospatial coordinate associated with one or more of the stored re-projected plurality of representations of infrastructure assets may then be adjusted based on the received geospatial coordinates. | 1. A method for managing a sanitary sewer infrastructure, the method comprising using at least one hardware processor to:
re-project a plurality of representations of infrastructure assets, from one or more computer-aided design (CAD) tiles, from a plane coordinate system into a geospatial coordinate system, such that each of the re-projected plurality of representations of infrastructure assets is associated with a geospatial coordinate; store each of the re-projected plurality of representations of infrastructure assets and its associated geospatial coordinate in one or more databases; receive an asset identifier and geospatial coordinates, associated with the asset identifier and collected in the field, from a user device, wherein each received geospatial coordinate corresponds to a geospatial location of an infrastructure asset; identify a first one of the stored re-projected plurality of representations of infrastructure assets that is associated with the received asset identifier; adjust the stored geospatial coordinate associated with the first stored re-projected representation of an infrastructure asset in the database based on the received geospatial coordinate associated with the received asset identifier; identify one or more second ones of the stored re-projected plurality of representations of infrastructure assets that were re-projected from a same one of the one or more CAD tiles as the first stored re-projected representation of an infrastructure asset; and, for each of the one or more second stored re-projected representations of infrastructure assets, adjust the stored geospatial coordinate associated with the second stored re-projected representation of an infrastructure asset based on a relationship, in one of the one or more CAD tiles, between the second stored re-projected representation of an infrastructure asset and the first stored re-projected representation of an infrastructure asset. 2. The method of claim 1, comprising using the at least one hardware processor to:
continually receive datasets comprising an asset identifier and geospatial coordinates, associated with the asset identifier and collected in the field, from one or more user devices; and continually and automatically adjust stored geospatial coordinates associated with two or more of the stored re-projected plurality of representations of infrastructure assets based on each received dataset. 3. The method of claim 1, further comprising adjusting points of one or more aerial image tiles based on the adjusted stored geo spatial coordinates associated with the first and second stored re-projected representations of infrastructure assets. 4. The method of claim 1, wherein each of the geospatial coordinates, associated with the plurality of re-projected plurality of representations of infrastructure assets in the database, comprises a latitude value, a longitude value, and an elevation value, and is associated with a time, indicating when the geospatial coordinates were collected. 5. The method of claim 1, wherein the re-projected plurality of representations of infrastructure assets comprise a representation of a first manhole and a representation of a second manhole, and wherein the method further comprises using the at least one hardware processor to:
identify a first geospatial coordinate associated with the representation of the first manhole; identify a second geospatial coordinate associated with the representation of the second manhole; and automatically assign one or more geospatial coordinates to a representation of a pipe segment, located between the first manhole and the second manhole, based on the first geospatial coordinate and the second geospatial coordinate. 6. The method of claim 1, further comprising, for each of the re-projected plurality of representations of infrastructure assets, storing the representation of the infrastructure asset in association with two or more attributes, wherein the two or more attributes comprise:
the geospatial coordinates associated with the re-projected representation of an infrastructure asset; and one or more of a time, an asset condition, an asset valuation, an environmental measurement, an inspection, a repair history, a contract, a work order, a purchase order, and a bid request. 7. The method of claim 6, further comprising, by an application executed by one or more hardware processors:
displaying a virtual map; and displaying one or more of a plurality of layers overlaid on the virtual map, wherein each of the one or more layers comprises a visual depiction of each of a subset of one or more of the stored re-projected plurality of representations of infrastructure assets, wherein each representation of an infrastructure asset in the subset is associated with a set of one or more attributes matching one or more defined criteria. 8. The method of claim 7, further comprising, by the application:
receiving a selection of three or more points on the virtual map from a user; determining a geospatial polygon by determining a geospatial coordinate for each of the received three or more points; and identifying a subset of one or more of the stored re-projected plurality of representations of infrastructure assets that are each associated with a geospatial coordinate within the geospatial polygon; and associating each of the identified subset of one or more of the stored re-projected plurality of representations of infrastructure assets with a common attribute. 9. The method of claim 8, wherein the common attribute is one or more of a new user-defined layer, a contract, a work order, a purchase order, and a bid request. 10. The method of claim 7, further comprising, by the application:
receiving a time input from the user; and updating each of the displayed one or more layers to comprise a visual depiction of each representation of an infrastructure in the subset that is also associated with a time attribute matching the received time input or within a range represented by the received time input. 11. The method of claim 7, further comprising, by the application:
generating at least one work order data structure representing a work order and corresponding to one or more infrastructure assets; and associating the at least one work order data structure with a corresponding one or more of the re-projected plurality of representations of infrastructure assets. 12. The method of claim 11, wherein associating the at least one work order data structure with a corresponding one or more of the re-projected plurality of representations of infrastructure assets comprises associating the at least one work order data structure with a fault data structure associated with a representation of an infrastructure asset, wherein the fault data structure represents a fault in the associated representation of an infrastructure asset. 13. The method of claim 7, further comprising, by the application:
generating at least one project plan data structure representing a project plan and corresponding to one or more infrastructure assets; and associating the at least one project plan data structure with a corresponding one or more of the re-projected plurality of representations of infrastructure assets. 14. The method of claim 13, wherein the at least one project plan data structure comprises two or more project plan data structures, and wherein the method further comprises using the at least one hardware processor to identify conflicts between two or more project plans based on the two or more project plan data structures. 15. The method of claim 14, further comprising, by the application, highlighting the conflicts on the displayed virtual map. 16. The method of claim 13, further comprising, by the application:
determining properties affected by the project plan by comparing geospatial coordinates associated with the one or more representations of infrastructure assets associated with the at least one project plan data structure with property records; and generating a communication to one or more owners of the determined properties. 17. The method of claim 16, wherein each communication comprises a request for permission to enter an owner's property to inspect one or more infrastructure assets, and wherein the method further comprises, by the application, coordinating inspection of the one or more infrastructure assets. 18. The method of claim 7, further comprising:
receiving a plurality of ratings for a plurality of infrastructure assets; storing each of the plurality of ratings in association with a corresponding one of the re-projected plurality of representations of infrastructure assets; modeling one or more maintenance strategies for one or more infrastructure assets based on one or more of the stored plurality of ratings; and overlaying a depiction of one or more budget scenarios associated with the modeled one or more maintenance strategies over the virtual map. 19. A system for managing a sanitary sewer infrastructure, the system comprising:
at least one hardware processor; and at least one executable software module that, when executed by the at least one hardware processor,
re-project a plurality of representations of infrastructure assets, from one or more computer-aided design (CAD) tiles, from a plane coordinate system into a geospatial coordinate system, such that each of the re-projected plurality of representations of infrastructure assets is associated with a geospatial coordinate,
store each of the re-projected plurality of representations of infrastructure assets and its associated geospatial coordinate in one or more databases,
receive an asset identifier and geospatial coordinates, associated with the asset identifier and collected in the field, from a user device, wherein each received geospatial coordinate corresponds to a geospatial location of an infrastructure asset,
identify a first one of the stored re-projected plurality of representations of infrastructure assets that is associated with the received asset identifier,
adjust the stored geospatial coordinate associated with the first stored re-projected representation of an infrastructure asset in the database based on the received geospatial coordinate associated with the received asset identifier,
identify one or more second ones of the stored re-projected plurality of representations of infrastructure assets that were re-projected from a same one of the one or more CAD tiles as the first stored re-projected representation of an infrastructure asset, and,
for each of the one or more second stored re-projected representations of infrastructure assets, adjust the stored geospatial coordinate associated with the second stored re-projected representation of an infrastructure asset based on a relationship, in one of the one or more CAD tiles, between the second stored re-projected representation of an infrastructure asset and the first stored re-projected representation of an infrastructure asset. 20. A non-transitory computer-readable medium having instructions stored thereon, wherein the instructions, when executed by a processor, cause the processor to:
re-project a plurality of representations of infrastructure assets, from one or more computer-aided design (CAD) tiles, from a plane coordinate system into a geospatial coordinate system, such that each of the re-projected plurality of representations of infrastructure assets is associated with a geospatial coordinate; store each of the re-projected plurality of representations of infrastructure assets and its associated geospatial coordinate in one or more databases; receive an asset identifier and geospatial coordinates, associated with the asset identifier and collected in the field, from a user device, wherein each received geospatial coordinate corresponds to a geospatial location of an infrastructure asset; identify a first one of the stored re-projected plurality of representations of infrastructure assets that is associated with the received asset identifier; adjust the stored geospatial coordinate associated with the first stored re-projected representation of an infrastructure asset in the database based on the received geospatial coordinate associated with the received asset identifier; identify one or more second ones of the stored re-projected plurality of representations of infrastructure assets that were re-projected from a same one of the one or more CAD tiles as the first stored re-projected representation of an infrastructure asset; and, for each of the one or more second stored re-projected representations of infrastructure assets, adjust the stored geospatial coordinate associated with the second stored re-projected representation of an infrastructure asset based on a relationship, in one of the one or more CAD tiles, between the second stored re-projected representation of an infrastructure asset and the first stored re-projected representation of an infrastructure asset. | Systems and methods for managing a sanitary sewer infrastructure. In an embodiment, a plurality of representations of infrastructure assets are re-projected from a plane coordinate system into a geospatial coordinate system, such that each of the re-projected plurality of representations of infrastructure assets is associated with a geospatial coordinate. Each of the re-projected plurality of representations of infrastructure assets and its associated geospatial coordinate is stored in one or more databases. Subsequently, geospatial coordinates, collected in the field, may be received from one or more user devices, wherein each geospatial coordinate corresponds to a geospatial location of an infrastructure asset. A stored geospatial coordinate associated with one or more of the stored re-projected plurality of representations of infrastructure assets may then be adjusted based on the received geospatial coordinates.1. A method for managing a sanitary sewer infrastructure, the method comprising using at least one hardware processor to:
re-project a plurality of representations of infrastructure assets, from one or more computer-aided design (CAD) tiles, from a plane coordinate system into a geospatial coordinate system, such that each of the re-projected plurality of representations of infrastructure assets is associated with a geospatial coordinate; store each of the re-projected plurality of representations of infrastructure assets and its associated geospatial coordinate in one or more databases; receive an asset identifier and geospatial coordinates, associated with the asset identifier and collected in the field, from a user device, wherein each received geospatial coordinate corresponds to a geospatial location of an infrastructure asset; identify a first one of the stored re-projected plurality of representations of infrastructure assets that is associated with the received asset identifier; adjust the stored geospatial coordinate associated with the first stored re-projected representation of an infrastructure asset in the database based on the received geospatial coordinate associated with the received asset identifier; identify one or more second ones of the stored re-projected plurality of representations of infrastructure assets that were re-projected from a same one of the one or more CAD tiles as the first stored re-projected representation of an infrastructure asset; and, for each of the one or more second stored re-projected representations of infrastructure assets, adjust the stored geospatial coordinate associated with the second stored re-projected representation of an infrastructure asset based on a relationship, in one of the one or more CAD tiles, between the second stored re-projected representation of an infrastructure asset and the first stored re-projected representation of an infrastructure asset. 2. The method of claim 1, comprising using the at least one hardware processor to:
continually receive datasets comprising an asset identifier and geospatial coordinates, associated with the asset identifier and collected in the field, from one or more user devices; and continually and automatically adjust stored geospatial coordinates associated with two or more of the stored re-projected plurality of representations of infrastructure assets based on each received dataset. 3. The method of claim 1, further comprising adjusting points of one or more aerial image tiles based on the adjusted stored geo spatial coordinates associated with the first and second stored re-projected representations of infrastructure assets. 4. The method of claim 1, wherein each of the geospatial coordinates, associated with the plurality of re-projected plurality of representations of infrastructure assets in the database, comprises a latitude value, a longitude value, and an elevation value, and is associated with a time, indicating when the geospatial coordinates were collected. 5. The method of claim 1, wherein the re-projected plurality of representations of infrastructure assets comprise a representation of a first manhole and a representation of a second manhole, and wherein the method further comprises using the at least one hardware processor to:
identify a first geospatial coordinate associated with the representation of the first manhole; identify a second geospatial coordinate associated with the representation of the second manhole; and automatically assign one or more geospatial coordinates to a representation of a pipe segment, located between the first manhole and the second manhole, based on the first geospatial coordinate and the second geospatial coordinate. 6. The method of claim 1, further comprising, for each of the re-projected plurality of representations of infrastructure assets, storing the representation of the infrastructure asset in association with two or more attributes, wherein the two or more attributes comprise:
the geospatial coordinates associated with the re-projected representation of an infrastructure asset; and one or more of a time, an asset condition, an asset valuation, an environmental measurement, an inspection, a repair history, a contract, a work order, a purchase order, and a bid request. 7. The method of claim 6, further comprising, by an application executed by one or more hardware processors:
displaying a virtual map; and displaying one or more of a plurality of layers overlaid on the virtual map, wherein each of the one or more layers comprises a visual depiction of each of a subset of one or more of the stored re-projected plurality of representations of infrastructure assets, wherein each representation of an infrastructure asset in the subset is associated with a set of one or more attributes matching one or more defined criteria. 8. The method of claim 7, further comprising, by the application:
receiving a selection of three or more points on the virtual map from a user; determining a geospatial polygon by determining a geospatial coordinate for each of the received three or more points; and identifying a subset of one or more of the stored re-projected plurality of representations of infrastructure assets that are each associated with a geospatial coordinate within the geospatial polygon; and associating each of the identified subset of one or more of the stored re-projected plurality of representations of infrastructure assets with a common attribute. 9. The method of claim 8, wherein the common attribute is one or more of a new user-defined layer, a contract, a work order, a purchase order, and a bid request. 10. The method of claim 7, further comprising, by the application:
receiving a time input from the user; and updating each of the displayed one or more layers to comprise a visual depiction of each representation of an infrastructure in the subset that is also associated with a time attribute matching the received time input or within a range represented by the received time input. 11. The method of claim 7, further comprising, by the application:
generating at least one work order data structure representing a work order and corresponding to one or more infrastructure assets; and associating the at least one work order data structure with a corresponding one or more of the re-projected plurality of representations of infrastructure assets. 12. The method of claim 11, wherein associating the at least one work order data structure with a corresponding one or more of the re-projected plurality of representations of infrastructure assets comprises associating the at least one work order data structure with a fault data structure associated with a representation of an infrastructure asset, wherein the fault data structure represents a fault in the associated representation of an infrastructure asset. 13. The method of claim 7, further comprising, by the application:
generating at least one project plan data structure representing a project plan and corresponding to one or more infrastructure assets; and associating the at least one project plan data structure with a corresponding one or more of the re-projected plurality of representations of infrastructure assets. 14. The method of claim 13, wherein the at least one project plan data structure comprises two or more project plan data structures, and wherein the method further comprises using the at least one hardware processor to identify conflicts between two or more project plans based on the two or more project plan data structures. 15. The method of claim 14, further comprising, by the application, highlighting the conflicts on the displayed virtual map. 16. The method of claim 13, further comprising, by the application:
determining properties affected by the project plan by comparing geospatial coordinates associated with the one or more representations of infrastructure assets associated with the at least one project plan data structure with property records; and generating a communication to one or more owners of the determined properties. 17. The method of claim 16, wherein each communication comprises a request for permission to enter an owner's property to inspect one or more infrastructure assets, and wherein the method further comprises, by the application, coordinating inspection of the one or more infrastructure assets. 18. The method of claim 7, further comprising:
receiving a plurality of ratings for a plurality of infrastructure assets; storing each of the plurality of ratings in association with a corresponding one of the re-projected plurality of representations of infrastructure assets; modeling one or more maintenance strategies for one or more infrastructure assets based on one or more of the stored plurality of ratings; and overlaying a depiction of one or more budget scenarios associated with the modeled one or more maintenance strategies over the virtual map. 19. A system for managing a sanitary sewer infrastructure, the system comprising:
at least one hardware processor; and at least one executable software module that, when executed by the at least one hardware processor,
re-project a plurality of representations of infrastructure assets, from one or more computer-aided design (CAD) tiles, from a plane coordinate system into a geospatial coordinate system, such that each of the re-projected plurality of representations of infrastructure assets is associated with a geospatial coordinate,
store each of the re-projected plurality of representations of infrastructure assets and its associated geospatial coordinate in one or more databases,
receive an asset identifier and geospatial coordinates, associated with the asset identifier and collected in the field, from a user device, wherein each received geospatial coordinate corresponds to a geospatial location of an infrastructure asset,
identify a first one of the stored re-projected plurality of representations of infrastructure assets that is associated with the received asset identifier,
adjust the stored geospatial coordinate associated with the first stored re-projected representation of an infrastructure asset in the database based on the received geospatial coordinate associated with the received asset identifier,
identify one or more second ones of the stored re-projected plurality of representations of infrastructure assets that were re-projected from a same one of the one or more CAD tiles as the first stored re-projected representation of an infrastructure asset, and,
for each of the one or more second stored re-projected representations of infrastructure assets, adjust the stored geospatial coordinate associated with the second stored re-projected representation of an infrastructure asset based on a relationship, in one of the one or more CAD tiles, between the second stored re-projected representation of an infrastructure asset and the first stored re-projected representation of an infrastructure asset. 20. A non-transitory computer-readable medium having instructions stored thereon, wherein the instructions, when executed by a processor, cause the processor to:
re-project a plurality of representations of infrastructure assets, from one or more computer-aided design (CAD) tiles, from a plane coordinate system into a geospatial coordinate system, such that each of the re-projected plurality of representations of infrastructure assets is associated with a geospatial coordinate; store each of the re-projected plurality of representations of infrastructure assets and its associated geospatial coordinate in one or more databases; receive an asset identifier and geospatial coordinates, associated with the asset identifier and collected in the field, from a user device, wherein each received geospatial coordinate corresponds to a geospatial location of an infrastructure asset; identify a first one of the stored re-projected plurality of representations of infrastructure assets that is associated with the received asset identifier; adjust the stored geospatial coordinate associated with the first stored re-projected representation of an infrastructure asset in the database based on the received geospatial coordinate associated with the received asset identifier; identify one or more second ones of the stored re-projected plurality of representations of infrastructure assets that were re-projected from a same one of the one or more CAD tiles as the first stored re-projected representation of an infrastructure asset; and, for each of the one or more second stored re-projected representations of infrastructure assets, adjust the stored geospatial coordinate associated with the second stored re-projected representation of an infrastructure asset based on a relationship, in one of the one or more CAD tiles, between the second stored re-projected representation of an infrastructure asset and the first stored re-projected representation of an infrastructure asset. | 2,100 |
4,910 | 13,842,581 | 2,144 | There is provided a document creation system comprising a document creation device and a document browsing device, wherein the document creation device has a functional layer storage that stores functional layers which are to be superposed on an image, which are transparent at least partially, and whose functions are defined in predetermined regions of the layers, a selection section that selects the functional layer to be applied, from among the functional layers stored in the functional layer storage, and a synthesis section that superposes the functional layer selected by the selection section onto the image, and wherein the document browsing device performs display processing, input acceptance processing, or output processing on the image onto which the functional layer is superposed by the synthesis section in accordance with the superposed functional layer. | 1. A document creation system comprising a document creation device and a document browsing device,
wherein the document creation device has a functional layer storage that stores functional layers which are to be superposed on an image, which are transparent at least partially, and whose functions are defined in predetermined regions of the layers, a selection section that selects the functional layer to be applied, from among the functional layers stored in the functional layer storage, and a synthesis section that superposes the functional layer selected by the selection section onto the image, and wherein the document browsing device performs display processing, input acceptance processing, or output processing on the image onto which the functional layer is superposed by the synthesis section in accordance with the superposed functional layer. 2. The document creation system according to claim 1,
wherein the document creation device further has an edit section that edits the functional layer selected by the selection section, and wherein the synthesis section superposes the functional layer edited by the edit section onto the image. 3. The document creation system according to claim 1,
wherein the document creation device further has a function definition section that specifies the predetermined region to the functional layer selected by the selection section and defines at least an input acceptance function, a file control function, or a display control function, and wherein the synthesis section superposes the functional layer whose function is defined by the function definition section onto the image. 4. The document creation system according to claim 3,
wherein the function definition section adds input acceptance definition information which specifies a region in the functional layer and a type of an input operation to be accepted in this region to this functional layer in response to an instruction from a user, and wherein the document browsing device has an input acceptance section that accepts the input operation of the type specified by the input acceptance definition information in the region specified by the input acceptance definition information in the functional layer superposed onto the image to be displayed in accordance with the input acceptance definition information added to the functional layer and displays the accepted input operation in the region. 5. The document creation system according to claim 3,
wherein the function definition section adds at least output definition information which specifies a transfer destination of a file as a whole, an output destination of the file, or addition of security to the file, to the functional layer, and wherein the document browsing device has an output control section that transfers the file containing the functional layer, outputs the file containing the functional layer, or adds security to the file containing the functional layer in accordance with the output definition information added to the functional layer. 6. The document creation system according to claim 3,
wherein the function definition section adds at least display definition information which specifies a display range, a display size, or display order to the functional layer in a predetermined region in the functional layer, and wherein the document browsing device has a display control section that displays the image onto which the functional layer is superposed, in accordance with the display definition information added to the functional layer. 7. The document creation system according to claim 3,
wherein the function definition section adds, to the functional layer, electronic authentication definition information which specifies the image to be superposed onto the functional layer or the layer in accordance with specification of the user and commands generating electronic authentication information to the specified image or layer, and wherein the document browsing device has an electronic authentication section that generates electronic authentication information to the image superposed onto the functional layer or the layer in accordance with the electronic authentication definition information added to the functional layer. 8. The document creation system according to claim 1, wherein:
the document creation device has a transmission section that transmits a consolidated data file, into the one consolidated data file, a data file of the image specified by the user and a data file of the selected functional layer being consolidated by the synthesis section; and the document browsing device is a browsing device whose display screen has touch-sensitive panel functions and has a reception section that receives the one data file consolidated by the synthesis section and further receives the data file transmitted by the transmission section. 9. A document creation device comprising:
a functional layer storage that stores functional layers which are to be superposed on an image, which are transparent at least partially, and whose functions are defined in predetermined regions of the layers; a selection section that selects the functional layer to be applied, from among the functional layers stored in the functional layer storage; and a synthesis section that superposes the functional layer selected by the selection section onto the image. 10. A non-transitory computer-readable medium storing thereon a computer program that causes a computer to perform a method comprising:
storing functional layers which are to be superposed on an image, which are transparent at least partially, and whose functions are defined in predetermined regions of the layers; selecting the functional layer to be applied, from among the stored functional layers; and superposing the selected functional layer onto the image. | There is provided a document creation system comprising a document creation device and a document browsing device, wherein the document creation device has a functional layer storage that stores functional layers which are to be superposed on an image, which are transparent at least partially, and whose functions are defined in predetermined regions of the layers, a selection section that selects the functional layer to be applied, from among the functional layers stored in the functional layer storage, and a synthesis section that superposes the functional layer selected by the selection section onto the image, and wherein the document browsing device performs display processing, input acceptance processing, or output processing on the image onto which the functional layer is superposed by the synthesis section in accordance with the superposed functional layer.1. A document creation system comprising a document creation device and a document browsing device,
wherein the document creation device has a functional layer storage that stores functional layers which are to be superposed on an image, which are transparent at least partially, and whose functions are defined in predetermined regions of the layers, a selection section that selects the functional layer to be applied, from among the functional layers stored in the functional layer storage, and a synthesis section that superposes the functional layer selected by the selection section onto the image, and wherein the document browsing device performs display processing, input acceptance processing, or output processing on the image onto which the functional layer is superposed by the synthesis section in accordance with the superposed functional layer. 2. The document creation system according to claim 1,
wherein the document creation device further has an edit section that edits the functional layer selected by the selection section, and wherein the synthesis section superposes the functional layer edited by the edit section onto the image. 3. The document creation system according to claim 1,
wherein the document creation device further has a function definition section that specifies the predetermined region to the functional layer selected by the selection section and defines at least an input acceptance function, a file control function, or a display control function, and wherein the synthesis section superposes the functional layer whose function is defined by the function definition section onto the image. 4. The document creation system according to claim 3,
wherein the function definition section adds input acceptance definition information which specifies a region in the functional layer and a type of an input operation to be accepted in this region to this functional layer in response to an instruction from a user, and wherein the document browsing device has an input acceptance section that accepts the input operation of the type specified by the input acceptance definition information in the region specified by the input acceptance definition information in the functional layer superposed onto the image to be displayed in accordance with the input acceptance definition information added to the functional layer and displays the accepted input operation in the region. 5. The document creation system according to claim 3,
wherein the function definition section adds at least output definition information which specifies a transfer destination of a file as a whole, an output destination of the file, or addition of security to the file, to the functional layer, and wherein the document browsing device has an output control section that transfers the file containing the functional layer, outputs the file containing the functional layer, or adds security to the file containing the functional layer in accordance with the output definition information added to the functional layer. 6. The document creation system according to claim 3,
wherein the function definition section adds at least display definition information which specifies a display range, a display size, or display order to the functional layer in a predetermined region in the functional layer, and wherein the document browsing device has a display control section that displays the image onto which the functional layer is superposed, in accordance with the display definition information added to the functional layer. 7. The document creation system according to claim 3,
wherein the function definition section adds, to the functional layer, electronic authentication definition information which specifies the image to be superposed onto the functional layer or the layer in accordance with specification of the user and commands generating electronic authentication information to the specified image or layer, and wherein the document browsing device has an electronic authentication section that generates electronic authentication information to the image superposed onto the functional layer or the layer in accordance with the electronic authentication definition information added to the functional layer. 8. The document creation system according to claim 1, wherein:
the document creation device has a transmission section that transmits a consolidated data file, into the one consolidated data file, a data file of the image specified by the user and a data file of the selected functional layer being consolidated by the synthesis section; and the document browsing device is a browsing device whose display screen has touch-sensitive panel functions and has a reception section that receives the one data file consolidated by the synthesis section and further receives the data file transmitted by the transmission section. 9. A document creation device comprising:
a functional layer storage that stores functional layers which are to be superposed on an image, which are transparent at least partially, and whose functions are defined in predetermined regions of the layers; a selection section that selects the functional layer to be applied, from among the functional layers stored in the functional layer storage; and a synthesis section that superposes the functional layer selected by the selection section onto the image. 10. A non-transitory computer-readable medium storing thereon a computer program that causes a computer to perform a method comprising:
storing functional layers which are to be superposed on an image, which are transparent at least partially, and whose functions are defined in predetermined regions of the layers; selecting the functional layer to be applied, from among the stored functional layers; and superposing the selected functional layer onto the image. | 2,100 |
4,911 | 14,472,017 | 2,174 | A system is disclosed that improves the ability for users to select links and/or other display elements via a touch screen, such as the touch screen of a smartphone, tablet, or other mobile device. The system achieves this effect by adjusting the sizes and/or shapes of the touch targets associated with particular display elements. For example, if a particular link on a web page is determined to be difficult to select via a touch screen (based on monitored user behaviors and/or based on an automated analysis of page content), the touch target associated with the link may be increased in size. | 1. A computer-implemented method, comprising:
receiving and storing user interaction data reported by each of a plurality of user devices having touch screens, the user interaction data specifying user interactions with a network-accessible page on the user devices, the network-accessible page including a user-selectable display element; detecting, based on a programmatic analysis of the user interaction data, a recurring pattern reflecting a difficulty experienced by users in selecting the user-selectable display element on the touch screens; and selecting, based on the detected recurring pattern, an adjustment to be made to a touch target associated with the user-selectable display element to facilitate selection of the user-selectable display element, the adjustment including a modification to a size of the touch target; the method performed programmatically by a touch target optimization system that comprises one or more computing devices. 2. The method of claim 1,
wherein the plurality of user devices include user devices of a plurality of device types; wherein the user interaction data is stored in association with user device type information that distinguishes between the plurality of device types; and wherein the selected adjustment is specific to one of the plurality of user device types. 3. The method of claim 1, wherein the plurality of user devices include user devices of a plurality of device types, and wherein the adjustment is specific to a particular one of the device types. 4. The method of claim 3, further comprising receiving a request from a user device for the page, and responding to the request by at least:
determining that the user device is of the particular device type; and in response to determining that the user device is of the particular device type, causing the page to be delivered to the user device with the adjustment. 5. The method of claim 1, wherein the interaction data is reflective of actions of a plurality of users, and the adjustment is specific to a selected subset of the users. 6. The method of claim 1, wherein the adjustment comprises an enlargement of the touch target. 7. The method of claim 1, wherein the recurring pattern is a pattern in which users zoom-in on the page before selecting the user-selectable display element. 8. The method of claim 7, wherein the adjustment is selected based at least partly on a determination of what percentage of users zoom-in on the page before selecting the user-selectable display element. 9. The method of claim 1, wherein the recurring pattern reflects failed attempts by users to select the user-selectable display element. 10. The method of claim 1, further comprising instructing a browser component running on a user device to make the adjustment to the touch target on the user device. 11. The method of claim 1, further comprising, by a proxy server system that operates as an intermediary between user devices and content servers, making the selected adjustment to the touch target in a copy of the page retrieved from a content server. 12. The method of claim 1, wherein the recurring pattern and the adjustment are specific to a particular user device and are based on user interactions performed on the user device. 13. A system, comprising:
a touch target optimization system comprising one or more computing devices; and a browser component configured to run on user devices that include touch screens and to report, to the touch target optimization system, user interaction data reflective of user interactions with network-accessible pages; wherein the touch target optimization system is configured to analyze the reported user interaction data to identify recurring patterns reflective of problems encountered by users in selecting display elements of the network-accessible pages, and to use the detected patterns to select touch target adjustments to be made to reduce the display element selection problems. 14. The system of claim 13, wherein the touch target optimization system is configured to store the reported user interaction data in association with each of a plurality of user device types, and is configured to select a touch target adjustment that is specific to a particular one of the user device types. 15. The system of claim 13, wherein the recurring patterns include patterns in which users attempt but fail to select a user-selectable display element. 16. The system of claim 13, wherein the recurring patterns include patterns in which users zoom-in on page content before selecting a user-selectable display element. 17. The system of claim 13, wherein the touch target optimization system is part of a proxy server system, and is configured to modify requested pages to cause the selected touch target adjustments to be made. 18. Non-transitory computer storage having stored thereon executable program instructions that direct a computing system to implement a process comprising:
monitoring and recording actions performed by a user on a touch screen of a user device during browsing of network-accessible pages; detecting, based on an analysis of the recorded actions of the user, a recurring pattern reflective of a problem experienced by the user in selecting at least one user-selectable display element of at least one of the the network-accessible pages; and based on the detected recurring pattern, selecting a touch target adjustment to be made for the user to reduce the problem. 19. The computer storage of claim 18, wherein the recurring pattern is a pattern in which the user consistently touches too high, too low, or to a particular side of a touch target, and the touch target adjustment comprises a touch target extension that is based on the recurring pattern. 20. The computer storage of claim 18, wherein the recurring pattern comprises failed attempts by the user to select at least one user-selectable display element. 21. The computer storage of claim 18, wherein the recurring pattern is a pattern in which the user zooms-in on page content before selecting a display element. | A system is disclosed that improves the ability for users to select links and/or other display elements via a touch screen, such as the touch screen of a smartphone, tablet, or other mobile device. The system achieves this effect by adjusting the sizes and/or shapes of the touch targets associated with particular display elements. For example, if a particular link on a web page is determined to be difficult to select via a touch screen (based on monitored user behaviors and/or based on an automated analysis of page content), the touch target associated with the link may be increased in size.1. A computer-implemented method, comprising:
receiving and storing user interaction data reported by each of a plurality of user devices having touch screens, the user interaction data specifying user interactions with a network-accessible page on the user devices, the network-accessible page including a user-selectable display element; detecting, based on a programmatic analysis of the user interaction data, a recurring pattern reflecting a difficulty experienced by users in selecting the user-selectable display element on the touch screens; and selecting, based on the detected recurring pattern, an adjustment to be made to a touch target associated with the user-selectable display element to facilitate selection of the user-selectable display element, the adjustment including a modification to a size of the touch target; the method performed programmatically by a touch target optimization system that comprises one or more computing devices. 2. The method of claim 1,
wherein the plurality of user devices include user devices of a plurality of device types; wherein the user interaction data is stored in association with user device type information that distinguishes between the plurality of device types; and wherein the selected adjustment is specific to one of the plurality of user device types. 3. The method of claim 1, wherein the plurality of user devices include user devices of a plurality of device types, and wherein the adjustment is specific to a particular one of the device types. 4. The method of claim 3, further comprising receiving a request from a user device for the page, and responding to the request by at least:
determining that the user device is of the particular device type; and in response to determining that the user device is of the particular device type, causing the page to be delivered to the user device with the adjustment. 5. The method of claim 1, wherein the interaction data is reflective of actions of a plurality of users, and the adjustment is specific to a selected subset of the users. 6. The method of claim 1, wherein the adjustment comprises an enlargement of the touch target. 7. The method of claim 1, wherein the recurring pattern is a pattern in which users zoom-in on the page before selecting the user-selectable display element. 8. The method of claim 7, wherein the adjustment is selected based at least partly on a determination of what percentage of users zoom-in on the page before selecting the user-selectable display element. 9. The method of claim 1, wherein the recurring pattern reflects failed attempts by users to select the user-selectable display element. 10. The method of claim 1, further comprising instructing a browser component running on a user device to make the adjustment to the touch target on the user device. 11. The method of claim 1, further comprising, by a proxy server system that operates as an intermediary between user devices and content servers, making the selected adjustment to the touch target in a copy of the page retrieved from a content server. 12. The method of claim 1, wherein the recurring pattern and the adjustment are specific to a particular user device and are based on user interactions performed on the user device. 13. A system, comprising:
a touch target optimization system comprising one or more computing devices; and a browser component configured to run on user devices that include touch screens and to report, to the touch target optimization system, user interaction data reflective of user interactions with network-accessible pages; wherein the touch target optimization system is configured to analyze the reported user interaction data to identify recurring patterns reflective of problems encountered by users in selecting display elements of the network-accessible pages, and to use the detected patterns to select touch target adjustments to be made to reduce the display element selection problems. 14. The system of claim 13, wherein the touch target optimization system is configured to store the reported user interaction data in association with each of a plurality of user device types, and is configured to select a touch target adjustment that is specific to a particular one of the user device types. 15. The system of claim 13, wherein the recurring patterns include patterns in which users attempt but fail to select a user-selectable display element. 16. The system of claim 13, wherein the recurring patterns include patterns in which users zoom-in on page content before selecting a user-selectable display element. 17. The system of claim 13, wherein the touch target optimization system is part of a proxy server system, and is configured to modify requested pages to cause the selected touch target adjustments to be made. 18. Non-transitory computer storage having stored thereon executable program instructions that direct a computing system to implement a process comprising:
monitoring and recording actions performed by a user on a touch screen of a user device during browsing of network-accessible pages; detecting, based on an analysis of the recorded actions of the user, a recurring pattern reflective of a problem experienced by the user in selecting at least one user-selectable display element of at least one of the the network-accessible pages; and based on the detected recurring pattern, selecting a touch target adjustment to be made for the user to reduce the problem. 19. The computer storage of claim 18, wherein the recurring pattern is a pattern in which the user consistently touches too high, too low, or to a particular side of a touch target, and the touch target adjustment comprises a touch target extension that is based on the recurring pattern. 20. The computer storage of claim 18, wherein the recurring pattern comprises failed attempts by the user to select at least one user-selectable display element. 21. The computer storage of claim 18, wherein the recurring pattern is a pattern in which the user zooms-in on page content before selecting a display element. | 2,100 |
4,912 | 13,821,208 | 2,168 | A method for recognizing software applications installed on hardware devices includes scanning a hardware device to discover a target software application installed on the hardware device, where the target application includes one or more files; retrieving one or more sample applications for comparison to the target application; determining a resemblance between the target application and each of the one or more sample applications; and identifying the target application based on the resemblance determination. | 1. A method for recognizing software applications installed on hardware devices, comprising:
scanning a hardware device to discover a target software application installed on the hardware device, wherein the target application comprises one or more files; retrieving one or more sample applications for comparison to the target application; determining a resemblance between the target application and each of the one or more sample applications; and identifying the target application based on the resemblance determination. 2. The method of claim 1, wherein the target application and each of the one or more sample applications comprise one or more files, and wherein the resemblance determination is based on a distance between corresponding files of the target application and each of the one or more sample applications. 3. The method of claim 2, wherein each of the files comprises one or more attributes, further comprising:
applying a weight to each of the one or more attributes; summing the weights; and selecting a sample application with the highest summed weights for identifying the target application. 4. The method of claim 2, wherein for target application files qi and sample application files si, the distance is measured as
r
(
q
,
s
)
=
∑
i
=
1
N
•
k
i
q
i
-
s
i
,
wherein
∑
i
=
1
N
•
k
i
=
1
,
and wherein ki is a weight value for each attribute N. 5. The method of claim 4, wherein to calculate the resemblance R(Q,S) between reference file set S={si|1≦l≦n, si≦si+1} and target file set Q={qi|1≦l≦m, qi≦qi+1}, the resemblance computation is
R
(
Q
,
S
)
=
∑
i
=
1
i
=
M
〚
r
(
q
i
,
s
j
〛
)
,
where, qi Q, sj S, sj-l<qi<sj. 6. The method of claim 5, further comprising storing the output values, R(Q,S) of the K nearest sample file sets to the target file set Q in vector R={R1, R2, . . . RK}. 7. The method of claim 6, further comprising applying a threshold to the K nearest sample file sets. 8. The method of claim 7, wherein no sample file set exceeds the threshold, further comprising using an alternate criteria for identifying the target software application. 9. The method of claim 1, further comprising:
determining a type of application for the target software application; and selecting only those sample software applications that correspond to the determined type of application. 10. The method of claim 1, wherein the files include a .exe file, and wherein the .exe file is assigned a highest weight. 11. The method of claim 1, where a sum of the weights equals 1.0 12. A computer-readable medium including programming code for execution by a processor, the programming, when executed by the processor, implementing a method, comprising:
scanning a hardware device to discover a target software application installed on the hardware device, wherein the target application comprises one or more files; retrieving one or more sample applications for comparison to the target application; determining a resemblance between the target application and each of the one or more sample applications; and identifying the target application based on the resemblance determination. 13. The computer-readable medium of claim 12, wherein the target application and each of the one or more sample applications comprise one or more files, and wherein the resemblance determination is based on a distance between corresponding files of the target application and each of the one or more sample applications. 14. The computer-readable medium of claim 13, wherein each of the files comprises one or more attributes, further comprising:
applying a weight to each of the one or more attributes; summing the weights; and selecting a sample application with the highest summed weights for identifying the target application. 15. The computer-readable medium of claim 13, wherein for target application files qi and sample application files si, the distance is measured as
r
(
q
,
s
)
=
∑
i
=
1
N
•
k
i
q
i
-
s
i
,
wherein
∑
i
=
1
N
•
k
i
=
1
,
and wherein ki is a weight value for each attribute N. 16. The computer-readable medium of claim 15, wherein to calculate the resemblance R(Q,S) between reference file set S={si|1≦l≦n, si≦si+1} and target file set Q={qi|1≦l≦m, qi≦qi+1}, the resemblance computation is R(Q,
S
)
=
∑
i
=
1
i
=
M
〚
r
(
q
i
,
s
j
〛
)
,
where, qi Q, sj S, sj-l<qi<sj. 17. The computer-readable medium of claim 16, further comprising storing the output values, R(Q,S) of the K nearest sample file sets to the target file set Q in vector R={R1, R2, . . . RK}. 18. The computer-readable medium of claim 17, further comprising applying a threshold to the K nearest sample file sets. 19. A system for recognizing a target software application, comprising:
a scanning engine that scans a hardware device to discover a target software application installed on the hardware device, wherein the target application comprises one or more files a file retrieval engine that retrieves one or more sample applications for comparison to the target application; a resemblance engine that determines a resemblance between the target application and each of the one or more sample applications; and a comparison engine that identifies the target application based on the resemblance determination. 20. The system of claim 19, wherein the resemblance engine applies a weight to each of the one or more attributes, sums the weights, and selects a sample application with the highest summed weights for identifying the target application further comprising, and wherein the resemblance engine calculates the resemblance R(Q,S) between reference the set S={si|1≦l≦n, si≦si+1} and target the set Q={(qi|1≦l≦m, qi≦qi+1}, as is
R
(
Q
,
S
)
=
∑
i
=
1
i
=
M
〚
r
(
q
i
,
s
j
〛
)
,
where, qi Q, sj S, sj-l<qi<sj, and wherein for target application files qi and sample application files si, the resemblance engine computes a distance as
r
(
q
,
s
)
=
∑
i
=
1
N
•
k
i
q
i
-
s
i
,
wherein
∑
i
=
1
N
•
k
i
=
1
,
and wherein ki is a weight value for each attribute N. | A method for recognizing software applications installed on hardware devices includes scanning a hardware device to discover a target software application installed on the hardware device, where the target application includes one or more files; retrieving one or more sample applications for comparison to the target application; determining a resemblance between the target application and each of the one or more sample applications; and identifying the target application based on the resemblance determination.1. A method for recognizing software applications installed on hardware devices, comprising:
scanning a hardware device to discover a target software application installed on the hardware device, wherein the target application comprises one or more files; retrieving one or more sample applications for comparison to the target application; determining a resemblance between the target application and each of the one or more sample applications; and identifying the target application based on the resemblance determination. 2. The method of claim 1, wherein the target application and each of the one or more sample applications comprise one or more files, and wherein the resemblance determination is based on a distance between corresponding files of the target application and each of the one or more sample applications. 3. The method of claim 2, wherein each of the files comprises one or more attributes, further comprising:
applying a weight to each of the one or more attributes; summing the weights; and selecting a sample application with the highest summed weights for identifying the target application. 4. The method of claim 2, wherein for target application files qi and sample application files si, the distance is measured as
r
(
q
,
s
)
=
∑
i
=
1
N
•
k
i
q
i
-
s
i
,
wherein
∑
i
=
1
N
•
k
i
=
1
,
and wherein ki is a weight value for each attribute N. 5. The method of claim 4, wherein to calculate the resemblance R(Q,S) between reference file set S={si|1≦l≦n, si≦si+1} and target file set Q={qi|1≦l≦m, qi≦qi+1}, the resemblance computation is
R
(
Q
,
S
)
=
∑
i
=
1
i
=
M
〚
r
(
q
i
,
s
j
〛
)
,
where, qi Q, sj S, sj-l<qi<sj. 6. The method of claim 5, further comprising storing the output values, R(Q,S) of the K nearest sample file sets to the target file set Q in vector R={R1, R2, . . . RK}. 7. The method of claim 6, further comprising applying a threshold to the K nearest sample file sets. 8. The method of claim 7, wherein no sample file set exceeds the threshold, further comprising using an alternate criteria for identifying the target software application. 9. The method of claim 1, further comprising:
determining a type of application for the target software application; and selecting only those sample software applications that correspond to the determined type of application. 10. The method of claim 1, wherein the files include a .exe file, and wherein the .exe file is assigned a highest weight. 11. The method of claim 1, where a sum of the weights equals 1.0 12. A computer-readable medium including programming code for execution by a processor, the programming, when executed by the processor, implementing a method, comprising:
scanning a hardware device to discover a target software application installed on the hardware device, wherein the target application comprises one or more files; retrieving one or more sample applications for comparison to the target application; determining a resemblance between the target application and each of the one or more sample applications; and identifying the target application based on the resemblance determination. 13. The computer-readable medium of claim 12, wherein the target application and each of the one or more sample applications comprise one or more files, and wherein the resemblance determination is based on a distance between corresponding files of the target application and each of the one or more sample applications. 14. The computer-readable medium of claim 13, wherein each of the files comprises one or more attributes, further comprising:
applying a weight to each of the one or more attributes; summing the weights; and selecting a sample application with the highest summed weights for identifying the target application. 15. The computer-readable medium of claim 13, wherein for target application files qi and sample application files si, the distance is measured as
r
(
q
,
s
)
=
∑
i
=
1
N
•
k
i
q
i
-
s
i
,
wherein
∑
i
=
1
N
•
k
i
=
1
,
and wherein ki is a weight value for each attribute N. 16. The computer-readable medium of claim 15, wherein to calculate the resemblance R(Q,S) between reference file set S={si|1≦l≦n, si≦si+1} and target file set Q={qi|1≦l≦m, qi≦qi+1}, the resemblance computation is R(Q,
S
)
=
∑
i
=
1
i
=
M
〚
r
(
q
i
,
s
j
〛
)
,
where, qi Q, sj S, sj-l<qi<sj. 17. The computer-readable medium of claim 16, further comprising storing the output values, R(Q,S) of the K nearest sample file sets to the target file set Q in vector R={R1, R2, . . . RK}. 18. The computer-readable medium of claim 17, further comprising applying a threshold to the K nearest sample file sets. 19. A system for recognizing a target software application, comprising:
a scanning engine that scans a hardware device to discover a target software application installed on the hardware device, wherein the target application comprises one or more files a file retrieval engine that retrieves one or more sample applications for comparison to the target application; a resemblance engine that determines a resemblance between the target application and each of the one or more sample applications; and a comparison engine that identifies the target application based on the resemblance determination. 20. The system of claim 19, wherein the resemblance engine applies a weight to each of the one or more attributes, sums the weights, and selects a sample application with the highest summed weights for identifying the target application further comprising, and wherein the resemblance engine calculates the resemblance R(Q,S) between reference the set S={si|1≦l≦n, si≦si+1} and target the set Q={(qi|1≦l≦m, qi≦qi+1}, as is
R
(
Q
,
S
)
=
∑
i
=
1
i
=
M
〚
r
(
q
i
,
s
j
〛
)
,
where, qi Q, sj S, sj-l<qi<sj, and wherein for target application files qi and sample application files si, the resemblance engine computes a distance as
r
(
q
,
s
)
=
∑
i
=
1
N
•
k
i
q
i
-
s
i
,
wherein
∑
i
=
1
N
•
k
i
=
1
,
and wherein ki is a weight value for each attribute N. | 2,100 |
4,913 | 14,606,588 | 2,186 | Methods, systems, and apparatuses are described for isolated word training and detection. Isolated word training devices and systems are provided in which a user may provide a wake-up phrase from 1 to 3 times to train the device or system. A concatenated phoneme model of the user-provided wake-up phrase may be generated based on the provided wake-up phrase and a pre-trained phoneme model database. A word model of the wake-up phrase may be subsequently generated from the concatenated phoneme model and the provided wake-up phrase. Once trained, the user-provided wake-up phrase may be used to unlock the device or system and/or to wake up the device or system from a standby mode of operation. The word model of the user-provided wake-up phrase may be further adapted based on additional provisioning of the wake-up phrase. | 1. An isolated word training system that comprises:
an input component configured to receive at least one audio input representation; a recognition component configured to generate a phoneme concatenation model of the at least one audio input representation based on a phoneme transcription; an adaptation component configured to generate a first word model of the at least one audio input based on the phoneme concatenation model. 2. The isolated word training system of claim 1, wherein the adaptation component is further configured to generate a second word model based on the first word model and at least one additional audio input representation. 3. The isolated word training system of claim 1, that further comprises:
a phoneme model database that includes the one or more stored phoneme models, each of the one or more stored phoneme models being a pre-trained Hidden Markov Model. 4. The isolated word training system of claim 1, wherein the recognition component is configured to generate the phoneme concatenation model by:
decoding feature vectors of the at least one audio input using the one or more stored phoneme models to generate the phoneme transcription that comprises one or more phoneme identifiers; selecting a subset of phoneme identifiers from the phoneme transcription; and selecting corresponding phoneme models from a phoneme model database for each phoneme identifier in the subset as the phoneme concatenation model. 5. The isolated word training system of claim 4, that further comprises:
a feature extraction component configured to:
derive speech features of speech of the at least one audio input; and
generate the feature vectors based on the speech features. 6. The isolated word training system of claim 5, that further comprises:
a voice activity detection component configured to:
detect an onset of the speech;
determine a termination of the speech; and
provide the speech to the feature extraction component. 7. The isolated word training system of claim 1, wherein the adaptation component is configured to generate the first word model by at least one of:
removing one or more phonemes from the phoneme concatenation model; combining one or more phonemes of the phoneme concatenation model; adapting one or more state transition probabilities of the phoneme concatenation model; adapting an observation symbol probability distribution of the phoneme concatenation model; or adapting the phoneme concatenation model as a whole. 8. An electronic device that comprises:
a first processing component configured to:
receive a user-specified wake-up phrase,
generate a phoneme concatenation model of the user-specified wake-up phrase, and
generate a word model of the user-specified wake-up phrase based on the phoneme concatenation model; and
a second processing component configured to:
detect audio activity of the user, and
determine if the user-specified wake-up phrase is present within the audio activity based on the word model. 9. The electronic device of claim 8, wherein the first processing component is further configured to operate in a training mode of the electronic device, and
wherein the second processing component is further configured to:
operate in a stand-by mode of the electronic device, and
provide, in the stand-by mode, an indication to the electronic device to operate in a normal operating mode subsequent to a determination that the user-specified wake-up phrase is present in the audio activity. 10. The electronic device of claim 9, that further comprises:
a memory component configured to:
buffer the audio activity and the user-specified wake-up phrase of the user; and
provide the audio activity or the user-specified wake-up phrase to at least one of a voice activity detector or an automatic speech recognition component. 11. The electronic device of claim 9, wherein the first processing component, in the training mode, is further configured to:
decode feature vectors of the at least one audio input using the one or more stored phoneme models to generate a phoneme transcription that comprises one or more phoneme identifiers; select a subset of phoneme identifiers from the phoneme transcription; and select corresponding phoneme models from a phoneme model database for each phoneme identifier in the subset as the phoneme concatenation model. 12. The electronic device of claim 11, wherein the first processing component, in the training mode, is further configured to:
derive speech features of the user-specified wake-up phrase; and generate the feature vectors based on the speech features. 13. The electronic device of claim 9, wherein the second processing component, in the stand-by mode, is further configured to:
derive speech features of the audio activity; generate feature vectors based on the speech features; and determine if the user-specified wake-up phrase is present by comparing the feature vectors to the word model. 14. The electronic device of claim 8, wherein the first processing component is further configured to:
generate the first word model by at least one of:
removing one or more phonemes from the phoneme concatenation model;
combining one or more phonemes of the phoneme concatenation model;
adapting one or more state transition probabilities of the phoneme concatenation model;
adapting an observation symbol probability distribution of the phoneme concatenation model; or
adapting the phoneme concatenation model as a whole. 15. The electronic device of claim 8, wherein the first processing component is further configured to update the word model based on the user-specified wake-up phrase in a subsequent audio input. 16. The electronic device of claim 8, that further comprises:
a phoneme model database that includes one or more stored phoneme models, each of the one or more stored phoneme models being a pre-trained Hidden Markov Model. 17. A computer-readable storage medium having program instructions recorded thereon that, when executed by an electronic device, perform a method for utilizing a user-specified wake-up phrase in the electronic device, the method comprising:
training the electronic device using the user-specified wake-up phrase, received from a user, to generate, at the electronic device, a user-dependent word model of the user-specified wake-up phrase; and transitioning the electronic device from a stand-by mode to a normal operating mode subsequent to a detection, that is based on the word model, of the user-specified wake-up phrase. 18. The computer-readable storage medium of claim 17, wherein training the electronic device using the user-specified wake-up phrase includes receiving the user-specified wake-up phrase from the user no more than three times. 19. The computer-readable storage medium of claim 18, wherein the electronic device generates the word model based on a phoneme concatenation model of the user-specified wake-up phrase. 20. The computer-readable storage medium of claim 19, wherein the training further comprises:
generating a phoneme transcription of the user-specified wake-up phrase that includes one or more phoneme identifiers; and generating the phoneme concatenation model of the user-specified wake-up phrase based on stored phoneme models that correspond to the one or more phoneme identifiers. | Methods, systems, and apparatuses are described for isolated word training and detection. Isolated word training devices and systems are provided in which a user may provide a wake-up phrase from 1 to 3 times to train the device or system. A concatenated phoneme model of the user-provided wake-up phrase may be generated based on the provided wake-up phrase and a pre-trained phoneme model database. A word model of the wake-up phrase may be subsequently generated from the concatenated phoneme model and the provided wake-up phrase. Once trained, the user-provided wake-up phrase may be used to unlock the device or system and/or to wake up the device or system from a standby mode of operation. The word model of the user-provided wake-up phrase may be further adapted based on additional provisioning of the wake-up phrase.1. An isolated word training system that comprises:
an input component configured to receive at least one audio input representation; a recognition component configured to generate a phoneme concatenation model of the at least one audio input representation based on a phoneme transcription; an adaptation component configured to generate a first word model of the at least one audio input based on the phoneme concatenation model. 2. The isolated word training system of claim 1, wherein the adaptation component is further configured to generate a second word model based on the first word model and at least one additional audio input representation. 3. The isolated word training system of claim 1, that further comprises:
a phoneme model database that includes the one or more stored phoneme models, each of the one or more stored phoneme models being a pre-trained Hidden Markov Model. 4. The isolated word training system of claim 1, wherein the recognition component is configured to generate the phoneme concatenation model by:
decoding feature vectors of the at least one audio input using the one or more stored phoneme models to generate the phoneme transcription that comprises one or more phoneme identifiers; selecting a subset of phoneme identifiers from the phoneme transcription; and selecting corresponding phoneme models from a phoneme model database for each phoneme identifier in the subset as the phoneme concatenation model. 5. The isolated word training system of claim 4, that further comprises:
a feature extraction component configured to:
derive speech features of speech of the at least one audio input; and
generate the feature vectors based on the speech features. 6. The isolated word training system of claim 5, that further comprises:
a voice activity detection component configured to:
detect an onset of the speech;
determine a termination of the speech; and
provide the speech to the feature extraction component. 7. The isolated word training system of claim 1, wherein the adaptation component is configured to generate the first word model by at least one of:
removing one or more phonemes from the phoneme concatenation model; combining one or more phonemes of the phoneme concatenation model; adapting one or more state transition probabilities of the phoneme concatenation model; adapting an observation symbol probability distribution of the phoneme concatenation model; or adapting the phoneme concatenation model as a whole. 8. An electronic device that comprises:
a first processing component configured to:
receive a user-specified wake-up phrase,
generate a phoneme concatenation model of the user-specified wake-up phrase, and
generate a word model of the user-specified wake-up phrase based on the phoneme concatenation model; and
a second processing component configured to:
detect audio activity of the user, and
determine if the user-specified wake-up phrase is present within the audio activity based on the word model. 9. The electronic device of claim 8, wherein the first processing component is further configured to operate in a training mode of the electronic device, and
wherein the second processing component is further configured to:
operate in a stand-by mode of the electronic device, and
provide, in the stand-by mode, an indication to the electronic device to operate in a normal operating mode subsequent to a determination that the user-specified wake-up phrase is present in the audio activity. 10. The electronic device of claim 9, that further comprises:
a memory component configured to:
buffer the audio activity and the user-specified wake-up phrase of the user; and
provide the audio activity or the user-specified wake-up phrase to at least one of a voice activity detector or an automatic speech recognition component. 11. The electronic device of claim 9, wherein the first processing component, in the training mode, is further configured to:
decode feature vectors of the at least one audio input using the one or more stored phoneme models to generate a phoneme transcription that comprises one or more phoneme identifiers; select a subset of phoneme identifiers from the phoneme transcription; and select corresponding phoneme models from a phoneme model database for each phoneme identifier in the subset as the phoneme concatenation model. 12. The electronic device of claim 11, wherein the first processing component, in the training mode, is further configured to:
derive speech features of the user-specified wake-up phrase; and generate the feature vectors based on the speech features. 13. The electronic device of claim 9, wherein the second processing component, in the stand-by mode, is further configured to:
derive speech features of the audio activity; generate feature vectors based on the speech features; and determine if the user-specified wake-up phrase is present by comparing the feature vectors to the word model. 14. The electronic device of claim 8, wherein the first processing component is further configured to:
generate the first word model by at least one of:
removing one or more phonemes from the phoneme concatenation model;
combining one or more phonemes of the phoneme concatenation model;
adapting one or more state transition probabilities of the phoneme concatenation model;
adapting an observation symbol probability distribution of the phoneme concatenation model; or
adapting the phoneme concatenation model as a whole. 15. The electronic device of claim 8, wherein the first processing component is further configured to update the word model based on the user-specified wake-up phrase in a subsequent audio input. 16. The electronic device of claim 8, that further comprises:
a phoneme model database that includes one or more stored phoneme models, each of the one or more stored phoneme models being a pre-trained Hidden Markov Model. 17. A computer-readable storage medium having program instructions recorded thereon that, when executed by an electronic device, perform a method for utilizing a user-specified wake-up phrase in the electronic device, the method comprising:
training the electronic device using the user-specified wake-up phrase, received from a user, to generate, at the electronic device, a user-dependent word model of the user-specified wake-up phrase; and transitioning the electronic device from a stand-by mode to a normal operating mode subsequent to a detection, that is based on the word model, of the user-specified wake-up phrase. 18. The computer-readable storage medium of claim 17, wherein training the electronic device using the user-specified wake-up phrase includes receiving the user-specified wake-up phrase from the user no more than three times. 19. The computer-readable storage medium of claim 18, wherein the electronic device generates the word model based on a phoneme concatenation model of the user-specified wake-up phrase. 20. The computer-readable storage medium of claim 19, wherein the training further comprises:
generating a phoneme transcription of the user-specified wake-up phrase that includes one or more phoneme identifiers; and generating the phoneme concatenation model of the user-specified wake-up phrase based on stored phoneme models that correspond to the one or more phoneme identifiers. | 2,100 |
4,914 | 14,330,947 | 2,199 | Systems, methods, and software described herein facilitate accelerated input and output operations with respect to virtualized environments. In an implementation, a computing system passes a process identifier to a kernel driver for a host environment, wherein the process identifier identifies a guest process spawned in a virtual machine and wherein the kernel driver uses the process identifier to determine an allocation of host memory corresponding to guest memory for the guest process and returns the allocation of host memory. Additionally, the computing system performs a mapping of the allocation of host memory to an allocation of guest memory for the guest element. | 1. An apparatus comprising:
one or more computer readable storage media; program instructions stored on the one or more computer readable media that, when executed by a processing system to facilitate accelerated input and output with respect to a virtual environment, direct the processing system to at least: pass a process identifier to a kernel driver for a host environment, wherein the process identifier identifies a guest process spawned in a virtual machine and wherein the kernel driver uses the process identifier to determine an allocation of host memory corresponding to guest memory for the guest process and returns the allocation of host memory; perform a mapping of the allocation of host memory to an allocation of guest memory for the guest element. 2. The apparatus of claim 1, wherein the process identifier is passed to the kernel driver using an input/output control call. 3. The apparatus of claim 2, wherein the allocation of host memory returned by the kernel driver comprises an offset within the host memory and wherein the kernel driver saves memory allocation information to a data structure. 4. The apparatus of claim 3, wherein to perform the mapping, the program instructions direct the processing system to:
invoke a map system call to the kernel driver, wherein the map system call passes the offset to an map portion of the kernel driver and wherein the kernel driver uses the offset to find the memory allocation information stored in the data structure, locks down the allocation of host memory, and creates a mapping for the allocation of the host memory to the allocation of the guest memory. 5. The apparatus of claim 1, wherein the guest element comprises a QEMU process. 6. The apparatus of claim 1 further comprising the processing system executing the program instructions. 7. The apparatus of claim 1, wherein the program instructions further direct the processing system to:
upon being notified of a guest read process initiated by the guest element to read data into a location in the allocation of the guest memory, identify a location in the host memory associated with the location in the guest memory based on the mapping; and initiate a host read process to read the data into the location in the host memory that corresponds to the location in the guest memory. 8. The apparatus of claim 7, wherein the program instructions further direct the processing system to:
upon completion of the host read process, notify the guest element that the guest process has completed. 9. The apparatus of claim 7, wherein the host read process reads the data from a storage service and writes the data to the location in the host memory. 10. A method for facilitating accelerated input and output with respect to a virtual environment comprising:
passing a process identifier to a kernel driver for a host environment, wherein the process identifier identifies a guest process spawned in a virtual machine and wherein the kernel driver uses the process identifier to determine an allocation of host memory corresponding to guest memory for the guest process and returns the allocation of host memory; performing a mapping of the allocation of host memory to an allocation of guest memory for the guest element. 11. The method of claim 10, wherein the process identifier is passed to the kernel driver using an input/output control call. 12. The method of claim 11, wherein the allocation of host memory returned by the kernel driver comprises an offset within the host memory and wherein the kernel driver saves memory allocation information to a data structure. 13. The method of claim 12, wherein performing the mapping comprises:
invoking a map system call to the kernel driver, wherein the map system call passes the offset to an map portion of the kernel driver and wherein the kernel driver uses the offset to find the memory allocation information stored in the data structure, locks down the allocation of host memory, and creates a mapping for the allocation of the host memory to the allocation of the guest memory. 14. The method of claim 10, wherein the guest element comprises a QEMU process. 15. The method of claim 10, further comprising:
upon being notified of a guest read process initiated by the guest element to read data into a location in the allocation of the guest memory, identifying a location in the host memory associated with the location in the guest memory based on the map; and initiating a host read process to read the data into the location in the host memory that corresponds to the location in the guest memory. 16. The method of claim 15, wherein the program instructions further direct the processing system to:
upon completion of the host read process, notify the guest element that the guest process has completed. 17. The method of claim 15, wherein the host read process reads the data from a storage service and writes the data to the location in the host memory. | Systems, methods, and software described herein facilitate accelerated input and output operations with respect to virtualized environments. In an implementation, a computing system passes a process identifier to a kernel driver for a host environment, wherein the process identifier identifies a guest process spawned in a virtual machine and wherein the kernel driver uses the process identifier to determine an allocation of host memory corresponding to guest memory for the guest process and returns the allocation of host memory. Additionally, the computing system performs a mapping of the allocation of host memory to an allocation of guest memory for the guest element.1. An apparatus comprising:
one or more computer readable storage media; program instructions stored on the one or more computer readable media that, when executed by a processing system to facilitate accelerated input and output with respect to a virtual environment, direct the processing system to at least: pass a process identifier to a kernel driver for a host environment, wherein the process identifier identifies a guest process spawned in a virtual machine and wherein the kernel driver uses the process identifier to determine an allocation of host memory corresponding to guest memory for the guest process and returns the allocation of host memory; perform a mapping of the allocation of host memory to an allocation of guest memory for the guest element. 2. The apparatus of claim 1, wherein the process identifier is passed to the kernel driver using an input/output control call. 3. The apparatus of claim 2, wherein the allocation of host memory returned by the kernel driver comprises an offset within the host memory and wherein the kernel driver saves memory allocation information to a data structure. 4. The apparatus of claim 3, wherein to perform the mapping, the program instructions direct the processing system to:
invoke a map system call to the kernel driver, wherein the map system call passes the offset to an map portion of the kernel driver and wherein the kernel driver uses the offset to find the memory allocation information stored in the data structure, locks down the allocation of host memory, and creates a mapping for the allocation of the host memory to the allocation of the guest memory. 5. The apparatus of claim 1, wherein the guest element comprises a QEMU process. 6. The apparatus of claim 1 further comprising the processing system executing the program instructions. 7. The apparatus of claim 1, wherein the program instructions further direct the processing system to:
upon being notified of a guest read process initiated by the guest element to read data into a location in the allocation of the guest memory, identify a location in the host memory associated with the location in the guest memory based on the mapping; and initiate a host read process to read the data into the location in the host memory that corresponds to the location in the guest memory. 8. The apparatus of claim 7, wherein the program instructions further direct the processing system to:
upon completion of the host read process, notify the guest element that the guest process has completed. 9. The apparatus of claim 7, wherein the host read process reads the data from a storage service and writes the data to the location in the host memory. 10. A method for facilitating accelerated input and output with respect to a virtual environment comprising:
passing a process identifier to a kernel driver for a host environment, wherein the process identifier identifies a guest process spawned in a virtual machine and wherein the kernel driver uses the process identifier to determine an allocation of host memory corresponding to guest memory for the guest process and returns the allocation of host memory; performing a mapping of the allocation of host memory to an allocation of guest memory for the guest element. 11. The method of claim 10, wherein the process identifier is passed to the kernel driver using an input/output control call. 12. The method of claim 11, wherein the allocation of host memory returned by the kernel driver comprises an offset within the host memory and wherein the kernel driver saves memory allocation information to a data structure. 13. The method of claim 12, wherein performing the mapping comprises:
invoking a map system call to the kernel driver, wherein the map system call passes the offset to an map portion of the kernel driver and wherein the kernel driver uses the offset to find the memory allocation information stored in the data structure, locks down the allocation of host memory, and creates a mapping for the allocation of the host memory to the allocation of the guest memory. 14. The method of claim 10, wherein the guest element comprises a QEMU process. 15. The method of claim 10, further comprising:
upon being notified of a guest read process initiated by the guest element to read data into a location in the allocation of the guest memory, identifying a location in the host memory associated with the location in the guest memory based on the map; and initiating a host read process to read the data into the location in the host memory that corresponds to the location in the guest memory. 16. The method of claim 15, wherein the program instructions further direct the processing system to:
upon completion of the host read process, notify the guest element that the guest process has completed. 17. The method of claim 15, wherein the host read process reads the data from a storage service and writes the data to the location in the host memory. | 2,100 |
4,915 | 15,094,219 | 2,199 | The current document discloses methods and systems for extending an internal network within a first cloud-computing facility to a second cloud-computing facility and deploying a virtual machine or virtual application previously running on a first cloud-computing facility within the context of the extended internal network in the second cloud-computing facility. The currently disclosed methods and systems which provide internal-network extension and redeployment of virtual machines and virtual applications, referred to as “stretch deploy,” allow a virtual machine or virtual application formerly executing on a first cloud-computing facility to resume execution on a second cloud-computing facility, using the computational and storage facilities of the second cloud-computing facility but depending on network support from the first cloud-computing facility, without changing IP and local network addresses and the network connectivity, based on those addresses, between the virtual machines and virtual applications and other local and remote computational entities with which the virtual machines and virtual applications communicate. | 1. A cloud-connector subsystem that provides a stretch-deploy operation for moving one or more virtual execution environments between cloud-computing facilities, the cloud-connector subsystem comprising:
cloud-connector nodes associated with each of a source and a target cloud-computing facility; and a cloud-connector server that includes one or more processors, one or more memories, one or more data-storage devices, and computer instructions that, when executed on the one or more processors, control the cloud-connector server to provide, in cooperation with the cloud-connector nodes, a stretch-deploy operation that
extends a first local virtual network within the source cloud-computing facility to the target cloud-computing facility, forming an extended local virtual network; and
moves one or more virtual execution environments from executing on the source cloud-computing facility and communicating with other computational entities through the extended local virtual network using one or more network addresses to executing on the target cloud-computing facility and communicating with other computational entities through the extended local virtual network using the same one or more network addresses. 2. The cloud-connector subsystem of claim 1 wherein the one or more one or more virtual execution environments comprises one of:
a single virtual machine;
two or more virtual machines;
a single virtual application including a single virtual machine; and
a single virtual application including two or more virtual machines. 3. The cloud-connector subsystem of claim 1 wherein the first local virtual network is connected through a first edge appliance to a first organization virtual network within the source cloud computing facility; wherein a second local virtual network is connected through a second edge appliance to a second organization virtual network within the target cloud computing facility; and wherein the stretch-deploy operation extends the first local virtual network within the source cloud-computing facility to the target cloud-computing facility by interconnecting the first edge appliance and the second edge appliance with a secure tunnel, joining the first and second local networks together to form the extended local virtual network. 4. The cloud-connector subsystem of claim 3 wherein the secure tunnel is an SSL VPN tunnel. 5. The cloud-connector subsystem of claim 1 wherein the stretch-deploy operation moves one or more virtual execution environments from the source cloud-computing facility to the target cloud-computing facility by:
verifying the source cloud-computing facility and one or more virtual execution environments to be moved;
verifying the target cloud-computing facility; and
executing an infrastructure phase, copy phase, and deployment phase. 6. The cloud-connector subsystem of claim 1 wherein the cloud-connector subsystem verifies a cloud-computing facility by:
determining that those components of the cloud-computing facility used in the stretch-deploy operation are present, configured, and licensed; and
determining that the cloud-computing facility has sufficient storage capacity for instantiating a temporary virtual application. 7. The cloud-connector subsystem of claim 6 wherein the cloud-connector subsystem executes the infrastructure phase by:
creating a routed virtual application with a second local virtual network in the target cloud-computing facility;
launching execution of the routed virtual application within the target cloud-computing facility; and
creating, from a first edge appliance through which the one or more virtual machines are connected to a first virtual organization network that is, in turn, connected to an external network, a secure communications tunnel to a second edge appliance through which the second local virtual network in the routed virtual application is connected to a second virtual organization network, in turn connected to the external network. 8. The cloud-connector subsystem of claim 7 wherein the cloud-connector subsystem executes the copy phase by:
creating a first temporary virtual application in the source cloud-computing facility;
moving the one or more virtual execution environments to the first temporary virtual application;
generating a virtual application template corresponding to the temporary virtual application; and
copying the virtual application template to the target cloud-computing facility. 9. The cloud-connector subsystem of claim 8 wherein the cloud-connector subsystem executes deployment phase by:
creating a second temporary virtual application in the target cloud-computing facility from the virtual application template copied to the target cloud-computing facility; and
moving the one or more virtual machines from the second temporary virtual application to the routed virtual application in the target cloud-computing facility. 10. A method that relocates one or more virtual execution environments connected to a virtual network within a source cloud-computing facility to a target cloud-computing facility, the method comprising:
extending the virtual network to the target cloud-computing facility; and moving the one or more virtual execution environments from the source cloud-computing facility to the target cloud-computing facility, where the one or more virtual execution environments are connected to the extended virtual network and use the same local and global network addresses used in the source cloud-computing facility. 11. The method of claim 10 wherein the one or more one or more virtual execution environments comprises one of:
a single virtual machine;
two or more virtual machines;
a single virtual application including a single virtual machine; and
a single virtual application including two or more virtual machines. 12. The method of claim 10 wherein the first local virtual network is connected through a first edge appliance to a first organization virtual network within the source cloud computing facility; wherein a second local virtual network is connected through a second edge appliance to a second organization virtual network within the target cloud computing facility; and wherein extending the virtual network to the target cloud-computing facility further comprises interconnecting the first edge appliance and the second edge appliance with a secure tunnel, joining the first and second local networks together to form the extended local virtual network. 13. The method of claim 12 wherein the secure tunnel is one of:
an SSL VPN tunnel; and
an IPsec tunnel. 14. The method of claim 10 wherein moving the one or more virtual execution environments from the source cloud-computing facility to the target cloud-computing facility further comprises:
verifying the source cloud-computing facility and one or more virtual execution environments to be moved;
verifying the target cloud-computing facility; and
executing an infrastructure phase, copy phase, and deployment phase. 15. The method of claim 14 wherein verifying a cloud-computing facility further comprises:
determining that those components of the cloud-computing facility used in the stretch-deploy operation are present, configured, and licensed; and
determining that the cloud-computing facility has sufficient storage capacity for instantiating a temporary virtual application. 16. The method of claim 14 wherein executing the infrastructure phase further comprises:
creating a routed virtual application with a second local virtual network in the target cloud-computing facility;
launching execution of the routed virtual application within the target cloud-computing facility; and
creating, from a first edge appliance through which the one or more virtual machines are connected to a first virtual organization network that is, in turn, connected to an external network, a secure communications tunnel to a second edge appliance through which the second local virtual network in the routed virtual application is connected to a second virtual organization network, in turn connected to the external network. 17. The method of claim 14 wherein executing the copy phase further comprises:
creating a first temporary virtual application in the source cloud-computing facility;
moving the one or more virtual execution environments to the first temporary virtual application;
generating a virtual application template corresponding to the temporary virtual application; and
copying the virtual application template to the target cloud-computing facility. 18. The method of claim 17 wherein executing the deployment phase further comprises:
creating a second temporary virtual application in the target cloud-computing facility from the virtual application template copied to the target cloud-computing facility; and
moving the one or more virtual execution environments from the second temporary virtual application to the routed virtual application in the target cloud-computing facility. 19. Computer instructions stored within a physical data-storage device that, when executed on one or more processors within a cloud-connector subsystem, control the cloud-connector subsystem to relocate one or more virtual execution environments connected to a virtual network within a source cloud-computing facility to a target cloud-computing facility by:
extending the virtual network to the target cloud-computing facility; and moving the one or more virtual execution environments from the source cloud-computing facility to the target cloud-computing facility, where the one or more virtual execution environments are connected to the extended virtual network and use the same local and global network addresses used in the source cloud-computing facility. 20. The computer instructions of claim 19 wherein the first local virtual network is connected through a first edge appliance to a first organization virtual network within the source cloud computing facility; wherein a second local virtual network is connected through a second edge appliance to a second organization virtual network within the target cloud computing facility; and wherein extending the virtual network to the target cloud-computing facility further comprises interconnecting the first edge appliance and the second edge appliance with a secure tunnel, joining the first and second local networks together to form the extended local virtual network. | The current document discloses methods and systems for extending an internal network within a first cloud-computing facility to a second cloud-computing facility and deploying a virtual machine or virtual application previously running on a first cloud-computing facility within the context of the extended internal network in the second cloud-computing facility. The currently disclosed methods and systems which provide internal-network extension and redeployment of virtual machines and virtual applications, referred to as “stretch deploy,” allow a virtual machine or virtual application formerly executing on a first cloud-computing facility to resume execution on a second cloud-computing facility, using the computational and storage facilities of the second cloud-computing facility but depending on network support from the first cloud-computing facility, without changing IP and local network addresses and the network connectivity, based on those addresses, between the virtual machines and virtual applications and other local and remote computational entities with which the virtual machines and virtual applications communicate.1. A cloud-connector subsystem that provides a stretch-deploy operation for moving one or more virtual execution environments between cloud-computing facilities, the cloud-connector subsystem comprising:
cloud-connector nodes associated with each of a source and a target cloud-computing facility; and a cloud-connector server that includes one or more processors, one or more memories, one or more data-storage devices, and computer instructions that, when executed on the one or more processors, control the cloud-connector server to provide, in cooperation with the cloud-connector nodes, a stretch-deploy operation that
extends a first local virtual network within the source cloud-computing facility to the target cloud-computing facility, forming an extended local virtual network; and
moves one or more virtual execution environments from executing on the source cloud-computing facility and communicating with other computational entities through the extended local virtual network using one or more network addresses to executing on the target cloud-computing facility and communicating with other computational entities through the extended local virtual network using the same one or more network addresses. 2. The cloud-connector subsystem of claim 1 wherein the one or more one or more virtual execution environments comprises one of:
a single virtual machine;
two or more virtual machines;
a single virtual application including a single virtual machine; and
a single virtual application including two or more virtual machines. 3. The cloud-connector subsystem of claim 1 wherein the first local virtual network is connected through a first edge appliance to a first organization virtual network within the source cloud computing facility; wherein a second local virtual network is connected through a second edge appliance to a second organization virtual network within the target cloud computing facility; and wherein the stretch-deploy operation extends the first local virtual network within the source cloud-computing facility to the target cloud-computing facility by interconnecting the first edge appliance and the second edge appliance with a secure tunnel, joining the first and second local networks together to form the extended local virtual network. 4. The cloud-connector subsystem of claim 3 wherein the secure tunnel is an SSL VPN tunnel. 5. The cloud-connector subsystem of claim 1 wherein the stretch-deploy operation moves one or more virtual execution environments from the source cloud-computing facility to the target cloud-computing facility by:
verifying the source cloud-computing facility and one or more virtual execution environments to be moved;
verifying the target cloud-computing facility; and
executing an infrastructure phase, copy phase, and deployment phase. 6. The cloud-connector subsystem of claim 1 wherein the cloud-connector subsystem verifies a cloud-computing facility by:
determining that those components of the cloud-computing facility used in the stretch-deploy operation are present, configured, and licensed; and
determining that the cloud-computing facility has sufficient storage capacity for instantiating a temporary virtual application. 7. The cloud-connector subsystem of claim 6 wherein the cloud-connector subsystem executes the infrastructure phase by:
creating a routed virtual application with a second local virtual network in the target cloud-computing facility;
launching execution of the routed virtual application within the target cloud-computing facility; and
creating, from a first edge appliance through which the one or more virtual machines are connected to a first virtual organization network that is, in turn, connected to an external network, a secure communications tunnel to a second edge appliance through which the second local virtual network in the routed virtual application is connected to a second virtual organization network, in turn connected to the external network. 8. The cloud-connector subsystem of claim 7 wherein the cloud-connector subsystem executes the copy phase by:
creating a first temporary virtual application in the source cloud-computing facility;
moving the one or more virtual execution environments to the first temporary virtual application;
generating a virtual application template corresponding to the temporary virtual application; and
copying the virtual application template to the target cloud-computing facility. 9. The cloud-connector subsystem of claim 8 wherein the cloud-connector subsystem executes deployment phase by:
creating a second temporary virtual application in the target cloud-computing facility from the virtual application template copied to the target cloud-computing facility; and
moving the one or more virtual machines from the second temporary virtual application to the routed virtual application in the target cloud-computing facility. 10. A method that relocates one or more virtual execution environments connected to a virtual network within a source cloud-computing facility to a target cloud-computing facility, the method comprising:
extending the virtual network to the target cloud-computing facility; and moving the one or more virtual execution environments from the source cloud-computing facility to the target cloud-computing facility, where the one or more virtual execution environments are connected to the extended virtual network and use the same local and global network addresses used in the source cloud-computing facility. 11. The method of claim 10 wherein the one or more one or more virtual execution environments comprises one of:
a single virtual machine;
two or more virtual machines;
a single virtual application including a single virtual machine; and
a single virtual application including two or more virtual machines. 12. The method of claim 10 wherein the first local virtual network is connected through a first edge appliance to a first organization virtual network within the source cloud computing facility; wherein a second local virtual network is connected through a second edge appliance to a second organization virtual network within the target cloud computing facility; and wherein extending the virtual network to the target cloud-computing facility further comprises interconnecting the first edge appliance and the second edge appliance with a secure tunnel, joining the first and second local networks together to form the extended local virtual network. 13. The method of claim 12 wherein the secure tunnel is one of:
an SSL VPN tunnel; and
an IPsec tunnel. 14. The method of claim 10 wherein moving the one or more virtual execution environments from the source cloud-computing facility to the target cloud-computing facility further comprises:
verifying the source cloud-computing facility and one or more virtual execution environments to be moved;
verifying the target cloud-computing facility; and
executing an infrastructure phase, copy phase, and deployment phase. 15. The method of claim 14 wherein verifying a cloud-computing facility further comprises:
determining that those components of the cloud-computing facility used in the stretch-deploy operation are present, configured, and licensed; and
determining that the cloud-computing facility has sufficient storage capacity for instantiating a temporary virtual application. 16. The method of claim 14 wherein executing the infrastructure phase further comprises:
creating a routed virtual application with a second local virtual network in the target cloud-computing facility;
launching execution of the routed virtual application within the target cloud-computing facility; and
creating, from a first edge appliance through which the one or more virtual machines are connected to a first virtual organization network that is, in turn, connected to an external network, a secure communications tunnel to a second edge appliance through which the second local virtual network in the routed virtual application is connected to a second virtual organization network, in turn connected to the external network. 17. The method of claim 14 wherein executing the copy phase further comprises:
creating a first temporary virtual application in the source cloud-computing facility;
moving the one or more virtual execution environments to the first temporary virtual application;
generating a virtual application template corresponding to the temporary virtual application; and
copying the virtual application template to the target cloud-computing facility. 18. The method of claim 17 wherein executing the deployment phase further comprises:
creating a second temporary virtual application in the target cloud-computing facility from the virtual application template copied to the target cloud-computing facility; and
moving the one or more virtual execution environments from the second temporary virtual application to the routed virtual application in the target cloud-computing facility. 19. Computer instructions stored within a physical data-storage device that, when executed on one or more processors within a cloud-connector subsystem, control the cloud-connector subsystem to relocate one or more virtual execution environments connected to a virtual network within a source cloud-computing facility to a target cloud-computing facility by:
extending the virtual network to the target cloud-computing facility; and moving the one or more virtual execution environments from the source cloud-computing facility to the target cloud-computing facility, where the one or more virtual execution environments are connected to the extended virtual network and use the same local and global network addresses used in the source cloud-computing facility. 20. The computer instructions of claim 19 wherein the first local virtual network is connected through a first edge appliance to a first organization virtual network within the source cloud computing facility; wherein a second local virtual network is connected through a second edge appliance to a second organization virtual network within the target cloud computing facility; and wherein extending the virtual network to the target cloud-computing facility further comprises interconnecting the first edge appliance and the second edge appliance with a secure tunnel, joining the first and second local networks together to form the extended local virtual network. | 2,100 |
4,916 | 14,343,010 | 2,139 | A transactional memory system uses a volatile memory as primary storage for transactions. Data is selectively stored in a non-volatile memory to impart durability to the transactional memory system to allow the transactional memory system to be restored to a consistent state in the event of data loss to the volatile memory. | 1. A method comprising:
a transactional memory system using a volatile memory as primary storage for transactions associated with the transactional memory system; and selectively storing data in a non-volatile memory to impart durability to the transactional memory system to allow the transactional memory system to be restored to a consistent state in the event of data loss to the volatile memory. 2. The method of claim 1, further comprising associating the stored data with ordering identifiers assigned by the transactional memory system to transactions that generated the data. 3. The method of claim 1, wherein the act of selectively storing comprises logging records of transactions processed by the transactional memory system in the non-volatile memory in partitions, each of the partitions being associated with a different transaction generating entity. 4. The method of claim 1, wherein the act of selectively storing comprises storing a checkpoint in the non-volatile memory indicative of a full record of a heap in the volatile memory used by the transactional memory system. 5. The method of claim 1, wherein the act of selectively storing comprises:
copying data stored in the volatile memory into a first non-volatile memory region to generate a checkpoint and logging records that reflect transactions that occurred after the generation of the checkpoint in a second non-volatile memory region. 6. The method of claim 1, wherein the act of selectively storing comprises selectively storing the data in at least one of the following memories: NAND flash memory, phase change memory and memristor memory. 7. The method of claim 1, further comprising, in response to a data loss in the volatile memory, reconstructing transactional memory data. 8. An article comprising at least one machine-readable storage medium storing instructions that upon execution cause a system having at least one processor to:
use a volatile memory as primary storage for transactions associated with a transactional memory system; and selectively store data in a non-volatile memory to impart durability to the transactional memory system to allow the transactional memory system to be restored to a consistent state in the event of data loss to the volatile memory. 9. An apparatus comprising:
a volatile memory to store transactional memory data created by a plurality of threads generating transactions with the volatile memory; a non-volatile memory; and a transactional memory system adapted to:
use the volatile memory as primary storage for the transactions; and
selectively store data in the non-volatile memory to impart durability to the transactional memory system to allow the transactional memory system to be restored to a consistent state in the event of data loss to the volatile memory. 10. The apparatus of claim 9, wherein the transactional memory system is further adapted to associate the stored data with ordering identifiers assigned by the transactional memory system to transactions that generated the data. 11. The apparatus of claim 9, wherein the transactional memory system is further adapted to log records of transactions processed by the transactional memory system in the non-volatile memory in partitions, each of the partitions being associated with a different transaction generating entity. 12. The apparatus of claim 9, wherein the transactional memory system is further adapted to store a checkpoint in the non-volatile memory indicative of a full record of a heap in the volatile memory used by the transactional memory system. 13. The apparatus of claim 9, wherein the non-volatile memory comprises at least one of the following memories: NAND flash memory, phase change memory and memristor memory. 14. The apparatus of claim 9, wherein the transactional memory system is further adapted to reconstruct transactional memory data in response to a data loss in the volatile memory. 15. The apparatus of claim 9, wherein the transactional memory system is further adapted to provide confirmations to the threads indicating that asynchronous transactions have been stored in the non-volatile memory. | A transactional memory system uses a volatile memory as primary storage for transactions. Data is selectively stored in a non-volatile memory to impart durability to the transactional memory system to allow the transactional memory system to be restored to a consistent state in the event of data loss to the volatile memory.1. A method comprising:
a transactional memory system using a volatile memory as primary storage for transactions associated with the transactional memory system; and selectively storing data in a non-volatile memory to impart durability to the transactional memory system to allow the transactional memory system to be restored to a consistent state in the event of data loss to the volatile memory. 2. The method of claim 1, further comprising associating the stored data with ordering identifiers assigned by the transactional memory system to transactions that generated the data. 3. The method of claim 1, wherein the act of selectively storing comprises logging records of transactions processed by the transactional memory system in the non-volatile memory in partitions, each of the partitions being associated with a different transaction generating entity. 4. The method of claim 1, wherein the act of selectively storing comprises storing a checkpoint in the non-volatile memory indicative of a full record of a heap in the volatile memory used by the transactional memory system. 5. The method of claim 1, wherein the act of selectively storing comprises:
copying data stored in the volatile memory into a first non-volatile memory region to generate a checkpoint and logging records that reflect transactions that occurred after the generation of the checkpoint in a second non-volatile memory region. 6. The method of claim 1, wherein the act of selectively storing comprises selectively storing the data in at least one of the following memories: NAND flash memory, phase change memory and memristor memory. 7. The method of claim 1, further comprising, in response to a data loss in the volatile memory, reconstructing transactional memory data. 8. An article comprising at least one machine-readable storage medium storing instructions that upon execution cause a system having at least one processor to:
use a volatile memory as primary storage for transactions associated with a transactional memory system; and selectively store data in a non-volatile memory to impart durability to the transactional memory system to allow the transactional memory system to be restored to a consistent state in the event of data loss to the volatile memory. 9. An apparatus comprising:
a volatile memory to store transactional memory data created by a plurality of threads generating transactions with the volatile memory; a non-volatile memory; and a transactional memory system adapted to:
use the volatile memory as primary storage for the transactions; and
selectively store data in the non-volatile memory to impart durability to the transactional memory system to allow the transactional memory system to be restored to a consistent state in the event of data loss to the volatile memory. 10. The apparatus of claim 9, wherein the transactional memory system is further adapted to associate the stored data with ordering identifiers assigned by the transactional memory system to transactions that generated the data. 11. The apparatus of claim 9, wherein the transactional memory system is further adapted to log records of transactions processed by the transactional memory system in the non-volatile memory in partitions, each of the partitions being associated with a different transaction generating entity. 12. The apparatus of claim 9, wherein the transactional memory system is further adapted to store a checkpoint in the non-volatile memory indicative of a full record of a heap in the volatile memory used by the transactional memory system. 13. The apparatus of claim 9, wherein the non-volatile memory comprises at least one of the following memories: NAND flash memory, phase change memory and memristor memory. 14. The apparatus of claim 9, wherein the transactional memory system is further adapted to reconstruct transactional memory data in response to a data loss in the volatile memory. 15. The apparatus of claim 9, wherein the transactional memory system is further adapted to provide confirmations to the threads indicating that asynchronous transactions have been stored in the non-volatile memory. | 2,100 |
4,917 | 15,198,535 | 2,111 | A method of transmitting data in an optical transport network is provided. The method comprises generating an optical transmission unit frame including an in-band area including a first area to which information data is allocated and a second area to which the information data is not allocated and an out-band area including parity information and transmitting the data through the optical transmission unit frame. | 1. A method for receiving client signal in an optical transport network, comprising:
receiving an optical transmission unit (OTU) frame including an in-band area and an out-band area, wherein the in-band area includes a first area to which the client signal is allocated and a second area to which fixed stuff is allocated; and demapping the client signal from the first area. 2. The method of claim 1, wherein the second area locates in 8-byte area at the end of the in-band area. 3. The method of claim 1, wherein the second area locates between the first area and the out-band area. 4. The method of claim 1, wherein the first area includes payload and overhead of the client signal, wherein the overhead includes client signal failure (CSF) bit and a plurality of bytes for payload type (PT) of the payload. 5. The method of claim 1, wherein the client signal has a bitrate close to 104.134G. 6. The method of claim 1, wherein the out-band area includes information for forward error correction (FEC). 7. The method of claim 6, further comprising:
performing an error correction of the information data by using the information included in the out-band area. 8. The method of claim 1, further comprising:
subtracting justification information from the first area. 9. A method for receiving tributary signal in an optical transport network, comprising:
receiving an optical transmission unit (OTU) frame including an in-band area and an out-band area, wherein the in-band area includes a first area to which the tributary signal is allocated and a second area to which fixed stuff is allocated; and demapping the tributary signal from a plurality of tributary slots included in the first area. 10. The method of claim 9, wherein the second area locates in 8-byte area at the end of the in-band area. 11. The method of claim 9, wherein the second area locates between the first area and the out-band area. 12. The method of claim 9, wherein the first area includes 80 tributary slots. 13. The method of claim 9, wherein the first area includes a plurality of 1.25G tributary slots. 14. The method of claim 9, wherein the out-band area includes information for forward error correction (FEC) of the tributary signal. 15. The method of claim 14, further comprising:
correcting error of the tributary signal by using the information included in the out-band area. 16. An apparatus of receiving data signal in an optical transport network, comprising:
a receiver configured to receive an optical transmission unit (OUT) frame including an in-band area and an out-band area, wherein the in-band area includes a first area to which the data signal is allocated and a second area to which fixed stuff is allocated; and demapper configured to demap the client signal from the first area. 17. The apparatus of claim 16, wherein out-band area includes information for forward error correction (FEC) of the data signal. 18. The apparatus of claim 17, further comprising:
error corrector configured to correct error of the data signal by using the information included in the out-band area. 19. The apparatus of claim 14, wherein the data signal is client signal. 20. The apparatus of claim 14, wherein the data signal is tributary signal. | A method of transmitting data in an optical transport network is provided. The method comprises generating an optical transmission unit frame including an in-band area including a first area to which information data is allocated and a second area to which the information data is not allocated and an out-band area including parity information and transmitting the data through the optical transmission unit frame.1. A method for receiving client signal in an optical transport network, comprising:
receiving an optical transmission unit (OTU) frame including an in-band area and an out-band area, wherein the in-band area includes a first area to which the client signal is allocated and a second area to which fixed stuff is allocated; and demapping the client signal from the first area. 2. The method of claim 1, wherein the second area locates in 8-byte area at the end of the in-band area. 3. The method of claim 1, wherein the second area locates between the first area and the out-band area. 4. The method of claim 1, wherein the first area includes payload and overhead of the client signal, wherein the overhead includes client signal failure (CSF) bit and a plurality of bytes for payload type (PT) of the payload. 5. The method of claim 1, wherein the client signal has a bitrate close to 104.134G. 6. The method of claim 1, wherein the out-band area includes information for forward error correction (FEC). 7. The method of claim 6, further comprising:
performing an error correction of the information data by using the information included in the out-band area. 8. The method of claim 1, further comprising:
subtracting justification information from the first area. 9. A method for receiving tributary signal in an optical transport network, comprising:
receiving an optical transmission unit (OTU) frame including an in-band area and an out-band area, wherein the in-band area includes a first area to which the tributary signal is allocated and a second area to which fixed stuff is allocated; and demapping the tributary signal from a plurality of tributary slots included in the first area. 10. The method of claim 9, wherein the second area locates in 8-byte area at the end of the in-band area. 11. The method of claim 9, wherein the second area locates between the first area and the out-band area. 12. The method of claim 9, wherein the first area includes 80 tributary slots. 13. The method of claim 9, wherein the first area includes a plurality of 1.25G tributary slots. 14. The method of claim 9, wherein the out-band area includes information for forward error correction (FEC) of the tributary signal. 15. The method of claim 14, further comprising:
correcting error of the tributary signal by using the information included in the out-band area. 16. An apparatus of receiving data signal in an optical transport network, comprising:
a receiver configured to receive an optical transmission unit (OUT) frame including an in-band area and an out-band area, wherein the in-band area includes a first area to which the data signal is allocated and a second area to which fixed stuff is allocated; and demapper configured to demap the client signal from the first area. 17. The apparatus of claim 16, wherein out-band area includes information for forward error correction (FEC) of the data signal. 18. The apparatus of claim 17, further comprising:
error corrector configured to correct error of the data signal by using the information included in the out-band area. 19. The apparatus of claim 14, wherein the data signal is client signal. 20. The apparatus of claim 14, wherein the data signal is tributary signal. | 2,100 |
4,918 | 14,870,538 | 2,112 | A control network communication arrangement includes a second protocol embedded into a first protocol in a way that modules supporting the second protocol may be aware of and utilize the first protocol whereas modules supporting only the first protocol may not be aware of the second protocol. Operation of modules using the second protocol does not disturb operation of the modules not configured to use or understand the second protocol. By one approach, unique additional information is embedded into an end of frame portion of a message to confirm that the portion is the end of frame portion. This acts as a quality check confirming proper synchronization and decoding of the signaling on the communication bus. | 1. A method of communication among two or more modules over a common control network, the method comprising:
sending from a communication device over a control network a message packet having at least a data portion, an error check portion, and an end of frame portion, the message packet defined by bits having a plurality of bit quanta, wherein data for the message packet is defined by a signal level at defined bit quanta of a bit, the defined bit quanta being less than every bit quanta of a bit; sending additional information within the end of frame portion of the message packet using bit quanta of the end of frame portion other than the defined bit quanta; wherein the additional information comprises a unique identifier sufficient to confirm a portion of the message packet embedding the additional information as the end of frame portion. 2. The method of claim 1 further comprising error checking additional information of a received message packet to confirm a portion of the received message packet embedding the additional information as an end of frame portion of the received message packet. 3. The method of claim 1 wherein the sending the message packet comprises transmitting a CAN message packet. 4. The method of claim 3 further comprising embedding the additional information in Prop-Seg bit quanta of the end of frame portion. 5. The method of claim 1 wherein the sending the message packet comprises transmitting a CAN-FD message packet. 6. The method of claim 1 further comprising embedding the additional information using a CAN-EF protocol. 7. A communication device apparatus for communicating with other devices over a control network, the communication device apparatus comprising:
a processing device operatively connected to a communication port to control receiving communications over the control network, the processing device configured to:
communicate a first part of a message packet using a first bit-rate followed by a second part of the message packet using a second bit-rate higher than the first bit-rate;
send a message packet having at least a data portion, an error check portion, and an end of frame portion, the message packet defined by bits having a plurality of bit quanta, wherein data for the message packet is defined by a signal level at defined bit quanta of a bit, the defined bit quanta being less than every bit quanta of a bit;
send additional information within the end of frame portion of the message packet using bit quanta of the end of frame portion other than the defined bit quanta;
wherein the additional information comprises a unique identifier sufficient to confirm a portion of the message packet embedding the additional information as the end of frame portion. 8. The communication device apparatus of claim 7 wherein the processing device is further configured to error check additional information of a received message packet to confirm a portion of the received message packet embedding the additional information as an end of frame portion of the received message packet. 9. The communication device apparatus of claim 7 wherein the processing device is further configured to send the message packet by transmitting a CAN message packet. 10. The communication device apparatus of claim 9 wherein the processing device is further configured to embed the additional information in Prop-Seg bit quanta of the end of frame portion. 11. The communication device apparatus of claim 7 wherein the processing device is further configured to send the message packet by transmitting a CAN-FD message packet. 12. The communication device apparatus of claim 7 wherein the processing device is further configured to embed the additional information using a CAN-EF protocol. 13. An apparatus for use in communicating with other devices over a control network, the apparatus comprising:
a processing device operatively connected to a communication port to control receiving communications over the control network, the processing device configured to:
send a message packet having at least a data portion, an error check portion, and an end of frame portion, the message packet defined by bits having a plurality of bit quanta, wherein data for the message packet is defined by a signal level at defined bit quanta of a bit, the defined bit quanta being less than every bit quanta of a bit;
send additional information within the end of frame portion of the message packet using bit quanta of the end of frame portion other than the defined bit quanta;
wherein the additional information comprises a unique identifier sufficient to confirm a portion of the message packet embedding the additional information as the end of frame portion. 14. The communication device apparatus of claim 13 wherein the processing device is further configured to error check additional information of a received message packet to confirm a portion of the received message packet embedding the additional information as an end of frame portion of the received message packet. 15. The communication device apparatus of claim 13 wherein the processing device is further configured to send the message packet by transmitting a CAN message packet. 16. The communication device apparatus of claim 15 wherein the processing device is further configured to embed the additional information in Prop-Seg bit quanta of the end of frame portion. 17. The communication device apparatus of claim 13 wherein the processing device is further configured to send the message packet by transmitting a CAN message packet. 18. The communication device apparatus of claim 13 wherein the processing device is further configured to embed the additional information using a CAN-EF protocol. | A control network communication arrangement includes a second protocol embedded into a first protocol in a way that modules supporting the second protocol may be aware of and utilize the first protocol whereas modules supporting only the first protocol may not be aware of the second protocol. Operation of modules using the second protocol does not disturb operation of the modules not configured to use or understand the second protocol. By one approach, unique additional information is embedded into an end of frame portion of a message to confirm that the portion is the end of frame portion. This acts as a quality check confirming proper synchronization and decoding of the signaling on the communication bus.1. A method of communication among two or more modules over a common control network, the method comprising:
sending from a communication device over a control network a message packet having at least a data portion, an error check portion, and an end of frame portion, the message packet defined by bits having a plurality of bit quanta, wherein data for the message packet is defined by a signal level at defined bit quanta of a bit, the defined bit quanta being less than every bit quanta of a bit; sending additional information within the end of frame portion of the message packet using bit quanta of the end of frame portion other than the defined bit quanta; wherein the additional information comprises a unique identifier sufficient to confirm a portion of the message packet embedding the additional information as the end of frame portion. 2. The method of claim 1 further comprising error checking additional information of a received message packet to confirm a portion of the received message packet embedding the additional information as an end of frame portion of the received message packet. 3. The method of claim 1 wherein the sending the message packet comprises transmitting a CAN message packet. 4. The method of claim 3 further comprising embedding the additional information in Prop-Seg bit quanta of the end of frame portion. 5. The method of claim 1 wherein the sending the message packet comprises transmitting a CAN-FD message packet. 6. The method of claim 1 further comprising embedding the additional information using a CAN-EF protocol. 7. A communication device apparatus for communicating with other devices over a control network, the communication device apparatus comprising:
a processing device operatively connected to a communication port to control receiving communications over the control network, the processing device configured to:
communicate a first part of a message packet using a first bit-rate followed by a second part of the message packet using a second bit-rate higher than the first bit-rate;
send a message packet having at least a data portion, an error check portion, and an end of frame portion, the message packet defined by bits having a plurality of bit quanta, wherein data for the message packet is defined by a signal level at defined bit quanta of a bit, the defined bit quanta being less than every bit quanta of a bit;
send additional information within the end of frame portion of the message packet using bit quanta of the end of frame portion other than the defined bit quanta;
wherein the additional information comprises a unique identifier sufficient to confirm a portion of the message packet embedding the additional information as the end of frame portion. 8. The communication device apparatus of claim 7 wherein the processing device is further configured to error check additional information of a received message packet to confirm a portion of the received message packet embedding the additional information as an end of frame portion of the received message packet. 9. The communication device apparatus of claim 7 wherein the processing device is further configured to send the message packet by transmitting a CAN message packet. 10. The communication device apparatus of claim 9 wherein the processing device is further configured to embed the additional information in Prop-Seg bit quanta of the end of frame portion. 11. The communication device apparatus of claim 7 wherein the processing device is further configured to send the message packet by transmitting a CAN-FD message packet. 12. The communication device apparatus of claim 7 wherein the processing device is further configured to embed the additional information using a CAN-EF protocol. 13. An apparatus for use in communicating with other devices over a control network, the apparatus comprising:
a processing device operatively connected to a communication port to control receiving communications over the control network, the processing device configured to:
send a message packet having at least a data portion, an error check portion, and an end of frame portion, the message packet defined by bits having a plurality of bit quanta, wherein data for the message packet is defined by a signal level at defined bit quanta of a bit, the defined bit quanta being less than every bit quanta of a bit;
send additional information within the end of frame portion of the message packet using bit quanta of the end of frame portion other than the defined bit quanta;
wherein the additional information comprises a unique identifier sufficient to confirm a portion of the message packet embedding the additional information as the end of frame portion. 14. The communication device apparatus of claim 13 wherein the processing device is further configured to error check additional information of a received message packet to confirm a portion of the received message packet embedding the additional information as an end of frame portion of the received message packet. 15. The communication device apparatus of claim 13 wherein the processing device is further configured to send the message packet by transmitting a CAN message packet. 16. The communication device apparatus of claim 15 wherein the processing device is further configured to embed the additional information in Prop-Seg bit quanta of the end of frame portion. 17. The communication device apparatus of claim 13 wherein the processing device is further configured to send the message packet by transmitting a CAN message packet. 18. The communication device apparatus of claim 13 wherein the processing device is further configured to embed the additional information using a CAN-EF protocol. | 2,100 |
4,919 | 13,155,166 | 2,166 | Disclosed are methods for developing authorized chemical palettes for formulating products with reduced adverse environmental and/or health concerns, and advising the public to a greater extent regarding the ingredients of products formulated using these palettes. Also disclosed are computer systems to implement such methods. | 1. A method of producing a list of chemicals pre-approved for use in selected products, comprising:
(a) identifying all chemical components of at least ten different multi-chemical materials, wherein the identifying involves obtaining from one or more third parties, under confidentiality restriction, information identifying all chemical components of the ten multi-chemical materials; (b) based at least in part on a review of environmental and health concerns, classifying identified chemical components into at least:
(i) a group of pre-approved components; and
(ii) a group of excluded components;
(c) creating a list of the components which are pre-approved for inclusion in selected products; and (d) disclosing the list of pre-approved components included in the selected products without confidentiality restriction in a manner that does not identify which chemicals covered by the confidentiality restriction are in which multi-chemical material. 2. The method of claim 1, wherein the chemical components are also classified into (iii) a group of components requiring further consideration as to whether to be included or excluded. 3. The method of claim 1, wherein the multi-chemical materials are multi-chemical fragrancing materials, and the products are fragranced products. 4. The method of claim 3, wherein the fragranced products are products selected from the group consisting of air care products, home cleaning products, personal care products, pest control products, and home storage products. 5. The method of claim 1, wherein a database stores the list on a computer system. 6. The method of claim 5, wherein the database is accessible over the Internet. 7. A method of producing a product, comprising:
obtaining under confidentiality restriction information identifying chemical components of a multi-chemical material proposed for use in the product; comparing those chemical components with a list of pre-approved chemicals, where the list represents chemicals not excluded by adverse environmental and/or health considerations; determining whether all of the chemical components of the multi-chemical material are on the list; and formulating the product with the multi-chemical material therein, where the multi-chemical material includes only chemicals on the list; and disclosing the list publically without specifically disclosing that at least some of the chemical components are in a specific multi-chemical material. 8. The method of claim 7, wherein the multi-chemical material is a multi-chemical fragrancing material and the product is a fragranced product. 9. The method of claim 8, wherein the fragranced product is selected from the group consisting of air care products, home cleaning products, personal care products, pest control products, and home storage products. 10. The method of claim 9, wherein the list represents all chemicals in at least ten fragrancing materials present in fragranced products marketed by a company. 11. The method of claim 9, wherein the list represents chemicals in fragrancing materials of at least one hundred selected products marketed by a company. 12. The method of claim 9, wherein the list represents all chemicals in fragrancing materials in all air care products, home cleaning products, personal care products, pest control products, and home storage products marketed by a company. 13. An automated computer system for storing and updating a list of pre-approved chemicals, the system comprising:
(a) a first database listing at least ten selected products marketed by a company; (b) a second database listing chemical components of at least ten different multi-component materials used in one or more of those products; and (c) a third database listing chemicals present in the selected products, by product, except that multi-component materials present in at least some of the products are identified in the third database without disclosing at least some of their chemical components in the third database; (d) wherein the second and third databases are publically accessible by telecommunication so that someone accessing these databases can review the chemical content of a product, except that chemical contents of a multi-component material in that product will be identified by being present in the second database, without the second or third database disclosing which of the components in the second database are in which third database multi-component material or in which third database product. 14. The automated computer system of claim 13, wherein the multi-component materials are fragrances. 15. The automated computer system of claim 13, wherein at least some chemical component information in the second database has been obtained from one or more 16. The automated computer system of claim 13, wherein if a new multi-component material is proposed for inclusion in the system, the system can compare the chemical components thereof with the chemical components in the second database, and if all are already in the second database a product that will be commercialized comprising the new multi-component material can be added by the system to the first and third databases. 17. The automated computer system of claim 13, wherein if a new product having the multi-component material is proposed for inclusion in the system, the system can compare the chemical components of its multi-component material to the second database, and if all those components are already in the second database the system can add the new product to the first and third databases. 18. The automated computer system of claim 13, wherein if a particular chemical component in the second database is believed to have developed an environmental or health concern, the system can identify those products in the first and third databases which contain it, and request instructions as to whether to remove those products from those databases and remove that component from the second database. 19. The automated computer system of claim 13, wherein if a new multi-component material is proposed for inclusion in the system, and the system does not locate at least one component thereof in the second database, the system can check to see if the component is on a fourth database of the system which is a list of excluded chemicals. 20. The automated computer system of claim 19, wherein if the system has not found a proposed component in either the second or fourth databases, it can then seek instructions as to whether the component can be | Disclosed are methods for developing authorized chemical palettes for formulating products with reduced adverse environmental and/or health concerns, and advising the public to a greater extent regarding the ingredients of products formulated using these palettes. Also disclosed are computer systems to implement such methods.1. A method of producing a list of chemicals pre-approved for use in selected products, comprising:
(a) identifying all chemical components of at least ten different multi-chemical materials, wherein the identifying involves obtaining from one or more third parties, under confidentiality restriction, information identifying all chemical components of the ten multi-chemical materials; (b) based at least in part on a review of environmental and health concerns, classifying identified chemical components into at least:
(i) a group of pre-approved components; and
(ii) a group of excluded components;
(c) creating a list of the components which are pre-approved for inclusion in selected products; and (d) disclosing the list of pre-approved components included in the selected products without confidentiality restriction in a manner that does not identify which chemicals covered by the confidentiality restriction are in which multi-chemical material. 2. The method of claim 1, wherein the chemical components are also classified into (iii) a group of components requiring further consideration as to whether to be included or excluded. 3. The method of claim 1, wherein the multi-chemical materials are multi-chemical fragrancing materials, and the products are fragranced products. 4. The method of claim 3, wherein the fragranced products are products selected from the group consisting of air care products, home cleaning products, personal care products, pest control products, and home storage products. 5. The method of claim 1, wherein a database stores the list on a computer system. 6. The method of claim 5, wherein the database is accessible over the Internet. 7. A method of producing a product, comprising:
obtaining under confidentiality restriction information identifying chemical components of a multi-chemical material proposed for use in the product; comparing those chemical components with a list of pre-approved chemicals, where the list represents chemicals not excluded by adverse environmental and/or health considerations; determining whether all of the chemical components of the multi-chemical material are on the list; and formulating the product with the multi-chemical material therein, where the multi-chemical material includes only chemicals on the list; and disclosing the list publically without specifically disclosing that at least some of the chemical components are in a specific multi-chemical material. 8. The method of claim 7, wherein the multi-chemical material is a multi-chemical fragrancing material and the product is a fragranced product. 9. The method of claim 8, wherein the fragranced product is selected from the group consisting of air care products, home cleaning products, personal care products, pest control products, and home storage products. 10. The method of claim 9, wherein the list represents all chemicals in at least ten fragrancing materials present in fragranced products marketed by a company. 11. The method of claim 9, wherein the list represents chemicals in fragrancing materials of at least one hundred selected products marketed by a company. 12. The method of claim 9, wherein the list represents all chemicals in fragrancing materials in all air care products, home cleaning products, personal care products, pest control products, and home storage products marketed by a company. 13. An automated computer system for storing and updating a list of pre-approved chemicals, the system comprising:
(a) a first database listing at least ten selected products marketed by a company; (b) a second database listing chemical components of at least ten different multi-component materials used in one or more of those products; and (c) a third database listing chemicals present in the selected products, by product, except that multi-component materials present in at least some of the products are identified in the third database without disclosing at least some of their chemical components in the third database; (d) wherein the second and third databases are publically accessible by telecommunication so that someone accessing these databases can review the chemical content of a product, except that chemical contents of a multi-component material in that product will be identified by being present in the second database, without the second or third database disclosing which of the components in the second database are in which third database multi-component material or in which third database product. 14. The automated computer system of claim 13, wherein the multi-component materials are fragrances. 15. The automated computer system of claim 13, wherein at least some chemical component information in the second database has been obtained from one or more 16. The automated computer system of claim 13, wherein if a new multi-component material is proposed for inclusion in the system, the system can compare the chemical components thereof with the chemical components in the second database, and if all are already in the second database a product that will be commercialized comprising the new multi-component material can be added by the system to the first and third databases. 17. The automated computer system of claim 13, wherein if a new product having the multi-component material is proposed for inclusion in the system, the system can compare the chemical components of its multi-component material to the second database, and if all those components are already in the second database the system can add the new product to the first and third databases. 18. The automated computer system of claim 13, wherein if a particular chemical component in the second database is believed to have developed an environmental or health concern, the system can identify those products in the first and third databases which contain it, and request instructions as to whether to remove those products from those databases and remove that component from the second database. 19. The automated computer system of claim 13, wherein if a new multi-component material is proposed for inclusion in the system, and the system does not locate at least one component thereof in the second database, the system can check to see if the component is on a fourth database of the system which is a list of excluded chemicals. 20. The automated computer system of claim 19, wherein if the system has not found a proposed component in either the second or fourth databases, it can then seek instructions as to whether the component can be | 2,100 |
4,920 | 15,289,711 | 2,154 | In one embodiment, a method includes receiving a first search query including a selection of a first query-domain. The first query-domain may correspond to a first object-type. The method includes identifying a first set of objects of the plurality of objects matching the first object-type. The method includes sending a first search-results interface responsive to the first search query. The first search-results interface may include references to one or more of the identified objects from the first set of objects and one or more query-filter elements. Each query-filter element may correspond to a query-filter associated with the first query-domain. Each query-filter element may be activatable to apply the associated query-filter to the identified objects. The method includes receiving a second search query including a selection of one or more of the query-filters in response to the first user activating the corresponding query-filter elements. | 1. A method comprising, by one or more computing devices:
receiving, from a client system of a first user, a first search query comprising a selection of a first query-domain, the first query-domain corresponding to a first object-type of a plurality of object-types; identifying, responsive to the first search query, a first set of objects of a plurality of objects matching the first object-type; sending, to the client system for display to the first user, a first search-results interface responsive to the first search query, the first search-results interface comprising references to one or more of the identified objects from the first set of objects and one or more query-filter elements, each query-filter element corresponding to a query-filter associated with the first query-domain, wherein each query-filter element is activatable to apply the associated query-filter to the identified objects; and receiving, from the client system of the first user, a second search query comprising a selection of one or more of the query-filters in response to the first user activating the corresponding query-filter elements. 2. The method of claim 1, further comprising:
sending, to the client system of the first user, a query-initiation interface responsive to a selection of a query field by the first user, the query-initiation interface comprising one or more query-domain elements corresponding to one or more query-domains, respectively, wherein each query-domain element is activatable to generate a search query comprising a selection of the associated query-domain. 3. The method of claim 2, wherein receiving the first search query comprises receiving an indication the first user has activated a first query-domain element corresponding to the first query-domain. 4. The method of claim 1, wherein the first search-results interface further comprises an additional-filters element, wherein the additional-filters element is activatable to generate a user interface comprising the one or more query-filter elements of the first search-results interface and one or more additional query-filter elements, each query-filter element corresponding to a query-filter associated with the first query-domain, wherein each query-filter element is activatable to apply the associated query-filter to the identified objects. 5. The method of claim 1, further comprising:
identifying, responsive to the second search query, a second set of objects of the plurality of objects matching the first object-type and the selected query-filters; and sending, to the client system of the first user, a second search-results interface responsive to the second search query, the second search-results interface comprising references to one or more of the identified objects from the second set of objects. 6. The method of claim 5, wherein the second search-results interface further comprises one or more query-filter elements, each query-filter element corresponding to a query-filter associated with the first query-domain, wherein each query-filter element is activatable to apply the associated query-filter to the identified objects. 7. The method of claim 1, wherein the first object-type is selected from a group consisting of: users, photos, posts, pages, applications, events, locations, or user groups. 8. The method of claim 1, wherein the method further comprises sending, to the client system of the first user and responsive to a selection of a query-filter element, a sub-filter interface, the sub-filter interface comprising one or more sub-filter elements, each sub-filter element corresponding to a sub-filter associated with the query filter. 9. The method of claim 1, wherein the method further comprises sending, to the client system of the first user and responsive to a selection of a query-filter element, a sub-filter interface comprising a query field. 10. The method of claim 9, further comprising:
receiving, from the client system of the first user, and text string inputted into the query field; and identifying a third set of objects of the plurality of objects matching the text string. 11. The method of claim 10, further comprising:
sending, to the client system of the first user, a user interface comprising additional query-filter elements, each additional query-filter element corresponding to one of the identified objects of the third set of objects; and receiving, from the client system of the first user, a third search query comprising a selection of one or more of the identified objects in the third set of objects in response to the first user activating the corresponding additional query-filter elements. 12. The method of claim 1, wherein the search-results interface is a user interface of a native application associated with the online social network on the client system of the first user. 13. The method of claim 1, wherein the search-results interface is a webpage of the online social network accessed by a browser client of the client system of the first user. 14. The method of claim 1, further comprising accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, the nodes comprising:
a first node corresponding to the first user; and a plurality of second nodes each corresponding to a plurality of objects, respectively, associated with the online social network, each object being of a particular object-type; wherein each of the identified objects corresponding to a second node within a threshold degree of separation of the first node. 15. The method of claim 14, wherein identifying a first set of objects of the plurality of objects matching the first object-type comprises searching a vertical storing a plurality of objects of the first object-type to identify a plurality of objects in the vertical that correspond to a second node within a threshold degree of separation of the first node. 16. The method of claim 15, wherein the vertical is one of a plurality of verticals, and wherein each vertical of the plurality of verticals stores objects of a particular object-type, the particular object-type being selected form a group consisting of: users, photos, posts, pages, applications, events, locations, or user groups. 17. The method of claim 14, further comprising:
generating a structured query based on the second search query, wherein the structured query comprises references to one or more selected nodes from the plurality of second nodes and one or more selected edges from the plurality of edges, each selected node and selected edge corresponding to one or more of the first query-domain or the one or more query-filters of the second search query; and sending, to the client system of the first user, the structured query for display to the first user. 18. The method of claim 17, wherein the structured query is based on a natural-language string generated by a grammar model. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
receive, from a client system of a first user, a first search query comprising a selection of a first query-domain, the first query-domain corresponding to a first object-type of a plurality of object-types; identify, responsive to the first search query, a first set of objects of a plurality of objects matching the first object-type; send, to the client system for display to the first user, a first search-results interface responsive to the first search query, the first search-results interface comprising references to one or more of the identified objects from the first set of objects and one or more query-filter elements, each query-filter element corresponding to a query-filter associated with the first query-domain, wherein each query-filter element is activatable to apply the associated query-filter to the identified objects; and receive, from the client system of the first user, a second search query comprising a selection of one or more of the query-filters in response to the first user activating the corresponding query-filter elements. 20. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
receive, from a client system of a first user, a first search query comprising a selection of a first query-domain, the first query-domain corresponding to a first object-type of a plurality of object-types; identify, responsive to the first search query, a first set of objects of a plurality of objects matching the first object-type; send, to the client system for display to the first user, a first search-results interface responsive to the first search query, the first search-results interface comprising references to one or more of the identified objects from the first set of objects and one or more query-filter elements, each query-filter element corresponding to a query-filter associated with the first query-domain, wherein each query-filter element is activatable to apply the associated query-filter to the identified objects; and receive, from the client system of the first user, a second search query comprising a selection of one or more of the query-filters in response to the first user activating the corresponding query-filter elements. | In one embodiment, a method includes receiving a first search query including a selection of a first query-domain. The first query-domain may correspond to a first object-type. The method includes identifying a first set of objects of the plurality of objects matching the first object-type. The method includes sending a first search-results interface responsive to the first search query. The first search-results interface may include references to one or more of the identified objects from the first set of objects and one or more query-filter elements. Each query-filter element may correspond to a query-filter associated with the first query-domain. Each query-filter element may be activatable to apply the associated query-filter to the identified objects. The method includes receiving a second search query including a selection of one or more of the query-filters in response to the first user activating the corresponding query-filter elements.1. A method comprising, by one or more computing devices:
receiving, from a client system of a first user, a first search query comprising a selection of a first query-domain, the first query-domain corresponding to a first object-type of a plurality of object-types; identifying, responsive to the first search query, a first set of objects of a plurality of objects matching the first object-type; sending, to the client system for display to the first user, a first search-results interface responsive to the first search query, the first search-results interface comprising references to one or more of the identified objects from the first set of objects and one or more query-filter elements, each query-filter element corresponding to a query-filter associated with the first query-domain, wherein each query-filter element is activatable to apply the associated query-filter to the identified objects; and receiving, from the client system of the first user, a second search query comprising a selection of one or more of the query-filters in response to the first user activating the corresponding query-filter elements. 2. The method of claim 1, further comprising:
sending, to the client system of the first user, a query-initiation interface responsive to a selection of a query field by the first user, the query-initiation interface comprising one or more query-domain elements corresponding to one or more query-domains, respectively, wherein each query-domain element is activatable to generate a search query comprising a selection of the associated query-domain. 3. The method of claim 2, wherein receiving the first search query comprises receiving an indication the first user has activated a first query-domain element corresponding to the first query-domain. 4. The method of claim 1, wherein the first search-results interface further comprises an additional-filters element, wherein the additional-filters element is activatable to generate a user interface comprising the one or more query-filter elements of the first search-results interface and one or more additional query-filter elements, each query-filter element corresponding to a query-filter associated with the first query-domain, wherein each query-filter element is activatable to apply the associated query-filter to the identified objects. 5. The method of claim 1, further comprising:
identifying, responsive to the second search query, a second set of objects of the plurality of objects matching the first object-type and the selected query-filters; and sending, to the client system of the first user, a second search-results interface responsive to the second search query, the second search-results interface comprising references to one or more of the identified objects from the second set of objects. 6. The method of claim 5, wherein the second search-results interface further comprises one or more query-filter elements, each query-filter element corresponding to a query-filter associated with the first query-domain, wherein each query-filter element is activatable to apply the associated query-filter to the identified objects. 7. The method of claim 1, wherein the first object-type is selected from a group consisting of: users, photos, posts, pages, applications, events, locations, or user groups. 8. The method of claim 1, wherein the method further comprises sending, to the client system of the first user and responsive to a selection of a query-filter element, a sub-filter interface, the sub-filter interface comprising one or more sub-filter elements, each sub-filter element corresponding to a sub-filter associated with the query filter. 9. The method of claim 1, wherein the method further comprises sending, to the client system of the first user and responsive to a selection of a query-filter element, a sub-filter interface comprising a query field. 10. The method of claim 9, further comprising:
receiving, from the client system of the first user, and text string inputted into the query field; and identifying a third set of objects of the plurality of objects matching the text string. 11. The method of claim 10, further comprising:
sending, to the client system of the first user, a user interface comprising additional query-filter elements, each additional query-filter element corresponding to one of the identified objects of the third set of objects; and receiving, from the client system of the first user, a third search query comprising a selection of one or more of the identified objects in the third set of objects in response to the first user activating the corresponding additional query-filter elements. 12. The method of claim 1, wherein the search-results interface is a user interface of a native application associated with the online social network on the client system of the first user. 13. The method of claim 1, wherein the search-results interface is a webpage of the online social network accessed by a browser client of the client system of the first user. 14. The method of claim 1, further comprising accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, the nodes comprising:
a first node corresponding to the first user; and a plurality of second nodes each corresponding to a plurality of objects, respectively, associated with the online social network, each object being of a particular object-type; wherein each of the identified objects corresponding to a second node within a threshold degree of separation of the first node. 15. The method of claim 14, wherein identifying a first set of objects of the plurality of objects matching the first object-type comprises searching a vertical storing a plurality of objects of the first object-type to identify a plurality of objects in the vertical that correspond to a second node within a threshold degree of separation of the first node. 16. The method of claim 15, wherein the vertical is one of a plurality of verticals, and wherein each vertical of the plurality of verticals stores objects of a particular object-type, the particular object-type being selected form a group consisting of: users, photos, posts, pages, applications, events, locations, or user groups. 17. The method of claim 14, further comprising:
generating a structured query based on the second search query, wherein the structured query comprises references to one or more selected nodes from the plurality of second nodes and one or more selected edges from the plurality of edges, each selected node and selected edge corresponding to one or more of the first query-domain or the one or more query-filters of the second search query; and sending, to the client system of the first user, the structured query for display to the first user. 18. The method of claim 17, wherein the structured query is based on a natural-language string generated by a grammar model. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
receive, from a client system of a first user, a first search query comprising a selection of a first query-domain, the first query-domain corresponding to a first object-type of a plurality of object-types; identify, responsive to the first search query, a first set of objects of a plurality of objects matching the first object-type; send, to the client system for display to the first user, a first search-results interface responsive to the first search query, the first search-results interface comprising references to one or more of the identified objects from the first set of objects and one or more query-filter elements, each query-filter element corresponding to a query-filter associated with the first query-domain, wherein each query-filter element is activatable to apply the associated query-filter to the identified objects; and receive, from the client system of the first user, a second search query comprising a selection of one or more of the query-filters in response to the first user activating the corresponding query-filter elements. 20. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
receive, from a client system of a first user, a first search query comprising a selection of a first query-domain, the first query-domain corresponding to a first object-type of a plurality of object-types; identify, responsive to the first search query, a first set of objects of a plurality of objects matching the first object-type; send, to the client system for display to the first user, a first search-results interface responsive to the first search query, the first search-results interface comprising references to one or more of the identified objects from the first set of objects and one or more query-filter elements, each query-filter element corresponding to a query-filter associated with the first query-domain, wherein each query-filter element is activatable to apply the associated query-filter to the identified objects; and receive, from the client system of the first user, a second search query comprising a selection of one or more of the query-filters in response to the first user activating the corresponding query-filter elements. | 2,100 |
4,921 | 14,472,513 | 2,126 | Mechanisms are provided in a question answering (QA) system comprising a QA system pipeline that analyzes an input question and generates an answer to the input question, for pre-processing the input question. The mechanisms receive an input question and input the input question to a pre-processor flow path having one or more pre-processors. The one or more pre-processors transform the input question into a transformed question by correcting errors in a formulation of the input question that are determined to be detrimental to efficient and accurate processing of the input question by a QA system pipeline of the QA system. The transformed question is then input to the QA system pipeline of the QA system which processes the transformed question to generate and output an answer to the input question. | 1. A method, in a question answering (QA) system comprising a QA system pipeline that analyzes an input question and generates an answer to the input question, for pre-processing the input question, the method comprising:
receiving, by the QA system, an input question for which an answer is sought by a submitter of the input question; inputting, by the QA system, the input question to a pre-processor flow path comprising at least one pre-processor; transforming, by the at least one pre-processor, the input question into a transformed question by correcting errors in a formulation of the input question that are determined to be detrimental to efficient and accurate processing of the input question by a QA system pipeline of the QA system; inputting the transformed question to the QA system pipeline of the QA system; and processing the transformed question via the QA system pipeline to generate and output at least one answer to the input question. 2. The method of claim 1, wherein the at least one pre-processor comprises a superfluous information pre-processor that identifies superfluous information content in the input question and transforms the superfluous information content. 3. The method of claim 2, wherein transforming the input question comprises:
identifying at least one of a term, phrase, or language pattern indicative of superfluous information content in the input question that is not relevant to the underlying question being asked by the input question; removing the superfluous information content from the input question to generate a modified input question; in response to determining that the modified input question requires reformatting, reformatting the input question into a logically correct input question; and outputting the logically correct input question as the transformed question. 4. The method of claim 3, wherein identifying at least one of a term, phrase, or language pattern indicative of superfluous information content in the input question comprises identifying at least one of a vocative clause or a common phrase in the input question. 5. The method of claim 2, wherein the superfluous information content in the input question comprises at least one of a vocative clause or a common phrase in the input question. 6. The method of claim 1, wherein the at least one pre-processor comprises an elided information pre-processor that identifies elided information content associated with the input question and transforms the input question based on the identified elided information. 7. The method of claim 6, wherein transforming the input question comprises:
identifying at least one of a term, phrase, or language pattern indicative of elided information content in the input question that is relevant to the underlying question being asked by the input question and is missing in the input question; inserting the elided information content into the input question to generate a modified input question; in response to determining that the modified input question requires reformatting, reformatting the input question into a logically correct input question; and outputting the logically correct input question as the transformed question. 8. The method of claim 7, wherein identifying at least one of a term, phrase, or language pattern indicative of elided information content in the input question comprises identifying at least one of an elided focus, an elided verb, or an elided noun phrase. 9. The method of claim 7, wherein inserting the elided information content into the input question to generate a modified input question comprises analyzing at least one of a domain or a context associated with the input question to determine the elided information content to be inserted into the input question. 10. The method of claim 6, wherein the elided information content in the input question comprises at least one of an elided focus, an elided verb, or an elided noun phrase. 11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device implementing a Question Answering (QA) system, causes the computing device to:
receive, by the QA system, an input question for which an answer is sought by a submitter of the input question; input, by the QA system, the input question to a pre-processor flow path comprising at least one pre-processor; transform, by the at least one pre-processor, the input question into a transformed question by correcting errors in a formulation of the input question that are determined to be detrimental to efficient and accurate processing of the input question by a QA system pipeline of the QA system; input the transformed question to the QA system pipeline of the QA system; and process the transformed question via the QA system pipeline to generate and output at least one answer to the input question. 12. The computer program product of claim 11, wherein the at least one pre-processor comprises a superfluous information pre-processor that identifies superfluous information content in the input question and transforms the superfluous information content. 13. The computer program product of claim 12, wherein the computer readable program further causes the computing device to transform the input question at last by:
identifying at least one of a term, phrase, or language pattern indicative of superfluous information content in the input question that is not relevant to the underlying question being asked by the input question; removing the superfluous information content from the input question to generate a modified input question; in response to determining that the modified input question requires reformatting, reformatting the input question into a logically correct input question; and outputting the logically correct input question as the transformed question. 14. The computer program product of claim 13, wherein the computer readable program further causes the computing device to identify at least one of a term, phrase, or language pattern indicative of superfluous information content in the input question at least by identifying at least one of a vocative clause or a common phrase in the input question. 15. The computer program product of claim 12, wherein the superfluous information content in the input question comprises at least one of a vocative clause or a common phrase in the input question. 16. The computer program product of claim 11, wherein the at least one pre-processor comprises an elided information pre-processor that identifies elided information content associated with the input question and transforms the input question based on the identified elided information. 17. The computer program product of claim 16, wherein the computer readable program further causes the computing device to transform the input question at least by:
identifying at least one of a term, phrase, or language pattern indicative of elided information content in the input question that is relevant to the underlying question being asked by the input question and is missing in the input question; inserting the elided information content into the input question to generate a modified input question; in response to determining that the modified input question requires reformatting, reformatting the input question into a logically correct input question; and outputting the logically correct input question as the transformed question. 18. The computer program product of claim 17, wherein the computer readable program further causes the computing device to insert the elided information content into the input question to generate a modified input question at least by analyzing at least one of a domain or a context associated with the input question to determine the elided information content to be inserted into the input question. 19. The computer program product of claim 16, wherein the elided information content in the input question comprises at least one of an elided focus, an elided verb, or an elided noun phrase. 20. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor implementing a Question Answering (QA) system, cause the processor to: receive, by the QA system, an input question for which an answer is sought by a submitter of the input question; input, by the QA system, the input question to a pre-processor flow path comprising at least one pre-processor; transform, by the at least one pre-processor, the input question into a transformed question by correcting errors in a formulation of the input question that are determined to be detrimental to efficient and accurate processing of the input question by a QA system pipeline of the QA system; input the transformed question to the QA system pipeline of the QA system; and process the transformed question via the QA system pipeline to generate and output at least one answer to the input question. | Mechanisms are provided in a question answering (QA) system comprising a QA system pipeline that analyzes an input question and generates an answer to the input question, for pre-processing the input question. The mechanisms receive an input question and input the input question to a pre-processor flow path having one or more pre-processors. The one or more pre-processors transform the input question into a transformed question by correcting errors in a formulation of the input question that are determined to be detrimental to efficient and accurate processing of the input question by a QA system pipeline of the QA system. The transformed question is then input to the QA system pipeline of the QA system which processes the transformed question to generate and output an answer to the input question.1. A method, in a question answering (QA) system comprising a QA system pipeline that analyzes an input question and generates an answer to the input question, for pre-processing the input question, the method comprising:
receiving, by the QA system, an input question for which an answer is sought by a submitter of the input question; inputting, by the QA system, the input question to a pre-processor flow path comprising at least one pre-processor; transforming, by the at least one pre-processor, the input question into a transformed question by correcting errors in a formulation of the input question that are determined to be detrimental to efficient and accurate processing of the input question by a QA system pipeline of the QA system; inputting the transformed question to the QA system pipeline of the QA system; and processing the transformed question via the QA system pipeline to generate and output at least one answer to the input question. 2. The method of claim 1, wherein the at least one pre-processor comprises a superfluous information pre-processor that identifies superfluous information content in the input question and transforms the superfluous information content. 3. The method of claim 2, wherein transforming the input question comprises:
identifying at least one of a term, phrase, or language pattern indicative of superfluous information content in the input question that is not relevant to the underlying question being asked by the input question; removing the superfluous information content from the input question to generate a modified input question; in response to determining that the modified input question requires reformatting, reformatting the input question into a logically correct input question; and outputting the logically correct input question as the transformed question. 4. The method of claim 3, wherein identifying at least one of a term, phrase, or language pattern indicative of superfluous information content in the input question comprises identifying at least one of a vocative clause or a common phrase in the input question. 5. The method of claim 2, wherein the superfluous information content in the input question comprises at least one of a vocative clause or a common phrase in the input question. 6. The method of claim 1, wherein the at least one pre-processor comprises an elided information pre-processor that identifies elided information content associated with the input question and transforms the input question based on the identified elided information. 7. The method of claim 6, wherein transforming the input question comprises:
identifying at least one of a term, phrase, or language pattern indicative of elided information content in the input question that is relevant to the underlying question being asked by the input question and is missing in the input question; inserting the elided information content into the input question to generate a modified input question; in response to determining that the modified input question requires reformatting, reformatting the input question into a logically correct input question; and outputting the logically correct input question as the transformed question. 8. The method of claim 7, wherein identifying at least one of a term, phrase, or language pattern indicative of elided information content in the input question comprises identifying at least one of an elided focus, an elided verb, or an elided noun phrase. 9. The method of claim 7, wherein inserting the elided information content into the input question to generate a modified input question comprises analyzing at least one of a domain or a context associated with the input question to determine the elided information content to be inserted into the input question. 10. The method of claim 6, wherein the elided information content in the input question comprises at least one of an elided focus, an elided verb, or an elided noun phrase. 11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device implementing a Question Answering (QA) system, causes the computing device to:
receive, by the QA system, an input question for which an answer is sought by a submitter of the input question; input, by the QA system, the input question to a pre-processor flow path comprising at least one pre-processor; transform, by the at least one pre-processor, the input question into a transformed question by correcting errors in a formulation of the input question that are determined to be detrimental to efficient and accurate processing of the input question by a QA system pipeline of the QA system; input the transformed question to the QA system pipeline of the QA system; and process the transformed question via the QA system pipeline to generate and output at least one answer to the input question. 12. The computer program product of claim 11, wherein the at least one pre-processor comprises a superfluous information pre-processor that identifies superfluous information content in the input question and transforms the superfluous information content. 13. The computer program product of claim 12, wherein the computer readable program further causes the computing device to transform the input question at last by:
identifying at least one of a term, phrase, or language pattern indicative of superfluous information content in the input question that is not relevant to the underlying question being asked by the input question; removing the superfluous information content from the input question to generate a modified input question; in response to determining that the modified input question requires reformatting, reformatting the input question into a logically correct input question; and outputting the logically correct input question as the transformed question. 14. The computer program product of claim 13, wherein the computer readable program further causes the computing device to identify at least one of a term, phrase, or language pattern indicative of superfluous information content in the input question at least by identifying at least one of a vocative clause or a common phrase in the input question. 15. The computer program product of claim 12, wherein the superfluous information content in the input question comprises at least one of a vocative clause or a common phrase in the input question. 16. The computer program product of claim 11, wherein the at least one pre-processor comprises an elided information pre-processor that identifies elided information content associated with the input question and transforms the input question based on the identified elided information. 17. The computer program product of claim 16, wherein the computer readable program further causes the computing device to transform the input question at least by:
identifying at least one of a term, phrase, or language pattern indicative of elided information content in the input question that is relevant to the underlying question being asked by the input question and is missing in the input question; inserting the elided information content into the input question to generate a modified input question; in response to determining that the modified input question requires reformatting, reformatting the input question into a logically correct input question; and outputting the logically correct input question as the transformed question. 18. The computer program product of claim 17, wherein the computer readable program further causes the computing device to insert the elided information content into the input question to generate a modified input question at least by analyzing at least one of a domain or a context associated with the input question to determine the elided information content to be inserted into the input question. 19. The computer program product of claim 16, wherein the elided information content in the input question comprises at least one of an elided focus, an elided verb, or an elided noun phrase. 20. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor implementing a Question Answering (QA) system, cause the processor to: receive, by the QA system, an input question for which an answer is sought by a submitter of the input question; input, by the QA system, the input question to a pre-processor flow path comprising at least one pre-processor; transform, by the at least one pre-processor, the input question into a transformed question by correcting errors in a formulation of the input question that are determined to be detrimental to efficient and accurate processing of the input question by a QA system pipeline of the QA system; input the transformed question to the QA system pipeline of the QA system; and process the transformed question via the QA system pipeline to generate and output at least one answer to the input question. | 2,100 |
4,922 | 13,910,743 | 2,185 | A chassis comprises a backplane comprising a switch fabric compatible with peripheral component interconnect express (PCI-E) and configured to support communication between a plurality of module slots, a module slot compatible with PCI-E and disposed on the backplane, a cavity disposed adjacent to the module slot and having a width greater than or equal to a width of the module slot and a height greater than or equal to a height of the module slot, and a device connection interface located in the cavity and configured to support connection of at least one PCI-E compatible module to the switch fabric via the module slot. | 1. A chassis, comprising:
a backplane comprising a switch fabric compatible with peripheral component interconnect express (PCI-E) and configured to support communication between a plurality of module slots; a module slot compatible with PCI-E and disposed on the backplane; a cavity disposed adjacent to the module slot and having a width greater than or equal to a width of the module slot and a height greater than or equal to a height of the module slot; and a device connection interface located in the cavity and configured to support connection of at least one PCI-E compatible module to the switch fabric via the module slot. 2. The chassis of claim 1, wherein the module slot is a system slot configured to support connection of an embedded controller or a remote cabled controller to the switch fabric. 3. The chassis of claim 2, wherein the cavity is located on a first side of the system slot, and the chassis further comprises a plurality of peripheral slots compatible with PCI-E and disposed on a second side of the system slot opposite the first side. 4. The chassis of claim 2, further comprising a cabled PCI-E interface module connected to the system slot and comprising a switch compatible with PCI-E and configured to connect the device connection interface to the system slot. 5. The chassis of claim 4, wherein the cabled PCI-E interface module comprises a cabled target adapter. 6. The chassis of claim 4, wherein the switch is configured to support concurrent operation of the remote cabled controller connected to the system slot and at least one peripheral device connected to the device connection interface. 7. The chassis of claim 4, wherein the switch communicates with the backplane via a plurality of PCI-E lanes and bridges a first subset of the lanes to at least one cable port of the cabled PCI-E interface and bridges a second subset of the lanes to the device connection interface. 8. The chassis of claim 4, wherein the device connection interface comprises a mezzanine card connected to the cabled PCI-E interface module via a mezzanine connector. 9. The chassis of claim 8, wherein the cabled PCI-E interface module comprises a first printed circuit board (PCB) and the mezzanine card comprises a second PCB arranged substantially perpendicular to the first PCB. 10. The chassis of claim 9, wherein the device connection interface further comprises at least one module slot disposed on the second PCB and configured to receive a PCI-E compatible module. 11. The chassis of claim 10, wherein the at least one module slot is configured to receive a PCI-E compatible module for input/output expansion of the chassis. 12. The chassis of claim 8, wherein the cabled PCI-E interface module comprises a first printed circuit board (PCB) and the mezzanine card comprises a second PCB arranged substantially parallel to the first PCB. 13. The chassis of claim 12, wherein the device connection interface comprises a connector for a peripheral module and the connector is located on a side of the second PCB proximate the first PCB. 14. The chassis of claim 12, wherein the cavity has a width approximately equal to a width of the module slot. 15. The chassis of claim 12, further comprising a power supply mounted on the second PCB and a power connector connected to the second PCB. 16. The chassis of claim 15, wherein the power supply receives power from the system slot via the cabled PCI-E interface module and the mezzanine connector or through a dedicated power cable or connector. 17. The chassis of claim 15, wherein the power supply is located on a side of the second PCB opposite the first PCB. 18. The chassis of claim 1, wherein the chassis is a compact PCI express (cPCI-E) chassis. 19. The chassis of claim 1, wherein the chassis is a PCI-E eXtensions for instrumentation (PXI-E) chassis. 20. The chassis of claim 1, further comprising a cooling facility configured to generate airflow across the cavity. | A chassis comprises a backplane comprising a switch fabric compatible with peripheral component interconnect express (PCI-E) and configured to support communication between a plurality of module slots, a module slot compatible with PCI-E and disposed on the backplane, a cavity disposed adjacent to the module slot and having a width greater than or equal to a width of the module slot and a height greater than or equal to a height of the module slot, and a device connection interface located in the cavity and configured to support connection of at least one PCI-E compatible module to the switch fabric via the module slot.1. A chassis, comprising:
a backplane comprising a switch fabric compatible with peripheral component interconnect express (PCI-E) and configured to support communication between a plurality of module slots; a module slot compatible with PCI-E and disposed on the backplane; a cavity disposed adjacent to the module slot and having a width greater than or equal to a width of the module slot and a height greater than or equal to a height of the module slot; and a device connection interface located in the cavity and configured to support connection of at least one PCI-E compatible module to the switch fabric via the module slot. 2. The chassis of claim 1, wherein the module slot is a system slot configured to support connection of an embedded controller or a remote cabled controller to the switch fabric. 3. The chassis of claim 2, wherein the cavity is located on a first side of the system slot, and the chassis further comprises a plurality of peripheral slots compatible with PCI-E and disposed on a second side of the system slot opposite the first side. 4. The chassis of claim 2, further comprising a cabled PCI-E interface module connected to the system slot and comprising a switch compatible with PCI-E and configured to connect the device connection interface to the system slot. 5. The chassis of claim 4, wherein the cabled PCI-E interface module comprises a cabled target adapter. 6. The chassis of claim 4, wherein the switch is configured to support concurrent operation of the remote cabled controller connected to the system slot and at least one peripheral device connected to the device connection interface. 7. The chassis of claim 4, wherein the switch communicates with the backplane via a plurality of PCI-E lanes and bridges a first subset of the lanes to at least one cable port of the cabled PCI-E interface and bridges a second subset of the lanes to the device connection interface. 8. The chassis of claim 4, wherein the device connection interface comprises a mezzanine card connected to the cabled PCI-E interface module via a mezzanine connector. 9. The chassis of claim 8, wherein the cabled PCI-E interface module comprises a first printed circuit board (PCB) and the mezzanine card comprises a second PCB arranged substantially perpendicular to the first PCB. 10. The chassis of claim 9, wherein the device connection interface further comprises at least one module slot disposed on the second PCB and configured to receive a PCI-E compatible module. 11. The chassis of claim 10, wherein the at least one module slot is configured to receive a PCI-E compatible module for input/output expansion of the chassis. 12. The chassis of claim 8, wherein the cabled PCI-E interface module comprises a first printed circuit board (PCB) and the mezzanine card comprises a second PCB arranged substantially parallel to the first PCB. 13. The chassis of claim 12, wherein the device connection interface comprises a connector for a peripheral module and the connector is located on a side of the second PCB proximate the first PCB. 14. The chassis of claim 12, wherein the cavity has a width approximately equal to a width of the module slot. 15. The chassis of claim 12, further comprising a power supply mounted on the second PCB and a power connector connected to the second PCB. 16. The chassis of claim 15, wherein the power supply receives power from the system slot via the cabled PCI-E interface module and the mezzanine connector or through a dedicated power cable or connector. 17. The chassis of claim 15, wherein the power supply is located on a side of the second PCB opposite the first PCB. 18. The chassis of claim 1, wherein the chassis is a compact PCI express (cPCI-E) chassis. 19. The chassis of claim 1, wherein the chassis is a PCI-E eXtensions for instrumentation (PXI-E) chassis. 20. The chassis of claim 1, further comprising a cooling facility configured to generate airflow across the cavity. | 2,100 |
4,923 | 12,042,451 | 2,123 | A platform used for capturing knowledge. More specifically, a framework configured to capture expert knowledge (e.g., of trained and/or skilled workers) for future instructional purposes (e.g., training of a younger, or less experienced, workforce). The platform comprises a knowledge recorder, instructional design tool, standardized XML, and gaming engine. The knowledge recorder is configured to capture knowledge of a user, which is transferable using a standardized XML format. The instructional design tool is configured to visually model a gaming scenario in order to expose and define logical situations based on the captured knowledge. | 1. A platform comprising:
a knowledge recorder configured to capture knowledge of a user, wherein the captured knowledge is transferable using a standardized XML format; and an instructional design tool configured to visually model a gaming scenario in order to expose and define logical situations based on the captured knowledge. 2. The platform of claim 1, wherein the instructional design tool is configured to transfer the visual model using the standardized XML format, which is fed to a gaming engine. 3. The platform of claim 1, wherein the knowledge recorder includes a Graphical User Interface that is configured to allow the user to capture process flow/series of task and their relationship, without an understanding of an underlying XML model. 4. The platform of claim 1, wherein the knowledge recorder includes a set of generic templates for conducting interviews which are transferable to the instructional design tool via the standardized XML format. 5. The platform of claim 4, wherein the templates are customizable and include selectable icons presented in a decision tree format. 6. The platform of claim 5, wherein the knowledge recorder accepts external embedded resources. 7. The platform of claim 1, wherein the knowledge recorder and instructional design tool are platform independent. 8. The platform of claim 1, wherein the instructional design tool is an eclipse-based RCP plug-in. 9. The platform of claim 1, wherein the knowledge recorder provides the captured knowledge to the instructional design tool in a standardized XML format. 10. The platform of claim 1, wherein the platform is created on a computer infrastructure. 11. The platform of claim 1, wherein the standardized XML format includes defined objects and assessment against goals. 12. A system for deploying an application for immersive learning comprising a computer infrastructure being operable to:
capture knowledge of a user via the use of templates that have selectable icons, the captured knowledge is transferable via a standardized XML format; and provide a visual model to expose and define logical situations based on the captured knowledge for implementation in a gaming scenario. 13. The system of claim 12, wherein the computer infrastructure is at least one of maintained, deployed, supported and created by a service provider for a fee. 14. The system of claim 12, wherein the selectable icons are dependent on a selection of the user. 15. The system of claim 12, wherein the selectable icons are based on a hierarchical format. 16. The system of claim 12, wherein the visual model is transferable to a gaming model layer via the standardized XML format. 17. The system of claim 12, wherein the computer infrastructure is operable to capture process flow/series of task and their relationship, without an understanding of an underlying XML model. 18. The system of claim 12, wherein the capturing of the knowledge and providing of the visual model are platform independent. 19. The system of claim 12, wherein the computer infrastructure is operable to use the captured knowledge and visual model to create a gaming environment, via a standardized XML feed using the standardized XML format. 20. A method for deploying an application for immersive learning comprising:
providing a computer infrastructure being operable to:
capture knowledge of a user and transfer the knowledge to a designer via a standardized XML format; and
model a gaming scenario using the standardized XML format to expose and define logical situations based on the captured knowledge. 21. The method of claim 20, wherein the computer infrastructure is at least one of maintained, deployed, supported and created by a service provider. 22. The method of claim 20, wherein the computer infrastructure is operable to capture the knowledge by use of the selectable icons which are dependent on a selection of the user. 23. The method of claim 22, wherein the selectable icons are based on a hierarchical format. 24. The method of claim 20, wherein the model is transferable to a gaming model layer via the standardized XML format. 25. A computer program product for capturing knowledge, the computer program product comprising:
a computer readable media; first program instructions to capture knowledge; second program instructions to model a gaming scenario to expose and define logical situations based on the captured knowledge; and third program instructions to build a learning game based on the model and the captured knowledge, wherein the first, second and third program instructions are stored on the computer readable media, and the first and second program instructions are transferable via a standardized XML format, which is platform independent. | A platform used for capturing knowledge. More specifically, a framework configured to capture expert knowledge (e.g., of trained and/or skilled workers) for future instructional purposes (e.g., training of a younger, or less experienced, workforce). The platform comprises a knowledge recorder, instructional design tool, standardized XML, and gaming engine. The knowledge recorder is configured to capture knowledge of a user, which is transferable using a standardized XML format. The instructional design tool is configured to visually model a gaming scenario in order to expose and define logical situations based on the captured knowledge.1. A platform comprising:
a knowledge recorder configured to capture knowledge of a user, wherein the captured knowledge is transferable using a standardized XML format; and an instructional design tool configured to visually model a gaming scenario in order to expose and define logical situations based on the captured knowledge. 2. The platform of claim 1, wherein the instructional design tool is configured to transfer the visual model using the standardized XML format, which is fed to a gaming engine. 3. The platform of claim 1, wherein the knowledge recorder includes a Graphical User Interface that is configured to allow the user to capture process flow/series of task and their relationship, without an understanding of an underlying XML model. 4. The platform of claim 1, wherein the knowledge recorder includes a set of generic templates for conducting interviews which are transferable to the instructional design tool via the standardized XML format. 5. The platform of claim 4, wherein the templates are customizable and include selectable icons presented in a decision tree format. 6. The platform of claim 5, wherein the knowledge recorder accepts external embedded resources. 7. The platform of claim 1, wherein the knowledge recorder and instructional design tool are platform independent. 8. The platform of claim 1, wherein the instructional design tool is an eclipse-based RCP plug-in. 9. The platform of claim 1, wherein the knowledge recorder provides the captured knowledge to the instructional design tool in a standardized XML format. 10. The platform of claim 1, wherein the platform is created on a computer infrastructure. 11. The platform of claim 1, wherein the standardized XML format includes defined objects and assessment against goals. 12. A system for deploying an application for immersive learning comprising a computer infrastructure being operable to:
capture knowledge of a user via the use of templates that have selectable icons, the captured knowledge is transferable via a standardized XML format; and provide a visual model to expose and define logical situations based on the captured knowledge for implementation in a gaming scenario. 13. The system of claim 12, wherein the computer infrastructure is at least one of maintained, deployed, supported and created by a service provider for a fee. 14. The system of claim 12, wherein the selectable icons are dependent on a selection of the user. 15. The system of claim 12, wherein the selectable icons are based on a hierarchical format. 16. The system of claim 12, wherein the visual model is transferable to a gaming model layer via the standardized XML format. 17. The system of claim 12, wherein the computer infrastructure is operable to capture process flow/series of task and their relationship, without an understanding of an underlying XML model. 18. The system of claim 12, wherein the capturing of the knowledge and providing of the visual model are platform independent. 19. The system of claim 12, wherein the computer infrastructure is operable to use the captured knowledge and visual model to create a gaming environment, via a standardized XML feed using the standardized XML format. 20. A method for deploying an application for immersive learning comprising:
providing a computer infrastructure being operable to:
capture knowledge of a user and transfer the knowledge to a designer via a standardized XML format; and
model a gaming scenario using the standardized XML format to expose and define logical situations based on the captured knowledge. 21. The method of claim 20, wherein the computer infrastructure is at least one of maintained, deployed, supported and created by a service provider. 22. The method of claim 20, wherein the computer infrastructure is operable to capture the knowledge by use of the selectable icons which are dependent on a selection of the user. 23. The method of claim 22, wherein the selectable icons are based on a hierarchical format. 24. The method of claim 20, wherein the model is transferable to a gaming model layer via the standardized XML format. 25. A computer program product for capturing knowledge, the computer program product comprising:
a computer readable media; first program instructions to capture knowledge; second program instructions to model a gaming scenario to expose and define logical situations based on the captured knowledge; and third program instructions to build a learning game based on the model and the captured knowledge, wherein the first, second and third program instructions are stored on the computer readable media, and the first and second program instructions are transferable via a standardized XML format, which is platform independent. | 2,100 |
4,924 | 15,270,616 | 2,191 | Embodiments of the present invention address deficiencies of the art in respect to wiring components in a component based application and provide a method, system and computer program product for heuristically assembling components in a component based application. In one embodiment, a data processing system configured to assemble component based applications can include a component aggregation application including an application builder configured to assemble components into a component based application. The system further can include a property broker coupled to the component aggregation application and configured to apply a wiring scheme to selected components in a component based application. Finally, a collaborative heuristic integration matching engine (CHIME) can be coupled to the property broker and a data store of behaviorally derived data, the CHIME including program enabled to suggest components for assembly in a component based application based upon behaviorally derived data in the data store. | 1-17. (canceled) 18. A computer-implemented method for constructing a component based application, comprising:
receiving a selection of a component for inclusion within the component based application; generating, based upon the selected component, a recommendation of an additional component for inclusion within the component based application; identifying, based upon the selected component and the additional component, a wiring scheme that aggregates the selected component and the additional component; and assembling the component based application using the selected component, the additional component, and the wiring scheme, wherein the recommendation of the additional component is based upon prior mutual interactions between the selected component and the recommended additional component in a previously-assembled component based application. 19. The method of claim 18, wherein
the identifying of the wiring scheme is based upon a stored previous length of a life cycle for other applications using the wiring scheme in previously-assembled component based applications. 20. The method of claim 18, wherein
a complete set of components are recommended for inclusion within the component based application based upon the identified wiring scheme. 21. The method of claim 20, wherein
the assembling includes the complete set of components. 22. The method of claim 18, wherein
the recommendation is based a match between data outputted from the selected component to data inputted into the recommended additional component. 23. The method of claim 18, wherein
the recommendation of the additional component is based upon prior user assessments. 24. A computer hardware system configured to construct a component based application, comprising:
a computer hardware processor, wherein the computer hardware processor is configured to initiate the following executable operations:
receiving a selection of a component for inclusion within the component based application;
generating, based upon the selected component, a recommendation of an additional component for inclusion within the component based application;
identifying, based upon the selected component and the additional component, a wiring scheme that aggregates the selected component and the additional component; and
assembling the component based application using the selected component, the additional component, and the wiring scheme, wherein
the recommendation of the additional component is based upon prior mutual interactions between the selected component and the recommended additional component in a previously-assembled component based application. 25. The system of claim 24, wherein
the identifying of the wiring scheme is based upon a stored previous length of a life cycle for other applications using the wiring scheme in previously-assembled component based applications. 26. The system of claim 24, wherein
a complete set of components are recommended for inclusion within the component based application based upon the identified wiring scheme. 27. The system of claim 26, wherein
the assembling includes the complete set of components. 28. The system of claim 24, wherein
the recommendation is based a match between data outputted from the selected component to data inputted into the recommended additional component. 29. The system of claim 24, wherein
the recommendation of the additional component is based upon prior user assessments. 30. A computer program product, comprising
a hardware storage device having stored therein computer usable program code, wherein the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform:
receiving a selection of a component for inclusion within the component based application;
generating, based upon the selected component, a recommendation of an additional component for inclusion within the component based application;
identifying, based upon the selected component and the additional component, a wiring scheme that aggregates the selected component and the additional component; and
assembling the component based application using the selected component, the additional component, and the wiring scheme, wherein
the recommendation of the additional component is based upon prior mutual interactions between the selected component and the recommended additional component in a previously-assembled component based application. 31. The computer program product of claim 30, wherein
the identifying of the wiring scheme is based upon a stored previous length of a life cycle for other applications using the wiring scheme in previously-assembled component based applications. 32. The computer program product of claim 30, wherein
a complete set of components are recommended for inclusion within the component based application based upon the identified wiring scheme. 33. The computer program product of claim 32, wherein
the assembling includes the complete set of components. 34. The computer program product of claim 30, wherein
the recommendation is based a match between data outputted from the selected component to data inputted into the recommended additional component. 35. The computer program product of claim 30, wherein
the recommendation of the additional component is based upon prior user assessments | Embodiments of the present invention address deficiencies of the art in respect to wiring components in a component based application and provide a method, system and computer program product for heuristically assembling components in a component based application. In one embodiment, a data processing system configured to assemble component based applications can include a component aggregation application including an application builder configured to assemble components into a component based application. The system further can include a property broker coupled to the component aggregation application and configured to apply a wiring scheme to selected components in a component based application. Finally, a collaborative heuristic integration matching engine (CHIME) can be coupled to the property broker and a data store of behaviorally derived data, the CHIME including program enabled to suggest components for assembly in a component based application based upon behaviorally derived data in the data store.1-17. (canceled) 18. A computer-implemented method for constructing a component based application, comprising:
receiving a selection of a component for inclusion within the component based application; generating, based upon the selected component, a recommendation of an additional component for inclusion within the component based application; identifying, based upon the selected component and the additional component, a wiring scheme that aggregates the selected component and the additional component; and assembling the component based application using the selected component, the additional component, and the wiring scheme, wherein the recommendation of the additional component is based upon prior mutual interactions between the selected component and the recommended additional component in a previously-assembled component based application. 19. The method of claim 18, wherein
the identifying of the wiring scheme is based upon a stored previous length of a life cycle for other applications using the wiring scheme in previously-assembled component based applications. 20. The method of claim 18, wherein
a complete set of components are recommended for inclusion within the component based application based upon the identified wiring scheme. 21. The method of claim 20, wherein
the assembling includes the complete set of components. 22. The method of claim 18, wherein
the recommendation is based a match between data outputted from the selected component to data inputted into the recommended additional component. 23. The method of claim 18, wherein
the recommendation of the additional component is based upon prior user assessments. 24. A computer hardware system configured to construct a component based application, comprising:
a computer hardware processor, wherein the computer hardware processor is configured to initiate the following executable operations:
receiving a selection of a component for inclusion within the component based application;
generating, based upon the selected component, a recommendation of an additional component for inclusion within the component based application;
identifying, based upon the selected component and the additional component, a wiring scheme that aggregates the selected component and the additional component; and
assembling the component based application using the selected component, the additional component, and the wiring scheme, wherein
the recommendation of the additional component is based upon prior mutual interactions between the selected component and the recommended additional component in a previously-assembled component based application. 25. The system of claim 24, wherein
the identifying of the wiring scheme is based upon a stored previous length of a life cycle for other applications using the wiring scheme in previously-assembled component based applications. 26. The system of claim 24, wherein
a complete set of components are recommended for inclusion within the component based application based upon the identified wiring scheme. 27. The system of claim 26, wherein
the assembling includes the complete set of components. 28. The system of claim 24, wherein
the recommendation is based a match between data outputted from the selected component to data inputted into the recommended additional component. 29. The system of claim 24, wherein
the recommendation of the additional component is based upon prior user assessments. 30. A computer program product, comprising
a hardware storage device having stored therein computer usable program code, wherein the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform:
receiving a selection of a component for inclusion within the component based application;
generating, based upon the selected component, a recommendation of an additional component for inclusion within the component based application;
identifying, based upon the selected component and the additional component, a wiring scheme that aggregates the selected component and the additional component; and
assembling the component based application using the selected component, the additional component, and the wiring scheme, wherein
the recommendation of the additional component is based upon prior mutual interactions between the selected component and the recommended additional component in a previously-assembled component based application. 31. The computer program product of claim 30, wherein
the identifying of the wiring scheme is based upon a stored previous length of a life cycle for other applications using the wiring scheme in previously-assembled component based applications. 32. The computer program product of claim 30, wherein
a complete set of components are recommended for inclusion within the component based application based upon the identified wiring scheme. 33. The computer program product of claim 32, wherein
the assembling includes the complete set of components. 34. The computer program product of claim 30, wherein
the recommendation is based a match between data outputted from the selected component to data inputted into the recommended additional component. 35. The computer program product of claim 30, wherein
the recommendation of the additional component is based upon prior user assessments | 2,100 |
4,925 | 14,087,794 | 2,169 | There are provided methods and systems to retrieve search result information and digital content. The system receives input information identifying a plurality of data sources from which to retrieve digital content. Next the system retrieves search result information, over the network, from the plurality of data sources based on the input information. Next the system retrieves the digital content, over the network, from at least one of the data sources based on the search result information. Finally, the system communicates digital content to a client machine. | 1. A method comprising :
receiving input information identifying a plurality of data sources from which to retrieve digital content; retrieving search result information, over a network, from the plurality of data sources based on the input information; retrieving the digital content, over the network, from at least one of the data sources based on the search result information; and communicating the digital content to a client machine. 2. The method of claim 1, further including communicating the digital content from the client machine to a portable client machine. 3. The method of claim 1, wherein the receiving of the input information includes at least one of receiving artist information, receiving creation information, or receiving category information. 4. The method of claim 3, wherein the receiving of the artist information includes at least one of receiving a request for a type of artist, receiving a request for an artist, receiving a request for ticket information, or receiving a request for digital sample information, wherein the receiving of the creation information includes at least one of receiving a request for digital content that is released or receiving a request for a multimedia presentation. 5. The method of claim 1, wherein the retrieving of the search result information includes at least one of communicating a query to at least one data source to receive the search result information or communicating a subscription to at least one data source to receive the search result information. 6. The method of claim 1, wherein the retrieving of the search result information is performed periodically based on a predetermined period. 7. The method of claim 1, wherein the retrieving of the search result information includes filtering the search result information based on a media type, wherein the media type includes at least one of a music video, a digital sample, or a streaming video. 8. The method of claim 1, including determining whether payment is required after the digital content is retrieved from the data source. 9. The method of claim 1, wherein the retrieving the digital content includes at least one of communicating a query to at least one data source to receive the digital content or communicating a subscription to at least one data source to receive the digital content. 10. The method of the claim 1, wherein the retrieving of the digital content includes communicating a subscription to at least one data source and receiving the digital content that is pushed from the data source based on a recommendation of the data source. 11. The method of claim 1, wherein the retrieving of the digital content includes identifying whether payment is required to retrieve the digital content from the data source. 12. The method of claim 1, wherein the retrieving of the digital content includes purchasing the digital content. 13. The method of claim 1, wherein the retrieving of the digital content includes determining whether a predetermined criterion is exceeded. 14. The method of claim 13, wherein the predetermined criterion includes at least one of a storage limitation or a purchase limitation. 15. The method of claim 1, including communicating, on a predetermined communication channel, an alert that the digital content has been retrieved. 16. A system comprising:
a configuration module to receive input information to identify a plurality of data sources from which to retrieve digital content and to retrieve search result information, over a network, from the plurality of data sources based on the input information; and a processing module to retrieve the digital content, over the network, from at least one of the data sources based on the search result information and to communicate the digital content to a client machine. 17. The system of claim 16, further including a distribution module, at the client machine, to communicate the digital content to a portable client machine. 18. The system of claim 16, wherein the input information includes at least one of artist information, creation information, and category information. 19. The system of claim 18, wherein the artist information includes at least one of a request for a type of artist, a request for an artist, a request for ticket information, and a request for digital sample information, wherein the creation information is includes at least one of a request for digital content that is released and a request for a multimedia presentation. 20. The system of claim 16, wherein the configuration module is to communicate a query to at least one data source to receive the search result information and wherein the configuration module communicates a subscription to at least one data source to receive the search result information. | There are provided methods and systems to retrieve search result information and digital content. The system receives input information identifying a plurality of data sources from which to retrieve digital content. Next the system retrieves search result information, over the network, from the plurality of data sources based on the input information. Next the system retrieves the digital content, over the network, from at least one of the data sources based on the search result information. Finally, the system communicates digital content to a client machine.1. A method comprising :
receiving input information identifying a plurality of data sources from which to retrieve digital content; retrieving search result information, over a network, from the plurality of data sources based on the input information; retrieving the digital content, over the network, from at least one of the data sources based on the search result information; and communicating the digital content to a client machine. 2. The method of claim 1, further including communicating the digital content from the client machine to a portable client machine. 3. The method of claim 1, wherein the receiving of the input information includes at least one of receiving artist information, receiving creation information, or receiving category information. 4. The method of claim 3, wherein the receiving of the artist information includes at least one of receiving a request for a type of artist, receiving a request for an artist, receiving a request for ticket information, or receiving a request for digital sample information, wherein the receiving of the creation information includes at least one of receiving a request for digital content that is released or receiving a request for a multimedia presentation. 5. The method of claim 1, wherein the retrieving of the search result information includes at least one of communicating a query to at least one data source to receive the search result information or communicating a subscription to at least one data source to receive the search result information. 6. The method of claim 1, wherein the retrieving of the search result information is performed periodically based on a predetermined period. 7. The method of claim 1, wherein the retrieving of the search result information includes filtering the search result information based on a media type, wherein the media type includes at least one of a music video, a digital sample, or a streaming video. 8. The method of claim 1, including determining whether payment is required after the digital content is retrieved from the data source. 9. The method of claim 1, wherein the retrieving the digital content includes at least one of communicating a query to at least one data source to receive the digital content or communicating a subscription to at least one data source to receive the digital content. 10. The method of the claim 1, wherein the retrieving of the digital content includes communicating a subscription to at least one data source and receiving the digital content that is pushed from the data source based on a recommendation of the data source. 11. The method of claim 1, wherein the retrieving of the digital content includes identifying whether payment is required to retrieve the digital content from the data source. 12. The method of claim 1, wherein the retrieving of the digital content includes purchasing the digital content. 13. The method of claim 1, wherein the retrieving of the digital content includes determining whether a predetermined criterion is exceeded. 14. The method of claim 13, wherein the predetermined criterion includes at least one of a storage limitation or a purchase limitation. 15. The method of claim 1, including communicating, on a predetermined communication channel, an alert that the digital content has been retrieved. 16. A system comprising:
a configuration module to receive input information to identify a plurality of data sources from which to retrieve digital content and to retrieve search result information, over a network, from the plurality of data sources based on the input information; and a processing module to retrieve the digital content, over the network, from at least one of the data sources based on the search result information and to communicate the digital content to a client machine. 17. The system of claim 16, further including a distribution module, at the client machine, to communicate the digital content to a portable client machine. 18. The system of claim 16, wherein the input information includes at least one of artist information, creation information, and category information. 19. The system of claim 18, wherein the artist information includes at least one of a request for a type of artist, a request for an artist, a request for ticket information, and a request for digital sample information, wherein the creation information is includes at least one of a request for digital content that is released and a request for a multimedia presentation. 20. The system of claim 16, wherein the configuration module is to communicate a query to at least one data source to receive the search result information and wherein the configuration module communicates a subscription to at least one data source to receive the search result information. | 2,100 |
4,926 | 14,212,107 | 2,163 | A publish/subscribe system is described that can adjust to provide high performance for diverse application environments through an attribute structure based on predicates of a subscription, each attribute structure with one or more buckets to which attribute values of a subscription may be stored. Various data structures can be used in the attribute structure to locate the buckets containing the subscriptions. The data structures selected for each subscription are based on the attribute type and predicate operators of the subscription. | 1. A publish/subscribe system comprising:
a database storing subscriptions; and a database manager that when executed by one or more processors directs the one or more processors to:
perform an update action with respect to a subscription to the database by:
using attributes of the subscription to follow a path in a hierarchical subscription data structure stored in the database until a lowest level is reached where there are still non-empty attributes; and
performing the update action at an appropriate bucket of the database determined by the following of the path in the hierarchical subscription data structure; and
search for one or more matching subscriptions for an event by:
using the hierarchical subscription data structure to determine which buckets of the subscription structure are to be searched; and
searching the buckets of the subscription structure which are to be searched for the one or more subscriptions that match the event. 2. The system according to claim 1, wherein performing the update action at the appropriate bucket comprises inserting or deleting the subscription into/from the appropriate bucket. 3. The system according to claim 1, for an attribute of the subscription not used in the path in the hierarchical subscription data structure, the database manager, when executed by the one or more processors, directs the one or more processors to select an attribute data structure based on the subscription predicates that use this attribute. 4. The system according to claim 1, for an attribute of the subscription not used in the path in the hierarchical subscription data structure, the database manager, when executed by the one or more processors, directs the one or more processors to: select a data structure for the attribute of the subscription not used in the path by:
determining whether subscription predicates that use this attribute specify a range of values; a substring and/or suffix operators; an exact match; or string matching; and in response to a determination that the attribute predicates specify the range of values, selecting a priority search tree or an interval tree; in response to a determination that the attribute predicates specify the substring and/or suffix operators, selecting a suffix tree; in response to a determination that the attribute predicates specify the exact match, selecting a red-black tree; in response to a determination that the attribute predicates specify the string matching, selecting a suffix tree or an Aho-Corasick tree. 5. The system according to claim 4, wherein the database manager, when executed by the one or more processors, directs the one or more processors to select the data structure for the attribute of the subscription not used in the path further by:
determining whether subscription predicates that use this attribute specify an inequality; a membership in a set; or a non-membership in a set; and in response to a determination that the attribute types of the subscription include the predicate specifying an inequality, the membership in a set, or the non-membership in a set, selecting a priority search tree. 6. The system according to claim 4, wherein when a domain cardinality of the predicate specifying the range of values is not known at a time of initialization, the database manager, when executed by the one or more processors, directs the one or more processors to
select a red-black priority search tree data structure for the subscription. 7. The system according to claim 4, wherein the interval tree comprises end-point lists that are stored as sorted arrays. 8. The system according to claim 1, wherein the attributes of the subscription are ordered from least occurring to most frequently occurring based on a frequency of occurrence of the attributes in the subscriptions in the database. 9. The system according to claim 1, further comprising a single hash table stored on a computer-readable storage medium that tracks a plurality of subscription attribute structures stored in the database. 10. A computer-readable storage medium having instructions stored thereon that, when executed by a processor, perform a method comprising:
in response to receiving a request to perform an update action with respect to a subscription, performing the update action with respect to the subscription to the database by:
using attributes of the subscription to follow a path in a hierarchical subscription data structure stored in the database until a lowest level is reached where there are still non-empty attributes; and
performing the update action at an appropriate bucket of the database determined by the following of the path in the hierarchical subscription data structure; and
in response to receiving a request to process an event, searching for one or more matching subscriptions for the event by:
using the hierarchical subscription data structure to determine which buckets of the subscription structure are to be searched; and
searching the buckets of the subscription structure which are to be searched for the one or more subscriptions that match the event. 11. The medium according to claim 10, wherein performing the update action at the appropriate bucket comprises inserting or deleting the subscription into/from the appropriate bucket. 12. The medium according to claim 10, wherein the method further comprises, for an attribute of the subscription not used in the path in the hierarchical subscription data structure, selecting an attribute data structure based on the subscription predicates that use this attribute. 13. The medium according to claim 10, wherein the method further comprises, for an attribute of the subscription not used in the path in the hierarchical subscription data structure, selecting the data structure for the attribute of the subscription not used in the path by:
determining whether the subscription predicates that use this attribute specify a range of values; a substring and/or suffix operators; an exact match; or string matching; and in response to a determination that the attribute predicates specify the range of values, selecting a priority search tree or an interval tree; in response to a determination that the attribute predicates specify the substring and/or suffix operators, selecting a suffix tree; in response to a determination that the attribute predicates specify the exact match, selecting a red-black tree; in response to a determination that the attribute predicates specify the string matching, selecting a suffix tree or an Aho-Corasick trie. 14. The medium according to claim 13, wherein selecting the data structure for the attribute of the subscription not used in the path further comprises:
determining whether the subscription predicates that use this attribute specify an inequality; a membership in a set; or a non-membership in a set; and in response to a determination that the attribute predicates specify an inequality, membership in a set, or non-membership in a set, selecting a priority search tree. 15. The medium according to claim 13, wherein when a domain cardinality of the predicate specifying the range of values is not known at a time of initialization, the selecting of the data structure for the attribute of the subscription not used in the path comprises:
selecting a red-black priority search tree data structure for the subscription. 16. The medium according to claim 13, wherein the interval tree comprises end-point lists that are stored as sorted arrays. 17. The medium according to claim 10, wherein the attributes of the subscription are ordered from least occurring to most frequently occurring based on a frequency of occurrence of the attributes in the subscriptions in the database. 18. The medium according to claim 10, further comprising a single hash table stored on a computer-readable storage medium that tracks a plurality of subscription attribute structures stored in the database. 19. A method of selecting a data structure for an attribute of a subscription in a publish/subscribe system, the attribute comprising attribute predicates, the method comprising:
selecting an attribute data structure based on subscription predicates that use the attribute. 20. The method according to claim 19, wherein selecting the attribute data structure based on the subscription predicates that use the attribute comprises:
determining whether the attribute predicates specify a range of values, an inequality, a membership in a set, a non-membership in a set, a substring and/or suffix operators, an exact match, or a string matching; and in response to a determination that the attribute predicates specify the range of values, selecting a priority search tree or an interval tree; in response to a determination that the attribute predicates specify the inequality, the membership in the set, the non-membership in the set, selecting a priority search tree; in response to a determination that the attribute predicates specify the substring and/or suffix operators, selecting a suffix tree; in response to a determination that the attribute predicates specify the exact match, selecting a red-black tree; in response to a determination that the attribute predicates specify the string matching, selecting a suffix tree or an Aho-Corasick tree. 21. The method according to claim 20, wherein when a domain cardinality of the predicate specifying the range of values is not known at a time of initialization,
selecting a red-black priority search tree data structure for the subscription. 22. The method according to claim 20, wherein the interval tree comprises end-point lists that are stored as sorted arrays. 23. The method according to claim 20, wherein the attributes of the subscription are ordered from least occurring to most frequently occurring based on a frequency of occurrence of the attributes in the subscriptions in the database. 24. The method according to claim 20, further comprising a single hash table stored on a computer-readable storage medium that tracks a plurality of subscription attribute structures stored in the database. | A publish/subscribe system is described that can adjust to provide high performance for diverse application environments through an attribute structure based on predicates of a subscription, each attribute structure with one or more buckets to which attribute values of a subscription may be stored. Various data structures can be used in the attribute structure to locate the buckets containing the subscriptions. The data structures selected for each subscription are based on the attribute type and predicate operators of the subscription.1. A publish/subscribe system comprising:
a database storing subscriptions; and a database manager that when executed by one or more processors directs the one or more processors to:
perform an update action with respect to a subscription to the database by:
using attributes of the subscription to follow a path in a hierarchical subscription data structure stored in the database until a lowest level is reached where there are still non-empty attributes; and
performing the update action at an appropriate bucket of the database determined by the following of the path in the hierarchical subscription data structure; and
search for one or more matching subscriptions for an event by:
using the hierarchical subscription data structure to determine which buckets of the subscription structure are to be searched; and
searching the buckets of the subscription structure which are to be searched for the one or more subscriptions that match the event. 2. The system according to claim 1, wherein performing the update action at the appropriate bucket comprises inserting or deleting the subscription into/from the appropriate bucket. 3. The system according to claim 1, for an attribute of the subscription not used in the path in the hierarchical subscription data structure, the database manager, when executed by the one or more processors, directs the one or more processors to select an attribute data structure based on the subscription predicates that use this attribute. 4. The system according to claim 1, for an attribute of the subscription not used in the path in the hierarchical subscription data structure, the database manager, when executed by the one or more processors, directs the one or more processors to: select a data structure for the attribute of the subscription not used in the path by:
determining whether subscription predicates that use this attribute specify a range of values; a substring and/or suffix operators; an exact match; or string matching; and in response to a determination that the attribute predicates specify the range of values, selecting a priority search tree or an interval tree; in response to a determination that the attribute predicates specify the substring and/or suffix operators, selecting a suffix tree; in response to a determination that the attribute predicates specify the exact match, selecting a red-black tree; in response to a determination that the attribute predicates specify the string matching, selecting a suffix tree or an Aho-Corasick tree. 5. The system according to claim 4, wherein the database manager, when executed by the one or more processors, directs the one or more processors to select the data structure for the attribute of the subscription not used in the path further by:
determining whether subscription predicates that use this attribute specify an inequality; a membership in a set; or a non-membership in a set; and in response to a determination that the attribute types of the subscription include the predicate specifying an inequality, the membership in a set, or the non-membership in a set, selecting a priority search tree. 6. The system according to claim 4, wherein when a domain cardinality of the predicate specifying the range of values is not known at a time of initialization, the database manager, when executed by the one or more processors, directs the one or more processors to
select a red-black priority search tree data structure for the subscription. 7. The system according to claim 4, wherein the interval tree comprises end-point lists that are stored as sorted arrays. 8. The system according to claim 1, wherein the attributes of the subscription are ordered from least occurring to most frequently occurring based on a frequency of occurrence of the attributes in the subscriptions in the database. 9. The system according to claim 1, further comprising a single hash table stored on a computer-readable storage medium that tracks a plurality of subscription attribute structures stored in the database. 10. A computer-readable storage medium having instructions stored thereon that, when executed by a processor, perform a method comprising:
in response to receiving a request to perform an update action with respect to a subscription, performing the update action with respect to the subscription to the database by:
using attributes of the subscription to follow a path in a hierarchical subscription data structure stored in the database until a lowest level is reached where there are still non-empty attributes; and
performing the update action at an appropriate bucket of the database determined by the following of the path in the hierarchical subscription data structure; and
in response to receiving a request to process an event, searching for one or more matching subscriptions for the event by:
using the hierarchical subscription data structure to determine which buckets of the subscription structure are to be searched; and
searching the buckets of the subscription structure which are to be searched for the one or more subscriptions that match the event. 11. The medium according to claim 10, wherein performing the update action at the appropriate bucket comprises inserting or deleting the subscription into/from the appropriate bucket. 12. The medium according to claim 10, wherein the method further comprises, for an attribute of the subscription not used in the path in the hierarchical subscription data structure, selecting an attribute data structure based on the subscription predicates that use this attribute. 13. The medium according to claim 10, wherein the method further comprises, for an attribute of the subscription not used in the path in the hierarchical subscription data structure, selecting the data structure for the attribute of the subscription not used in the path by:
determining whether the subscription predicates that use this attribute specify a range of values; a substring and/or suffix operators; an exact match; or string matching; and in response to a determination that the attribute predicates specify the range of values, selecting a priority search tree or an interval tree; in response to a determination that the attribute predicates specify the substring and/or suffix operators, selecting a suffix tree; in response to a determination that the attribute predicates specify the exact match, selecting a red-black tree; in response to a determination that the attribute predicates specify the string matching, selecting a suffix tree or an Aho-Corasick trie. 14. The medium according to claim 13, wherein selecting the data structure for the attribute of the subscription not used in the path further comprises:
determining whether the subscription predicates that use this attribute specify an inequality; a membership in a set; or a non-membership in a set; and in response to a determination that the attribute predicates specify an inequality, membership in a set, or non-membership in a set, selecting a priority search tree. 15. The medium according to claim 13, wherein when a domain cardinality of the predicate specifying the range of values is not known at a time of initialization, the selecting of the data structure for the attribute of the subscription not used in the path comprises:
selecting a red-black priority search tree data structure for the subscription. 16. The medium according to claim 13, wherein the interval tree comprises end-point lists that are stored as sorted arrays. 17. The medium according to claim 10, wherein the attributes of the subscription are ordered from least occurring to most frequently occurring based on a frequency of occurrence of the attributes in the subscriptions in the database. 18. The medium according to claim 10, further comprising a single hash table stored on a computer-readable storage medium that tracks a plurality of subscription attribute structures stored in the database. 19. A method of selecting a data structure for an attribute of a subscription in a publish/subscribe system, the attribute comprising attribute predicates, the method comprising:
selecting an attribute data structure based on subscription predicates that use the attribute. 20. The method according to claim 19, wherein selecting the attribute data structure based on the subscription predicates that use the attribute comprises:
determining whether the attribute predicates specify a range of values, an inequality, a membership in a set, a non-membership in a set, a substring and/or suffix operators, an exact match, or a string matching; and in response to a determination that the attribute predicates specify the range of values, selecting a priority search tree or an interval tree; in response to a determination that the attribute predicates specify the inequality, the membership in the set, the non-membership in the set, selecting a priority search tree; in response to a determination that the attribute predicates specify the substring and/or suffix operators, selecting a suffix tree; in response to a determination that the attribute predicates specify the exact match, selecting a red-black tree; in response to a determination that the attribute predicates specify the string matching, selecting a suffix tree or an Aho-Corasick tree. 21. The method according to claim 20, wherein when a domain cardinality of the predicate specifying the range of values is not known at a time of initialization,
selecting a red-black priority search tree data structure for the subscription. 22. The method according to claim 20, wherein the interval tree comprises end-point lists that are stored as sorted arrays. 23. The method according to claim 20, wherein the attributes of the subscription are ordered from least occurring to most frequently occurring based on a frequency of occurrence of the attributes in the subscriptions in the database. 24. The method according to claim 20, further comprising a single hash table stored on a computer-readable storage medium that tracks a plurality of subscription attribute structures stored in the database. | 2,100 |
4,927 | 13,136,610 | 2,176 | A system and method for a wireless browser operating in a handheld wireless device for efficient utilization of wireless networks wireless devices resources. The browser identifies ad-server reference links in a received html webpage before the browser can request the ad-server image files from their respective servers, deletes these links and collapses corresponding cells, to create a modified webpage. The wireless browser displays the modified webpage on the device screen. The browser by removing the request and receipt of ad file images from and into the wireless device over the wireless network makes efficient use of the wireless networks. The wireless browser inputs screen size and user desired font size parameters and uses these input parameters, parses the modified webpage into screen size segments and displays the segments one at a time that enables a user to navigate from a segment to another segment to efficiently view web page content. | 1. A handheld wireless device, comprising:
a. a wireless browser operating in a handheld wireless device, the browser identifies ad-server reference links in a received html webpage before the browser can request the ad-server image files from their respective servers, deletes these links and collapses their corresponding cells, to create a modified webpage; b. the wireless browser displays the modified webpage on a screen of the wireless device, wherein the wireless browser by removing the request and receipt of ad file images from and into the wireless device over the wireless network, reduces processing in the wireless device and reduces the use of the wireless network. 2. The device as in claim 1, comprising:
the wireless browser saves the ad-server reference links, before deleting, in an ad-server list file for display of the list at bottom of the modified webpage that enables a device owner to selectively decide to click a one or more links to request, receive and view the ad file images. 3. The device as in claim 1, comprising:
a. the wireless browser inputs a user desired display screen size of the wireless device and the user desired font size parameters; b. the wireless browser, uses these input parameters, parses the modified webpage into display screen size segments and displays the segments one at a time that enables a user to navigate from a segment to another segment to view a webpage content. 4. The device as in claim 1, comprising:
a. the wireless browser identifies in the received webpage, image file links to a server from where the webpage itself has been received; b. the wireless browser, when the number of links exceed a threshold, saves these links in an image link file and deletes the links from the webpage, then displays the modified webpage on the screen of the device with the image link list file at the bottom of the modified webpage that enables a user to select, fetch and display a one or more images from the links. 5. The device as in claim 4, comprising:
the wireless browser, if the number of image files is below the threshold, fetches the images from the webpage server and displays the images on the device screen. 6. The device as in claim 1, comprising:
a. the wireless browser identifies in the received webpage, image file links to a server from where the webpage itself has been received; b. the wireless browser stops requests and receipts of the image files from these links and displays the modified webpage with the image file links that enables a device owner to read an accompanying text and then decide to request, receive and view individual image files. 7. The device as in claim 6, comprising:
the wireless browser fetches the images from the webpage server and displays the images on the device screen. 8. A method of rendering of webpage content on a screen of a wireless device, comprising the steps of:
a. using a wireless browser for rendering of a webpage on a screen of a wireless device, and receiving, by the browser, a requested web page from a server on a global network; b. identifying ad-server reference links in the webpage and deleting these links in the received webpage; c. collapsing the corresponding empty cells of the deleted links and then displaying a modified webpage on the device screen. 9. The method as in claim 8, comprising the steps of:
saving the links, before deleting, in an ad-server list and displaying the list at end of the webpage, enabling a device owner to selectively choose to view their corresponding ad file images. 10. The method as in claim 8, comprising the steps of:
a. inputting a user desired screen size of the wireless device and the user desired font size parameters; b. using the parameters, parsing the webpage into screen size segments and displaying the segments one at a time, enabling a user to move from a segment to another segment for viewing of webpage content. 11. The method as in claim 8, comprising the steps of:
a. identifying image reference links to a server from where the webpage itself has been received; b. saving these links in an image link file and deleting the links from the webpage, before displaying the modified webpage on the screen of the device. 12. The method as in claim 11, comprising the steps of:
a. displaying the image link list file at the bottom of the webpage; b. enabling a user to select, fetch, and display a one or more images of the links. 13. The method as in claim 8, comprising the steps of:
a. identifying by the wireless browser, in the received webpage, number of image file links to a server from where the webpage itself has been received; b. saving by the wireless browser these links, when the number of links exceed a threshold, in an image link file and deleting the links from the webpage, then displaying the modified webpage on the screen of the device with the image link list file at the bottom of the modified webpage, enabling a user to select, fetch and display a one or more images from the links. 14. The method as in claim 13, comprising the steps of:
fetching by the wireless browser, the images from the webpage server and displaying the images on the device screen if the number of image files is below a threshold. 15. The method as in claim 8, comprising the steps of:
a. identifying by the wireless browser, in the received webpage, image file links to a server from where the webpage itself has been received; b. stopping by the wireless browser requests and receipts of the image files from these links and displaying the modified webpage with the image file links enabling a device owner to read an accompanying text and then decide to request, receive and view individual image files. 16. A system for rendering of webpage content on a screen of a handheld wireless device, comprising:
a. a wireless browser for rendering of a webpage on a screen of a wireless handheld computing device, where the wireless browser receives, a requested web page from a server on a global network; b. the wireless browser identifies ad-server reference links in the received webpage that have been pre-stored in an ad-server list file and deletes these links in the received webpage; c. the wireless browser collapses the corresponding empty cells of the deleted links and then displays the modified webpage on the device screen. 17. The system as in claim 16, comprising:
the wireless browser parses the webpage into screen size segments and displays the segments one at a time that enables a user to move from a segment to another segment. 18. The system as in claim 16, comprising:
the browser saves the links, before deleting, that are not already in the ad-server list, in the ad-server list file. 19. The system as in claim 16, comprising:
a. the browser identifies image reference links to a server from where the webpage itself has been received; b. saves these links in an image link file and deletes the links from the webpage, and then displays the modified webpage on the screen of the device. 20. The system as in claim 19, comprising:
the browser displays the image link list file at the bottom of the webpage and enables a user to select, fetch and display a one or more images of the links. | A system and method for a wireless browser operating in a handheld wireless device for efficient utilization of wireless networks wireless devices resources. The browser identifies ad-server reference links in a received html webpage before the browser can request the ad-server image files from their respective servers, deletes these links and collapses corresponding cells, to create a modified webpage. The wireless browser displays the modified webpage on the device screen. The browser by removing the request and receipt of ad file images from and into the wireless device over the wireless network makes efficient use of the wireless networks. The wireless browser inputs screen size and user desired font size parameters and uses these input parameters, parses the modified webpage into screen size segments and displays the segments one at a time that enables a user to navigate from a segment to another segment to efficiently view web page content.1. A handheld wireless device, comprising:
a. a wireless browser operating in a handheld wireless device, the browser identifies ad-server reference links in a received html webpage before the browser can request the ad-server image files from their respective servers, deletes these links and collapses their corresponding cells, to create a modified webpage; b. the wireless browser displays the modified webpage on a screen of the wireless device, wherein the wireless browser by removing the request and receipt of ad file images from and into the wireless device over the wireless network, reduces processing in the wireless device and reduces the use of the wireless network. 2. The device as in claim 1, comprising:
the wireless browser saves the ad-server reference links, before deleting, in an ad-server list file for display of the list at bottom of the modified webpage that enables a device owner to selectively decide to click a one or more links to request, receive and view the ad file images. 3. The device as in claim 1, comprising:
a. the wireless browser inputs a user desired display screen size of the wireless device and the user desired font size parameters; b. the wireless browser, uses these input parameters, parses the modified webpage into display screen size segments and displays the segments one at a time that enables a user to navigate from a segment to another segment to view a webpage content. 4. The device as in claim 1, comprising:
a. the wireless browser identifies in the received webpage, image file links to a server from where the webpage itself has been received; b. the wireless browser, when the number of links exceed a threshold, saves these links in an image link file and deletes the links from the webpage, then displays the modified webpage on the screen of the device with the image link list file at the bottom of the modified webpage that enables a user to select, fetch and display a one or more images from the links. 5. The device as in claim 4, comprising:
the wireless browser, if the number of image files is below the threshold, fetches the images from the webpage server and displays the images on the device screen. 6. The device as in claim 1, comprising:
a. the wireless browser identifies in the received webpage, image file links to a server from where the webpage itself has been received; b. the wireless browser stops requests and receipts of the image files from these links and displays the modified webpage with the image file links that enables a device owner to read an accompanying text and then decide to request, receive and view individual image files. 7. The device as in claim 6, comprising:
the wireless browser fetches the images from the webpage server and displays the images on the device screen. 8. A method of rendering of webpage content on a screen of a wireless device, comprising the steps of:
a. using a wireless browser for rendering of a webpage on a screen of a wireless device, and receiving, by the browser, a requested web page from a server on a global network; b. identifying ad-server reference links in the webpage and deleting these links in the received webpage; c. collapsing the corresponding empty cells of the deleted links and then displaying a modified webpage on the device screen. 9. The method as in claim 8, comprising the steps of:
saving the links, before deleting, in an ad-server list and displaying the list at end of the webpage, enabling a device owner to selectively choose to view their corresponding ad file images. 10. The method as in claim 8, comprising the steps of:
a. inputting a user desired screen size of the wireless device and the user desired font size parameters; b. using the parameters, parsing the webpage into screen size segments and displaying the segments one at a time, enabling a user to move from a segment to another segment for viewing of webpage content. 11. The method as in claim 8, comprising the steps of:
a. identifying image reference links to a server from where the webpage itself has been received; b. saving these links in an image link file and deleting the links from the webpage, before displaying the modified webpage on the screen of the device. 12. The method as in claim 11, comprising the steps of:
a. displaying the image link list file at the bottom of the webpage; b. enabling a user to select, fetch, and display a one or more images of the links. 13. The method as in claim 8, comprising the steps of:
a. identifying by the wireless browser, in the received webpage, number of image file links to a server from where the webpage itself has been received; b. saving by the wireless browser these links, when the number of links exceed a threshold, in an image link file and deleting the links from the webpage, then displaying the modified webpage on the screen of the device with the image link list file at the bottom of the modified webpage, enabling a user to select, fetch and display a one or more images from the links. 14. The method as in claim 13, comprising the steps of:
fetching by the wireless browser, the images from the webpage server and displaying the images on the device screen if the number of image files is below a threshold. 15. The method as in claim 8, comprising the steps of:
a. identifying by the wireless browser, in the received webpage, image file links to a server from where the webpage itself has been received; b. stopping by the wireless browser requests and receipts of the image files from these links and displaying the modified webpage with the image file links enabling a device owner to read an accompanying text and then decide to request, receive and view individual image files. 16. A system for rendering of webpage content on a screen of a handheld wireless device, comprising:
a. a wireless browser for rendering of a webpage on a screen of a wireless handheld computing device, where the wireless browser receives, a requested web page from a server on a global network; b. the wireless browser identifies ad-server reference links in the received webpage that have been pre-stored in an ad-server list file and deletes these links in the received webpage; c. the wireless browser collapses the corresponding empty cells of the deleted links and then displays the modified webpage on the device screen. 17. The system as in claim 16, comprising:
the wireless browser parses the webpage into screen size segments and displays the segments one at a time that enables a user to move from a segment to another segment. 18. The system as in claim 16, comprising:
the browser saves the links, before deleting, that are not already in the ad-server list, in the ad-server list file. 19. The system as in claim 16, comprising:
a. the browser identifies image reference links to a server from where the webpage itself has been received; b. saves these links in an image link file and deletes the links from the webpage, and then displays the modified webpage on the screen of the device. 20. The system as in claim 19, comprising:
the browser displays the image link list file at the bottom of the webpage and enables a user to select, fetch and display a one or more images of the links. | 2,100 |
4,928 | 14,483,411 | 2,126 | A dataset for an event of interest is received. The dataset represents occurrences of events including data corresponding to features. Event frame sizes are determined to generate insights on the dataset. Features from the occurrences of events are extracted corresponding to the determined event frame sizes. The extracted features are represented as feature abbreviations corresponding to a context. The feature abbreviations with high frequency of occurrence are identified. Rules are generated based on the identified feature abbreviations. Weights are associated to the feature abbreviations variably. Here, the association of weights is based on frequency of occurrence of feature abbreviations in the rules. The features corresponding to feature abbreviations are displayed as insights on the dataset. The displayed features correspond to a high probability of occurrence of the event of interest. | 1. A non-transitory computer-readable medium to store instructions, which when executed by a computer, cause the computer to perform operations comprising:
receive a dataset for an event of interest, wherein the dataset represents plurality of occurrences of events comprising data corresponding to features; determine plurality of event frame sizes to generate insights on the dataset; extract features from the plurality of occurrences of events corresponding to the plurality of event frame sizes, wherein the extracted features are represented as feature abbreviations corresponding to a context; identify feature abbreviations with high frequency of occurrence; generate rules based on the identified feature abbreviations; associate weights variably to the feature abbreviations, wherein the association of weights is based on frequency of occurrence of feature abbreviations in the rules; and display the features corresponding to feature abbreviations with high weights as insights on the dataset, wherein the displayed features correspond to a high probability of occurrence of the event of interest. 2. The computer-readable medium of claim 1, further comprising instructions which when executed by the computer further causes the computer to:
compute lift values corresponding to the generated rules; and sort the generated rules in increasing order of lift values. 3. The computer-readable medium of claim 2, wherein the lift values are computed based on support values and confidence values of the generated rules. 4. The computer-readable medium of claim 1, wherein the dataset is a filtered dataset retrieved from a time series data. 5. The computer-readable medium of claim 1, further comprising instructions which when executed by the computer further causes the computer to:
identify redundant rules from the generated rules; and eliminate the redundant rules. 6. The computer-readable medium of claim 1, wherein displaying the features further causes the computer to:
display the features corresponding to feature abbreviations in a tag cloud, wherein the features with high weights are displayed in large fonts. 7. The computer-readable medium of claim 1, further comprising instructions which when executed by the computer further causes the computer to:
receive an entity for which insights is to be generated in a specific context; match a set of context of the received entity other than the specific context with entities in the dataset to identify shortlisted entities including the received entity; determine aggregated values of quantitative features for the shortlisted entities including the received entity; normalize values of the aggregated quantitative features corresponding to the shortlisted entities including the received entity; group the shortlisted entities including the received entity into clusters based on the normalized values of the aggregated quantitative features; identify a cluster to which the received entity belongs to and the other entities in that cluster are selected; and determine entities from the selected entities that match the received specific context as a filtered dataset. 8. A computer-implemented method for automated generation of insights based on events of interest, the method comprising:
receiving a dataset for an event of interest, wherein the dataset represents plurality of occurrences of events comprising data corresponding to features; determining plurality of event frame sizes to generate insights on the dataset; extracting features from the plurality of occurrences of events corresponding to the plurality of event frame sizes, wherein the extracted features are represented as feature abbreviations corresponding to a context; identifying feature abbreviations with high frequency of occurrence; generating rules based on the identified feature abbreviations; associating weights variably to the feature abbreviations, wherein the association of weights is based on frequency of occurrence of feature abbreviations in the rules; and displaying the features corresponding to feature abbreviations with high weights as insights on the dataset, wherein the displayed features correspond to a high probability of occurrence of the event of interest. 9. The method of claim 8, further comprising instructions which when executed by the computer further causes the computer to:
computing lift values corresponding to the generated rules; and sorting the generated rules in increasing order of lift values. 10. The method of claim 9, wherein the lift values are computed based on support values and confidence values of the generated rules. 11. The method of claim 8, wherein the dataset is a filtered dataset retrieved from a time series data. 12. The method of claim 8, further comprising instructions which when executed by the computer further causes the computer to:
identifying redundant rules from the generated rules; and eliminating the redundant rules. 13. The method of claim 8, wherein displaying the features further causes the computer to:
displaying the features corresponding to feature abbreviations in a tag cloud, wherein the features with high weights are displayed in large fonts. 14. The method of claim 11, further comprising instructions which when executed by the computer further causes the computer to:
receiving an entity for which insights is to be generated in a specific context; matching a set of context of the received entity other than the specific context with entities in the dataset to identify shortlisted entities including the received entity; determining aggregated values of quantitative features for the shortlisted entities including the received entity; normalizing values of the aggregated quantitative features corresponding to the shortlisted entities including the received entity; grouping the shortlisted entities including the received entity into clusters based on the normalized values of the aggregated quantitative features; identifying a cluster to which the received entity belongs to and the other entities in that cluster are selected; and determining entities from the selected entities that match the received specific context as a filtered dataset. 15. A computer system for automated generation of insights based on events of interest, comprising:
a computer memory to store program code; and a processor to execute the program code to: receive a dataset for an event of interest, wherein the dataset represents plurality of occurrences of events comprising data corresponding to features; determine plurality of event frame sizes to generate insights on the dataset; extract features from the plurality of occurrences of events corresponding to the plurality of event frame sizes, wherein the extracted features are represented as feature abbreviations corresponding to a context; identify feature abbreviations with high frequency of occurrence; generate rules based on the identified feature abbreviations; associate weights variably to the feature abbreviations, wherein the association of weights is based on frequency of occurrence of feature abbreviations in the rules; and display the features corresponding to feature abbreviations with high weights as insights on the dataset, wherein the displayed features correspond to a high probability of occurrence of the event of interest. 16. The system of claim 15, further comprising instructions which when executed by the computer further causes the computer to:
compute lift values corresponding to the generated rules; and sort the generated rules in increasing order of lift values. 17. The system of claim 16, wherein the lift values are computed based on support values and confidence values of the generated rules. 18. The system of claim 15, wherein the dataset is a filtered dataset retrieved from a time series data. 19. The system of claim 15, further comprising instructions which when executed by the computer further causes the computer to:
identify redundant rules from the generated rules; and eliminate the redundant rules. 20. The system of claim 18, further comprising instructions which when executed by the computer further causes the computer to:
receive an entity for which insights is to be generated in a specific context; match a set of context of the received entity other than the specific context with entities in the dataset to identify shortlisted entities including the received entity; determine aggregated values of quantitative features for the shortlisted entities including the received entity; normalize values of the aggregated quantitative features corresponding to the shortlisted entities including the received entity; group the shortlisted entities including the received entity into clusters based on the normalized values of the aggregated quantitative features; identify a cluster to which the received entity belongs to and the other entities in that cluster are selected; and determine entities from the selected entities that match the received specific context as a filtered dataset. | A dataset for an event of interest is received. The dataset represents occurrences of events including data corresponding to features. Event frame sizes are determined to generate insights on the dataset. Features from the occurrences of events are extracted corresponding to the determined event frame sizes. The extracted features are represented as feature abbreviations corresponding to a context. The feature abbreviations with high frequency of occurrence are identified. Rules are generated based on the identified feature abbreviations. Weights are associated to the feature abbreviations variably. Here, the association of weights is based on frequency of occurrence of feature abbreviations in the rules. The features corresponding to feature abbreviations are displayed as insights on the dataset. The displayed features correspond to a high probability of occurrence of the event of interest.1. A non-transitory computer-readable medium to store instructions, which when executed by a computer, cause the computer to perform operations comprising:
receive a dataset for an event of interest, wherein the dataset represents plurality of occurrences of events comprising data corresponding to features; determine plurality of event frame sizes to generate insights on the dataset; extract features from the plurality of occurrences of events corresponding to the plurality of event frame sizes, wherein the extracted features are represented as feature abbreviations corresponding to a context; identify feature abbreviations with high frequency of occurrence; generate rules based on the identified feature abbreviations; associate weights variably to the feature abbreviations, wherein the association of weights is based on frequency of occurrence of feature abbreviations in the rules; and display the features corresponding to feature abbreviations with high weights as insights on the dataset, wherein the displayed features correspond to a high probability of occurrence of the event of interest. 2. The computer-readable medium of claim 1, further comprising instructions which when executed by the computer further causes the computer to:
compute lift values corresponding to the generated rules; and sort the generated rules in increasing order of lift values. 3. The computer-readable medium of claim 2, wherein the lift values are computed based on support values and confidence values of the generated rules. 4. The computer-readable medium of claim 1, wherein the dataset is a filtered dataset retrieved from a time series data. 5. The computer-readable medium of claim 1, further comprising instructions which when executed by the computer further causes the computer to:
identify redundant rules from the generated rules; and eliminate the redundant rules. 6. The computer-readable medium of claim 1, wherein displaying the features further causes the computer to:
display the features corresponding to feature abbreviations in a tag cloud, wherein the features with high weights are displayed in large fonts. 7. The computer-readable medium of claim 1, further comprising instructions which when executed by the computer further causes the computer to:
receive an entity for which insights is to be generated in a specific context; match a set of context of the received entity other than the specific context with entities in the dataset to identify shortlisted entities including the received entity; determine aggregated values of quantitative features for the shortlisted entities including the received entity; normalize values of the aggregated quantitative features corresponding to the shortlisted entities including the received entity; group the shortlisted entities including the received entity into clusters based on the normalized values of the aggregated quantitative features; identify a cluster to which the received entity belongs to and the other entities in that cluster are selected; and determine entities from the selected entities that match the received specific context as a filtered dataset. 8. A computer-implemented method for automated generation of insights based on events of interest, the method comprising:
receiving a dataset for an event of interest, wherein the dataset represents plurality of occurrences of events comprising data corresponding to features; determining plurality of event frame sizes to generate insights on the dataset; extracting features from the plurality of occurrences of events corresponding to the plurality of event frame sizes, wherein the extracted features are represented as feature abbreviations corresponding to a context; identifying feature abbreviations with high frequency of occurrence; generating rules based on the identified feature abbreviations; associating weights variably to the feature abbreviations, wherein the association of weights is based on frequency of occurrence of feature abbreviations in the rules; and displaying the features corresponding to feature abbreviations with high weights as insights on the dataset, wherein the displayed features correspond to a high probability of occurrence of the event of interest. 9. The method of claim 8, further comprising instructions which when executed by the computer further causes the computer to:
computing lift values corresponding to the generated rules; and sorting the generated rules in increasing order of lift values. 10. The method of claim 9, wherein the lift values are computed based on support values and confidence values of the generated rules. 11. The method of claim 8, wherein the dataset is a filtered dataset retrieved from a time series data. 12. The method of claim 8, further comprising instructions which when executed by the computer further causes the computer to:
identifying redundant rules from the generated rules; and eliminating the redundant rules. 13. The method of claim 8, wherein displaying the features further causes the computer to:
displaying the features corresponding to feature abbreviations in a tag cloud, wherein the features with high weights are displayed in large fonts. 14. The method of claim 11, further comprising instructions which when executed by the computer further causes the computer to:
receiving an entity for which insights is to be generated in a specific context; matching a set of context of the received entity other than the specific context with entities in the dataset to identify shortlisted entities including the received entity; determining aggregated values of quantitative features for the shortlisted entities including the received entity; normalizing values of the aggregated quantitative features corresponding to the shortlisted entities including the received entity; grouping the shortlisted entities including the received entity into clusters based on the normalized values of the aggregated quantitative features; identifying a cluster to which the received entity belongs to and the other entities in that cluster are selected; and determining entities from the selected entities that match the received specific context as a filtered dataset. 15. A computer system for automated generation of insights based on events of interest, comprising:
a computer memory to store program code; and a processor to execute the program code to: receive a dataset for an event of interest, wherein the dataset represents plurality of occurrences of events comprising data corresponding to features; determine plurality of event frame sizes to generate insights on the dataset; extract features from the plurality of occurrences of events corresponding to the plurality of event frame sizes, wherein the extracted features are represented as feature abbreviations corresponding to a context; identify feature abbreviations with high frequency of occurrence; generate rules based on the identified feature abbreviations; associate weights variably to the feature abbreviations, wherein the association of weights is based on frequency of occurrence of feature abbreviations in the rules; and display the features corresponding to feature abbreviations with high weights as insights on the dataset, wherein the displayed features correspond to a high probability of occurrence of the event of interest. 16. The system of claim 15, further comprising instructions which when executed by the computer further causes the computer to:
compute lift values corresponding to the generated rules; and sort the generated rules in increasing order of lift values. 17. The system of claim 16, wherein the lift values are computed based on support values and confidence values of the generated rules. 18. The system of claim 15, wherein the dataset is a filtered dataset retrieved from a time series data. 19. The system of claim 15, further comprising instructions which when executed by the computer further causes the computer to:
identify redundant rules from the generated rules; and eliminate the redundant rules. 20. The system of claim 18, further comprising instructions which when executed by the computer further causes the computer to:
receive an entity for which insights is to be generated in a specific context; match a set of context of the received entity other than the specific context with entities in the dataset to identify shortlisted entities including the received entity; determine aggregated values of quantitative features for the shortlisted entities including the received entity; normalize values of the aggregated quantitative features corresponding to the shortlisted entities including the received entity; group the shortlisted entities including the received entity into clusters based on the normalized values of the aggregated quantitative features; identify a cluster to which the received entity belongs to and the other entities in that cluster are selected; and determine entities from the selected entities that match the received specific context as a filtered dataset. | 2,100 |
4,929 | 13,931,592 | 2,175 | A tile-based user interface (UI) may be presented on a display device in tile view in full-screen view. The underlying application is active whether the UI is in tile view or in full-screen view, and may generate data that can be presented via the UI. In tile view, the UI may present abbreviated representations of information generated by the underlying application. In full-screen view, the UI may present detailed representations of information, including graphical UI elements and data elements that were not presented in the tile view UI. | 1. A method comprising:
displaying a plurality of tiles in a display area of an output device of a computer, including displaying a first tile in the display area, the first tile presenting therein a tile view of a UI of an application associated with the first tile, wherein the UI presents an abbreviated representation of information produced by the application; receiving first user input directed to the first tile; in response to the first user input, displaying in the display area an animation of the first tile expanding in size, wherein, upon completion of the animation, the first tile occupies substantially all of the display area and presents therein a full-screen view of the UI; and presenting in the full-screen view of the UI a detailed representation of information produced by the application, the detailed representation of information being different from the abbreviated representation of information presented in the tile view of the UI. 2. The method of claim 1 further comprising receiving an abbreviated representation of information from the application associated with the first tile and presenting the abbreviated representation of information in the tile view of the UI. 3. The method of claim 1 wherein presenting the UI in full-screen view includes displaying data elements that are not abbreviated representations of the information produced by the application. 4. The method of claim 1 wherein presenting the UI in full-screen view includes providing access to more functionality of the application than the UI in tile view. 5. The method of claim 1 wherein presenting the UI in full-screen view includes graphical UI (GUI) elements that are different from GUI elements comprising the UI in tile view. 6. The method of claim 1 wherein displaying the animation of the first tile expanding in size comprises replacing the tile view UI with an image of a full-screen UI scaled down to a size of the first tile, and expanding a size of the image of the full-screen UI to occupy substantially all of the display area. 7. The method of claim 1 wherein the animation of the first tile expanding in size begins at a location of the first tile so as to provide a visual cue to the user as to which tile among the plurality of tiles is expanding. 8. The method of claim 7 wherein sides of the first tile move toward respective sides of the display area and reach the respective sides of the display area at substantially the same time. 9. The method of claim 7 wherein the sides of the first tile move toward the respective sides of the display area at a speed as to be visually perceptible to the user. 10. The method of claim 7 wherein an aspect ratio of the UI in tile view is different from an aspect ratio of the UI in full-screen view. 11. The method of claim 1 further comprising:
receiving actionable user input directed to the tile view of the UI presented in the first tile; and
updating the tile view of the UI presented in the first tile with new information produced by the application responsive to the actionable user input. 12. The method of claim 1 further comprising:
receiving second user input directed to the first tile;
in response to the second user input, displaying in the display area an animation of the first tile reducing in size, including replacing the full-screen view of the UI with the tile view of the first UI, wherein upon completion of the animation, the first tile appears in the display area at its location during a time when the first user input was received. 13. The method of claim 1 wherein the first user input is a pinch gesture. 14. The method of claim 1 wherein the output device includes a touch sensitive input component. 15. A computing device comprising:
a processor; an output device; and a data storage device having stored thereon program code, which, when executed by the processor, causes the processor to:
display a plurality of tiles in a display area of the output device, including a first tile presenting therein a tile view of a UI of an application associated with the first tile, wherein the UI presents an abbreviated representation of information produced by the application;
receive first user input directed to the first tile;
in response to the first user input, display in the display area an animation of the first tile expanding in size, wherein, upon completion of the animation, the first tile occupies substantially all of the display area and presents therein a full-screen view of the UI; and
present in the full-screen view of the UI a detailed representation of information produced by the application, the detailed representation of information being different from the abbreviated representation of information presented in the tile view of the UI. 16. The computing device of claim 15 wherein the full-screen view of the UI comprises graphical UI (GUI) elements that are different from GUI elements comprising the UI in tile view and provides access to more functionality of the application than the UI in tile view. 17. The computing device of claim 15 wherein the program code, which, when executed by the processor, further causes the processor to:
receive actionable user input directed to the tile view of the UI presented in the first tile; and
update the tile view of the UI presented in the first tile with new information produced by the application responsive to the actionable user input. 18. The computing device of claim 15 wherein the output device includes a touch sensitive input component. 19. A non-transitory computer-readable storage medium having stored thereon program code, which, when executed by the processor, causes the processor to perform steps of:
displaying a plurality of tiles in a display area of an output device of a computer, including displaying a first tile in the display area, the first tile presenting therein a tile view of a UI of an application associated with the first tile, wherein the UI presents an abbreviated representation of information produced by the application; receiving first user input directed to the first tile; in response to the first user input, displaying in the display area an animation of the first tile expanding in size, wherein, upon completion of the animation, the first tile occupies substantially all of the display area and presents therein a full-screen view of the UI; and presenting in the full-screen view of the UI a detailed representation of information produced by the application, the detailed representation of information being different from the abbreviated representation of information presented in the tile view of the UI. 20. The non-transitory computer-readable storage medium of claim 19,
wherein the UI in full-screen view includes graphical UI (GUI) elements that are different from GUI elements comprising the UI in tile view, wherein the program code, which, when executed by the processor, further causes the processor to provide access to more functionality of the application than the UI in tile view. | A tile-based user interface (UI) may be presented on a display device in tile view in full-screen view. The underlying application is active whether the UI is in tile view or in full-screen view, and may generate data that can be presented via the UI. In tile view, the UI may present abbreviated representations of information generated by the underlying application. In full-screen view, the UI may present detailed representations of information, including graphical UI elements and data elements that were not presented in the tile view UI.1. A method comprising:
displaying a plurality of tiles in a display area of an output device of a computer, including displaying a first tile in the display area, the first tile presenting therein a tile view of a UI of an application associated with the first tile, wherein the UI presents an abbreviated representation of information produced by the application; receiving first user input directed to the first tile; in response to the first user input, displaying in the display area an animation of the first tile expanding in size, wherein, upon completion of the animation, the first tile occupies substantially all of the display area and presents therein a full-screen view of the UI; and presenting in the full-screen view of the UI a detailed representation of information produced by the application, the detailed representation of information being different from the abbreviated representation of information presented in the tile view of the UI. 2. The method of claim 1 further comprising receiving an abbreviated representation of information from the application associated with the first tile and presenting the abbreviated representation of information in the tile view of the UI. 3. The method of claim 1 wherein presenting the UI in full-screen view includes displaying data elements that are not abbreviated representations of the information produced by the application. 4. The method of claim 1 wherein presenting the UI in full-screen view includes providing access to more functionality of the application than the UI in tile view. 5. The method of claim 1 wherein presenting the UI in full-screen view includes graphical UI (GUI) elements that are different from GUI elements comprising the UI in tile view. 6. The method of claim 1 wherein displaying the animation of the first tile expanding in size comprises replacing the tile view UI with an image of a full-screen UI scaled down to a size of the first tile, and expanding a size of the image of the full-screen UI to occupy substantially all of the display area. 7. The method of claim 1 wherein the animation of the first tile expanding in size begins at a location of the first tile so as to provide a visual cue to the user as to which tile among the plurality of tiles is expanding. 8. The method of claim 7 wherein sides of the first tile move toward respective sides of the display area and reach the respective sides of the display area at substantially the same time. 9. The method of claim 7 wherein the sides of the first tile move toward the respective sides of the display area at a speed as to be visually perceptible to the user. 10. The method of claim 7 wherein an aspect ratio of the UI in tile view is different from an aspect ratio of the UI in full-screen view. 11. The method of claim 1 further comprising:
receiving actionable user input directed to the tile view of the UI presented in the first tile; and
updating the tile view of the UI presented in the first tile with new information produced by the application responsive to the actionable user input. 12. The method of claim 1 further comprising:
receiving second user input directed to the first tile;
in response to the second user input, displaying in the display area an animation of the first tile reducing in size, including replacing the full-screen view of the UI with the tile view of the first UI, wherein upon completion of the animation, the first tile appears in the display area at its location during a time when the first user input was received. 13. The method of claim 1 wherein the first user input is a pinch gesture. 14. The method of claim 1 wherein the output device includes a touch sensitive input component. 15. A computing device comprising:
a processor; an output device; and a data storage device having stored thereon program code, which, when executed by the processor, causes the processor to:
display a plurality of tiles in a display area of the output device, including a first tile presenting therein a tile view of a UI of an application associated with the first tile, wherein the UI presents an abbreviated representation of information produced by the application;
receive first user input directed to the first tile;
in response to the first user input, display in the display area an animation of the first tile expanding in size, wherein, upon completion of the animation, the first tile occupies substantially all of the display area and presents therein a full-screen view of the UI; and
present in the full-screen view of the UI a detailed representation of information produced by the application, the detailed representation of information being different from the abbreviated representation of information presented in the tile view of the UI. 16. The computing device of claim 15 wherein the full-screen view of the UI comprises graphical UI (GUI) elements that are different from GUI elements comprising the UI in tile view and provides access to more functionality of the application than the UI in tile view. 17. The computing device of claim 15 wherein the program code, which, when executed by the processor, further causes the processor to:
receive actionable user input directed to the tile view of the UI presented in the first tile; and
update the tile view of the UI presented in the first tile with new information produced by the application responsive to the actionable user input. 18. The computing device of claim 15 wherein the output device includes a touch sensitive input component. 19. A non-transitory computer-readable storage medium having stored thereon program code, which, when executed by the processor, causes the processor to perform steps of:
displaying a plurality of tiles in a display area of an output device of a computer, including displaying a first tile in the display area, the first tile presenting therein a tile view of a UI of an application associated with the first tile, wherein the UI presents an abbreviated representation of information produced by the application; receiving first user input directed to the first tile; in response to the first user input, displaying in the display area an animation of the first tile expanding in size, wherein, upon completion of the animation, the first tile occupies substantially all of the display area and presents therein a full-screen view of the UI; and presenting in the full-screen view of the UI a detailed representation of information produced by the application, the detailed representation of information being different from the abbreviated representation of information presented in the tile view of the UI. 20. The non-transitory computer-readable storage medium of claim 19,
wherein the UI in full-screen view includes graphical UI (GUI) elements that are different from GUI elements comprising the UI in tile view, wherein the program code, which, when executed by the processor, further causes the processor to provide access to more functionality of the application than the UI in tile view. | 2,100 |
4,930 | 13,555,330 | 2,141 | A system and method for debating in a virtual forum, such as an on-line chat room. A user may select one competitor to support. The competitor selected may be one of the competitors in a specific competitive event, such as a game, or one of the competitors in an association of competitors, such as a sports league. A plurality of virtual chat rooms may be created for debate over a competitive event. The populations of users in each of the plurality of virtual chat rooms may be based on the selection of competitors by the users. | 1. A method of debating, comprising:
selecting a competitor to support from a selection provided by a virtual forum; and communicating in the virtual forum, wherein a visual representation of the competitor selected by a user to support is displayed proximate to the user's communications to the virtual forum. 2. The method as recited in claim 1, wherein the virtual forum displays a selection of competitors in a specific competitive event and selecting a competitor to support from a selection provided by a virtual forum comprises selecting one of the competitors in the specific competitive event to support from the selection provided by the virtual forum. 3. The method as recited in claim 1, wherein selecting a competitor to support from a selection provided by a virtual forum comprises selecting a primary competitor within an association of competitors to support and a secondary competitor in a specific competitive event to support, wherein a visual representation of the primary competitor and the secondary competitor are displayed in the virtual forum proximate to the user's communications to the virtual forum. 4. The method as recited in claim 1, wherein the user's communications to the virtual forum comprises text. 5. The method as recited in claim 1, wherein the user's communications to the virtual forum comprises audio. 6. The method as recited in claim 1, wherein the user's communications to the virtual forum comprises video. 7. The method as recited in claim 1, comprising:
enabling a user to create a private virtual chat room and invite other users to chat in the private virtual chat room. 8. The method as recited in claim 1, comprising:
hosting the virtual forum on an Internet server and enabling a user to join the virtual forum using an electronic communication device operable to communicate via the Internet. 9. The method as recited in claim 8, wherein the electronic communication device is a Smartphone. 10. A method of chatting in a virtual forum, comprising:
presenting a selection of competitors to a virtual forum participant connected to the virtual forum; requiring each virtual forum participant to select one competitor from the selection of competitors to support; creating a first virtual chat room to enable a virtual forum participant to communicate with another virtual forum participant; creating a second virtual chat room to enable new virtual forum participants to communicate with other new virtual forum participants when a threshold number of virtual forum participants in the first chat room is reached; and directing a new virtual forum participant to one of the first or second virtual chat room based on their selection of competitor to support. 11. The method as recited in claim 10, wherein directing a new virtual forum participant to one of the first or second virtual chat room based on their selection of competitor to support comprises directing a new virtual forum participant to a virtual chat room to equalize ratios of supporters of one competitor to another competitor in each chat room. 12. The method as recited in claim 10, wherein the threshold number of users in the first virtual chat room is a threshold number of virtual forum participants in the first virtual chat room who have selected one competitor to support. 13. The method as recited in claim 10, wherein the threshold number of virtual forum participants in the first virtual chat room is a total number of virtual forum participants in the first virtual chat room. 14. The method as recited in claim 10, wherein a visual representation of the competitor selected by a virtual forum participant user to support is displayed in the virtual forum proximate to each virtual forum participant's communications to the first or second virtual chat room. 15. The method as recited in claim 10, wherein the virtual forum enables a virtual forum participant to communicate text to other virtual forum participants. 16. The method as recited in claim 10, wherein the virtual forum enables a virtual forum participant to communicate audio to other virtual forum participants. 17. The method as recited in claim 10, wherein the virtual forum enables a virtual forum participant to communicate video to other virtual forum participants. 18. A system for chatting, comprising:
a virtual forum; and a software program storable within a memory of an electronic device, wherein the software program enables the electronic device to communicate with the virtual forum; wherein a user is required to select a competitor from a selection of competitors presented by the system and a visual representation of the competitor selected by the user is displayed on the electronic device proximate to the user's communications to the virtual forum. 19. The system as recited in claim 18, wherein the electronic device is a Smartphone. 20. The system as recited in claim 18, wherein the selection of competitors is a selection of competitors in a specific competitive event. 21. The system as recited in claim 18, wherein the selection of competitors is a selection of competitors in an association of competitors. | A system and method for debating in a virtual forum, such as an on-line chat room. A user may select one competitor to support. The competitor selected may be one of the competitors in a specific competitive event, such as a game, or one of the competitors in an association of competitors, such as a sports league. A plurality of virtual chat rooms may be created for debate over a competitive event. The populations of users in each of the plurality of virtual chat rooms may be based on the selection of competitors by the users.1. A method of debating, comprising:
selecting a competitor to support from a selection provided by a virtual forum; and communicating in the virtual forum, wherein a visual representation of the competitor selected by a user to support is displayed proximate to the user's communications to the virtual forum. 2. The method as recited in claim 1, wherein the virtual forum displays a selection of competitors in a specific competitive event and selecting a competitor to support from a selection provided by a virtual forum comprises selecting one of the competitors in the specific competitive event to support from the selection provided by the virtual forum. 3. The method as recited in claim 1, wherein selecting a competitor to support from a selection provided by a virtual forum comprises selecting a primary competitor within an association of competitors to support and a secondary competitor in a specific competitive event to support, wherein a visual representation of the primary competitor and the secondary competitor are displayed in the virtual forum proximate to the user's communications to the virtual forum. 4. The method as recited in claim 1, wherein the user's communications to the virtual forum comprises text. 5. The method as recited in claim 1, wherein the user's communications to the virtual forum comprises audio. 6. The method as recited in claim 1, wherein the user's communications to the virtual forum comprises video. 7. The method as recited in claim 1, comprising:
enabling a user to create a private virtual chat room and invite other users to chat in the private virtual chat room. 8. The method as recited in claim 1, comprising:
hosting the virtual forum on an Internet server and enabling a user to join the virtual forum using an electronic communication device operable to communicate via the Internet. 9. The method as recited in claim 8, wherein the electronic communication device is a Smartphone. 10. A method of chatting in a virtual forum, comprising:
presenting a selection of competitors to a virtual forum participant connected to the virtual forum; requiring each virtual forum participant to select one competitor from the selection of competitors to support; creating a first virtual chat room to enable a virtual forum participant to communicate with another virtual forum participant; creating a second virtual chat room to enable new virtual forum participants to communicate with other new virtual forum participants when a threshold number of virtual forum participants in the first chat room is reached; and directing a new virtual forum participant to one of the first or second virtual chat room based on their selection of competitor to support. 11. The method as recited in claim 10, wherein directing a new virtual forum participant to one of the first or second virtual chat room based on their selection of competitor to support comprises directing a new virtual forum participant to a virtual chat room to equalize ratios of supporters of one competitor to another competitor in each chat room. 12. The method as recited in claim 10, wherein the threshold number of users in the first virtual chat room is a threshold number of virtual forum participants in the first virtual chat room who have selected one competitor to support. 13. The method as recited in claim 10, wherein the threshold number of virtual forum participants in the first virtual chat room is a total number of virtual forum participants in the first virtual chat room. 14. The method as recited in claim 10, wherein a visual representation of the competitor selected by a virtual forum participant user to support is displayed in the virtual forum proximate to each virtual forum participant's communications to the first or second virtual chat room. 15. The method as recited in claim 10, wherein the virtual forum enables a virtual forum participant to communicate text to other virtual forum participants. 16. The method as recited in claim 10, wherein the virtual forum enables a virtual forum participant to communicate audio to other virtual forum participants. 17. The method as recited in claim 10, wherein the virtual forum enables a virtual forum participant to communicate video to other virtual forum participants. 18. A system for chatting, comprising:
a virtual forum; and a software program storable within a memory of an electronic device, wherein the software program enables the electronic device to communicate with the virtual forum; wherein a user is required to select a competitor from a selection of competitors presented by the system and a visual representation of the competitor selected by the user is displayed on the electronic device proximate to the user's communications to the virtual forum. 19. The system as recited in claim 18, wherein the electronic device is a Smartphone. 20. The system as recited in claim 18, wherein the selection of competitors is a selection of competitors in a specific competitive event. 21. The system as recited in claim 18, wherein the selection of competitors is a selection of competitors in an association of competitors. | 2,100 |
4,931 | 13,778,396 | 2,131 | A memory controller and an operation method thereof are provided. The operation method includes storing a plurality of random sequences, selecting at least one random sequence among the plurality of random sequences according to a data pattern of a data block, and performing conversion by at least one of randomizing the data block using the selected at least one random sequence and derandomizing the randomized data block using the selected at least one random sequence. | 1. A memory controller comprising:
a memory configured to store a plurality of random sequences; and a first converter configured to select at least one random sequence among the plurality of random sequences according to a data pattern of a data block and perform at least one of randomizing the data block using the selected at least one random sequence and derandomizing the randomized data block using the selected at least one random sequence. 2. The memory controller of claim 1, wherein the first converter selects the at least one random sequence by shifting the plurality of random sequences by a unit of a command received from a processing unit when the first converter receives the data block for performing the randomizing or receives the randomized data block for performing the derandomizing. 3. The memory controller of claim 1, wherein the first converter performs the at least one of the randomizing the data block by performing a logical operation on the data block and the selected at least one random sequence and the derandomizing the randomized data block by performing the logical operation on the randomized data block and the selected at least one random sequence. 4. The memory controller of claim 3, wherein the logical operation comprises an XOR operation, and
wherein the derandomizing the randomized data block comprises performing the logical operation twice. 5. The memory controller of claim 1, further comprising a first processing unit configured to execute a first command, received from a host, according to which the first converter selects the at least one random sequence and performs the randomizing or the derandomizing,
wherein the memory stores the plurality of random sequences when the memory controller is booted or when the first processing unit executes the first command. 6. The memory controller of claim 1, further comprising a second processing unit configured to execute a second command received from the host independently from the first command, and
wherein the second processing unit comprises another first converter to select another at least one random sequence among the plurality of random sequences according to a data pattern of another data block and perform at least one of randomizing the other data block using the selected other at least one random sequence and derandomizing the randomized data block using the selected other at least one random sequence. 7. The memory controller of claim 1, further comprising a second converter,
wherein the data block comprises first data having a first attribute and second data having a second attribute, wherein the second converter is configured to perform at least one of randomizing the second data using another at least one random sequence and derandomizing the randomized second data using the other at least one random sequence, while the first converter performs at least one of randomizing the first data using the at least one random sequence and derandomizing the randomized first data using the at least one random sequence. 8. The memory controller of claim 7, wherein the first data having the first attribute is metadata and the second data having the second attribute is user data in the data block. 9. A memory system comprising:
a host configured to output a command; a memory device configured to store the data block; and the memory controller of claim 1, wherein the memory controller performs at least one of:
storing the randomized data block in the memory device according to the command; and
derandomizing the randomized data block stored in the memory device and outputting the derandomized data block to the host according to another command from the host. 10. A memory controller comprising:
a memory configured to store a plurality of random sequences; and a converter which selects at least one random sequence among the plurality of random sequences according to a data pattern of a data block received from a host, and randomizes the data block according to the selected at least one random sequence, wherein the data pattern is determined based on a portion of the data block which is a target of randomization. 11. The memory controller of claim 10, wherein the converter selects another at least one random sequence among the plurality of random sequences according to a data pattern of a data block received from a memory device, and derandomizes the data block according to the selected other at least one random sequence,
wherein the data pattern is determined based on a portion of the data block which is a target of derandomization. 12. An operation method of a memory controller, the operation method comprising:
storing a plurality of random sequences; selecting at least one random sequence among the plurality of random sequences according to a data pattern of a data block; and performing conversion by at least one of randomizing the data block using the selected at least one random sequence and derandomizing the randomized data block using the selected at least one random sequence. 13. The operation method of claim 12, wherein the at least one random sequence is selected by shifting the plurality of random sequences by a unit of a command received from a processing unit when receiving the data block for the randomizing or receiving the randomized data block for the derandomizing. 14. The operation method of claim 12, wherein the performing the conversion comprises:
randomizing the data block by performing a logical operation on the data block and the selected at least one random sequence; and transmitting the randomized data block to a memory device. 15. The operation method of claim 14, wherein the logical operation comprises an XOR operation. 16. The operation method of claim 12, wherein the performing the conversion comprises:
receiving the randomized data block from a memory device; derandomizing the randomized data block by performing a logical operation on the randomized data block and the selected at least one random sequence; and transmitting the derandomized data block to a host. 17. The operation method of claim 16, wherein the logical operation comprises an XOR operation, and
wherein the derandomizing the randomized data block is performed by performing the logical operation twice. 18. The operation method of claim 12, wherein the data block further comprises first data having a first attribute and second data having a second attribute,
wherein the operation method further comprises at least one of randomizing the second data using another at least one random sequence and derandomizing the randomized second data using the other at least one random sequence while performing at least one of randomizing the first data using the at least one random sequence and derandomizing the randomized first data using the at least one random sequence,. 19. The operation method of claim 12, wherein the storing the plurality of random sequences comprises storing the plurality of random sequences when the memory controller is booted or when a processing unit executes a command according to which the selecting at least one random sequence is selected and one of the randomizing and the derandomizing is performed. 20. A recording medium for storing the operation method of claim 12 as a computer readable code and executing the computer readable code. | A memory controller and an operation method thereof are provided. The operation method includes storing a plurality of random sequences, selecting at least one random sequence among the plurality of random sequences according to a data pattern of a data block, and performing conversion by at least one of randomizing the data block using the selected at least one random sequence and derandomizing the randomized data block using the selected at least one random sequence.1. A memory controller comprising:
a memory configured to store a plurality of random sequences; and a first converter configured to select at least one random sequence among the plurality of random sequences according to a data pattern of a data block and perform at least one of randomizing the data block using the selected at least one random sequence and derandomizing the randomized data block using the selected at least one random sequence. 2. The memory controller of claim 1, wherein the first converter selects the at least one random sequence by shifting the plurality of random sequences by a unit of a command received from a processing unit when the first converter receives the data block for performing the randomizing or receives the randomized data block for performing the derandomizing. 3. The memory controller of claim 1, wherein the first converter performs the at least one of the randomizing the data block by performing a logical operation on the data block and the selected at least one random sequence and the derandomizing the randomized data block by performing the logical operation on the randomized data block and the selected at least one random sequence. 4. The memory controller of claim 3, wherein the logical operation comprises an XOR operation, and
wherein the derandomizing the randomized data block comprises performing the logical operation twice. 5. The memory controller of claim 1, further comprising a first processing unit configured to execute a first command, received from a host, according to which the first converter selects the at least one random sequence and performs the randomizing or the derandomizing,
wherein the memory stores the plurality of random sequences when the memory controller is booted or when the first processing unit executes the first command. 6. The memory controller of claim 1, further comprising a second processing unit configured to execute a second command received from the host independently from the first command, and
wherein the second processing unit comprises another first converter to select another at least one random sequence among the plurality of random sequences according to a data pattern of another data block and perform at least one of randomizing the other data block using the selected other at least one random sequence and derandomizing the randomized data block using the selected other at least one random sequence. 7. The memory controller of claim 1, further comprising a second converter,
wherein the data block comprises first data having a first attribute and second data having a second attribute, wherein the second converter is configured to perform at least one of randomizing the second data using another at least one random sequence and derandomizing the randomized second data using the other at least one random sequence, while the first converter performs at least one of randomizing the first data using the at least one random sequence and derandomizing the randomized first data using the at least one random sequence. 8. The memory controller of claim 7, wherein the first data having the first attribute is metadata and the second data having the second attribute is user data in the data block. 9. A memory system comprising:
a host configured to output a command; a memory device configured to store the data block; and the memory controller of claim 1, wherein the memory controller performs at least one of:
storing the randomized data block in the memory device according to the command; and
derandomizing the randomized data block stored in the memory device and outputting the derandomized data block to the host according to another command from the host. 10. A memory controller comprising:
a memory configured to store a plurality of random sequences; and a converter which selects at least one random sequence among the plurality of random sequences according to a data pattern of a data block received from a host, and randomizes the data block according to the selected at least one random sequence, wherein the data pattern is determined based on a portion of the data block which is a target of randomization. 11. The memory controller of claim 10, wherein the converter selects another at least one random sequence among the plurality of random sequences according to a data pattern of a data block received from a memory device, and derandomizes the data block according to the selected other at least one random sequence,
wherein the data pattern is determined based on a portion of the data block which is a target of derandomization. 12. An operation method of a memory controller, the operation method comprising:
storing a plurality of random sequences; selecting at least one random sequence among the plurality of random sequences according to a data pattern of a data block; and performing conversion by at least one of randomizing the data block using the selected at least one random sequence and derandomizing the randomized data block using the selected at least one random sequence. 13. The operation method of claim 12, wherein the at least one random sequence is selected by shifting the plurality of random sequences by a unit of a command received from a processing unit when receiving the data block for the randomizing or receiving the randomized data block for the derandomizing. 14. The operation method of claim 12, wherein the performing the conversion comprises:
randomizing the data block by performing a logical operation on the data block and the selected at least one random sequence; and transmitting the randomized data block to a memory device. 15. The operation method of claim 14, wherein the logical operation comprises an XOR operation. 16. The operation method of claim 12, wherein the performing the conversion comprises:
receiving the randomized data block from a memory device; derandomizing the randomized data block by performing a logical operation on the randomized data block and the selected at least one random sequence; and transmitting the derandomized data block to a host. 17. The operation method of claim 16, wherein the logical operation comprises an XOR operation, and
wherein the derandomizing the randomized data block is performed by performing the logical operation twice. 18. The operation method of claim 12, wherein the data block further comprises first data having a first attribute and second data having a second attribute,
wherein the operation method further comprises at least one of randomizing the second data using another at least one random sequence and derandomizing the randomized second data using the other at least one random sequence while performing at least one of randomizing the first data using the at least one random sequence and derandomizing the randomized first data using the at least one random sequence,. 19. The operation method of claim 12, wherein the storing the plurality of random sequences comprises storing the plurality of random sequences when the memory controller is booted or when a processing unit executes a command according to which the selecting at least one random sequence is selected and one of the randomizing and the derandomizing is performed. 20. A recording medium for storing the operation method of claim 12 as a computer readable code and executing the computer readable code. | 2,100 |
4,932 | 14,746,905 | 2,124 | Embodiments of the invention relate to a storage system organized into a hierarchy of storage tiers, with at least one tier reflecting a high performance tier and at least one tier reflecting a lower performance tier. The high performance tier has a capacity restriction and has a limited quantity of blocks and pages may be placed in the tier. Assessments are conducted and a preferred selection of blocks and pages are recommended for placement; the recommendation is based on the assessment. The recommendation is converted to an actual placement, resulting in placement of at least one block, an in one embodiment at least one page, in the high performance tier. | 1. A method comprising:
configuring a storage system into a hierarchy of storage tiers, including a high performance storage tier and a lower performance storage tier; determining a resource constraint limiting a number of blocks and number of pages for selection and placement into the high performance storage tier; estimating a benefit metric as a value of a given selection of blocks and pages for placement in the high performance storage tier; determining a preferred selection of blocks and pages according to the benefit metric; and converting the preferred selection to placement in the storage tier, including placing a selection of blocks and pages in the high storage tier with the selection reflecting the preference as determined by the benefit metric. 2. The method of claim 1, wherein the resource constraint includes a maximum number of blocks and a maximum number of pages. 3. The method of claim 1, wherein the resource constraint includes a limit on a weighted sum of the number of blocks and the number of pages 4. The method of claim 1, wherein estimating the benefit metric further comprising a sum of block scores of selected blocks, and page scores for selected pages not contained in the selected blocks. 5. The method of claim 4, wherein the page scores include a prediction of an access frequency for the selected pages. 6. The method of claim 4, further comprising further comprising dynamically re-assessing the block scores and the page scores based on access, including performing placement changes in the high tier based on the re-assessment. 7. The method of claim 1, wherein determining the preferred selection further comprising:
a page selection procedure; and a block selection procedure, the block selection procedure including, computing an adjusted block score according to a page selection model, and selecting blocks with highest adjusted block scores. 8. The method of claim 7, further comprising:
computing an optimal selection as constrained by a parameter of the page selection model, and performing a search in a parameter space of the page selection model. 9. A computer program product for optimizing performance of tiered storage, the computer program product comprising a computer readable storage device having program code embodied therewith, the program code executable by a processing unit to:
configure a storage system into a hierarchy of storage tiers, including a high performance storage tier and a lower performance storage tier; determine a resource constraint limiting a number of blocks and number of pages for selection and placement into the high performance storage tier; estimate a benefit metric as a value of a given selection of blocks and pages for placement in the high performance storage tier; determine a preferred selection of blocks and pages according to the benefit metric; and convert the preferred selection to placement in the storage tier, including placing a selection of blocks and pages in the high storage tier with the selection reflecting the preference as determined by the benefit metric. 10. The computer program product of claim 9, wherein the resource constraint includes a maximum number of blocks and a maximum number of pages. 11. The computer program product of claim 9, wherein the resource constraint includes a limit on a weighted sum of the number of blocks and the number of pages. 12. The computer program product of claim 9, wherein the program code to estimate the benefit metric further comprising a sum of block scores of selected blocks, and page scores for selected pages not contained in the selected blocks. 13. The computer program product of claim 12, wherein the page scores include a prediction of an access frequency for the selected pages. 14. The computer program product of claim 12, further comprising program code to dynamically re-assess the block scores and the page scores based on access, including performing placement changes in the high tier based on the re-assessment. 15. The computer program product of claim 9, wherein the program code to determine the preferred selection further comprising:
a page selection procedure; and a block selection procedure, the block selection procedure including, program code to compute an adjusted block score according to a page selection model, and program code to select blocks with highest adjusted block scores. 16. The computer program product of claim 15, further comprising program code to
compute an optimal selection as constrained by a parameter of the page selection model, and perform a search in a parameter space of the page selection model. 17. A computer system comprising:
a processing unit operatively coupled to memory; a tool in communication with the processing unit to optimize performance of tiered storage, including:
a controller to configure a storage system into a hierarchy of storage tiers, including a high performance storage tier and a lower performance storage tier; and
an optimizer to select and place pages and blocks into one of the tiers in a combination of page and block granularity, including:
determine a resource constraint limiting a number of blocks and number of pages for selection and placement into the high performance storage tier;
estimate a benefit metric as a value of a given selection of blocks and pages for placement in the high performance storage tier;
determine a preferred selection of blocks and pages according to the benefit metric; and
convert the preferred selection to placement in the storage tier, including placing a selection of blocks and pages in the high storage tier with the selection reflecting the preference as determined by the benefit metric. 18. The system of claim 17, wherein the estimation of the benefit metric further comprises a sum of block scores of selected blocks, and page score for selected pages not contained in the selected blocks. 19. The system of claim 18, wherein the page scores include a prediction of an access frequency for the selected pages. 20. The system of claim 18, further comprising the optimizer to dynamically re-assess the block scores and the page scores based on access, including the optimizer performing placement changes in the high tier based on the re-assessment. | Embodiments of the invention relate to a storage system organized into a hierarchy of storage tiers, with at least one tier reflecting a high performance tier and at least one tier reflecting a lower performance tier. The high performance tier has a capacity restriction and has a limited quantity of blocks and pages may be placed in the tier. Assessments are conducted and a preferred selection of blocks and pages are recommended for placement; the recommendation is based on the assessment. The recommendation is converted to an actual placement, resulting in placement of at least one block, an in one embodiment at least one page, in the high performance tier.1. A method comprising:
configuring a storage system into a hierarchy of storage tiers, including a high performance storage tier and a lower performance storage tier; determining a resource constraint limiting a number of blocks and number of pages for selection and placement into the high performance storage tier; estimating a benefit metric as a value of a given selection of blocks and pages for placement in the high performance storage tier; determining a preferred selection of blocks and pages according to the benefit metric; and converting the preferred selection to placement in the storage tier, including placing a selection of blocks and pages in the high storage tier with the selection reflecting the preference as determined by the benefit metric. 2. The method of claim 1, wherein the resource constraint includes a maximum number of blocks and a maximum number of pages. 3. The method of claim 1, wherein the resource constraint includes a limit on a weighted sum of the number of blocks and the number of pages 4. The method of claim 1, wherein estimating the benefit metric further comprising a sum of block scores of selected blocks, and page scores for selected pages not contained in the selected blocks. 5. The method of claim 4, wherein the page scores include a prediction of an access frequency for the selected pages. 6. The method of claim 4, further comprising further comprising dynamically re-assessing the block scores and the page scores based on access, including performing placement changes in the high tier based on the re-assessment. 7. The method of claim 1, wherein determining the preferred selection further comprising:
a page selection procedure; and a block selection procedure, the block selection procedure including, computing an adjusted block score according to a page selection model, and selecting blocks with highest adjusted block scores. 8. The method of claim 7, further comprising:
computing an optimal selection as constrained by a parameter of the page selection model, and performing a search in a parameter space of the page selection model. 9. A computer program product for optimizing performance of tiered storage, the computer program product comprising a computer readable storage device having program code embodied therewith, the program code executable by a processing unit to:
configure a storage system into a hierarchy of storage tiers, including a high performance storage tier and a lower performance storage tier; determine a resource constraint limiting a number of blocks and number of pages for selection and placement into the high performance storage tier; estimate a benefit metric as a value of a given selection of blocks and pages for placement in the high performance storage tier; determine a preferred selection of blocks and pages according to the benefit metric; and convert the preferred selection to placement in the storage tier, including placing a selection of blocks and pages in the high storage tier with the selection reflecting the preference as determined by the benefit metric. 10. The computer program product of claim 9, wherein the resource constraint includes a maximum number of blocks and a maximum number of pages. 11. The computer program product of claim 9, wherein the resource constraint includes a limit on a weighted sum of the number of blocks and the number of pages. 12. The computer program product of claim 9, wherein the program code to estimate the benefit metric further comprising a sum of block scores of selected blocks, and page scores for selected pages not contained in the selected blocks. 13. The computer program product of claim 12, wherein the page scores include a prediction of an access frequency for the selected pages. 14. The computer program product of claim 12, further comprising program code to dynamically re-assess the block scores and the page scores based on access, including performing placement changes in the high tier based on the re-assessment. 15. The computer program product of claim 9, wherein the program code to determine the preferred selection further comprising:
a page selection procedure; and a block selection procedure, the block selection procedure including, program code to compute an adjusted block score according to a page selection model, and program code to select blocks with highest adjusted block scores. 16. The computer program product of claim 15, further comprising program code to
compute an optimal selection as constrained by a parameter of the page selection model, and perform a search in a parameter space of the page selection model. 17. A computer system comprising:
a processing unit operatively coupled to memory; a tool in communication with the processing unit to optimize performance of tiered storage, including:
a controller to configure a storage system into a hierarchy of storage tiers, including a high performance storage tier and a lower performance storage tier; and
an optimizer to select and place pages and blocks into one of the tiers in a combination of page and block granularity, including:
determine a resource constraint limiting a number of blocks and number of pages for selection and placement into the high performance storage tier;
estimate a benefit metric as a value of a given selection of blocks and pages for placement in the high performance storage tier;
determine a preferred selection of blocks and pages according to the benefit metric; and
convert the preferred selection to placement in the storage tier, including placing a selection of blocks and pages in the high storage tier with the selection reflecting the preference as determined by the benefit metric. 18. The system of claim 17, wherein the estimation of the benefit metric further comprises a sum of block scores of selected blocks, and page score for selected pages not contained in the selected blocks. 19. The system of claim 18, wherein the page scores include a prediction of an access frequency for the selected pages. 20. The system of claim 18, further comprising the optimizer to dynamically re-assess the block scores and the page scores based on access, including the optimizer performing placement changes in the high tier based on the re-assessment. | 2,100 |
4,933 | 12,351,501 | 2,157 | Techniques for using database rule results are provided. Structure Query Language (SQL) statements are parsed for multiple metric calculations. Multiple rules are parsed and evaluated within the SQL statements to produce results. The results are used by other portions of the SQL statements as a source or a driver for those other portions of the SQL statements. | 1. A method implemented in a computer-readable storage medium and processed by a processor to perform the method, comprising:
receiving Structured Query Language (SQL) statements; identifying a first rule and a second rule in the SQL statements; and evaluating the first rule and the second rule against a database and providing results to other portions of the SQL statement for processing. 2. The method of claim 1, wherein receiving further includes interacting with a user via a graphical user interface to receive the SQL statements. 3. The method of claim 1, wherein identifying further includes parsing the SQL statements to identify the first rule as a first chain of rules. 4. The method of claim 3, wherein identifying further includes parsing the SQL statements to identify the second rule as a second chain of rules. 5. The method of claim 1, wherein evaluating further includes providing the results as a source to the other portions of the SQL statements. 6. The method of claim 1, wherein evaluating further includes providing the results as a driver to the other portions of the SQL statements. 7. The method of claim 1, wherein evaluating further includes evaluating the first rule and the second rule as components of a metric calculation to produce the results. 8. A method implemented in a computer-readable storage medium and processed by a processor to perform the method, comprising:
dynamically parsing Structured Query Language (SQL) statements to obtain a first rule and a second rule; evaluating the first rule and the second rule against a database and summing first results from the first rule with second results from the second rule to produce combined results; and using the combined results as input to other portions of the SQL statements when processing the other portions against the database. 9. The method of claim 8, wherein dynamically parsing further includes recognizing the first rule as a first set of rules that are to be evaluated when the first rule is processed. 10. The method of claim 9, wherein dynamically parsing further includes recognizing the second rule as a second set of rules that are to be evaluated when the second rule is processed. 11. The method of claim 8, wherein processing further includes producing the combined results as a source to the other portions of the SQL statements. 12. The method of claim 8, wherein processing further includes producing the combined results as a driver to the other portions of the SQL statements. 13. The method of claim 8, wherein processing further includes processing the first rule as a portion of a first metric calculation. 14. The method of claim 13, wherein processing further includes processing the second rule as another portion of the first metric calculation or a second and different metric calculation. 15. A computer-implemented system that executes on one or more processors, the system comprising:
a Structured Query Language (SQL) preprocessor implemented in a computer-readable storage medium and executed by a processor of a network; and a data store implemented in a computer-readable storage medium and accessible to the SQL preprocessor; wherein the SQL preprocessor iterates SQL statements to automatically and dynamically identify and evaluate multiple rules against the database to produce combined results that feed other portions of the SQL statements when those other portions of the SQL statements are processed. 16. The system of claim 15, wherein the SQL preprocessor iterates the SQL statements to process multiple sets of sub rules for each of the metric rules. 17. The system of claim 15, wherein the SQL preprocessor feeds the combined results as a source input to the other portions of the SQL statements. 18. The system of claim 15, wherein the SQL preprocessor feeds the combined results as a driver to the other portions of the SQL statements. 19. The system of claim 15, wherein the SQL preprocessor interacts with a user via a graphical user interface to interactively acquire the SQL statements. 20. The system of claim 15, wherein data store is a data warehouse that includes a collection of databases logically organized and accessible as a single unit. | Techniques for using database rule results are provided. Structure Query Language (SQL) statements are parsed for multiple metric calculations. Multiple rules are parsed and evaluated within the SQL statements to produce results. The results are used by other portions of the SQL statements as a source or a driver for those other portions of the SQL statements.1. A method implemented in a computer-readable storage medium and processed by a processor to perform the method, comprising:
receiving Structured Query Language (SQL) statements; identifying a first rule and a second rule in the SQL statements; and evaluating the first rule and the second rule against a database and providing results to other portions of the SQL statement for processing. 2. The method of claim 1, wherein receiving further includes interacting with a user via a graphical user interface to receive the SQL statements. 3. The method of claim 1, wherein identifying further includes parsing the SQL statements to identify the first rule as a first chain of rules. 4. The method of claim 3, wherein identifying further includes parsing the SQL statements to identify the second rule as a second chain of rules. 5. The method of claim 1, wherein evaluating further includes providing the results as a source to the other portions of the SQL statements. 6. The method of claim 1, wherein evaluating further includes providing the results as a driver to the other portions of the SQL statements. 7. The method of claim 1, wherein evaluating further includes evaluating the first rule and the second rule as components of a metric calculation to produce the results. 8. A method implemented in a computer-readable storage medium and processed by a processor to perform the method, comprising:
dynamically parsing Structured Query Language (SQL) statements to obtain a first rule and a second rule; evaluating the first rule and the second rule against a database and summing first results from the first rule with second results from the second rule to produce combined results; and using the combined results as input to other portions of the SQL statements when processing the other portions against the database. 9. The method of claim 8, wherein dynamically parsing further includes recognizing the first rule as a first set of rules that are to be evaluated when the first rule is processed. 10. The method of claim 9, wherein dynamically parsing further includes recognizing the second rule as a second set of rules that are to be evaluated when the second rule is processed. 11. The method of claim 8, wherein processing further includes producing the combined results as a source to the other portions of the SQL statements. 12. The method of claim 8, wherein processing further includes producing the combined results as a driver to the other portions of the SQL statements. 13. The method of claim 8, wherein processing further includes processing the first rule as a portion of a first metric calculation. 14. The method of claim 13, wherein processing further includes processing the second rule as another portion of the first metric calculation or a second and different metric calculation. 15. A computer-implemented system that executes on one or more processors, the system comprising:
a Structured Query Language (SQL) preprocessor implemented in a computer-readable storage medium and executed by a processor of a network; and a data store implemented in a computer-readable storage medium and accessible to the SQL preprocessor; wherein the SQL preprocessor iterates SQL statements to automatically and dynamically identify and evaluate multiple rules against the database to produce combined results that feed other portions of the SQL statements when those other portions of the SQL statements are processed. 16. The system of claim 15, wherein the SQL preprocessor iterates the SQL statements to process multiple sets of sub rules for each of the metric rules. 17. The system of claim 15, wherein the SQL preprocessor feeds the combined results as a source input to the other portions of the SQL statements. 18. The system of claim 15, wherein the SQL preprocessor feeds the combined results as a driver to the other portions of the SQL statements. 19. The system of claim 15, wherein the SQL preprocessor interacts with a user via a graphical user interface to interactively acquire the SQL statements. 20. The system of claim 15, wherein data store is a data warehouse that includes a collection of databases logically organized and accessible as a single unit. | 2,100 |
4,934 | 14,697,810 | 2,143 | A method, computer program product, and/or computer system controls icon movement behavior on a graphical user interface. A file hosting icon and a data file icon are displayed on a graphical user interface (GUI). The file hosting icon represents a file hosting service, and the data file icon, which is capable of being moved towards the file hosting icon on the GUI to initiate storage by the file hosting service, represents data. The behavior of movement of the data file icon is adjusted according to a position of the data file icon relative to a position of the file hosting icon on the GUI, and based on predefined features of the data relative to predefined features of the file hosting service. | 1. A method of controlling icon movement behavior on a graphical user interface, the method comprising:
displaying, on a graphical user interface (GUI), a file hosting icon, wherein the file hosting icon represents a file hosting service; displaying, on the GUI, a data file icon, wherein the data file icon represents data, and wherein the data file icon is capable of movement towards the file hosting icon on the GUI to initiate storage of the data by the file hosting service; and adjusting, by one or more processors, a behavior of the movement of the data file icon according to a position of the data file icon relative to a position of the file hosting icon on the GUI and according to predefined features of the data relative to predefined features of the file hosting service. 2. The method of claim 1, wherein said adjusting the behavior of the movement of the data file icon on the GUI results in a drag rate change in the movement of the data file icon. 3. The method of claim 1, wherein said adjusting the behavior of the movement of the data file icon on the GUI results in an emulation on the GUI of a repulsive force between the data file icon and the file hosting icon. 4. The method of claim 1, wherein said adjusting the behavior of the movement of the data file icon on the GUI results in a change in viscosity of an emulated medium through which the data file icon travels on the GUI. 5. The method of claim 4, further comprising:
adjusting, by one or more processors, the viscosity of the emulated medium based on a level of sensitivity of the data. 6. The method of claim 4, further comprising:
adjusting, by one or more processors, the viscosity of the emulated medium based on a proximity of the data file icon to the file hosting icon on the GUI. 7. The method of claim 4, further comprising:
adjusting, by one or more processors, the viscosity of the emulated medium based on a profile of a user of the GUI. 8. The method of claim 4, further comprising:
adjusting, by one or more processors, the viscosity of the emulated medium based on a predefined level of trustworthiness of the file hosting service. 9. The method of claim 4, further comprising:
adjusting, by one or more processors, the viscosity of the emulated medium based on a history of security incidents involving the file hosting service. 10. The method of claim 1, further comprising:
adjusting, by one or more processors, a color of the data file icon as the data file icon is moving relative to the file hosting icon, wherein the color of the data file icon is adjusted based on the predefined features of the data being represented by the data file icon. 11. The method of claim 1, further comprising:
adjusting, by one or more processors, a color of the file hosting icon as the data file icon is moving relative to the file hosting icon, wherein the color of the file hosting icon is adjusted based on the predefined features of the file hosting service represented by the file hosting icon. 12. The method of claim 1, further comprising:
detecting, by one or more processors, a dragging of the file hosting icon to a sensitivity icon; in response to detecting that the file hosting icon has been dragged and dropped onto the sensitivity icon, presenting, by one or more processors, sensitivity options to a user; receiving, by one or more processors, a selected sensitivity option from the user, wherein the selected sensitivity option alters the behavior of the movement of the data file icon according to the position of the data file icon relative to the position of the file hosting icon on the GUI. 13. The method of claim 1, wherein the predefined features of the data being represented by the data file icon include a description of a predefined confidentiality level of the data represented by the data file icon. 14. The method of claim 1, wherein the predefined features of the data being represented by the data file icon include a description of a size of the data represented by the data file icon. 15. The method of claim 1, wherein the GUI is on an electronic device, and wherein the method further comprises:
determining, based on readings from a geophysical positioning device within the electronic device, a real-time location of the electronic device; and further adjusting, by one or more processors, the behavior of the movement of the data file icon according to the real-time location of the electronic device. 16. The method of claim 1, further comprising:
presenting a first data file icon and a second data file icon on the GUI, wherein the first data file icon represents a first data file and the second data file icon represents a second data file; and presenting, on the GUI, a force directed graphical representation of a relationship between the first data file and a second data file describing shared movement properties of the first data file icon and the second data file icon relative to each other and to the file hosting icon, wherein said representation provides an explanation for the behavior of the movement of the first data file icon and the second data file icon. 17. The method of claim 1, wherein the file hosting icon is displayed on a GUI on a first computer, and wherein the method further comprises:
identifying, by one or more processors, the file hosting icon being displayed on a GUI on a second computer; retrieving, by one or more processors, a profile for a user of the second computer; and further adjusting, by one or more processors, the behavior of the movement of the data file icon according to the profile for the user of the second computer. 18. The method of claim 1, wherein the movement of the data file icon is for a drag-and-drop operation, wherein the drag-and-drop operation places the data into the file hosting service. 19. A computer program product for controlling icon movement behavior on a graphical user interface, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code readable and executable by a processor to perform a method comprising:
displaying, on a graphical user interface (GUI), a file hosting icon, wherein the file hosting icon represents a file hosting service; displaying, on the GUI, a data file icon, wherein the data file icon represents data, and wherein the data file icon is capable of movement towards the file hosting icon on the GUI to initiate storage of the data by the file hosting service; and adjusting a behavior of the movement of the data file icon according to a position of the data file icon relative to a position of the file hosting icon on the GUI, wherein the behavior of the movement is further adjusted according to predefined features of the data relative to predefined features of the file hosting service. 20. A computer system comprising:
a processor, a computer readable memory, and a non-transitory computer readable storage medium; first program instructions to display, on a graphical user interface (GUI), a file hosting icon, wherein the file hosting icon represents a file hosting service; second program instructions to display, on the GUI, a data file icon, wherein the data file icon represents data, and wherein the data file icon is capable of movement towards the file hosting icon on the GUI to initiate storage of the data by the file hosting service; and third program instructions to adjust a behavior of the movement of the data file icon according to a position of the data file icon relative to a position of the file hosting icon on the GUI, wherein the behavior of the movement is further adjusted according to predefined features of the data relative to predefined features of the file hosting service; and wherein the first, second, and third program instructions are stored on the non-transitory computer readable storage medium for execution by one or more processors via the computer readable memory. | A method, computer program product, and/or computer system controls icon movement behavior on a graphical user interface. A file hosting icon and a data file icon are displayed on a graphical user interface (GUI). The file hosting icon represents a file hosting service, and the data file icon, which is capable of being moved towards the file hosting icon on the GUI to initiate storage by the file hosting service, represents data. The behavior of movement of the data file icon is adjusted according to a position of the data file icon relative to a position of the file hosting icon on the GUI, and based on predefined features of the data relative to predefined features of the file hosting service.1. A method of controlling icon movement behavior on a graphical user interface, the method comprising:
displaying, on a graphical user interface (GUI), a file hosting icon, wherein the file hosting icon represents a file hosting service; displaying, on the GUI, a data file icon, wherein the data file icon represents data, and wherein the data file icon is capable of movement towards the file hosting icon on the GUI to initiate storage of the data by the file hosting service; and adjusting, by one or more processors, a behavior of the movement of the data file icon according to a position of the data file icon relative to a position of the file hosting icon on the GUI and according to predefined features of the data relative to predefined features of the file hosting service. 2. The method of claim 1, wherein said adjusting the behavior of the movement of the data file icon on the GUI results in a drag rate change in the movement of the data file icon. 3. The method of claim 1, wherein said adjusting the behavior of the movement of the data file icon on the GUI results in an emulation on the GUI of a repulsive force between the data file icon and the file hosting icon. 4. The method of claim 1, wherein said adjusting the behavior of the movement of the data file icon on the GUI results in a change in viscosity of an emulated medium through which the data file icon travels on the GUI. 5. The method of claim 4, further comprising:
adjusting, by one or more processors, the viscosity of the emulated medium based on a level of sensitivity of the data. 6. The method of claim 4, further comprising:
adjusting, by one or more processors, the viscosity of the emulated medium based on a proximity of the data file icon to the file hosting icon on the GUI. 7. The method of claim 4, further comprising:
adjusting, by one or more processors, the viscosity of the emulated medium based on a profile of a user of the GUI. 8. The method of claim 4, further comprising:
adjusting, by one or more processors, the viscosity of the emulated medium based on a predefined level of trustworthiness of the file hosting service. 9. The method of claim 4, further comprising:
adjusting, by one or more processors, the viscosity of the emulated medium based on a history of security incidents involving the file hosting service. 10. The method of claim 1, further comprising:
adjusting, by one or more processors, a color of the data file icon as the data file icon is moving relative to the file hosting icon, wherein the color of the data file icon is adjusted based on the predefined features of the data being represented by the data file icon. 11. The method of claim 1, further comprising:
adjusting, by one or more processors, a color of the file hosting icon as the data file icon is moving relative to the file hosting icon, wherein the color of the file hosting icon is adjusted based on the predefined features of the file hosting service represented by the file hosting icon. 12. The method of claim 1, further comprising:
detecting, by one or more processors, a dragging of the file hosting icon to a sensitivity icon; in response to detecting that the file hosting icon has been dragged and dropped onto the sensitivity icon, presenting, by one or more processors, sensitivity options to a user; receiving, by one or more processors, a selected sensitivity option from the user, wherein the selected sensitivity option alters the behavior of the movement of the data file icon according to the position of the data file icon relative to the position of the file hosting icon on the GUI. 13. The method of claim 1, wherein the predefined features of the data being represented by the data file icon include a description of a predefined confidentiality level of the data represented by the data file icon. 14. The method of claim 1, wherein the predefined features of the data being represented by the data file icon include a description of a size of the data represented by the data file icon. 15. The method of claim 1, wherein the GUI is on an electronic device, and wherein the method further comprises:
determining, based on readings from a geophysical positioning device within the electronic device, a real-time location of the electronic device; and further adjusting, by one or more processors, the behavior of the movement of the data file icon according to the real-time location of the electronic device. 16. The method of claim 1, further comprising:
presenting a first data file icon and a second data file icon on the GUI, wherein the first data file icon represents a first data file and the second data file icon represents a second data file; and presenting, on the GUI, a force directed graphical representation of a relationship between the first data file and a second data file describing shared movement properties of the first data file icon and the second data file icon relative to each other and to the file hosting icon, wherein said representation provides an explanation for the behavior of the movement of the first data file icon and the second data file icon. 17. The method of claim 1, wherein the file hosting icon is displayed on a GUI on a first computer, and wherein the method further comprises:
identifying, by one or more processors, the file hosting icon being displayed on a GUI on a second computer; retrieving, by one or more processors, a profile for a user of the second computer; and further adjusting, by one or more processors, the behavior of the movement of the data file icon according to the profile for the user of the second computer. 18. The method of claim 1, wherein the movement of the data file icon is for a drag-and-drop operation, wherein the drag-and-drop operation places the data into the file hosting service. 19. A computer program product for controlling icon movement behavior on a graphical user interface, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code readable and executable by a processor to perform a method comprising:
displaying, on a graphical user interface (GUI), a file hosting icon, wherein the file hosting icon represents a file hosting service; displaying, on the GUI, a data file icon, wherein the data file icon represents data, and wherein the data file icon is capable of movement towards the file hosting icon on the GUI to initiate storage of the data by the file hosting service; and adjusting a behavior of the movement of the data file icon according to a position of the data file icon relative to a position of the file hosting icon on the GUI, wherein the behavior of the movement is further adjusted according to predefined features of the data relative to predefined features of the file hosting service. 20. A computer system comprising:
a processor, a computer readable memory, and a non-transitory computer readable storage medium; first program instructions to display, on a graphical user interface (GUI), a file hosting icon, wherein the file hosting icon represents a file hosting service; second program instructions to display, on the GUI, a data file icon, wherein the data file icon represents data, and wherein the data file icon is capable of movement towards the file hosting icon on the GUI to initiate storage of the data by the file hosting service; and third program instructions to adjust a behavior of the movement of the data file icon according to a position of the data file icon relative to a position of the file hosting icon on the GUI, wherein the behavior of the movement is further adjusted according to predefined features of the data relative to predefined features of the file hosting service; and wherein the first, second, and third program instructions are stored on the non-transitory computer readable storage medium for execution by one or more processors via the computer readable memory. | 2,100 |
4,935 | 14,060,704 | 2,145 | A method, system and computer program product for overloaded schedule detection and notification in a calendaring and scheduling (C&S) system is provided. A method for overloaded schedule detection and notification in a C&S system includes loading a task list for an end user into memory of the C&S system. The task list includes a set of tasks scheduled for completion by the end user over a range of time. The method also includes displaying the task list in a user interface of the C&S system, comparing a capacity of the end user to complete tasks during the range of time to the tasks in the set. Finally, the method includes responding to a determination that the tasks in the last exceeds the capacity by displaying an alert in the user interface of the C&S system indicating an overloaded condition. | 1. A method for overloaded schedule detection and notification in a calendaring and scheduling (C&S) system, the method comprising:
loading a task list for an end user into memory of the C&S system, the task list comprising a set of tasks scheduled for completion by the end user over a range of time; displaying the task list in a user interface of the C&S system; comparing a capacity of the end user to complete tasks during the range of time to the tasks in the set; and, responsive to a determination that the tasks in the set exceeds the capacity, displaying an alert in the user interface of the C&S system indicating an overloaded condition. 2. The method of claim 1, further comprising responsive to a determination that the tasks in the set do not exceed the capacity but is within a threshold value of the capacity, displaying an alert in the user interface of the C&S system indicating an approaching overloaded condition. 3. The method of claim 1, further comprising, in response to the overloaded condition, selecting a task in the set of tasks, determining a future day when the selected task can be re-scheduled without causing an overloaded condition in the future day, and prompting the end user in the user interface of the C&S system to reschedule the selected task to the future day. 4. The method of claim 3, wherein the selected task is selected according to a lowest priority from amongst the set of tasks. 5. The method of claim 3, wherein the selected task is selected from amongst the set of tasks according to a combination of known time consumption and priority of the selected task. 6. A calendaring and scheduling (C&S) data processing system configured for overloaded schedule detection and notification, the system comprising:
a host server computing system comprising at least one server with memory and at least one processor; a database of tasks scheduled for an end user of the C&S system; a C&S system executing in the host server computing system and coupled to the database, the C&S system managing scheduling and completion of different tasks in the database; and, an overloaded schedule detection and notification module of the C&S system, the module comprising program code enabled upon execution in the memory of the host server computing system to load a task list for the end user in the C&S system, the task list comprising a set of tasks scheduled in the database for completion by the end user over a range of time, to display the task list in a user interface of the C&S system, to compare a capacity of the end user to complete tasks during the range of time to the tasks in the set, and to respond to a determination that the tasks in the set exceeds the capacity by displaying an alert in the user interface of the C&S system indicating an overloaded condition. 7. The system of claim 6, wherein the program code is further enabled to respond to a determination that the tasks in the set do not exceed the capacity, but is within a threshold value of the capacity, by displaying an alert in the user interface of the C&S system indicating an approaching overloaded condition. 8. The system of claim 6, wherein the program code is further enabled to respond to the overloaded condition by selecting a task in the set of tasks, by determining a future day when the selected task can be re-scheduled without causing an overloaded condition in the future day, and by prompting the end user in the user interface of the C&S system to reschedule the selected task to the future day. 9. The system of claim 8, wherein the selected task is selected according to a lowest priority from amongst the set of tasks. 10. The system of claim 8, wherein the selected task is selected from amongst the set of tasks according to a combination of known time consumption and priority of the selected task. 11. A computer program product for overloaded schedule detection and notification in a calendaring and scheduling (C&S) system, the computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code for loading a task list for an end user into memory of the C&S system, the task list comprising a set of tasks scheduled for completion by the end user over a range of time; computer readable program code for displaying the task list in a user interface of the C&S system; computer readable program code for comparing a capacity of the end user to complete tasks during the range of time to the tasks in the set; and, computer readable program code for responding to a determination that the tasks in the set exceeds the capacity, by displaying an alert in the user interface of the C&S system indicating an overloaded condition. 12. The computer program product of claim 11, further comprising computer readable program code for responding to a determination that the tasks in the set do not exceed the capacity but is within a threshold value of the capacity, by displaying an alert in the user interface of the C&S system indicating an approaching overloaded condition. 13. The computer program product of claim 11, further comprising, computer readable program code for responding to the overloaded condition by selecting a task in the set of tasks, by determining a future day when the selected task can be re-scheduled without causing an overloaded condition in the future day, and by prompting the end user in the user interface of the C&S system to reschedule the selected task to the future day. 14. The computer program product of claim 13, wherein the selected task is selected according to a lowest priority from amongst the set of tasks. 15. The computer program product of claim 13, wherein the selected task is selected from amongst the set of tasks according to a combination of known time consumption and priority of the selected task. | A method, system and computer program product for overloaded schedule detection and notification in a calendaring and scheduling (C&S) system is provided. A method for overloaded schedule detection and notification in a C&S system includes loading a task list for an end user into memory of the C&S system. The task list includes a set of tasks scheduled for completion by the end user over a range of time. The method also includes displaying the task list in a user interface of the C&S system, comparing a capacity of the end user to complete tasks during the range of time to the tasks in the set. Finally, the method includes responding to a determination that the tasks in the last exceeds the capacity by displaying an alert in the user interface of the C&S system indicating an overloaded condition.1. A method for overloaded schedule detection and notification in a calendaring and scheduling (C&S) system, the method comprising:
loading a task list for an end user into memory of the C&S system, the task list comprising a set of tasks scheduled for completion by the end user over a range of time; displaying the task list in a user interface of the C&S system; comparing a capacity of the end user to complete tasks during the range of time to the tasks in the set; and, responsive to a determination that the tasks in the set exceeds the capacity, displaying an alert in the user interface of the C&S system indicating an overloaded condition. 2. The method of claim 1, further comprising responsive to a determination that the tasks in the set do not exceed the capacity but is within a threshold value of the capacity, displaying an alert in the user interface of the C&S system indicating an approaching overloaded condition. 3. The method of claim 1, further comprising, in response to the overloaded condition, selecting a task in the set of tasks, determining a future day when the selected task can be re-scheduled without causing an overloaded condition in the future day, and prompting the end user in the user interface of the C&S system to reschedule the selected task to the future day. 4. The method of claim 3, wherein the selected task is selected according to a lowest priority from amongst the set of tasks. 5. The method of claim 3, wherein the selected task is selected from amongst the set of tasks according to a combination of known time consumption and priority of the selected task. 6. A calendaring and scheduling (C&S) data processing system configured for overloaded schedule detection and notification, the system comprising:
a host server computing system comprising at least one server with memory and at least one processor; a database of tasks scheduled for an end user of the C&S system; a C&S system executing in the host server computing system and coupled to the database, the C&S system managing scheduling and completion of different tasks in the database; and, an overloaded schedule detection and notification module of the C&S system, the module comprising program code enabled upon execution in the memory of the host server computing system to load a task list for the end user in the C&S system, the task list comprising a set of tasks scheduled in the database for completion by the end user over a range of time, to display the task list in a user interface of the C&S system, to compare a capacity of the end user to complete tasks during the range of time to the tasks in the set, and to respond to a determination that the tasks in the set exceeds the capacity by displaying an alert in the user interface of the C&S system indicating an overloaded condition. 7. The system of claim 6, wherein the program code is further enabled to respond to a determination that the tasks in the set do not exceed the capacity, but is within a threshold value of the capacity, by displaying an alert in the user interface of the C&S system indicating an approaching overloaded condition. 8. The system of claim 6, wherein the program code is further enabled to respond to the overloaded condition by selecting a task in the set of tasks, by determining a future day when the selected task can be re-scheduled without causing an overloaded condition in the future day, and by prompting the end user in the user interface of the C&S system to reschedule the selected task to the future day. 9. The system of claim 8, wherein the selected task is selected according to a lowest priority from amongst the set of tasks. 10. The system of claim 8, wherein the selected task is selected from amongst the set of tasks according to a combination of known time consumption and priority of the selected task. 11. A computer program product for overloaded schedule detection and notification in a calendaring and scheduling (C&S) system, the computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code for loading a task list for an end user into memory of the C&S system, the task list comprising a set of tasks scheduled for completion by the end user over a range of time; computer readable program code for displaying the task list in a user interface of the C&S system; computer readable program code for comparing a capacity of the end user to complete tasks during the range of time to the tasks in the set; and, computer readable program code for responding to a determination that the tasks in the set exceeds the capacity, by displaying an alert in the user interface of the C&S system indicating an overloaded condition. 12. The computer program product of claim 11, further comprising computer readable program code for responding to a determination that the tasks in the set do not exceed the capacity but is within a threshold value of the capacity, by displaying an alert in the user interface of the C&S system indicating an approaching overloaded condition. 13. The computer program product of claim 11, further comprising, computer readable program code for responding to the overloaded condition by selecting a task in the set of tasks, by determining a future day when the selected task can be re-scheduled without causing an overloaded condition in the future day, and by prompting the end user in the user interface of the C&S system to reschedule the selected task to the future day. 14. The computer program product of claim 13, wherein the selected task is selected according to a lowest priority from amongst the set of tasks. 15. The computer program product of claim 13, wherein the selected task is selected from amongst the set of tasks according to a combination of known time consumption and priority of the selected task. | 2,100 |
4,936 | 13,282,595 | 2,157 | Techniques to share media files are described. An apparatus may comprise a processor and a memory communicatively coupled to the processor. The memory may store an application having a media share component operative to share a media file among a defined set of users. The media share component may comprise multiple software modules, including a file manager module and a file reference module. The file manager module may be operative to determine a network storage location for the media file. The file reference module may be operative to automatically generate a valid link to the network storage location for the media file. The valid link may be specifically arranged to permit access to the network storage location for the media file by the defined set of users of the application. Other embodiments are described and claimed. | 1. An apparatus, comprising:
a processor; and a memory communicatively coupled to the processor, the memory to store an application having a media share component operative to share a media file among a defined set of users, the media share component comprising a file manager module operative to determine a network storage location for the media file, and a file reference module operative to automatically generate a valid link to the network storage location for the media file, the valid link arranged to permit access to the network storage location for the media file by the defined set of users. 2. The apparatus of claim 1, the file manager module operative to determine whether the media file is a local media file or a remote media file, and send the media file to a network storage server when the media file is a local media file. 3. The apparatus of claim 1, the file reference module operative to retrieve a current link for the network storage location for the media file, determine whether the current link permits access to the network storage location for the media file by the defined set of users, and if not, generate the valid link that permits access to the network storage location for the media file by the defined set of users. 4. The apparatus of claim 1, the file reference module operative to retrieve a tokenized anonymous view universal resource locator (URL) for the network storage location, and generate the valid link as a reference comprising the tokenized anonymous view URL. 5. The apparatus of claim 1, the file reference module operative to modify permissions for the network storage location, and generate the valid link as a reference to the network storage location of the media file after permissions have been modified for the network storage location. 6. The apparatus of claim 1, the file reference module operative to copy the media file from the network storage location to a different network storage location that permits access to the media file by the defined set of users, and generate the valid link as a reference to the different network storage location for the copied media file. 7. The apparatus of claim 1, the application to associate the valid link with a document, and send the document and the valid link to a set of document recipients as the defined set of users. 8. A computer-implement method, comprising:
receiving a request to associate a media file with a document; retrieving a first link to a network storage location for the media file; determining the first link does not permit access to the network storage location for the media file by a document recipient; determining whether a second link to the network storage location for the media file is available that does permit access by the document recipient; and associating the second link with the document when the second link is available. 9. The computer-implemented method of claim 8, comprising determining the second link to the network storage location for the media file is not available. 10. The computer-implemented method of claim 9, comprising determining whether permissions for the network storage location can be modified to permit access by the document recipient. 11. The computer-implemented method of claim 10, comprising:
determining permissions for the network storage location can be modified to permit access by the document recipient; modifying permissions for the network storage location to permit access by the document recipient; retrieving a third link to the network storage location with the modified permissions; and associating the third link with the document. 12. The computer-implemented method of claim 10, comprising determining permissions for the network storage location cannot be modified to permit access by the document recipient. 13. The computer-implemented method of claim 12, comprising determining whether the media file can be retrieved from the network storage location. 14. The computer-implemented method of claim 13, comprising:
determining the media file can be retrieved from the network storage location; retrieving the media file from the network storage location; sending the media file to a new network storage location that does permit access by the document recipient; receiving a fourth link to the new network storage location for the media file; and associating the fourth link to the document. 15. An article of manufacture comprising a storage medium containing instructions that when executed cause a system to:
receive a request to share a media file among a defined set of users; and generate a valid link to a network storage location for the media file, the valid link arranged to permit access to the network storage location for the media file by the defined set of users. 16. The article of manufacture of claim 15, further comprising instructions that when executed cause the system to
determine whether the media file is a local media file or a remote media file; and generate a control directive to send the media file to a network storage server when the media file is a local media file. 17. The article of manufacture of claim 15, further comprising instructions that when executed cause the system to
retrieve a current link for the network storage location for the media file; determine whether the current link permits access to the network storage location for the media file by the defined set of users; and generate the valid link that permits access to the network storage location for the media file by the defined set of users. 18. The article of manufacture of claim 17, further comprising instructions that when executed cause the system to:
retrieve a tokenized anonymous view universal resource locator (URL) for the network storage location; and generate the valid link as a reference comprising the tokenized anonymous view URL. 19. The article of manufacture of claim 17, further comprising instructions that when executed cause the system to:
modify permissions for the network storage location; and generate the valid link as a reference to the network storage location of the media file after permissions have been modified for the network storage location. 20. The article of manufacture of claim 17, further comprising instructions that when executed cause the system to:
generate a control directive to copy the media file from the network storage location to a different network storage location that permits access to the media file by the defined set of users; and generate the valid link as a reference to the different network storage location for the copied media file. | Techniques to share media files are described. An apparatus may comprise a processor and a memory communicatively coupled to the processor. The memory may store an application having a media share component operative to share a media file among a defined set of users. The media share component may comprise multiple software modules, including a file manager module and a file reference module. The file manager module may be operative to determine a network storage location for the media file. The file reference module may be operative to automatically generate a valid link to the network storage location for the media file. The valid link may be specifically arranged to permit access to the network storage location for the media file by the defined set of users of the application. Other embodiments are described and claimed.1. An apparatus, comprising:
a processor; and a memory communicatively coupled to the processor, the memory to store an application having a media share component operative to share a media file among a defined set of users, the media share component comprising a file manager module operative to determine a network storage location for the media file, and a file reference module operative to automatically generate a valid link to the network storage location for the media file, the valid link arranged to permit access to the network storage location for the media file by the defined set of users. 2. The apparatus of claim 1, the file manager module operative to determine whether the media file is a local media file or a remote media file, and send the media file to a network storage server when the media file is a local media file. 3. The apparatus of claim 1, the file reference module operative to retrieve a current link for the network storage location for the media file, determine whether the current link permits access to the network storage location for the media file by the defined set of users, and if not, generate the valid link that permits access to the network storage location for the media file by the defined set of users. 4. The apparatus of claim 1, the file reference module operative to retrieve a tokenized anonymous view universal resource locator (URL) for the network storage location, and generate the valid link as a reference comprising the tokenized anonymous view URL. 5. The apparatus of claim 1, the file reference module operative to modify permissions for the network storage location, and generate the valid link as a reference to the network storage location of the media file after permissions have been modified for the network storage location. 6. The apparatus of claim 1, the file reference module operative to copy the media file from the network storage location to a different network storage location that permits access to the media file by the defined set of users, and generate the valid link as a reference to the different network storage location for the copied media file. 7. The apparatus of claim 1, the application to associate the valid link with a document, and send the document and the valid link to a set of document recipients as the defined set of users. 8. A computer-implement method, comprising:
receiving a request to associate a media file with a document; retrieving a first link to a network storage location for the media file; determining the first link does not permit access to the network storage location for the media file by a document recipient; determining whether a second link to the network storage location for the media file is available that does permit access by the document recipient; and associating the second link with the document when the second link is available. 9. The computer-implemented method of claim 8, comprising determining the second link to the network storage location for the media file is not available. 10. The computer-implemented method of claim 9, comprising determining whether permissions for the network storage location can be modified to permit access by the document recipient. 11. The computer-implemented method of claim 10, comprising:
determining permissions for the network storage location can be modified to permit access by the document recipient; modifying permissions for the network storage location to permit access by the document recipient; retrieving a third link to the network storage location with the modified permissions; and associating the third link with the document. 12. The computer-implemented method of claim 10, comprising determining permissions for the network storage location cannot be modified to permit access by the document recipient. 13. The computer-implemented method of claim 12, comprising determining whether the media file can be retrieved from the network storage location. 14. The computer-implemented method of claim 13, comprising:
determining the media file can be retrieved from the network storage location; retrieving the media file from the network storage location; sending the media file to a new network storage location that does permit access by the document recipient; receiving a fourth link to the new network storage location for the media file; and associating the fourth link to the document. 15. An article of manufacture comprising a storage medium containing instructions that when executed cause a system to:
receive a request to share a media file among a defined set of users; and generate a valid link to a network storage location for the media file, the valid link arranged to permit access to the network storage location for the media file by the defined set of users. 16. The article of manufacture of claim 15, further comprising instructions that when executed cause the system to
determine whether the media file is a local media file or a remote media file; and generate a control directive to send the media file to a network storage server when the media file is a local media file. 17. The article of manufacture of claim 15, further comprising instructions that when executed cause the system to
retrieve a current link for the network storage location for the media file; determine whether the current link permits access to the network storage location for the media file by the defined set of users; and generate the valid link that permits access to the network storage location for the media file by the defined set of users. 18. The article of manufacture of claim 17, further comprising instructions that when executed cause the system to:
retrieve a tokenized anonymous view universal resource locator (URL) for the network storage location; and generate the valid link as a reference comprising the tokenized anonymous view URL. 19. The article of manufacture of claim 17, further comprising instructions that when executed cause the system to:
modify permissions for the network storage location; and generate the valid link as a reference to the network storage location of the media file after permissions have been modified for the network storage location. 20. The article of manufacture of claim 17, further comprising instructions that when executed cause the system to:
generate a control directive to copy the media file from the network storage location to a different network storage location that permits access to the media file by the defined set of users; and generate the valid link as a reference to the different network storage location for the copied media file. | 2,100 |
4,937 | 14,321,231 | 2,121 | A method and system for linking a multimedia data element (MMDE) and a webpage are provided. The method includes receiving a MMDE from a source; generating a signature representative of the MMDE using a plurality of computational cores; matching the generated signature with a plurality of signatures stored in a database to find at least one matching signature, wherein at least one of the stored signatures has at least one corresponding universal resource locator (URL) of a web page stored therein as metadata of the at least one of the stored signatures; and providing to the source at least a URL that is a metadata of a matched signature upon determination of a match between the generated signature and at least one of the plurality of signatures stored in the database. | 1. A method for linking between a multimedia data element (MMDE) and a web page, comprising:
receiving a MMDE from a source; generating a signature representative of the MMDE using a plurality of computational cores, each computational core having properties statistically independent of each other computational core, each computational core generates, responsive to the received MMDE, at least a signature comprising a first signature element and a second signature element; matching the generated signature with a plurality of signatures stored in a database to find at least one matching signature, wherein each signature of the stored plurality of signatures is generated by the plurality of computational cores, and wherein at least one of the stored signatures has at least one corresponding universal resource locator (URL) of a web page stored therein as metadata of the at least one of the stored signatures; and providing to the source at least a URL that is a metadata of a matched signature upon determination of a match between the generated signature and at least one of the plurality of signatures stored in the database. 2. The method of claim 1, further comprising:
storing the generated signature in a database; and associating the at least a URL that is a metadata of a matched signature with the generated signature as a metadata of the generated signature. 3. The method of claim 1, further comprising:
selecting a single URL when the matching results in more than one matching signature, wherein the selection is based on at least one of: a random selection, and a weighted decision selection process. 4. The method of claim 3, wherein providing the URL to the source further comprising:
enabling display of a web-page corresponding to the URL on a display. 5. The method of claim 1, wherein the MMDE is selected from the group consisting of an image, graphics, a video stream, a video clip, an audio stream, an audio clip, a video frame, a photograph, images of signals, a combinations thereof, and portions thereof. 6. The method of claim 5, wherein the images of signals comprise images selected from the group consisting of medical signals, geophysical signals, subsonic signals, supersonic signals, electromagnetic signals, and infrared signals. 7. The method of claim 1, wherein the first signature element is a robust signature. 8. The method of claim 1, further comprising:
performing a clustering of at least a portion of the plurality of signatures to generate at least one cluster of signatures; and generating a signature by the plurality of computational cores for each of the at least one cluster of signatures. 9. The method of claim 8, wherein matching the generated signature with the plurality of signatures further comprising:
matching the generated signature with at least a signature of the at least one cluster of signatures. 10. The method of claim 1, wherein matching the generated signature with the plurality of signatures further comprising:
matching the generated signature with each of the plurality of signatures stored in the database; generating a matching score for each match found; and determining that a matching signature is found, if at least one matching score is above a predefined threshold. 11. 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. 12. A system for linking between a multimedia data element (MMDE) and a web page, the system comprising:
a signature generator for receiving a MMDE from a source through a network and generating a signature for the MMDE, the signature generator comprising a plurality of computational cores, each computational core having properties statistically independent of each other computational core, each computational core generates, responsive to the received MMDE, at least a signature comprising a first signature element and a second signature element; a database containing a plurality of signatures, wherein each of the plurality of stored signatures is generated by the plurality of computational cores, and wherein at least one of the stored signatures has at least one corresponding universal resource locator (URL) of a web page stored therein as metadata of the at least one of the stored signatures; and a matching engine for matching the generated signature for the MMDE to the plurality of signatures stored in the database and outputting at least one URL of at least one signature matching the generated signature wherein, responsive to receiving the MMDE from the source, a web page respective of the at least one URL can be accessed. 13. The system of claim 12, wherein the signature generator is further configured to:
store the generated signature in the database; and associate the at least one URL with the generated signature as a metadata thereof. 14. The system of claim 12, wherein the first signature element is a robust signature. 15. The system of claim 12, wherein the signature generator is further configured to:
periodically perform a clustering of the plurality of the signatures stored in the database; generate a signature for the at least a cluster of signatures; and store the signature for the at least a cluster of signatures in the database. 16. The system of claim 15, wherein the matching engine is further configured to:
match the generated signature with at least the signature for the at least a cluster of signatures. 17. The system of claim 12, wherein the system is further configured to:
match the generated signature with each of the plurality of signatures stored in the database; generate a matching score for each match found; and determine that a matching signature is found, if at least one matching score is above a predefined threshold. 18. The system of claim 17, wherein the matching engine is further configured to:
select a single URL when the matching results in more than one matching score that is above the threshold, wherein the selection is based on at least one of: a random selection, and a weighted decision selection process. 19. The system of claim 12, wherein the MMDE is selected from the group consisting of an image, images of signals, graphics, a video stream, a video clip, an audio stream, an audio clip, a video frame, a photograph, images of signals, a combinations thereof, and portions thereof. 20. The system of claim 19, wherein the images of signals comprise images selected from the group consisting of medical signals, geophysical signals, subsonic signals, supersonic signals, electromagnetic signals, and infrared signals. 21. The system of claim 12, wherein the source comprises at least one of: a mobile phone, a smart phone, a personal PC computer, a laptop computer, and a tablet computer. | A method and system for linking a multimedia data element (MMDE) and a webpage are provided. The method includes receiving a MMDE from a source; generating a signature representative of the MMDE using a plurality of computational cores; matching the generated signature with a plurality of signatures stored in a database to find at least one matching signature, wherein at least one of the stored signatures has at least one corresponding universal resource locator (URL) of a web page stored therein as metadata of the at least one of the stored signatures; and providing to the source at least a URL that is a metadata of a matched signature upon determination of a match between the generated signature and at least one of the plurality of signatures stored in the database.1. A method for linking between a multimedia data element (MMDE) and a web page, comprising:
receiving a MMDE from a source; generating a signature representative of the MMDE using a plurality of computational cores, each computational core having properties statistically independent of each other computational core, each computational core generates, responsive to the received MMDE, at least a signature comprising a first signature element and a second signature element; matching the generated signature with a plurality of signatures stored in a database to find at least one matching signature, wherein each signature of the stored plurality of signatures is generated by the plurality of computational cores, and wherein at least one of the stored signatures has at least one corresponding universal resource locator (URL) of a web page stored therein as metadata of the at least one of the stored signatures; and providing to the source at least a URL that is a metadata of a matched signature upon determination of a match between the generated signature and at least one of the plurality of signatures stored in the database. 2. The method of claim 1, further comprising:
storing the generated signature in a database; and associating the at least a URL that is a metadata of a matched signature with the generated signature as a metadata of the generated signature. 3. The method of claim 1, further comprising:
selecting a single URL when the matching results in more than one matching signature, wherein the selection is based on at least one of: a random selection, and a weighted decision selection process. 4. The method of claim 3, wherein providing the URL to the source further comprising:
enabling display of a web-page corresponding to the URL on a display. 5. The method of claim 1, wherein the MMDE is selected from the group consisting of an image, graphics, a video stream, a video clip, an audio stream, an audio clip, a video frame, a photograph, images of signals, a combinations thereof, and portions thereof. 6. The method of claim 5, wherein the images of signals comprise images selected from the group consisting of medical signals, geophysical signals, subsonic signals, supersonic signals, electromagnetic signals, and infrared signals. 7. The method of claim 1, wherein the first signature element is a robust signature. 8. The method of claim 1, further comprising:
performing a clustering of at least a portion of the plurality of signatures to generate at least one cluster of signatures; and generating a signature by the plurality of computational cores for each of the at least one cluster of signatures. 9. The method of claim 8, wherein matching the generated signature with the plurality of signatures further comprising:
matching the generated signature with at least a signature of the at least one cluster of signatures. 10. The method of claim 1, wherein matching the generated signature with the plurality of signatures further comprising:
matching the generated signature with each of the plurality of signatures stored in the database; generating a matching score for each match found; and determining that a matching signature is found, if at least one matching score is above a predefined threshold. 11. 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. 12. A system for linking between a multimedia data element (MMDE) and a web page, the system comprising:
a signature generator for receiving a MMDE from a source through a network and generating a signature for the MMDE, the signature generator comprising a plurality of computational cores, each computational core having properties statistically independent of each other computational core, each computational core generates, responsive to the received MMDE, at least a signature comprising a first signature element and a second signature element; a database containing a plurality of signatures, wherein each of the plurality of stored signatures is generated by the plurality of computational cores, and wherein at least one of the stored signatures has at least one corresponding universal resource locator (URL) of a web page stored therein as metadata of the at least one of the stored signatures; and a matching engine for matching the generated signature for the MMDE to the plurality of signatures stored in the database and outputting at least one URL of at least one signature matching the generated signature wherein, responsive to receiving the MMDE from the source, a web page respective of the at least one URL can be accessed. 13. The system of claim 12, wherein the signature generator is further configured to:
store the generated signature in the database; and associate the at least one URL with the generated signature as a metadata thereof. 14. The system of claim 12, wherein the first signature element is a robust signature. 15. The system of claim 12, wherein the signature generator is further configured to:
periodically perform a clustering of the plurality of the signatures stored in the database; generate a signature for the at least a cluster of signatures; and store the signature for the at least a cluster of signatures in the database. 16. The system of claim 15, wherein the matching engine is further configured to:
match the generated signature with at least the signature for the at least a cluster of signatures. 17. The system of claim 12, wherein the system is further configured to:
match the generated signature with each of the plurality of signatures stored in the database; generate a matching score for each match found; and determine that a matching signature is found, if at least one matching score is above a predefined threshold. 18. The system of claim 17, wherein the matching engine is further configured to:
select a single URL when the matching results in more than one matching score that is above the threshold, wherein the selection is based on at least one of: a random selection, and a weighted decision selection process. 19. The system of claim 12, wherein the MMDE is selected from the group consisting of an image, images of signals, graphics, a video stream, a video clip, an audio stream, an audio clip, a video frame, a photograph, images of signals, a combinations thereof, and portions thereof. 20. The system of claim 19, wherein the images of signals comprise images selected from the group consisting of medical signals, geophysical signals, subsonic signals, supersonic signals, electromagnetic signals, and infrared signals. 21. The system of claim 12, wherein the source comprises at least one of: a mobile phone, a smart phone, a personal PC computer, a laptop computer, and a tablet computer. | 2,100 |
4,938 | 13,832,782 | 2,142 | A method and system for managing the active area of a touch-sensitive display is disclosed. A request to resize the active area of a touch-sensitive display is received from a user in the form of a user gesture. The relationship of the current dimensions of the active area to the inside dimensions of a bezel associated with the touch-sensitive display is determined. The request is then processed to initiate active area resizing operations. If the dimensions of the active area are coincident with the inside dimensions of the bezel, then the dimensions of the active area can be reduced. If the dimensions of the active area are not coincident with the inside dimensions of the bezel, then the dimensions of the active area can be increased. | 1. A computer-implementable method for managing the active area of a touch-sensitive display, comprising:
receiving user input data from a user, the user input data comprising a request to resize the active area of a touch-sensitive display; processing active area data to determine the relationship of the current dimensions of the active area to the inside dimensions of a bezel associated with the touch-sensitive display; and processing the user input data to initiate active area resizing operations. 2. The method of claim 1, wherein the active area resizing operations comprise one member of the set of:
decreasing the dimensions of the active area if the current dimensions of the active area are coincident with the inside dimensions of the bezel; and increasing the dimensions of the active area if the current dimensions of the active area are not coincident with the inside dimensions of the bezel. 3. The method of claim 1, wherein:
the active area resizing operations automatically resize the dimensions of the active area to a set of predetermined dimensions; and the difference between the set of predetermined dimensions and the inside dimensions of the touch-sensitive display's bezel comply with a predetermined certification requirement. 4. The method of claim 1, wherein:
the active area resizing operations incrementally resize the dimensions of the active area in predetermined increments. 5. The method of claim 1, wherein:
the touch-sensitive display comprises an optical imaging touchscreen. 6. The method of claim 1, wherein the user input data is received as a result of the performance of at least one member of the set of:
a simple user gesture; a multi-touch user gesture; a three dimensional (3D) user gesture; proximity detection of a user; a voice recognition command; and an interaction with a physical control by a user. 7. A system comprising:
a processor; a data bus coupled to the processor; and a non-transitory, computer-readable storage medium embodying computer program code for managing the active area of a touch-sensitive display, the non-transitory, computer-readable storage medium being coupled to the data bus, the computer program code interacting with a plurality of computer operations and comprising instructions executable by the processor and configured for:
receiving user input data from a user, the user input data comprising a request to resize the active area of a touch-sensitive display;
processing active area data to determine the relationship of the current dimensions of the active area to the inside dimensions of a bezel associated with the touch-sensitive display; and
processing the user input data to initiate active area resizing operations. 8. The system of claim 7, wherein the active area resizing operations comprise one member of the set of:
decreasing the dimensions of the active area if the current dimensions of the active area are coincident with the inside dimensions of the bezel; and increasing the dimensions of the active area if the current dimensions of the active area are not coincident with the inside dimensions of the bezel. 9. The system of claim 7, wherein:
the active area resizing operations automatically resize the dimensions of the active area to a set of predetermined dimensions; and the difference between the set of predetermined dimensions and the inside dimensions of the touch-sensitive display's bezel comply with a predetermined certification requirement. 10. The system of claim 7, wherein:
the active area resizing operations incrementally resize the dimensions of the active area in predetermined increments. 11. The system of claim 7, wherein:
the touch-sensitive display comprises an optical imaging touchscreen. 12. The system of claim 7, wherein the user input data is received as a result of the performance of at least one member of the set of:
a simple user gesture; a multi-touch user gesture; a three dimensional (3D) user gesture; proximity detection of a user; a voice recognition command; and an interaction with a physical control by a user. 13. A non-transitory, computer-readable storage medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
receiving user input data from a user, the user input data comprising a request to resize the active area of a touch-sensitive display; processing active area data to determine the relationship of the current dimensions of the active area to the inside dimensions of a bezel associated with the touch-sensitive display; and processing the user input data to initiate active area resizing operations. 14. The non-transitory, computer-readable storage medium of claim 13, wherein the active area resizing operations comprise one member of the set of:
decreasing the dimensions of the active area if the current dimensions of the active area are coincident with the inside dimensions of the bezel; and increasing the dimensions of the active area if the current dimensions of the active area are not coincident with the inside dimensions of the bezel. 15. The non-transitory, computer-readable storage medium of claim 13, wherein:
the active area resizing operations automatically resize the dimensions of the active area to a set of predetermined dimensions; and the difference between the set of predetermined dimensions and the inside dimensions of the touch-sensitive display's bezel comply with a predetermined certification requirement. 16. The non-transitory, computer-readable storage medium of claim 13, wherein:
the active area resizing operations incrementally resize the dimensions of the active area in predetermined increments. 17. The non-transitory, computer-readable storage medium of claim 13, wherein:
the touch-sensitive display comprises an optical imaging touchscreen. 18. The non-transitory, computer-readable storage medium of claim 13, wherein the user input data is received as a result of the performance of at least one member of the set of:
a simple user gesture; a multi-touch user gesture; a three dimensional (3D) user gesture; proximity detection of a user; a voice recognition command; and an interaction with a physical control by a user. | A method and system for managing the active area of a touch-sensitive display is disclosed. A request to resize the active area of a touch-sensitive display is received from a user in the form of a user gesture. The relationship of the current dimensions of the active area to the inside dimensions of a bezel associated with the touch-sensitive display is determined. The request is then processed to initiate active area resizing operations. If the dimensions of the active area are coincident with the inside dimensions of the bezel, then the dimensions of the active area can be reduced. If the dimensions of the active area are not coincident with the inside dimensions of the bezel, then the dimensions of the active area can be increased.1. A computer-implementable method for managing the active area of a touch-sensitive display, comprising:
receiving user input data from a user, the user input data comprising a request to resize the active area of a touch-sensitive display; processing active area data to determine the relationship of the current dimensions of the active area to the inside dimensions of a bezel associated with the touch-sensitive display; and processing the user input data to initiate active area resizing operations. 2. The method of claim 1, wherein the active area resizing operations comprise one member of the set of:
decreasing the dimensions of the active area if the current dimensions of the active area are coincident with the inside dimensions of the bezel; and increasing the dimensions of the active area if the current dimensions of the active area are not coincident with the inside dimensions of the bezel. 3. The method of claim 1, wherein:
the active area resizing operations automatically resize the dimensions of the active area to a set of predetermined dimensions; and the difference between the set of predetermined dimensions and the inside dimensions of the touch-sensitive display's bezel comply with a predetermined certification requirement. 4. The method of claim 1, wherein:
the active area resizing operations incrementally resize the dimensions of the active area in predetermined increments. 5. The method of claim 1, wherein:
the touch-sensitive display comprises an optical imaging touchscreen. 6. The method of claim 1, wherein the user input data is received as a result of the performance of at least one member of the set of:
a simple user gesture; a multi-touch user gesture; a three dimensional (3D) user gesture; proximity detection of a user; a voice recognition command; and an interaction with a physical control by a user. 7. A system comprising:
a processor; a data bus coupled to the processor; and a non-transitory, computer-readable storage medium embodying computer program code for managing the active area of a touch-sensitive display, the non-transitory, computer-readable storage medium being coupled to the data bus, the computer program code interacting with a plurality of computer operations and comprising instructions executable by the processor and configured for:
receiving user input data from a user, the user input data comprising a request to resize the active area of a touch-sensitive display;
processing active area data to determine the relationship of the current dimensions of the active area to the inside dimensions of a bezel associated with the touch-sensitive display; and
processing the user input data to initiate active area resizing operations. 8. The system of claim 7, wherein the active area resizing operations comprise one member of the set of:
decreasing the dimensions of the active area if the current dimensions of the active area are coincident with the inside dimensions of the bezel; and increasing the dimensions of the active area if the current dimensions of the active area are not coincident with the inside dimensions of the bezel. 9. The system of claim 7, wherein:
the active area resizing operations automatically resize the dimensions of the active area to a set of predetermined dimensions; and the difference between the set of predetermined dimensions and the inside dimensions of the touch-sensitive display's bezel comply with a predetermined certification requirement. 10. The system of claim 7, wherein:
the active area resizing operations incrementally resize the dimensions of the active area in predetermined increments. 11. The system of claim 7, wherein:
the touch-sensitive display comprises an optical imaging touchscreen. 12. The system of claim 7, wherein the user input data is received as a result of the performance of at least one member of the set of:
a simple user gesture; a multi-touch user gesture; a three dimensional (3D) user gesture; proximity detection of a user; a voice recognition command; and an interaction with a physical control by a user. 13. A non-transitory, computer-readable storage medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
receiving user input data from a user, the user input data comprising a request to resize the active area of a touch-sensitive display; processing active area data to determine the relationship of the current dimensions of the active area to the inside dimensions of a bezel associated with the touch-sensitive display; and processing the user input data to initiate active area resizing operations. 14. The non-transitory, computer-readable storage medium of claim 13, wherein the active area resizing operations comprise one member of the set of:
decreasing the dimensions of the active area if the current dimensions of the active area are coincident with the inside dimensions of the bezel; and increasing the dimensions of the active area if the current dimensions of the active area are not coincident with the inside dimensions of the bezel. 15. The non-transitory, computer-readable storage medium of claim 13, wherein:
the active area resizing operations automatically resize the dimensions of the active area to a set of predetermined dimensions; and the difference between the set of predetermined dimensions and the inside dimensions of the touch-sensitive display's bezel comply with a predetermined certification requirement. 16. The non-transitory, computer-readable storage medium of claim 13, wherein:
the active area resizing operations incrementally resize the dimensions of the active area in predetermined increments. 17. The non-transitory, computer-readable storage medium of claim 13, wherein:
the touch-sensitive display comprises an optical imaging touchscreen. 18. The non-transitory, computer-readable storage medium of claim 13, wherein the user input data is received as a result of the performance of at least one member of the set of:
a simple user gesture; a multi-touch user gesture; a three dimensional (3D) user gesture; proximity detection of a user; a voice recognition command; and an interaction with a physical control by a user. | 2,100 |
4,939 | 14,551,179 | 2,179 | In one embodiment, a method includes generating a notification for a first user that describes a check-in by a second user. The first and second users are users of a social-networking system that has a number of nodes and a number of edges connecting the nodes, with at least one node corresponding to the first user and at least one other node corresponding to the second user. The method includes determining whether to generate in association with the notification an interactive element for associating the first user with the check-in, and, when the interactive element is to be generated, the method includes generating the interactive element and providing the interactive element for display to the first user in association with the notification. | 1. A method comprising:
by a computing device, generating a notification for a first user, the notification comprising a description of a check-in by a second user, the first and second users being users of a social networking system comprising a plurality of nodes and a plurality of edges connecting the nodes, at least one node corresponding to the first user, at least one node corresponding to the second user; by a computing device, determining whether to generate in association with the notification an interactive element for associating the first user with the check-in; and by a computing device, when the interactive element is to be generated, generating the interactive element and providing the interactive element for display to the first user in association with the notification. 2. The method of claim 1, further comprising:
by a computing device, receiving an identification that the first user has interacted with the interactive element; and by a computing device, associating the first user with the check-in. 3. The method of claim 1, further comprising:
by a computing device, receiving an identification that the first user has interacted with the interactive element; and by a computing device, generating a notification of the interaction for the second user; and by a computing device, providing the notification of the interaction for display to the second user. 4. The method of claim 3, wherein the notification of the interaction comprises an interactive element for allowing or disallowing the first user from associating with the check-in. 5. The method of claim 1, further comprising:
by a computing device, receiving an identification that the first user has interacted with the interactive element; and by a computing device, allowing or disallowing the first user from associating with the check-in based on one or more criteria. 6. The method of claim 5, wherein when the first user is allowed to associate with the check-in:
by a computing device, generating a notification of the interaction for the second user, the notification of the interaction comprising an interactive element for allowing or disallowing the first user from associating with the check-in; and by a computing device, providing the notification of the interaction for display to the second user. 7. The method of claim 5, wherein the criteria is determined at least in part by the second user. 8. The method of claim 5, wherein the criteria comprises a maximum threshold for a degree-of-separation between the node representing the first user and the node representing the second user. 9. The method of claim 8, wherein the threshold is two. 10. The method of claim 5, wherein the criteria comprises an identification of one or more groups; and
allowing or disallowing the first user from associating with the check-in based on one or more criteria comprises determining whether the first user is a member of at least one of the one or more groups. 11. The method of claim 5, wherein the criteria comprises an identification of one or more users. 12. The method of claim 5, wherein the criteria comprises one or more places; and
allowing or disallowing the first user from associating with the check-in based on one or more criteria comprises determining whether a place associated with the check-in corresponds to at least one of the places identified by the criteria. 13. The method of claim 5, wherein the criteria comprises one or more types of places; and
allowing or disallowing the first user from associating with the check-in based on one or more criteria comprises determining whether a type of place associated with the check-in corresponds to at least one of the type of places identified by the criteria. 14. The method of claim 5, wherein the criteria is based at least in part on a check-in history for the second user. 15. The method of claim 1, wherein determining whether to generate the interactive element comprises:
accessing a check-in history for the first user; and determining whether to generate the interactive element based at least in part on the check-in history. 16. The method of claim 1, wherein determining whether to generate the interactive element comprises:
accessing a check-in history for the second user; and determining whether to generate the interactive element based at least in part on the check-in history. 17. The method of claim 1, wherein determining whether to generate the interactive element comprises:
determining a place associated with the check-in; determining a location of the first user; comparing the location or a place corresponding to the location to the place associated with the check-in; and determining whether to generate the interactive element based at least in part on the comparison. 18. The method of claim 1, wherein generating the interactive element and providing the interactive element for display to the first user in association with the notification further comprises determining a graphical characteristic of the interactive element based on a check-in history associated with the first user. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
generate a notification for a first user, the notification comprising a description of a check-in by a second user, the first and second users being users of a social networking system comprising a plurality of nodes and a plurality of edges connecting the nodes, at least one node corresponding to the first user, at least one node corresponding to the second user; determine whether to generate in association with the notification an interactive element for associating the first user with the check-in; and when the interactive element is to be generated, generate the interactive element and provide the interactive element for display to the first user in association with the notification. 20. A system comprising:
one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
generate a notification for a first user, the notification comprising a description of a check-in by a second user, the first and second users being users of a social networking system comprising a plurality of nodes and a plurality of edges connecting the nodes, at least one node corresponding to the first user, at least one node corresponding to the second user;
determine whether to generate in association with the notification an interactive element for associating the first user with the check-in; and
when the interactive element is to be generated, generate the interactive element and provide the interactive element for display to the first user in association with the notification. | In one embodiment, a method includes generating a notification for a first user that describes a check-in by a second user. The first and second users are users of a social-networking system that has a number of nodes and a number of edges connecting the nodes, with at least one node corresponding to the first user and at least one other node corresponding to the second user. The method includes determining whether to generate in association with the notification an interactive element for associating the first user with the check-in, and, when the interactive element is to be generated, the method includes generating the interactive element and providing the interactive element for display to the first user in association with the notification.1. A method comprising:
by a computing device, generating a notification for a first user, the notification comprising a description of a check-in by a second user, the first and second users being users of a social networking system comprising a plurality of nodes and a plurality of edges connecting the nodes, at least one node corresponding to the first user, at least one node corresponding to the second user; by a computing device, determining whether to generate in association with the notification an interactive element for associating the first user with the check-in; and by a computing device, when the interactive element is to be generated, generating the interactive element and providing the interactive element for display to the first user in association with the notification. 2. The method of claim 1, further comprising:
by a computing device, receiving an identification that the first user has interacted with the interactive element; and by a computing device, associating the first user with the check-in. 3. The method of claim 1, further comprising:
by a computing device, receiving an identification that the first user has interacted with the interactive element; and by a computing device, generating a notification of the interaction for the second user; and by a computing device, providing the notification of the interaction for display to the second user. 4. The method of claim 3, wherein the notification of the interaction comprises an interactive element for allowing or disallowing the first user from associating with the check-in. 5. The method of claim 1, further comprising:
by a computing device, receiving an identification that the first user has interacted with the interactive element; and by a computing device, allowing or disallowing the first user from associating with the check-in based on one or more criteria. 6. The method of claim 5, wherein when the first user is allowed to associate with the check-in:
by a computing device, generating a notification of the interaction for the second user, the notification of the interaction comprising an interactive element for allowing or disallowing the first user from associating with the check-in; and by a computing device, providing the notification of the interaction for display to the second user. 7. The method of claim 5, wherein the criteria is determined at least in part by the second user. 8. The method of claim 5, wherein the criteria comprises a maximum threshold for a degree-of-separation between the node representing the first user and the node representing the second user. 9. The method of claim 8, wherein the threshold is two. 10. The method of claim 5, wherein the criteria comprises an identification of one or more groups; and
allowing or disallowing the first user from associating with the check-in based on one or more criteria comprises determining whether the first user is a member of at least one of the one or more groups. 11. The method of claim 5, wherein the criteria comprises an identification of one or more users. 12. The method of claim 5, wherein the criteria comprises one or more places; and
allowing or disallowing the first user from associating with the check-in based on one or more criteria comprises determining whether a place associated with the check-in corresponds to at least one of the places identified by the criteria. 13. The method of claim 5, wherein the criteria comprises one or more types of places; and
allowing or disallowing the first user from associating with the check-in based on one or more criteria comprises determining whether a type of place associated with the check-in corresponds to at least one of the type of places identified by the criteria. 14. The method of claim 5, wherein the criteria is based at least in part on a check-in history for the second user. 15. The method of claim 1, wherein determining whether to generate the interactive element comprises:
accessing a check-in history for the first user; and determining whether to generate the interactive element based at least in part on the check-in history. 16. The method of claim 1, wherein determining whether to generate the interactive element comprises:
accessing a check-in history for the second user; and determining whether to generate the interactive element based at least in part on the check-in history. 17. The method of claim 1, wherein determining whether to generate the interactive element comprises:
determining a place associated with the check-in; determining a location of the first user; comparing the location or a place corresponding to the location to the place associated with the check-in; and determining whether to generate the interactive element based at least in part on the comparison. 18. The method of claim 1, wherein generating the interactive element and providing the interactive element for display to the first user in association with the notification further comprises determining a graphical characteristic of the interactive element based on a check-in history associated with the first user. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
generate a notification for a first user, the notification comprising a description of a check-in by a second user, the first and second users being users of a social networking system comprising a plurality of nodes and a plurality of edges connecting the nodes, at least one node corresponding to the first user, at least one node corresponding to the second user; determine whether to generate in association with the notification an interactive element for associating the first user with the check-in; and when the interactive element is to be generated, generate the interactive element and provide the interactive element for display to the first user in association with the notification. 20. A system comprising:
one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
generate a notification for a first user, the notification comprising a description of a check-in by a second user, the first and second users being users of a social networking system comprising a plurality of nodes and a plurality of edges connecting the nodes, at least one node corresponding to the first user, at least one node corresponding to the second user;
determine whether to generate in association with the notification an interactive element for associating the first user with the check-in; and
when the interactive element is to be generated, generate the interactive element and provide the interactive element for display to the first user in association with the notification. | 2,100 |
4,940 | 13,787,570 | 2,128 | Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving data describing a model, the model describing a curve network; determining boundary continuity constraints for each edge, of each face, in the model; combining the determined boundary continuity constraints to determine respective boundary continuity for each face; and determining, using the respective boundary continuity constraints, a respective surface patch for each face. | 1. A computer-implemented method, the method comprising:
receiving data describing a model, the model describing a curve network; determining boundary continuity constraints for each edge, of each face, in the model; combining the determined boundary continuity constraints to determine respective boundary continuity for each face; and determining, using the respective boundary continuity constraints, a respective surface patch for each face. 2. The method of claim 1, wherein determining boundary continuity constraints for each edge, of each face, in the model comprises:
determining, for an edge of a face, respective end derivatives of a first and second adjacent edge; determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges; and determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge. 3. The method of claim 2, wherein determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges comprises:
sweeping the respective end derivatives of the first and second edge along the edge. 4. The method of claim 2, wherein determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge comprises:
blending the respective derivative fields for the first and second adjacent edges. 5. The method of claim 4, wherein the blending is performed using a linear function to achieve a G0 continuity between the first and second adjacent edges. 6. The method of claim 4, wherein the blending is performed using a cubic Hermite interpolation polynomial to achieve a G1 continuity between the first and second adjacent edges. 7. The method of claim 4, wherein the blending is performed using a quintic Hermite interpolation polynomial to achieve a G2 continuity between the first and second adjacent edges. 8. The method of claim 1, wherein the respective boundary continuity constraints for each respective face are determined using local geometric information of the respective face. 9. A computer storage medium having instructions stored thereon that, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising:
receiving data describing a model, the model describing a curve network; determining boundary continuity constraints for each edge, of each face, in the model; combining the determined boundary continuity constraints to determine respective boundary continuity for each face; and determining, using the respective boundary continuity constraints, a respective surface patch for each face. 10. The medium of claim 9, wherein determining boundary continuity constraints for each edge, of each face, in the model comprises:
determining, for an edge of a face, respective end derivatives of a first and second adjacent edge; determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges; and determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge. 11. The medium of claim 10, wherein determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges comprises:
sweeping the respective end derivatives of the first and second edge along the edge. 12. The medium of claim 10, wherein determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge comprises:
blending the respective derivative fields for the first and second adjacent edges. 13. The medium of claim 12, wherein the blending is performed using a linear function to achieve a G0 continuity between the first and second adjacent edges. 14. The medium of claim 12, wherein the blending is performed using a cubic Hermite interpolation polynomial to achieve a G1 continuity between the first and second adjacent edges. 15. The medium of claim 12, wherein the blending is performed using a quintic Hermite interpolation polynomial to achieve a G2 continuity between the first and second adjacent edges. 16. The medium of claim 9, wherein the respective boundary continuity constraints for each respective face are determined using local geometric information of the respective face. 17. A system comprising:
a computer storage medium having instructions stored thereon; and data processing apparatus configured to execute the instructions to perform operations comprising: receiving data describing a model, the model describing a curve network; determining boundary continuity constraints for each edge, of each face, in the model; combining the determined boundary continuity constraints to determine respective boundary continuity for each face; and determining, using the respective boundary continuity constraints, a respective surface patch for each face. 18. The system of claim 17, wherein determining boundary continuity constraints for each edge, of each face, in the model comprises:
determining, for an edge of a face, respective end derivatives of a first and second adjacent edge; determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges; and determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge. 19. The system of claim 18, wherein determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges comprises:
sweeping the respective end derivatives of the first and second edge along the edge. 20. The system of claim 18, wherein determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge comprises:
blending the respective derivative fields for the first and second adjacent edges. 21. The system of claim 20, wherein the blending is performed using a linear function to achieve a G0 continuity between the first and second adjacent edges. 22. The system of claim 20, wherein the blending is performed using a cubic Hermite interpolation polynomial to achieve a G1 continuity between the first and second adjacent edges. 23. The system of claim 20, wherein the blending is performed using a quintic Hermite interpolation polynomial to achieve a G2 continuity between the first and second adjacent edges. 24. The system of claim 17, wherein the respective boundary continuity constraints for each respective face are determined using local geometric information of the respective face. | Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving data describing a model, the model describing a curve network; determining boundary continuity constraints for each edge, of each face, in the model; combining the determined boundary continuity constraints to determine respective boundary continuity for each face; and determining, using the respective boundary continuity constraints, a respective surface patch for each face.1. A computer-implemented method, the method comprising:
receiving data describing a model, the model describing a curve network; determining boundary continuity constraints for each edge, of each face, in the model; combining the determined boundary continuity constraints to determine respective boundary continuity for each face; and determining, using the respective boundary continuity constraints, a respective surface patch for each face. 2. The method of claim 1, wherein determining boundary continuity constraints for each edge, of each face, in the model comprises:
determining, for an edge of a face, respective end derivatives of a first and second adjacent edge; determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges; and determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge. 3. The method of claim 2, wherein determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges comprises:
sweeping the respective end derivatives of the first and second edge along the edge. 4. The method of claim 2, wherein determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge comprises:
blending the respective derivative fields for the first and second adjacent edges. 5. The method of claim 4, wherein the blending is performed using a linear function to achieve a G0 continuity between the first and second adjacent edges. 6. The method of claim 4, wherein the blending is performed using a cubic Hermite interpolation polynomial to achieve a G1 continuity between the first and second adjacent edges. 7. The method of claim 4, wherein the blending is performed using a quintic Hermite interpolation polynomial to achieve a G2 continuity between the first and second adjacent edges. 8. The method of claim 1, wherein the respective boundary continuity constraints for each respective face are determined using local geometric information of the respective face. 9. A computer storage medium having instructions stored thereon that, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising:
receiving data describing a model, the model describing a curve network; determining boundary continuity constraints for each edge, of each face, in the model; combining the determined boundary continuity constraints to determine respective boundary continuity for each face; and determining, using the respective boundary continuity constraints, a respective surface patch for each face. 10. The medium of claim 9, wherein determining boundary continuity constraints for each edge, of each face, in the model comprises:
determining, for an edge of a face, respective end derivatives of a first and second adjacent edge; determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges; and determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge. 11. The medium of claim 10, wherein determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges comprises:
sweeping the respective end derivatives of the first and second edge along the edge. 12. The medium of claim 10, wherein determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge comprises:
blending the respective derivative fields for the first and second adjacent edges. 13. The medium of claim 12, wherein the blending is performed using a linear function to achieve a G0 continuity between the first and second adjacent edges. 14. The medium of claim 12, wherein the blending is performed using a cubic Hermite interpolation polynomial to achieve a G1 continuity between the first and second adjacent edges. 15. The medium of claim 12, wherein the blending is performed using a quintic Hermite interpolation polynomial to achieve a G2 continuity between the first and second adjacent edges. 16. The medium of claim 9, wherein the respective boundary continuity constraints for each respective face are determined using local geometric information of the respective face. 17. A system comprising:
a computer storage medium having instructions stored thereon; and data processing apparatus configured to execute the instructions to perform operations comprising: receiving data describing a model, the model describing a curve network; determining boundary continuity constraints for each edge, of each face, in the model; combining the determined boundary continuity constraints to determine respective boundary continuity for each face; and determining, using the respective boundary continuity constraints, a respective surface patch for each face. 18. The system of claim 17, wherein determining boundary continuity constraints for each edge, of each face, in the model comprises:
determining, for an edge of a face, respective end derivatives of a first and second adjacent edge; determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges; and determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge. 19. The system of claim 18, wherein determining, based on the respective end derivatives, respective derivative fields for the first and second adjacent edges comprises:
sweeping the respective end derivatives of the first and second edge along the edge. 20. The system of claim 18, wherein determining, based on the respective derivative fields for the first and second adjacent edges, final derivative fields for the edge comprises:
blending the respective derivative fields for the first and second adjacent edges. 21. The system of claim 20, wherein the blending is performed using a linear function to achieve a G0 continuity between the first and second adjacent edges. 22. The system of claim 20, wherein the blending is performed using a cubic Hermite interpolation polynomial to achieve a G1 continuity between the first and second adjacent edges. 23. The system of claim 20, wherein the blending is performed using a quintic Hermite interpolation polynomial to achieve a G2 continuity between the first and second adjacent edges. 24. The system of claim 17, wherein the respective boundary continuity constraints for each respective face are determined using local geometric information of the respective face. | 2,100 |
4,941 | 13,168,525 | 2,141 | A method, apparatus, and non-transitory computer-readable storage medium for presenting information identifying relationships in a database. Entity labels identifying a plurality of different entity types modeled in the database are presented in a user interface. Input identifying one or more selected entity types is received. A plurality of entity instance relationship sets is accessed. Each entity instance relationship set identifies a relationship between entity instances of at least two different entity types. Attribute data of the entity instances identified in only those entity instance relationship sets that identify a relationship between entity instances of the one or more selected entity types are presented, such that attribute data for each unique relationship between entity instances of the one or more selected entity types are presented only once. | 1. A method for presenting data, comprising:
presenting, by a computing device, in a user interface, entity labels identifying a plurality of different entity types modeled in a database; receiving, by the computing device, input identifying one or more selected entity types of the plurality of different entity types; accessing, by the computing device, a plurality of entity instance relationship sets, each entity instance relationship set identifying a relationship between entity instances of at least two different entity types of the plurality of different entity types; selecting, from the plurality of entity instance relationship sets, only those entity instance relationship sets that identify a relationship between entity instances of the one or more selected entity types to form a subset of entity instance relationship sets, wherein only a single entity instance relationship set is selected for each different identified relationship; and for each entity instance relationship set in the subset, presenting, in the user interface, attribute data from each of the entity instances identified as having a relationship in the each entity instance relationship set. 2. The method of claim 1, wherein each entity instance relationship set comprises a row in a database structure. 3. The method of claim 1, wherein each entity instance relationship set identifies a relationship between entity instances of at least three different entity types of the plurality of different entity types. 4. The method of claim 1, wherein each entity instance relationship set comprises entity instance identifiers, each of which uniquely identifies one of the entity instances of the at least two different entity types. 5. The method of claim 1, wherein the plurality of entity instance relationship sets comprises multiple entity instance relationship sets that identify a same relationship between the entity instances of the at least two different entity types of the plurality of different entity types. 6. The method of claim 1, wherein the attribute data from each of the entity instances identified as having the relationship in the each entity instance relationship set is stored in the each entity instance relationship set. 7. The method of claim 1, further comprising:
prior to presenting, in the user interface, the entity labels identifying the plurality of different entity types modeled in the database, receiving data identifying:
the plurality of different entity types; and
for each of the plurality of different entity types, at least one attribute associated with the each of the plurality of different entity types; and
wherein the attribute data presented in the user interface is attribute data relating to the at least one attribute associated with the each of the plurality of different entity types. 8. A method for presenting data, comprising:
presenting, by a computing device, in a user interface, entity labels identifying a plurality of different entity types modeled in a database; receiving, by the computing device, input identifying one or more selected entity types of the plurality of entity types; accessing, by the computing device, a plurality of entity instance relationship sets, each entity instance relationship set identifying a relationship between entity instances of at least two different entity types of the plurality of different entity types; and presenting, in the user interface, from only those entity instance relationship sets that identify a relationship between entity instances of the one or more selected entity types, attribute data of the entity instances identified in each such entity instance relationship set, wherein attribute data for each unique relationship between entity instances of the one or more selected entity types is presented only once. 9. The method of claim 8, wherein each entity instance relationship set identifies a relationship between entity instances of at least three different entity types of the plurality of different entity types. 10. The method of claim 8, wherein each entity instance relationship set comprises entity instance identifiers, each of which uniquely identifies one of the entity instances of the at least two different entity types. 11. The method of claim 8, wherein the plurality of entity instance relationship sets comprises multiple entity instance relationship sets that identify a same relationship between the entity instances of the at least two different entity types of the plurality of different entity types. 12. The method of claim 8, further comprising:
prior to presenting, in the user interface, the entity labels identifying the plurality of different entity types modeled in the database, receiving data identifying:
the plurality of different entity types; and
for each of the plurality of different entity types, at least one attribute associated with the each of the plurality of different entity types; and
wherein the attribute data presented in the user interface is attribute data relating to the at least one attribute associated with the each of the plurality of different entity types. 13. A computing device comprising:
a communication interface adapted to communicate with a network; and a control system comprising a processor and coupled to the communication interface, and adapted to:
present in a user interface entity labels identifying a plurality of different entity types modeled in a database;
receive input identifying one or more selected entity types of the plurality of different entity types;
access a plurality of entity instance relationship sets, each entity instance relationship set identifying a relationship between entity instances of at least two different entity types of the plurality of different entity types; and
present in the user interface from only those entity instance relationship sets that identify a relationship between entity instances of the one or more selected entity types attribute data of the entity instances identified in each such entity instance relationship set, wherein attribute data for each unique relationship between the entity instances of the one or more selected entity types is presented only once. 14. The computing device of claim 13, wherein each entity instance relationship set identifies a relationship between entity instances of at least three different entity types of the plurality of different entity types. 15. The computing device of claim 13, wherein each entity instance relationship set comprises entity instance identifiers, each of which uniquely identifies one of the entity instances of the at least two different entity types. 16. The computing device of claim 13, wherein the plurality of entity instance relationship sets comprises multiple entity instance relationship sets that identify a same relationship between entity instances of the at least two different entity types of the plurality of different entity types. 17. The computing device of claim 13, wherein the control system is further adapted to:
prior to presenting, in the user interface, the entity labels identifying the plurality of different entity types modeled in the database, receive data identifying:
the plurality of different entity types; and
for each of the plurality of different entity types, at least one attribute associated with the each of the plurality of different entity types; and
wherein the attribute data presented in the user interface is attribute data relating to the at least one attribute associated with the each of the plurality of different entity types. 18. A computer program product for presenting data, the computer program product stored on a non-transitory computer-readable storage medium and including instructions configured to cause a processor to carry out the steps of:
presenting in a user interface entity labels identifying a plurality of different entity types modeled in a database; receiving input identifying one or more selected entity types of the plurality of entity types; accessing a plurality of entity instance relationship sets, each entity instance relationship set identifying a relationship between entity instances of at least two different entity types of the plurality of different entity types; selecting, from the plurality of entity instance relationship sets, only those entity instance relationship sets that identify a relationship between entity instances of the one or more selected entity types to form a subset of entity instance relationship sets, wherein only a single entity instance relationship set is selected for each different identified relationship; and for each entity instance relationship set in the subset, presenting, in the user interface, attribute data from each of the entity instances identified as having a relationship in the each entity instance relationship set. 19. The computer program product of claim 18, wherein the plurality of entity instance relationship sets comprises multiple entity instance relationship sets that identify a same relationship between entity instances of the at least two different entity types of the plurality of different entity types. 20. The computer program product of claim 18, wherein the instructions are further configured to cause the processor to carry out the steps of:
prior to presenting, in the user interface, the entity labels identifying the plurality of different entity types modeled in the database, receiving data identifying:
the plurality of different entity types; and
for each of the plurality of different entity types, at least one attribute associated with the each of the plurality of different entity types; and
wherein the attribute data presented in the user interface is attribute data relating to the at least one attribute associated with the each of the plurality of different entity types. | A method, apparatus, and non-transitory computer-readable storage medium for presenting information identifying relationships in a database. Entity labels identifying a plurality of different entity types modeled in the database are presented in a user interface. Input identifying one or more selected entity types is received. A plurality of entity instance relationship sets is accessed. Each entity instance relationship set identifies a relationship between entity instances of at least two different entity types. Attribute data of the entity instances identified in only those entity instance relationship sets that identify a relationship between entity instances of the one or more selected entity types are presented, such that attribute data for each unique relationship between entity instances of the one or more selected entity types are presented only once.1. A method for presenting data, comprising:
presenting, by a computing device, in a user interface, entity labels identifying a plurality of different entity types modeled in a database; receiving, by the computing device, input identifying one or more selected entity types of the plurality of different entity types; accessing, by the computing device, a plurality of entity instance relationship sets, each entity instance relationship set identifying a relationship between entity instances of at least two different entity types of the plurality of different entity types; selecting, from the plurality of entity instance relationship sets, only those entity instance relationship sets that identify a relationship between entity instances of the one or more selected entity types to form a subset of entity instance relationship sets, wherein only a single entity instance relationship set is selected for each different identified relationship; and for each entity instance relationship set in the subset, presenting, in the user interface, attribute data from each of the entity instances identified as having a relationship in the each entity instance relationship set. 2. The method of claim 1, wherein each entity instance relationship set comprises a row in a database structure. 3. The method of claim 1, wherein each entity instance relationship set identifies a relationship between entity instances of at least three different entity types of the plurality of different entity types. 4. The method of claim 1, wherein each entity instance relationship set comprises entity instance identifiers, each of which uniquely identifies one of the entity instances of the at least two different entity types. 5. The method of claim 1, wherein the plurality of entity instance relationship sets comprises multiple entity instance relationship sets that identify a same relationship between the entity instances of the at least two different entity types of the plurality of different entity types. 6. The method of claim 1, wherein the attribute data from each of the entity instances identified as having the relationship in the each entity instance relationship set is stored in the each entity instance relationship set. 7. The method of claim 1, further comprising:
prior to presenting, in the user interface, the entity labels identifying the plurality of different entity types modeled in the database, receiving data identifying:
the plurality of different entity types; and
for each of the plurality of different entity types, at least one attribute associated with the each of the plurality of different entity types; and
wherein the attribute data presented in the user interface is attribute data relating to the at least one attribute associated with the each of the plurality of different entity types. 8. A method for presenting data, comprising:
presenting, by a computing device, in a user interface, entity labels identifying a plurality of different entity types modeled in a database; receiving, by the computing device, input identifying one or more selected entity types of the plurality of entity types; accessing, by the computing device, a plurality of entity instance relationship sets, each entity instance relationship set identifying a relationship between entity instances of at least two different entity types of the plurality of different entity types; and presenting, in the user interface, from only those entity instance relationship sets that identify a relationship between entity instances of the one or more selected entity types, attribute data of the entity instances identified in each such entity instance relationship set, wherein attribute data for each unique relationship between entity instances of the one or more selected entity types is presented only once. 9. The method of claim 8, wherein each entity instance relationship set identifies a relationship between entity instances of at least three different entity types of the plurality of different entity types. 10. The method of claim 8, wherein each entity instance relationship set comprises entity instance identifiers, each of which uniquely identifies one of the entity instances of the at least two different entity types. 11. The method of claim 8, wherein the plurality of entity instance relationship sets comprises multiple entity instance relationship sets that identify a same relationship between the entity instances of the at least two different entity types of the plurality of different entity types. 12. The method of claim 8, further comprising:
prior to presenting, in the user interface, the entity labels identifying the plurality of different entity types modeled in the database, receiving data identifying:
the plurality of different entity types; and
for each of the plurality of different entity types, at least one attribute associated with the each of the plurality of different entity types; and
wherein the attribute data presented in the user interface is attribute data relating to the at least one attribute associated with the each of the plurality of different entity types. 13. A computing device comprising:
a communication interface adapted to communicate with a network; and a control system comprising a processor and coupled to the communication interface, and adapted to:
present in a user interface entity labels identifying a plurality of different entity types modeled in a database;
receive input identifying one or more selected entity types of the plurality of different entity types;
access a plurality of entity instance relationship sets, each entity instance relationship set identifying a relationship between entity instances of at least two different entity types of the plurality of different entity types; and
present in the user interface from only those entity instance relationship sets that identify a relationship between entity instances of the one or more selected entity types attribute data of the entity instances identified in each such entity instance relationship set, wherein attribute data for each unique relationship between the entity instances of the one or more selected entity types is presented only once. 14. The computing device of claim 13, wherein each entity instance relationship set identifies a relationship between entity instances of at least three different entity types of the plurality of different entity types. 15. The computing device of claim 13, wherein each entity instance relationship set comprises entity instance identifiers, each of which uniquely identifies one of the entity instances of the at least two different entity types. 16. The computing device of claim 13, wherein the plurality of entity instance relationship sets comprises multiple entity instance relationship sets that identify a same relationship between entity instances of the at least two different entity types of the plurality of different entity types. 17. The computing device of claim 13, wherein the control system is further adapted to:
prior to presenting, in the user interface, the entity labels identifying the plurality of different entity types modeled in the database, receive data identifying:
the plurality of different entity types; and
for each of the plurality of different entity types, at least one attribute associated with the each of the plurality of different entity types; and
wherein the attribute data presented in the user interface is attribute data relating to the at least one attribute associated with the each of the plurality of different entity types. 18. A computer program product for presenting data, the computer program product stored on a non-transitory computer-readable storage medium and including instructions configured to cause a processor to carry out the steps of:
presenting in a user interface entity labels identifying a plurality of different entity types modeled in a database; receiving input identifying one or more selected entity types of the plurality of entity types; accessing a plurality of entity instance relationship sets, each entity instance relationship set identifying a relationship between entity instances of at least two different entity types of the plurality of different entity types; selecting, from the plurality of entity instance relationship sets, only those entity instance relationship sets that identify a relationship between entity instances of the one or more selected entity types to form a subset of entity instance relationship sets, wherein only a single entity instance relationship set is selected for each different identified relationship; and for each entity instance relationship set in the subset, presenting, in the user interface, attribute data from each of the entity instances identified as having a relationship in the each entity instance relationship set. 19. The computer program product of claim 18, wherein the plurality of entity instance relationship sets comprises multiple entity instance relationship sets that identify a same relationship between entity instances of the at least two different entity types of the plurality of different entity types. 20. The computer program product of claim 18, wherein the instructions are further configured to cause the processor to carry out the steps of:
prior to presenting, in the user interface, the entity labels identifying the plurality of different entity types modeled in the database, receiving data identifying:
the plurality of different entity types; and
for each of the plurality of different entity types, at least one attribute associated with the each of the plurality of different entity types; and
wherein the attribute data presented in the user interface is attribute data relating to the at least one attribute associated with the each of the plurality of different entity types. | 2,100 |
4,942 | 13,834,490 | 2,173 | Example systems and methods to visualize and manage medical device operations and troubleshooting are provided. Interface information from a plurality of medical devices is used to generate a visualization of the interface information from the one or more of the plurality of medical devices. Each medical device interface is represented by a miniature representation of the interface in the visualization. Each miniature representation is to convey information shown on the interface of the medical device. The visualization is provided to a user via a user interface at a remote control computer. The user interface is to facilitate user selection of a miniature representation to trigger display of a larger representation of the selected medical device interface information via the user interface. | 1. A medical device interface visualization system comprising a processor configured to implement:
a communication channel to communicate with a plurality of medical devices to receive interface information for one or more of the plurality of medical devices; a remote controller to generate a visualization of the interface information from the one or more of the plurality of medical devices; and a user interface to provide the visualization of the medical device interface information to a user, each medical device interface represented by a miniature representation of the interface in the visualization, each miniature representation to convey information shown on the interface of the medical device, the user interface to facilitate user selection of a miniature representation to trigger display of a larger representation of the selected medical device interface information via the user interface. 2. The system of claim 1, wherein both the miniature representation and the larger representation of medical device interface information are to convey an indicator of an issue with respect to the associated medical device. 3. The system of claim 1, wherein the miniature representation of medical device interface information comprises at least one of a screen capture of the medical device interface and a live feed from the medical device interface. 4. The system of claim 1, wherein the larger representation of medical device interface information comprises at least one of a screen capture of the medical device interface and a live feed from the medical device interface. 5. The system of claim 1, wherein the user interface is to arrange the visualization of the miniature representations according to a priority of an issue associated with each of the miniature representations. 6. The system of claim 5, wherein the visualization of the miniature representations is to occupy multiple pages on the user interface, and wherein the user interface is to arrange the visualization of the miniature representations such that a page including an alarm associated with a miniature representation of medical device interface information is displayed first for user review. 7. The system of claim 1, wherein the user interface is to further facilitate interaction with a selected medical device interface via at least one of the miniature representation and the larger representation. 8. The system of claim 7, wherein the interaction comprises placing the selected medical device into at least one of a service mode or an administrative mode remotely via the user interface. 9. The system of claim 8, wherein the interaction further comprises configuration of the selected medical device remotely in the at least one of service mode or administrative mode. 10. The system of claim 9, wherein the interaction further comprises enabling the user to select to apply the configuration to the selected medical device or a group of medical devices. 11. A tangible computer readable storage medium including a set of instructions to be executed by a processor, the instructions, when executed, implementing a method to facilitate visualization and troubleshooting of a plurality of medical devices, the method comprising:
communicating with a plurality of medical devices to receive interface information for one or more of the plurality of medical devices; generating a visualization of the interface information from the one or more of the plurality of medical devices via a user interface; providing the visualization of the medical device interface information to a user, each medical device interface represented by a miniature representation of the interface in the visualization, each miniature representation to convey information shown on the interface of the medical device; and facilitating user selection of a miniature representation to trigger display of a larger representation of the selected medical device interface information via the user interface. 12. The computer readable storage medium of claim 11, wherein both the miniature representation and the larger representation of medical device interface information are to convey an indicator of an issue with respect to the associated medical device. 13. The computer readable storage medium of claim 11, wherein the miniature representation of medical device interface information comprises at least one of a screen capture of the medical device interface and a live feed from the medical device interface. 14. The computer readable storage medium of claim 11, wherein the larger representation of medical device interface information comprises at least one of a screen capture of the medical device interface and a live feed from the medical device interface. 15. The computer readable storage medium of claim 11, wherein the method further comprises arranging the visualization of the miniature representations according to a priority of an issue associated with each of the miniature representations. 16. The computer readable storage medium of claim 15, wherein the visualization of the miniature representations is to occupy multiple pages on the user interface, and wherein arranging further comprises arranging the visualization of the miniature representations such that a page including an alarm associated with a miniature representation of medical device interface information is displayed first for user review. 17. The computer readable storage medium of claim 11, wherein the method further comprises facilitating interaction with a selected medical device interface via at least one of the miniature representation and the larger representation. 18. The computer readable storage medium of claim 17, wherein facilitating interaction further comprises placing the selected medical device into at least one of a service mode or an administrative mode remotely via the user interface. 19. The computer readable storage medium of claim 18, wherein facilitating interaction further comprises configuration of the selected medical device remotely in the at least one of service mode or administrative mode. 20. The computer readable storage medium of claim 19, wherein facilitating interaction further comprises enabling the user to select to apply the configuration to the selected medical device or a group of medical devices. | Example systems and methods to visualize and manage medical device operations and troubleshooting are provided. Interface information from a plurality of medical devices is used to generate a visualization of the interface information from the one or more of the plurality of medical devices. Each medical device interface is represented by a miniature representation of the interface in the visualization. Each miniature representation is to convey information shown on the interface of the medical device. The visualization is provided to a user via a user interface at a remote control computer. The user interface is to facilitate user selection of a miniature representation to trigger display of a larger representation of the selected medical device interface information via the user interface.1. A medical device interface visualization system comprising a processor configured to implement:
a communication channel to communicate with a plurality of medical devices to receive interface information for one or more of the plurality of medical devices; a remote controller to generate a visualization of the interface information from the one or more of the plurality of medical devices; and a user interface to provide the visualization of the medical device interface information to a user, each medical device interface represented by a miniature representation of the interface in the visualization, each miniature representation to convey information shown on the interface of the medical device, the user interface to facilitate user selection of a miniature representation to trigger display of a larger representation of the selected medical device interface information via the user interface. 2. The system of claim 1, wherein both the miniature representation and the larger representation of medical device interface information are to convey an indicator of an issue with respect to the associated medical device. 3. The system of claim 1, wherein the miniature representation of medical device interface information comprises at least one of a screen capture of the medical device interface and a live feed from the medical device interface. 4. The system of claim 1, wherein the larger representation of medical device interface information comprises at least one of a screen capture of the medical device interface and a live feed from the medical device interface. 5. The system of claim 1, wherein the user interface is to arrange the visualization of the miniature representations according to a priority of an issue associated with each of the miniature representations. 6. The system of claim 5, wherein the visualization of the miniature representations is to occupy multiple pages on the user interface, and wherein the user interface is to arrange the visualization of the miniature representations such that a page including an alarm associated with a miniature representation of medical device interface information is displayed first for user review. 7. The system of claim 1, wherein the user interface is to further facilitate interaction with a selected medical device interface via at least one of the miniature representation and the larger representation. 8. The system of claim 7, wherein the interaction comprises placing the selected medical device into at least one of a service mode or an administrative mode remotely via the user interface. 9. The system of claim 8, wherein the interaction further comprises configuration of the selected medical device remotely in the at least one of service mode or administrative mode. 10. The system of claim 9, wherein the interaction further comprises enabling the user to select to apply the configuration to the selected medical device or a group of medical devices. 11. A tangible computer readable storage medium including a set of instructions to be executed by a processor, the instructions, when executed, implementing a method to facilitate visualization and troubleshooting of a plurality of medical devices, the method comprising:
communicating with a plurality of medical devices to receive interface information for one or more of the plurality of medical devices; generating a visualization of the interface information from the one or more of the plurality of medical devices via a user interface; providing the visualization of the medical device interface information to a user, each medical device interface represented by a miniature representation of the interface in the visualization, each miniature representation to convey information shown on the interface of the medical device; and facilitating user selection of a miniature representation to trigger display of a larger representation of the selected medical device interface information via the user interface. 12. The computer readable storage medium of claim 11, wherein both the miniature representation and the larger representation of medical device interface information are to convey an indicator of an issue with respect to the associated medical device. 13. The computer readable storage medium of claim 11, wherein the miniature representation of medical device interface information comprises at least one of a screen capture of the medical device interface and a live feed from the medical device interface. 14. The computer readable storage medium of claim 11, wherein the larger representation of medical device interface information comprises at least one of a screen capture of the medical device interface and a live feed from the medical device interface. 15. The computer readable storage medium of claim 11, wherein the method further comprises arranging the visualization of the miniature representations according to a priority of an issue associated with each of the miniature representations. 16. The computer readable storage medium of claim 15, wherein the visualization of the miniature representations is to occupy multiple pages on the user interface, and wherein arranging further comprises arranging the visualization of the miniature representations such that a page including an alarm associated with a miniature representation of medical device interface information is displayed first for user review. 17. The computer readable storage medium of claim 11, wherein the method further comprises facilitating interaction with a selected medical device interface via at least one of the miniature representation and the larger representation. 18. The computer readable storage medium of claim 17, wherein facilitating interaction further comprises placing the selected medical device into at least one of a service mode or an administrative mode remotely via the user interface. 19. The computer readable storage medium of claim 18, wherein facilitating interaction further comprises configuration of the selected medical device remotely in the at least one of service mode or administrative mode. 20. The computer readable storage medium of claim 19, wherein facilitating interaction further comprises enabling the user to select to apply the configuration to the selected medical device or a group of medical devices. | 2,100 |
4,943 | 14,185,602 | 2,191 | A system and method for organizing and classifying existing applications so as to enable users to create new applications using the one or more parts of existing applications. The system is capable of automatically generating a large number of template applications which are fully designed, coded, and ready-to-use. The system also automatically expands its catalog of template applications and screen components, which are categorized based on a specified purpose, whenever a user creates a new application or screen with the same purpose. In this way a user can simply specify the purpose of what they want to create, and the system will provide a ranked list of possibilities based on the actions of other users, and automatic generation mechanisms. | 1. A method for generating a set of ranked screens, the method comprising:
providing a database of screen seeds and parts accessible by a computer processor and a user, each screen seed being capable of having at least one part positioned on a position thereon; said user:
selecting a screen seed from said database;
populating said screen seed with parts from said database until all said positions have a part populated thereon;
assigning said screen a screen purpose; and
repeating said providing, selecting, populating and assigning to create a set of screens, each of said screens in said set having said screen seed and said screen purpose;
said computer processor:
accessing said set of screens and giving each of said screens in said set of screens a lowest ranking;
making at least one new screen, each of said new screens comprising: said screen seed populated with an unused combination of parts which parts have been previously populated on at least one of said screens in said set of screens;
associating each of said new screens with said screen purpose;
increasing said ranking of said screens in said set of screens;
giving each of said new screens a lowest ranking;
merging said new screens into said set of screens; and
storing said set of screens on said database. 2. The method of claim 1 further comprising:
said user making a first application, said first application comprising two or more screens from said database; and
said user assigning said first application an application purpose. 3. The method of claim 2 further comprising:
a second user, said second user making a second application, said second application comprising two or more screens from said database; and
said second user assigning said second application said application purpose. 4. The method of claim 3 further comprising:
said computer processor examining said first application and said second application and:
if said first application and said second application include any screens with a common screen purpose,
then creating a minimum screen requirement for said application purpose, said minimum screen requirement comprising all said common screen purposes between said first application and said second application. 5. The method of claim 4 further comprising:
said computer processor:
generating at least one application template for said application purpose, said application template including at least one screen;
wherein, said application template meets said minimum screen requirement for said application purpose. 6. The method of claim 5 wherein said computer processor suggests to a third user, said third user indicating to said computer processor that they want an application for said application purpose, at least one of said application templates for said application purpose. 7. The method of claim 6 wherein said application is designed to be rendered on a client device. | A system and method for organizing and classifying existing applications so as to enable users to create new applications using the one or more parts of existing applications. The system is capable of automatically generating a large number of template applications which are fully designed, coded, and ready-to-use. The system also automatically expands its catalog of template applications and screen components, which are categorized based on a specified purpose, whenever a user creates a new application or screen with the same purpose. In this way a user can simply specify the purpose of what they want to create, and the system will provide a ranked list of possibilities based on the actions of other users, and automatic generation mechanisms.1. A method for generating a set of ranked screens, the method comprising:
providing a database of screen seeds and parts accessible by a computer processor and a user, each screen seed being capable of having at least one part positioned on a position thereon; said user:
selecting a screen seed from said database;
populating said screen seed with parts from said database until all said positions have a part populated thereon;
assigning said screen a screen purpose; and
repeating said providing, selecting, populating and assigning to create a set of screens, each of said screens in said set having said screen seed and said screen purpose;
said computer processor:
accessing said set of screens and giving each of said screens in said set of screens a lowest ranking;
making at least one new screen, each of said new screens comprising: said screen seed populated with an unused combination of parts which parts have been previously populated on at least one of said screens in said set of screens;
associating each of said new screens with said screen purpose;
increasing said ranking of said screens in said set of screens;
giving each of said new screens a lowest ranking;
merging said new screens into said set of screens; and
storing said set of screens on said database. 2. The method of claim 1 further comprising:
said user making a first application, said first application comprising two or more screens from said database; and
said user assigning said first application an application purpose. 3. The method of claim 2 further comprising:
a second user, said second user making a second application, said second application comprising two or more screens from said database; and
said second user assigning said second application said application purpose. 4. The method of claim 3 further comprising:
said computer processor examining said first application and said second application and:
if said first application and said second application include any screens with a common screen purpose,
then creating a minimum screen requirement for said application purpose, said minimum screen requirement comprising all said common screen purposes between said first application and said second application. 5. The method of claim 4 further comprising:
said computer processor:
generating at least one application template for said application purpose, said application template including at least one screen;
wherein, said application template meets said minimum screen requirement for said application purpose. 6. The method of claim 5 wherein said computer processor suggests to a third user, said third user indicating to said computer processor that they want an application for said application purpose, at least one of said application templates for said application purpose. 7. The method of claim 6 wherein said application is designed to be rendered on a client device. | 2,100 |
4,944 | 13,912,275 | 2,121 | A method (and structure) for implementing a software tool, as executable by a processor on a computer to exercise any of a plurality of prediction tools. Questions are provided to a user output port, and inputs from a user input port are received as responses to the questions. The question responses are used to instantiate, customize, and configure a specific one of said plurality of prediction tools for executing a specific application on the software tool. | 1. A method for implementing a software tool, as executable by a processor on a computer, said software tool configured to exercise any of a plurality of prediction tools, said method comprising:
providing questions to a user output port; receiving inputs from a user input port as responses to said questions; and using said question responses for determining which specific one of said plurality of prediction tools to at least one of instantiate, customize, and configure for executing a specific application on said software tool. 2. The method of claim 1, wherein said question responses comprise information directed to determining a relative importance of data and a business process execution semantics and path information. 3. The method of claim 2, wherein said determining of relative importance of data/business process execution semantics and path information is indicative of whether:
all data attributes have equal importance; some data attributes have more importance; some data attributes have no importance; business process semantics have importance along with the data; and business process semantics have importance without the data. 4. The method of claim 2, wherein said question responses comprise information for customizing one or more attributes of training data for training a model implemented by said specific prediction tool. 5. The method of claim 1, wherein said plurality of prediction tools comprises machine learning tools based on one of logistic regression and decision trees. 6. The method of claim 5, wherein said plurality of prediction tools implements one of a data-aware probabilistic graph model and a fragmentation enabled decision tree prediction. 7. The method of claim 1, further comprising providing outputs to said user output port, for action by a user of said software tool. 8. The method of claim 1, wherein said software tool:
executes a prediction model learned from a set of training samples created from completed historical executions of events that represent a superset of partially-executed event sequences; and uses said prediction model to make a prediction for a user-provided target attribute for a partially-executed event sequence. 9. The method of claim 8, wherein said questions are directed to:
whether data associated with each of a task instance or an entire event sequence matters; and whether execution semantics matter in terms of repeated task executions and parallel tasks execution. 10. The method of claim 1, wherein said software tool, based on said responses received for said questions, one of:
automatically selects a most appropriate prediction tool from among said plurality of prediction tools; and provides an indication to a user of which prediction tool has been determined as most appropriate. 11. A non-transitory, computer-readable storage medium embodying the method of claim 1, as a set of machine-readable instructions tangibly embodied in said storage medium. 12. The storage medium of claim 11, as comprising one of:
a read only memory (ROM) device on a computer, as a set of instructions selectively to be executed by said computer; a random access memory (RAM) device on a computer, as a set of instructions currently being executed by said computer; a standalone memory device that can be interfaced to a computer to load said set of instructions into a memory of said computer; and a read only memory (ROM) device on a first computer, as a set of instructions selectively to be downloaded by said first computer onto a second computer interconnected with said first computer. 13. A method, comprising:
for a software-implemented prediction tool configured to predict a user-specified target attribute for a partially-executed event sequence on a basis of a prediction model learned from a set of training data, said set of training data comprising historical data for completed event sequences, providing one or more questions to a user that indicate a relative significance of data and business process execution semantics and path information; and receiving responses to said questions and using said responses to make a selection of a technique to make said user-specified target attribute prediction. 14. The method of claim 13, further comprising providing one or more additional questions to the user, based on said selected technique, and using responses therefrom to determine which attributes to one of add and delete from data of said set of training data for a prediction model implementing said selected technique. 15. The method of claim 14, further comprising, for input data to be used for determining a prediction probability value of the user-specified target attribute, editing said input data to add or delete attributes and their associated values. 16. The method of claim 13, wherein said one or more questions are directed to determining:
whether said event sequences have a parallel path characteristic; whether said event sequences have a looping cycle characteristic; and whether said event sequences have a memory characteristic. 17. The method of claim 13, wherein said one or more questions comprises a question whether said historical data for completed event sequences includes data having a parallel path characteristic, wherein said technique to make said user-specified target attribute prediction comprises:
a fragmentation-enabled decision tree prediction model, if said response indicates that said data has said parallel path characteristic; and a data-aware probabilistic graph model, if said response indicates that said data does not have said parallel path characteristic. 18. A non-transitory, computer-readable storage medium embodying the method of claim 13, as a set of machine-readable instructions tangibly embodied in said storage medium. 19. The storage medium of claim 17, as comprising one of:
a read only memory (ROM) device on a computer, as a set of instructions selectively to be executed by said computer; a random access memory (RAM) device on a computer, as a set of instructions currently being executed by said computer; a standalone memory device that can be interfaced to a computer to load said set of instructions into a memory of said computer; and a read only memory (ROM) device on a first computer, as a set of instructions selectively to be downloaded by said first computer onto a second computer interconnected with said first computer. 20. A method, comprising:
for a software-implemented prediction tool configured to predict a user-specified target attribute for a partially-executed event sequence on a basis of a prediction model learned from a set of training data, said set of training data comprising historical data for completed event sequences, receiving inputs from a user of said prediction tool that indicate whether data and business process execution semantics and path matter and which attributes to one of add and delete from data of said set of training data for said prediction model; and automatically, for input data to be used for determining a prediction probability value of the user-specified target attribute, editing said input data to add or delete attributes and their associated values, based on said inputs for adding or deleting of attributes of training data. | A method (and structure) for implementing a software tool, as executable by a processor on a computer to exercise any of a plurality of prediction tools. Questions are provided to a user output port, and inputs from a user input port are received as responses to the questions. The question responses are used to instantiate, customize, and configure a specific one of said plurality of prediction tools for executing a specific application on the software tool.1. A method for implementing a software tool, as executable by a processor on a computer, said software tool configured to exercise any of a plurality of prediction tools, said method comprising:
providing questions to a user output port; receiving inputs from a user input port as responses to said questions; and using said question responses for determining which specific one of said plurality of prediction tools to at least one of instantiate, customize, and configure for executing a specific application on said software tool. 2. The method of claim 1, wherein said question responses comprise information directed to determining a relative importance of data and a business process execution semantics and path information. 3. The method of claim 2, wherein said determining of relative importance of data/business process execution semantics and path information is indicative of whether:
all data attributes have equal importance; some data attributes have more importance; some data attributes have no importance; business process semantics have importance along with the data; and business process semantics have importance without the data. 4. The method of claim 2, wherein said question responses comprise information for customizing one or more attributes of training data for training a model implemented by said specific prediction tool. 5. The method of claim 1, wherein said plurality of prediction tools comprises machine learning tools based on one of logistic regression and decision trees. 6. The method of claim 5, wherein said plurality of prediction tools implements one of a data-aware probabilistic graph model and a fragmentation enabled decision tree prediction. 7. The method of claim 1, further comprising providing outputs to said user output port, for action by a user of said software tool. 8. The method of claim 1, wherein said software tool:
executes a prediction model learned from a set of training samples created from completed historical executions of events that represent a superset of partially-executed event sequences; and uses said prediction model to make a prediction for a user-provided target attribute for a partially-executed event sequence. 9. The method of claim 8, wherein said questions are directed to:
whether data associated with each of a task instance or an entire event sequence matters; and whether execution semantics matter in terms of repeated task executions and parallel tasks execution. 10. The method of claim 1, wherein said software tool, based on said responses received for said questions, one of:
automatically selects a most appropriate prediction tool from among said plurality of prediction tools; and provides an indication to a user of which prediction tool has been determined as most appropriate. 11. A non-transitory, computer-readable storage medium embodying the method of claim 1, as a set of machine-readable instructions tangibly embodied in said storage medium. 12. The storage medium of claim 11, as comprising one of:
a read only memory (ROM) device on a computer, as a set of instructions selectively to be executed by said computer; a random access memory (RAM) device on a computer, as a set of instructions currently being executed by said computer; a standalone memory device that can be interfaced to a computer to load said set of instructions into a memory of said computer; and a read only memory (ROM) device on a first computer, as a set of instructions selectively to be downloaded by said first computer onto a second computer interconnected with said first computer. 13. A method, comprising:
for a software-implemented prediction tool configured to predict a user-specified target attribute for a partially-executed event sequence on a basis of a prediction model learned from a set of training data, said set of training data comprising historical data for completed event sequences, providing one or more questions to a user that indicate a relative significance of data and business process execution semantics and path information; and receiving responses to said questions and using said responses to make a selection of a technique to make said user-specified target attribute prediction. 14. The method of claim 13, further comprising providing one or more additional questions to the user, based on said selected technique, and using responses therefrom to determine which attributes to one of add and delete from data of said set of training data for a prediction model implementing said selected technique. 15. The method of claim 14, further comprising, for input data to be used for determining a prediction probability value of the user-specified target attribute, editing said input data to add or delete attributes and their associated values. 16. The method of claim 13, wherein said one or more questions are directed to determining:
whether said event sequences have a parallel path characteristic; whether said event sequences have a looping cycle characteristic; and whether said event sequences have a memory characteristic. 17. The method of claim 13, wherein said one or more questions comprises a question whether said historical data for completed event sequences includes data having a parallel path characteristic, wherein said technique to make said user-specified target attribute prediction comprises:
a fragmentation-enabled decision tree prediction model, if said response indicates that said data has said parallel path characteristic; and a data-aware probabilistic graph model, if said response indicates that said data does not have said parallel path characteristic. 18. A non-transitory, computer-readable storage medium embodying the method of claim 13, as a set of machine-readable instructions tangibly embodied in said storage medium. 19. The storage medium of claim 17, as comprising one of:
a read only memory (ROM) device on a computer, as a set of instructions selectively to be executed by said computer; a random access memory (RAM) device on a computer, as a set of instructions currently being executed by said computer; a standalone memory device that can be interfaced to a computer to load said set of instructions into a memory of said computer; and a read only memory (ROM) device on a first computer, as a set of instructions selectively to be downloaded by said first computer onto a second computer interconnected with said first computer. 20. A method, comprising:
for a software-implemented prediction tool configured to predict a user-specified target attribute for a partially-executed event sequence on a basis of a prediction model learned from a set of training data, said set of training data comprising historical data for completed event sequences, receiving inputs from a user of said prediction tool that indicate whether data and business process execution semantics and path matter and which attributes to one of add and delete from data of said set of training data for said prediction model; and automatically, for input data to be used for determining a prediction probability value of the user-specified target attribute, editing said input data to add or delete attributes and their associated values, based on said inputs for adding or deleting of attributes of training data. | 2,100 |
4,945 | 14,969,574 | 2,152 | The embodiments described herein relate to synchronization of data in a shared pool of configurable computer resources. One or more consistency points are created in a source filesystem. A first consistency point is compared with a second consistency point to detect a directory change at the source filesystem, which includes identifying at least one difference between the first and second consistency points. A file level change associated with an established directory at a target filesystem is identified responsive to the detection of the directory change. A link is established between the source filesystem and the target filesystem, and the established directory is updated based on the file level change. | 1. A method comprising:
creating one or more consistency points in a source filesystem, including creating a first consistency point at a first point-in-time and a second consistency point at a second point-in-time, wherein each consistency point represents filesystem data and metadata at a point-in-time to establish a recovery point, and wherein the first consistency point and the second consistency point are any two consistency points; comparing the first consistency point with the second consistency point to detect a directory change at the source filesystem, including identifying at least one difference between the first and second consistency points; responsive to the detection of the directory change, identifying a file level change, wherein the file level change is associated with an established directory at a target filesystem; establishing a link from the source filesystem to the target filesystem; and updating the established directory based on the file level change. 2. The method of claim 1, wherein the comparison detects a presence of a new source filesystem inode, and wherein updating the established directory comprises mapping the new source filesystem inode to a target filesystem inode. 3. The method of claim 1, wherein updating the established directory comprises identifying filesystem operations on filesystem objects using file names. 4. The method of claim 1, further comprising generating an output file based on the comparison, and replaying the output file as a series of filesystem operations. 5. The method of claim 4, wherein the output file is replayed after communication failure between the source filesystem and the target filesystem. 6. The method of claim 1, wherein the source and target filesystems are heterogeneous filesystems. 7. The method of claim 1, further comprising reverting changes at the target filesystem by moving to an older consistency point. 8. The method of claim 1, further comprising creating a third consistency point in the source filesystem at a third point-in-time, the third consistency point being sequential with the first and second consistency point, and removing the first consistency point. 9. A system comprising:
a source server having a processing unit in communication with memory, wherein the source server is associated with a source filesystem; a functional unit in communication with the source server, the functional unit to:
create one or more consistency points in a source filesystem, including create a first consistency point at a first point-in-time and a second consistency point at a second point-in-time, wherein each consistency point represents filesystem data and metadata at a point-in-time to establish a recovery point, and wherein the first consistency point and the second consistency point are any two consistency points;
compare the first consistency point with the second consistency point to detect a directory change at the source filesystem, including the functional unit to identify at least one difference between the first and second consistency points;
responsive to the detection of the directory change, identify a file level change, wherein the file level change is associated with an established directory at a target filesystem;
establish a link from the source filesystem to the target filesystem; and
update the established directory based on the file level change. 10. The system of claim 9, wherein the comparison detects a presence of a new source filesystem inode, and wherein updating the established directory comprises the functional unit to map the new source filesystem inode to a target filesystem inode. 11. The system of claim 9, wherein updating the established directory comprises the functional unit to identify filesystem operations on filesystem objects using file names. 12. The system of claim 9, further comprising the functional unit to generate an output file based on the comparison, and replay the output file as a series of filesystem operations, wherein the output file is replayed after communication failure between the source filesystem and the target filesystem. 13. The system of claim 9, wherein the source and target filesystems are heterogeneous filesystems. 14. The system of claim 9, further comprising the functional unit to revert changes at the target filesystem by moving to an older consistency point. 15. The system of claim 9, further comprising the functional unit to create a third consistency point in the source filesystem at a third point-in-time, the third consistency point being sequential with the first and second consistency point, and remove the first consistency point. 16. A computer program product comprising computer readable storage device having computer readable program code embodied therewith, the program code executable by a processor to:
create one or more consistency points in a source filesystem, including create a first consistency point at a first point-in-time and a second consistency point at a second point-in-time, wherein each consistency point represents filesystem data and metadata at a point-in-time to establish a recovery point, and wherein the first consistency point and the second consistency point are any two consistency points; compare the first consistency point with the second consistency point to detect a directory change at the source filesystem, including the functional unit to identify at least one difference between the first and second consistency points; responsive to the detection of the directory change, identify a file level change, wherein the file level change is associated with an established directory at a target filesystem; establish a link from the source filesystem to the target filesystem; and update the established directory based on the file level change. 17. The computer program product of claim 16, wherein the comparison detects a presence of a new source filesystem inode, and wherein updating the established directory comprises program code to map the new source filesystem inode to a target filesystem inode. 18. The computer program product of claim 16, wherein updating the established directory comprises program code to identify filesystem operations on filesystem objects using file names. 19. The computer program product of claim 16, further comprising program code to generate an output file based on the comparison, and replay the output file as a series of filesystem operations, wherein the output file is replayed after communication failure between the source filesystem and the target filesystem. 20. The computer program product of claim 16, further comprising the functional unit to create a third consistency point in the source filesystem at a third point-in-time, the third consistency point being sequential with the first and second consistency point, and remove the first consistency point. | The embodiments described herein relate to synchronization of data in a shared pool of configurable computer resources. One or more consistency points are created in a source filesystem. A first consistency point is compared with a second consistency point to detect a directory change at the source filesystem, which includes identifying at least one difference between the first and second consistency points. A file level change associated with an established directory at a target filesystem is identified responsive to the detection of the directory change. A link is established between the source filesystem and the target filesystem, and the established directory is updated based on the file level change.1. A method comprising:
creating one or more consistency points in a source filesystem, including creating a first consistency point at a first point-in-time and a second consistency point at a second point-in-time, wherein each consistency point represents filesystem data and metadata at a point-in-time to establish a recovery point, and wherein the first consistency point and the second consistency point are any two consistency points; comparing the first consistency point with the second consistency point to detect a directory change at the source filesystem, including identifying at least one difference between the first and second consistency points; responsive to the detection of the directory change, identifying a file level change, wherein the file level change is associated with an established directory at a target filesystem; establishing a link from the source filesystem to the target filesystem; and updating the established directory based on the file level change. 2. The method of claim 1, wherein the comparison detects a presence of a new source filesystem inode, and wherein updating the established directory comprises mapping the new source filesystem inode to a target filesystem inode. 3. The method of claim 1, wherein updating the established directory comprises identifying filesystem operations on filesystem objects using file names. 4. The method of claim 1, further comprising generating an output file based on the comparison, and replaying the output file as a series of filesystem operations. 5. The method of claim 4, wherein the output file is replayed after communication failure between the source filesystem and the target filesystem. 6. The method of claim 1, wherein the source and target filesystems are heterogeneous filesystems. 7. The method of claim 1, further comprising reverting changes at the target filesystem by moving to an older consistency point. 8. The method of claim 1, further comprising creating a third consistency point in the source filesystem at a third point-in-time, the third consistency point being sequential with the first and second consistency point, and removing the first consistency point. 9. A system comprising:
a source server having a processing unit in communication with memory, wherein the source server is associated with a source filesystem; a functional unit in communication with the source server, the functional unit to:
create one or more consistency points in a source filesystem, including create a first consistency point at a first point-in-time and a second consistency point at a second point-in-time, wherein each consistency point represents filesystem data and metadata at a point-in-time to establish a recovery point, and wherein the first consistency point and the second consistency point are any two consistency points;
compare the first consistency point with the second consistency point to detect a directory change at the source filesystem, including the functional unit to identify at least one difference between the first and second consistency points;
responsive to the detection of the directory change, identify a file level change, wherein the file level change is associated with an established directory at a target filesystem;
establish a link from the source filesystem to the target filesystem; and
update the established directory based on the file level change. 10. The system of claim 9, wherein the comparison detects a presence of a new source filesystem inode, and wherein updating the established directory comprises the functional unit to map the new source filesystem inode to a target filesystem inode. 11. The system of claim 9, wherein updating the established directory comprises the functional unit to identify filesystem operations on filesystem objects using file names. 12. The system of claim 9, further comprising the functional unit to generate an output file based on the comparison, and replay the output file as a series of filesystem operations, wherein the output file is replayed after communication failure between the source filesystem and the target filesystem. 13. The system of claim 9, wherein the source and target filesystems are heterogeneous filesystems. 14. The system of claim 9, further comprising the functional unit to revert changes at the target filesystem by moving to an older consistency point. 15. The system of claim 9, further comprising the functional unit to create a third consistency point in the source filesystem at a third point-in-time, the third consistency point being sequential with the first and second consistency point, and remove the first consistency point. 16. A computer program product comprising computer readable storage device having computer readable program code embodied therewith, the program code executable by a processor to:
create one or more consistency points in a source filesystem, including create a first consistency point at a first point-in-time and a second consistency point at a second point-in-time, wherein each consistency point represents filesystem data and metadata at a point-in-time to establish a recovery point, and wherein the first consistency point and the second consistency point are any two consistency points; compare the first consistency point with the second consistency point to detect a directory change at the source filesystem, including the functional unit to identify at least one difference between the first and second consistency points; responsive to the detection of the directory change, identify a file level change, wherein the file level change is associated with an established directory at a target filesystem; establish a link from the source filesystem to the target filesystem; and update the established directory based on the file level change. 17. The computer program product of claim 16, wherein the comparison detects a presence of a new source filesystem inode, and wherein updating the established directory comprises program code to map the new source filesystem inode to a target filesystem inode. 18. The computer program product of claim 16, wherein updating the established directory comprises program code to identify filesystem operations on filesystem objects using file names. 19. The computer program product of claim 16, further comprising program code to generate an output file based on the comparison, and replay the output file as a series of filesystem operations, wherein the output file is replayed after communication failure between the source filesystem and the target filesystem. 20. The computer program product of claim 16, further comprising the functional unit to create a third consistency point in the source filesystem at a third point-in-time, the third consistency point being sequential with the first and second consistency point, and remove the first consistency point. | 2,100 |
4,946 | 14,728,678 | 2,116 | Described are systems and methods for controlling pool and spa equipment. A device may communicate wirelessly with pool and spa controls directly (point-to-point) as well as indirectly, either via the Internet or as part of a local area network (LAN). The device may be a smart phone, tablet, or other appropriate apparatus. | 1. A method of controlling pool or spa equipment, comprising:
a. providing a controller configured to communicate wirelessly directly with a mobile device; b. communicatively connecting the controller to pool or spa equipment; and c. transmitting information, from the mobile device to the controller, for further transmission to the pool or spa equipment. 2. A method of controlling pool or spa equipment according to claim 1 in which the controller is configured also to communicate wirelessly indirectly with the mobile device. 3. A method of controlling pool or spa equipment according to claim 2 in which indirect wireless communication between the controller and the mobile device may occur via a router disconnected from the Internet. 4. A method of controlling pool or spa equipment according to claim 2 in which indirect wireless communication between the controller and the mobile device may occur via a router connected to the Internet. 5. A method of controlling pool or spa equipment according to claim 2 in which indirect wireless communication between the controller and the mobile device may occur via the Internet bypassing any router. 6. A method of controlling pool or spa equipment according to claim 2 in which the mobile device is a hand-held smart phone or tablet and the pool or spa equipment is a pump. 7. A method of controlling a pool or spa pump communicatively connected to a controller, comprising:
a. selectively configuring the controller to communicate wirelessly either directly with a mobile device or indirectly with the mobile device via at least one of a router or the Internet; and b. wirelessly transmitting information from the mobile device for receipt by the controller and further transmission to the pump. 8. A control system comprising:
a. a mobile device; b. a controller configured to communicate wirelessly directly with a mobile device; and c. pool or spa equipment communicatively connected to the controller. 9. A control system according to claim 8 in which the controller is configured also to communicate wirelessly indirectly with the mobile device. 10. A control system according to claim 9 in which indirect wireless communication between the controller and the mobile device may occur via a router disconnected from the Internet. 11. A control system according to claim 9 in which indirect wireless communication between the controller and the mobile device may occur via a router connected to the Internet. 12. A control system according to claim 9 in which indirect wireless communication between the controller and the mobile device may occur via the Internet bypassing any router. 13. A method of controlling pool or spa equipment according to claim 9 in which the mobile device is a hand-held smart phone or tablet and the pool or spa equipment is a pump. 14. A control system comprising;
a. a mobile device; b. a controller selectively configurable to communicate wirelessly either directly with the mobile device or indirectly with the mobile device via at least one of a router or the Internet; c. a pool or spa pump communicatively connected to the controller. | Described are systems and methods for controlling pool and spa equipment. A device may communicate wirelessly with pool and spa controls directly (point-to-point) as well as indirectly, either via the Internet or as part of a local area network (LAN). The device may be a smart phone, tablet, or other appropriate apparatus.1. A method of controlling pool or spa equipment, comprising:
a. providing a controller configured to communicate wirelessly directly with a mobile device; b. communicatively connecting the controller to pool or spa equipment; and c. transmitting information, from the mobile device to the controller, for further transmission to the pool or spa equipment. 2. A method of controlling pool or spa equipment according to claim 1 in which the controller is configured also to communicate wirelessly indirectly with the mobile device. 3. A method of controlling pool or spa equipment according to claim 2 in which indirect wireless communication between the controller and the mobile device may occur via a router disconnected from the Internet. 4. A method of controlling pool or spa equipment according to claim 2 in which indirect wireless communication between the controller and the mobile device may occur via a router connected to the Internet. 5. A method of controlling pool or spa equipment according to claim 2 in which indirect wireless communication between the controller and the mobile device may occur via the Internet bypassing any router. 6. A method of controlling pool or spa equipment according to claim 2 in which the mobile device is a hand-held smart phone or tablet and the pool or spa equipment is a pump. 7. A method of controlling a pool or spa pump communicatively connected to a controller, comprising:
a. selectively configuring the controller to communicate wirelessly either directly with a mobile device or indirectly with the mobile device via at least one of a router or the Internet; and b. wirelessly transmitting information from the mobile device for receipt by the controller and further transmission to the pump. 8. A control system comprising:
a. a mobile device; b. a controller configured to communicate wirelessly directly with a mobile device; and c. pool or spa equipment communicatively connected to the controller. 9. A control system according to claim 8 in which the controller is configured also to communicate wirelessly indirectly with the mobile device. 10. A control system according to claim 9 in which indirect wireless communication between the controller and the mobile device may occur via a router disconnected from the Internet. 11. A control system according to claim 9 in which indirect wireless communication between the controller and the mobile device may occur via a router connected to the Internet. 12. A control system according to claim 9 in which indirect wireless communication between the controller and the mobile device may occur via the Internet bypassing any router. 13. A method of controlling pool or spa equipment according to claim 9 in which the mobile device is a hand-held smart phone or tablet and the pool or spa equipment is a pump. 14. A control system comprising;
a. a mobile device; b. a controller selectively configurable to communicate wirelessly either directly with the mobile device or indirectly with the mobile device via at least one of a router or the Internet; c. a pool or spa pump communicatively connected to the controller. | 2,100 |
4,947 | 14,427,764 | 2,118 | Method and apparatus for performing a local control of an energy resource An energy resource controller (ERC) of an energy resource (ER) within an energy management system of a power supply grid (PSG), wherein said energy resource controller (ERC) is adapted to monitor a communication link (CL) to a control unit (CU) of said energy management system and to emulate after a loss or limitation of communication via said communication link (CL) has been detected a continued reception of control parameters and/or control limits from said control unit (CU) to perform a local control of the associated energy resource (ER) on the basis of the emulated control parameters and/or control limits according to an applied energy management policy (EMP). | 1. An energy resource controller of an energy resource within an energy management system of a power supply grid, wherein said energy resource controller is adapted to monitor a communication link to a control unit of said energy management system and to emulate after a loss or limitation of communication via said communication link has been detected a continued reception of control parameters and/or control limits from said control unit to perform a local control of the associated energy resource on the basis of the emulated control parameters and/or control limits according to an applied energy management policy. 2. The energy resource controller according to claim 1, wherein said energy resource controller is adapted to receive a set of energy management policies comprising at least one energy management policy from said control unit via said communication link and to store the received set of energy management policies in a memory. 3. The energy resource controller according to claim 2, wherein said energy resource controller is connected to a policy management unit which comprises a processor adapted to process control parameters and/or control limits on the basis of rules of an applied energy management policy selected from said set of energy management policies stored in said memory of said energy resource controller. 4. The energy resource controller according to claim 3, wherein before a loss or limitation of communication via said communication link is detected the policy management unit is adapted to either forward directly control parameters and/or control limits received from said control unit via said communication link to said energy resource controller or to derive control parameters and/or control limits from the control parameters and/or the control limits received from said control unit via said communication link and then to forward the derived control parameters and/or derived control limits to said energy resource controller depending on the rules of the selected and applied energy management policy. 5. The energy resource controller according to claim 1, wherein said energy resource controller is adapted to perform a local control of the associated energy resource as long as no loss or limitation of communication via said communication link is detected on the basis of the forwarded and/or derived control parameters and/or control limits which the energy resource controller receives from the respective policy management unit. 6. The energy resource controller according to claim 1, wherein in response to a detected loss or limitation of communication via said communication link said policy management unit is adapted to generate local control parameters and/or local control limits based on rules of an energy management policy selected from the last set of energy management policies received by the policy management unit from said control unit via said communication link before the loss or limitation of communication via said communication link has occurred and to output the generated local control parameters and/or local control limits to the energy resource controller to perform a local control of the associated energy resource. 7. The energy resource controller according to claim 6, where said policy management unit generates the local control parameters and/or local control limits based on the rules of the selected and applied energy management policy and/or on the basis of local measurements and/or on the basis of installation dependent control limits. 8. The energy resource controller according to claim 7, wherein said local measurements comprise at least one measured value or time series for at least one of the following variables: voltage frequency, voltage, spectra of the voltage, current, phase shift between voltage and current, and a state information of the energy resource, for example a state of charge or a state of supply, wherein said local measurements comprise context data including current and/or forecast weather condition data at the location of the energy resource, time data indicating a local time, date, day of week and/or month at the location of the energy resource, and location data indicating a current geographical location of the energy resource and/or wherein the local measurements comprise reliability data indicating a reliability of the communication link between the energy resource controller and the control unit and/or a reliability of the associated energy resource and/or wherein the local measurements comprise consumption data of local consumers and/or generation data of local generators. 9. The energy resource controller according to claim 7, wherein the applied energy management policy is selected from the last set of energy management policies having been received by the policy management unit from the control unit via said communication link before the loss or limitation of communication via said communication link has occurred depending on local measurements comprising measured grid parameters, measured context data and/or measured reliability data and/or measured consumption data. 10. The energy resource controller according to claim 1, wherein the energy resource is adapted to feed electrical power into said power supply grid or to draw electrical power from said power supply grid or to store power. 11. The energy resource controller according to claim 1, wherein said communication link comprises a wired or wireless link via a communication network and/or a communication link via said power supply grid. 12. The energy resource controller according to claim 1, wherein said energy resource is immobile and located at a fixed location and connected permanently to the power supply grid or mobile and movable between different locations and connectable to said power supply grid. 13. The energy resource controller according to claim 1, wherein said energy resource controller is adapted to detect a loss or limitation of communication of a monitored communication link to said communication unit by monitoring keep alive signals or keep alive messages transmitted by said control unit to said energy resource controller via said communication link. 14. A method for performing a local control of an energy resource by an energy resource controller connected to at least one control unit of an energy management system of a power supply grid by means of a communication network, comprising the steps of:
(a) monitoring the communication link between the energy resource controller and the control unit via said communication network; and (b) emulating a continued reception of control parameters and/or control limits from said control unit by said energy resource controller to perform a local control of the associated energy resource if a loss or limitation of communication of the communication link between the energy resource controller of the energy resource and the control unit is detected. 15. The method according to claim 14, wherein if a loss or limitation of communication is detected local control parameters and/or local control limits are generated by a policy management unit connected to said energy resource controller based on rules of an energy management policy selected from a set of energy management policies received by the policy management unit from the control unit via this communication link before the loss or limitation of communication via this communication link has occurred. | Method and apparatus for performing a local control of an energy resource An energy resource controller (ERC) of an energy resource (ER) within an energy management system of a power supply grid (PSG), wherein said energy resource controller (ERC) is adapted to monitor a communication link (CL) to a control unit (CU) of said energy management system and to emulate after a loss or limitation of communication via said communication link (CL) has been detected a continued reception of control parameters and/or control limits from said control unit (CU) to perform a local control of the associated energy resource (ER) on the basis of the emulated control parameters and/or control limits according to an applied energy management policy (EMP).1. An energy resource controller of an energy resource within an energy management system of a power supply grid, wherein said energy resource controller is adapted to monitor a communication link to a control unit of said energy management system and to emulate after a loss or limitation of communication via said communication link has been detected a continued reception of control parameters and/or control limits from said control unit to perform a local control of the associated energy resource on the basis of the emulated control parameters and/or control limits according to an applied energy management policy. 2. The energy resource controller according to claim 1, wherein said energy resource controller is adapted to receive a set of energy management policies comprising at least one energy management policy from said control unit via said communication link and to store the received set of energy management policies in a memory. 3. The energy resource controller according to claim 2, wherein said energy resource controller is connected to a policy management unit which comprises a processor adapted to process control parameters and/or control limits on the basis of rules of an applied energy management policy selected from said set of energy management policies stored in said memory of said energy resource controller. 4. The energy resource controller according to claim 3, wherein before a loss or limitation of communication via said communication link is detected the policy management unit is adapted to either forward directly control parameters and/or control limits received from said control unit via said communication link to said energy resource controller or to derive control parameters and/or control limits from the control parameters and/or the control limits received from said control unit via said communication link and then to forward the derived control parameters and/or derived control limits to said energy resource controller depending on the rules of the selected and applied energy management policy. 5. The energy resource controller according to claim 1, wherein said energy resource controller is adapted to perform a local control of the associated energy resource as long as no loss or limitation of communication via said communication link is detected on the basis of the forwarded and/or derived control parameters and/or control limits which the energy resource controller receives from the respective policy management unit. 6. The energy resource controller according to claim 1, wherein in response to a detected loss or limitation of communication via said communication link said policy management unit is adapted to generate local control parameters and/or local control limits based on rules of an energy management policy selected from the last set of energy management policies received by the policy management unit from said control unit via said communication link before the loss or limitation of communication via said communication link has occurred and to output the generated local control parameters and/or local control limits to the energy resource controller to perform a local control of the associated energy resource. 7. The energy resource controller according to claim 6, where said policy management unit generates the local control parameters and/or local control limits based on the rules of the selected and applied energy management policy and/or on the basis of local measurements and/or on the basis of installation dependent control limits. 8. The energy resource controller according to claim 7, wherein said local measurements comprise at least one measured value or time series for at least one of the following variables: voltage frequency, voltage, spectra of the voltage, current, phase shift between voltage and current, and a state information of the energy resource, for example a state of charge or a state of supply, wherein said local measurements comprise context data including current and/or forecast weather condition data at the location of the energy resource, time data indicating a local time, date, day of week and/or month at the location of the energy resource, and location data indicating a current geographical location of the energy resource and/or wherein the local measurements comprise reliability data indicating a reliability of the communication link between the energy resource controller and the control unit and/or a reliability of the associated energy resource and/or wherein the local measurements comprise consumption data of local consumers and/or generation data of local generators. 9. The energy resource controller according to claim 7, wherein the applied energy management policy is selected from the last set of energy management policies having been received by the policy management unit from the control unit via said communication link before the loss or limitation of communication via said communication link has occurred depending on local measurements comprising measured grid parameters, measured context data and/or measured reliability data and/or measured consumption data. 10. The energy resource controller according to claim 1, wherein the energy resource is adapted to feed electrical power into said power supply grid or to draw electrical power from said power supply grid or to store power. 11. The energy resource controller according to claim 1, wherein said communication link comprises a wired or wireless link via a communication network and/or a communication link via said power supply grid. 12. The energy resource controller according to claim 1, wherein said energy resource is immobile and located at a fixed location and connected permanently to the power supply grid or mobile and movable between different locations and connectable to said power supply grid. 13. The energy resource controller according to claim 1, wherein said energy resource controller is adapted to detect a loss or limitation of communication of a monitored communication link to said communication unit by monitoring keep alive signals or keep alive messages transmitted by said control unit to said energy resource controller via said communication link. 14. A method for performing a local control of an energy resource by an energy resource controller connected to at least one control unit of an energy management system of a power supply grid by means of a communication network, comprising the steps of:
(a) monitoring the communication link between the energy resource controller and the control unit via said communication network; and (b) emulating a continued reception of control parameters and/or control limits from said control unit by said energy resource controller to perform a local control of the associated energy resource if a loss or limitation of communication of the communication link between the energy resource controller of the energy resource and the control unit is detected. 15. The method according to claim 14, wherein if a loss or limitation of communication is detected local control parameters and/or local control limits are generated by a policy management unit connected to said energy resource controller based on rules of an energy management policy selected from a set of energy management policies received by the policy management unit from the control unit via this communication link before the loss or limitation of communication via this communication link has occurred. | 2,100 |
4,948 | 14,794,650 | 2,114 | A method for assisting evaluation of anomalies in a distributed storage system is disclosed. The method includes monitoring at least one system metric of the system and creating a mapping between values and/or patterns of the system metric and one or more services configured to generate logs for the system. The method further includes detecting a potential anomaly in the system based on the monitoring, the potential anomaly being associated with a value and/or a pattern of the monitored system metric. The method also includes using the mapping to identify one or more logs associated with the potential anomaly, displaying a graphical representation of at least a part of monitoring the system metric, the graphical representation indicating the potential anomaly, and providing an overlay over the graphical representation, the overlay comprising an indicator of a number of the logs associated with the potential anomaly. | 1. A method for assisting evaluation of anomalies in a distributed storage system, the method comprising:
monitoring at least one system metric of the distributed storage system; creating a mapping between values and/or patterns of the at least one system metric and one or more services configured to generate logs for the distributed storage system; based on the monitoring, detecting a potential anomaly in the distributed storage system, the potential anomaly associated with a value and/or a pattern of the at least one system metric; based on the mapping, identifying one or more logs associated with the potential anomaly; displaying a graphical representation of at least a part of monitoring the at least one system metric, the graphical representation indicating the potential anomaly; and providing an overlay over the graphical representation, the overlay comprising an indicator of a number of the one or more logs associated with the potential anomaly. 2. The method according to claim 1, wherein the potential anomaly is detected based on comparison of values of the at least one system metric within a specified time interval comprising the potential anomaly with values of the at least one system metric within an earlier time interval of the duration of the specified time interval. 3. The method according to claim 1, wherein:
monitoring the at least one system metric of the distributed storage system comprises monitoring of the at least one system metric for a first node of the distributed storage system, the method further comprises monitoring the at least one system metric for a second node of the distributed storage system, and the potential anomaly is detected based on comparison of values of the at least one system metric for the first node with values of the at least one system metric for the second node. 4. The method according to claim 1, wherein the potential anomaly is identified based on comparison of values of the at least one system metric with values of at least one other system metric. 5. The method according to claim 1, wherein the at least one system metric includes information related to at least one of on-going client operations, current central processing unit (CPU) utilization, disk usage, available network bandwidth, remaining disk input/output operations per second (IOPS), and remaining disk bandwidth. 6. The method according to claim 1, further comprising performing a similarity search to identify whether one or more anomalies similar to the potential anomaly have occurred prior to occurrence of the potential anomaly. 7. The method according to claim 1, wherein the potential anomaly is detected using Holt-Winters exponential smoothing or/and a Gaussian process based method. 8. A system for assisting evaluation of anomalies in a distributed storage system, the system comprising:
at least one memory configured to store computer executable instructions, and at least one processor coupled to the at least one memory and configured, when executing the instructions, to:
monitor at least one system metric of the distributed storage system;
create a mapping between values and/or patterns of the at least one system metric and one or more services configured to generate logs for the distributed storage system;
based on the monitoring, detect a potential anomaly in the distributed storage system, the potential anomaly associated with a value and/or a pattern of the at least one system metric;
based on the mapping, identify one or more logs associated with the potential anomaly;
display a graphical representation of at least a part of monitoring the at least one system metric, the graphical representation indicating the potential anomaly; and
provide an overlay over the graphical representation, the overlay comprising an indicator of a number of the one or more logs associated with the potential anomaly. 9. The system according to claim 8, wherein the potential anomaly is detected based on comparison of values of the at least one system metric within a specified time interval comprising the potential anomaly with values of the at least one system metric within an earlier time interval of the duration of the specified time interval. 10. The system according to claim 8, wherein:
monitoring the at least one system metric of the distributed storage system comprises monitoring of the at least one system metric for a first node of the distributed storage system, the method further comprises monitoring the at least one system metric for a second node of the distributed storage system, and the potential anomaly is detected based on comparison of values of the at least one system metric for the first node with values of the at least one system metric for the second node. 11. The system according to claim 8, wherein the potential anomaly is identified based on comparison of values of the at least one system metric with values of at least one other system metric. 12. The system according to claim 8, wherein the at least one system metric includes information related to at least one of on-going client operations, current central processing unit (CPU) utilization, disk usage, available network bandwidth, remaining disk input/output operations per second (IOPS), and remaining disk bandwidth. 13. The system according to claim 8, wherein the at least one processor is further configured to perform a similarity search to identify whether one or more anomalies similar to the potential anomaly have occurred prior to occurrence of the potential anomaly. 14. The system according to claim 8, wherein the at least one processor is configured to detect the potential anomaly using Holt-Winters exponential smoothing or/and a Gaussian process based method. 15. One or more computer readable storage media encoded with software comprising computer executable instructions and when the software is executed operable to perform a method for assisting evaluation of anomalies in a distributed storage system, the method comprising:
monitoring at least one system metric of the distributed storage system; creating a mapping between values and/or patterns of the at least one system metric and one or more services configured to generate logs for the distributed storage system; based on the monitoring, detecting a potential anomaly in the distributed storage system, the potential anomaly associated with a value and/or a pattern of the at least one system metric; based on the mapping, identifying one or more logs associated with the potential anomaly; displaying a graphical representation of at least a part of monitoring the at least one system metric, the graphical representation indicating the potential anomaly; and providing an overlay over the graphical representation, the overlay comprising an indicator of a number of the one or more logs associated with the potential anomaly. 16. The one or more computer readable media according to claim 15, wherein the potential anomaly is detected based on comparison of values of the at least one system metric within a specified time interval comprising the potential anomaly with values of the at least one system metric within an earlier time interval of the duration of the specified time interval. 17. The one or more computer readable media according to claim 15, wherein:
monitoring the at least one system metric of the distributed storage system comprises monitoring of the at least one system metric for a first node of the distributed storage system, the method further comprises monitoring the at least one system metric for a second node of the distributed storage system, and the potential anomaly is detected based on comparison of values of the at least one system metric for the first node with values of the at least one system metric for the second node. 18. The one or more computer readable media according to claim 15, wherein the potential anomaly is identified based on comparison of values of the at least one system metric with values of at least one other system metric. 19. The one or more computer readable media according to claim 15, wherein the at least one system metric includes information related to at least one of on-going client operations, current central processing unit (CPU) utilization, disk usage, available network bandwidth, remaining disk input/output operations per second (IOPS), and remaining disk bandwidth. 20. The one or more computer readable media according to claim 15, wherein the method further comprises performing a similarity search to identify whether one or more anomalies similar to the potential anomaly have occurred prior to occurrence of the potential anomaly. | A method for assisting evaluation of anomalies in a distributed storage system is disclosed. The method includes monitoring at least one system metric of the system and creating a mapping between values and/or patterns of the system metric and one or more services configured to generate logs for the system. The method further includes detecting a potential anomaly in the system based on the monitoring, the potential anomaly being associated with a value and/or a pattern of the monitored system metric. The method also includes using the mapping to identify one or more logs associated with the potential anomaly, displaying a graphical representation of at least a part of monitoring the system metric, the graphical representation indicating the potential anomaly, and providing an overlay over the graphical representation, the overlay comprising an indicator of a number of the logs associated with the potential anomaly.1. A method for assisting evaluation of anomalies in a distributed storage system, the method comprising:
monitoring at least one system metric of the distributed storage system; creating a mapping between values and/or patterns of the at least one system metric and one or more services configured to generate logs for the distributed storage system; based on the monitoring, detecting a potential anomaly in the distributed storage system, the potential anomaly associated with a value and/or a pattern of the at least one system metric; based on the mapping, identifying one or more logs associated with the potential anomaly; displaying a graphical representation of at least a part of monitoring the at least one system metric, the graphical representation indicating the potential anomaly; and providing an overlay over the graphical representation, the overlay comprising an indicator of a number of the one or more logs associated with the potential anomaly. 2. The method according to claim 1, wherein the potential anomaly is detected based on comparison of values of the at least one system metric within a specified time interval comprising the potential anomaly with values of the at least one system metric within an earlier time interval of the duration of the specified time interval. 3. The method according to claim 1, wherein:
monitoring the at least one system metric of the distributed storage system comprises monitoring of the at least one system metric for a first node of the distributed storage system, the method further comprises monitoring the at least one system metric for a second node of the distributed storage system, and the potential anomaly is detected based on comparison of values of the at least one system metric for the first node with values of the at least one system metric for the second node. 4. The method according to claim 1, wherein the potential anomaly is identified based on comparison of values of the at least one system metric with values of at least one other system metric. 5. The method according to claim 1, wherein the at least one system metric includes information related to at least one of on-going client operations, current central processing unit (CPU) utilization, disk usage, available network bandwidth, remaining disk input/output operations per second (IOPS), and remaining disk bandwidth. 6. The method according to claim 1, further comprising performing a similarity search to identify whether one or more anomalies similar to the potential anomaly have occurred prior to occurrence of the potential anomaly. 7. The method according to claim 1, wherein the potential anomaly is detected using Holt-Winters exponential smoothing or/and a Gaussian process based method. 8. A system for assisting evaluation of anomalies in a distributed storage system, the system comprising:
at least one memory configured to store computer executable instructions, and at least one processor coupled to the at least one memory and configured, when executing the instructions, to:
monitor at least one system metric of the distributed storage system;
create a mapping between values and/or patterns of the at least one system metric and one or more services configured to generate logs for the distributed storage system;
based on the monitoring, detect a potential anomaly in the distributed storage system, the potential anomaly associated with a value and/or a pattern of the at least one system metric;
based on the mapping, identify one or more logs associated with the potential anomaly;
display a graphical representation of at least a part of monitoring the at least one system metric, the graphical representation indicating the potential anomaly; and
provide an overlay over the graphical representation, the overlay comprising an indicator of a number of the one or more logs associated with the potential anomaly. 9. The system according to claim 8, wherein the potential anomaly is detected based on comparison of values of the at least one system metric within a specified time interval comprising the potential anomaly with values of the at least one system metric within an earlier time interval of the duration of the specified time interval. 10. The system according to claim 8, wherein:
monitoring the at least one system metric of the distributed storage system comprises monitoring of the at least one system metric for a first node of the distributed storage system, the method further comprises monitoring the at least one system metric for a second node of the distributed storage system, and the potential anomaly is detected based on comparison of values of the at least one system metric for the first node with values of the at least one system metric for the second node. 11. The system according to claim 8, wherein the potential anomaly is identified based on comparison of values of the at least one system metric with values of at least one other system metric. 12. The system according to claim 8, wherein the at least one system metric includes information related to at least one of on-going client operations, current central processing unit (CPU) utilization, disk usage, available network bandwidth, remaining disk input/output operations per second (IOPS), and remaining disk bandwidth. 13. The system according to claim 8, wherein the at least one processor is further configured to perform a similarity search to identify whether one or more anomalies similar to the potential anomaly have occurred prior to occurrence of the potential anomaly. 14. The system according to claim 8, wherein the at least one processor is configured to detect the potential anomaly using Holt-Winters exponential smoothing or/and a Gaussian process based method. 15. One or more computer readable storage media encoded with software comprising computer executable instructions and when the software is executed operable to perform a method for assisting evaluation of anomalies in a distributed storage system, the method comprising:
monitoring at least one system metric of the distributed storage system; creating a mapping between values and/or patterns of the at least one system metric and one or more services configured to generate logs for the distributed storage system; based on the monitoring, detecting a potential anomaly in the distributed storage system, the potential anomaly associated with a value and/or a pattern of the at least one system metric; based on the mapping, identifying one or more logs associated with the potential anomaly; displaying a graphical representation of at least a part of monitoring the at least one system metric, the graphical representation indicating the potential anomaly; and providing an overlay over the graphical representation, the overlay comprising an indicator of a number of the one or more logs associated with the potential anomaly. 16. The one or more computer readable media according to claim 15, wherein the potential anomaly is detected based on comparison of values of the at least one system metric within a specified time interval comprising the potential anomaly with values of the at least one system metric within an earlier time interval of the duration of the specified time interval. 17. The one or more computer readable media according to claim 15, wherein:
monitoring the at least one system metric of the distributed storage system comprises monitoring of the at least one system metric for a first node of the distributed storage system, the method further comprises monitoring the at least one system metric for a second node of the distributed storage system, and the potential anomaly is detected based on comparison of values of the at least one system metric for the first node with values of the at least one system metric for the second node. 18. The one or more computer readable media according to claim 15, wherein the potential anomaly is identified based on comparison of values of the at least one system metric with values of at least one other system metric. 19. The one or more computer readable media according to claim 15, wherein the at least one system metric includes information related to at least one of on-going client operations, current central processing unit (CPU) utilization, disk usage, available network bandwidth, remaining disk input/output operations per second (IOPS), and remaining disk bandwidth. 20. The one or more computer readable media according to claim 15, wherein the method further comprises performing a similarity search to identify whether one or more anomalies similar to the potential anomaly have occurred prior to occurrence of the potential anomaly. | 2,100 |
4,949 | 15,333,383 | 2,169 | An automated media scheduling system maintains information associating multiple different content triggers with multiple different content adjustment parameters. The media scheduling system monitors media content across multiple media platforms for a content trigger. In response to detecting a particular content trigger, the media scheduling system adjusts playout of scheduled media content based on a content adjustment parameter associated with the detected content trigger. | 1. A method for use in an automated media scheduling system, the method comprising:
maintaining information associating a plurality of different content triggers with a plurality of different content adjustment parameters, by executing a program instruction in a data processing apparatus; monitoring media content across a plurality of media platforms for a content trigger, by executing a program instruction in a data processing apparatus; and in response to detecting a particular content trigger, adjusting playout of scheduled media content based on a particular content adjustment parameter associated with the particular content trigger, by executing a program instruction in a data processing apparatus. 2. The method of claim 1, wherein content adjustment parameters specify at least one of inserting additional media content, removing media content, or replacing a general media content item with specific media content item. 3. The method of claim 2, wherein:
the general media content item includes a general advertisement associated with an advertiser; and the specific media content item includes an ad-song advertisement associated with the advertiser. 4. The method of claim 1, wherein the plurality of different content triggers include phrases indicating an occurrence of an event associated with an advertiser. 5. The method of claim 1, wherein adjusting playout includes inserting visual display content delivered via at least one of a website or mobile application, by executing a program instruction in a data processing apparatus. 6. The method of claim 1, wherein adjusting playout includes altering radio data system (RDS) content, by executing a program instruction in a data processing apparatus. 7. The method of claim 1, wherein adjusting playout includes altering signage displays, by executing a program instruction in a data processing apparatus. 8. An automated media scheduling system, the automated media scheduling system comprising:
a processor; a memory coupled to the processor, the memory configured to store a program of instructions executable by the processor; the program of instructions including: at least one instruction to maintain information associating a plurality of different content triggers with a plurality of different content adjustment parameters; at least one instruction to monitor media content across a plurality of media platforms for a content trigger; and at least one instruction to adjust playout of scheduled media content based on a particular content adjustment parameter associated with a particular content trigger. 9. The automated media scheduling system of claim 8, wherein content adjustment parameters specify at least one of inserting additional media content, removing media content, or replacing a general media content item with specific media content item. 10. The automated media scheduling system of claim 9, wherein:
the general media content item includes a general advertisement associated with an advertiser; and the specific media content item includes an ad-song advertisement associated with the advertiser. 11. The automated media scheduling system of claim 8, wherein the plurality of different content triggers include phrases indicating an occurrence of an event associated with an advertiser. 12. The automated media scheduling system of claim 8, wherein adjusting playout includes inserting visual display content delivered via at least one of a website or mobile application, by executing a program instruction in a data processing apparatus. 13. The automated media scheduling system of claim 8, wherein adjusting playout includes altering radio data system (RDS) content, by executing a program instruction in a data processing apparatus. 14. The automated media scheduling system of claim 8, wherein adjusting playout includes altering signage displays, by executing a program instruction in a data processing apparatus. 15. A non-transitory computer readable medium tangibly embodying a program of instructions to be stored in a memory and executed by a processor, the program of instructions comprising:
at least one instruction to maintain information used by an automated media scheduling system to associate a plurality of different content triggers with a plurality of different content adjustment parameters; at least one instruction used by an automated media scheduling system to monitor media content across a plurality of media platforms for a content trigger; and at least one instruction used by an automated media scheduling system to adjust playout of scheduled media content based on a particular content adjustment parameter associated with a particular content trigger. 16. The non-transitory computer readable medium of claim 15, wherein content adjustment parameters specify at least one of inserting additional media content, removing media content, or replacing a general media content item with specific media content item. 17. The non-transitory computer readable medium of claim 15, wherein the plurality of different content triggers include phrases indicating an occurrence of an event associated with an advertiser. 18. The non-transitory computer readable medium of claim 15, wherein adjusting playout includes inserting visual display content delivered via at least one of a website or mobile application, by executing a program instruction in a data processing apparatus. 19. The non-transitory computer readable medium of claim 15, wherein adjusting playout includes altering radio data system (RDS) content, by executing a program instruction in a data processing apparatus. 20. The non-transitory computer readable medium of claim 15, wherein adjusting playout includes altering signage displays, by executing a program instruction in a data processing apparatus. | An automated media scheduling system maintains information associating multiple different content triggers with multiple different content adjustment parameters. The media scheduling system monitors media content across multiple media platforms for a content trigger. In response to detecting a particular content trigger, the media scheduling system adjusts playout of scheduled media content based on a content adjustment parameter associated with the detected content trigger.1. A method for use in an automated media scheduling system, the method comprising:
maintaining information associating a plurality of different content triggers with a plurality of different content adjustment parameters, by executing a program instruction in a data processing apparatus; monitoring media content across a plurality of media platforms for a content trigger, by executing a program instruction in a data processing apparatus; and in response to detecting a particular content trigger, adjusting playout of scheduled media content based on a particular content adjustment parameter associated with the particular content trigger, by executing a program instruction in a data processing apparatus. 2. The method of claim 1, wherein content adjustment parameters specify at least one of inserting additional media content, removing media content, or replacing a general media content item with specific media content item. 3. The method of claim 2, wherein:
the general media content item includes a general advertisement associated with an advertiser; and the specific media content item includes an ad-song advertisement associated with the advertiser. 4. The method of claim 1, wherein the plurality of different content triggers include phrases indicating an occurrence of an event associated with an advertiser. 5. The method of claim 1, wherein adjusting playout includes inserting visual display content delivered via at least one of a website or mobile application, by executing a program instruction in a data processing apparatus. 6. The method of claim 1, wherein adjusting playout includes altering radio data system (RDS) content, by executing a program instruction in a data processing apparatus. 7. The method of claim 1, wherein adjusting playout includes altering signage displays, by executing a program instruction in a data processing apparatus. 8. An automated media scheduling system, the automated media scheduling system comprising:
a processor; a memory coupled to the processor, the memory configured to store a program of instructions executable by the processor; the program of instructions including: at least one instruction to maintain information associating a plurality of different content triggers with a plurality of different content adjustment parameters; at least one instruction to monitor media content across a plurality of media platforms for a content trigger; and at least one instruction to adjust playout of scheduled media content based on a particular content adjustment parameter associated with a particular content trigger. 9. The automated media scheduling system of claim 8, wherein content adjustment parameters specify at least one of inserting additional media content, removing media content, or replacing a general media content item with specific media content item. 10. The automated media scheduling system of claim 9, wherein:
the general media content item includes a general advertisement associated with an advertiser; and the specific media content item includes an ad-song advertisement associated with the advertiser. 11. The automated media scheduling system of claim 8, wherein the plurality of different content triggers include phrases indicating an occurrence of an event associated with an advertiser. 12. The automated media scheduling system of claim 8, wherein adjusting playout includes inserting visual display content delivered via at least one of a website or mobile application, by executing a program instruction in a data processing apparatus. 13. The automated media scheduling system of claim 8, wherein adjusting playout includes altering radio data system (RDS) content, by executing a program instruction in a data processing apparatus. 14. The automated media scheduling system of claim 8, wherein adjusting playout includes altering signage displays, by executing a program instruction in a data processing apparatus. 15. A non-transitory computer readable medium tangibly embodying a program of instructions to be stored in a memory and executed by a processor, the program of instructions comprising:
at least one instruction to maintain information used by an automated media scheduling system to associate a plurality of different content triggers with a plurality of different content adjustment parameters; at least one instruction used by an automated media scheduling system to monitor media content across a plurality of media platforms for a content trigger; and at least one instruction used by an automated media scheduling system to adjust playout of scheduled media content based on a particular content adjustment parameter associated with a particular content trigger. 16. The non-transitory computer readable medium of claim 15, wherein content adjustment parameters specify at least one of inserting additional media content, removing media content, or replacing a general media content item with specific media content item. 17. The non-transitory computer readable medium of claim 15, wherein the plurality of different content triggers include phrases indicating an occurrence of an event associated with an advertiser. 18. The non-transitory computer readable medium of claim 15, wherein adjusting playout includes inserting visual display content delivered via at least one of a website or mobile application, by executing a program instruction in a data processing apparatus. 19. The non-transitory computer readable medium of claim 15, wherein adjusting playout includes altering radio data system (RDS) content, by executing a program instruction in a data processing apparatus. 20. The non-transitory computer readable medium of claim 15, wherein adjusting playout includes altering signage displays, by executing a program instruction in a data processing apparatus. | 2,100 |
4,950 | 14,697,832 | 2,135 | In one embodiment, a processor includes a control logic to determine whether to enable an incoming data block associated with a first priority to displace, in a cache memory coupled to the processor, a candidate victim data block associated with a second priority and stored in the cache memory, based at least in part on the first and second priorities, a first access history associated with the incoming data block and a second access history associated with the candidate victim data block. Other embodiments are described and claimed. | 1. A processor comprising:
a control logic to determine whether to enable an incoming data block associated with a first priority to displace, in a cache memory coupled to the processor, a candidate victim data block associated with a second priority and stored in the cache memory, based at least in part on the first and second priorities, a first access history associated with the incoming data block and a second access history associated with the candidate victim data block. 2. The processor of claim 1, wherein the control logic is to enable a second data block having the second priority to displace a first data block stored in the cache memory, the first data block having the first priority, the second priority lower than the first priority, when an application indicates that priority information is to be overridden. 3. The processor of claim 2, wherein the control logic is to receive the first priority and the second priority from the application responsive to one or more user-level instructions to indicate the first priority and the second priority. 4. The processor of claim 2, wherein the control logic, when the application indicates that the priority information is not to be overridden, is to prevent the displacement of the first data block with the second data block. 5. The processor of claim 1, wherein the control logic is to statistically bias displacement of the candidate victim data block according to a first bias value, the first bias value based at least in part on the first priority and the second priority. 6. The processor of claim 5, wherein the first bias value is further based at least in part on the first access history and the second access history. 7. The processor of claim 1, wherein the cache memory comprises a direct-mapped cache memory and wherein the candidate victim data block and the incoming data block map to a common entry of the direct-mapped cache memory. 8. The processor of claim 1, further comprising a plurality of filter storages including a first filter storage to store a first pattern to indicate locations in the cache memory that may store data blocks of the first priority. 9. The processor of claim 1, wherein the processor further comprises:
a first storage to store a first access history to indicate an access history for data blocks having the first priority; and a second storage to store a second access history to indicate an access history for data blocks having the second priority. 10. The processor of claim 9, wherein the control logic is to perform a hash function of an address of the incoming data block and to update a corresponding entry of the first storage based on the hash function. 11. The processor of claim 1, wherein the processor further comprises a memory controller, the memory controller including the control logic, wherein the cache memory comprises a system memory coupled to the processor, and wherein the incoming data block is to be obtained from a persistent storage coupled to the system memory. 12. The processor of claim 1, wherein the control logic is to prevent displacement of the candidate victim data block with a second incoming data block having a third priority unless data blocks of the third priority are requested more often than data blocks of the first priority or the second priority, wherein the third priority is lower than the first priority and the second priority. 13. A machine-readable medium having stored thereon data, which if used by at least one machine, causes the at least one machine to fabricate at least one integrated circuit to perform a method comprising:
responsive to a cache miss for a requested data item in a cache memory of a processor, identifying a candidate victim data item stored in a first memory coupled to the processor; determining to displace the candidate victim data item stored in the first memory with the requested data item when an override indicator indicates that a priority consideration of a displacement policy is to be overridden, wherein a priority associated with the candidate victim data item is higher than a priority associated with the requested data item; and storing the requested data item in the first memory in a location in which the candidate replacement data item was stored. 14. The machine-readable medium of claim 13, wherein the method further comprises receiving an instruction from an application to indicate a first priority level for a memory range including the requested data item. 15. The machine-readable medium of claim 14, wherein the method further comprises storing a first value in an entry of a filter storage corresponding to the requested data item responsive to the instruction, the filter storage associated with the first priority level. 16. The machine-readable medium of claim 14, wherein the method further comprises receiving the override indicator from the application, based on a particular phase of application execution. 17. The machine-readable medium of claim 13, wherein the first memory comprises a system memory coupled to the processor and in response to the displacement determination, loading the requested data item from a persistent memory coupled to the first memory into the first memory, wherein the first memory is direct mapped. 18. The machine-readable medium of claim 13, wherein the method further comprises determining whether to displace the candidate victim data item according to a stochastic determination. 19. The machine-readable medium of claim 18, wherein the method further comprises adjusting a bias of the stochastic determination according to a bias value, the bias value based at least in part on the priority associated with the requested data item and the priority associated with the candidate victim data item. 20. A system comprising:
a persistent storage to store data blocks persistently; a memory coupled to the persistent storage to cache a plurality of the data blocks obtained from the persistent storage; and a processor coupled to the memory and the persistent storage, the processor including at least one core, at least one cache memory, and a memory controller, the memory controller including a control logic to stochastically determine whether to displace a first data block stored in the memory with a second data block stored in the persistent storage, based at least in part on a first priority associated with the first data block and a second priority associated with the second data block. 21. The system of claim 20, wherein the processor further comprises a first filter storage having entries to indicate one or more first addresses within the persistent storage associated with the first priority and a second filter storage having entries to indicate one or more second addresses within the persistent storage associated with the second priority, wherein the control logic is to update an entry of the first filter storage associated with the first data block according to a hash function responsive to an indication that associates the first priority with the first data block, the indication received from an application. 22. The system of claim 21, wherein the indication comprises a user-level instruction to indicate, from the application, association of the first priority with the first data block. 23. The system of claim 21, wherein the processor further comprises:
a first storage to store a first access history to indicate an access history for data blocks having the first priority; and a second storage to store a second access history to indicate an access history for data blocks having the second priority. 24. The system of claim 23, wherein the control logic is to stochastically determine whether to displace the first data block further based at least in part on a first access history for the first data block obtained from the first storage and a second access history for the second data block obtained from the second storage. 25. The system of claim 24, wherein the control logic is to stochastically determine whether to displace the first data block further based on a first bias value or a second bias value, wherein the control logic is to obtain the first bias value if the first data block was more recently used than the second data block. | In one embodiment, a processor includes a control logic to determine whether to enable an incoming data block associated with a first priority to displace, in a cache memory coupled to the processor, a candidate victim data block associated with a second priority and stored in the cache memory, based at least in part on the first and second priorities, a first access history associated with the incoming data block and a second access history associated with the candidate victim data block. Other embodiments are described and claimed.1. A processor comprising:
a control logic to determine whether to enable an incoming data block associated with a first priority to displace, in a cache memory coupled to the processor, a candidate victim data block associated with a second priority and stored in the cache memory, based at least in part on the first and second priorities, a first access history associated with the incoming data block and a second access history associated with the candidate victim data block. 2. The processor of claim 1, wherein the control logic is to enable a second data block having the second priority to displace a first data block stored in the cache memory, the first data block having the first priority, the second priority lower than the first priority, when an application indicates that priority information is to be overridden. 3. The processor of claim 2, wherein the control logic is to receive the first priority and the second priority from the application responsive to one or more user-level instructions to indicate the first priority and the second priority. 4. The processor of claim 2, wherein the control logic, when the application indicates that the priority information is not to be overridden, is to prevent the displacement of the first data block with the second data block. 5. The processor of claim 1, wherein the control logic is to statistically bias displacement of the candidate victim data block according to a first bias value, the first bias value based at least in part on the first priority and the second priority. 6. The processor of claim 5, wherein the first bias value is further based at least in part on the first access history and the second access history. 7. The processor of claim 1, wherein the cache memory comprises a direct-mapped cache memory and wherein the candidate victim data block and the incoming data block map to a common entry of the direct-mapped cache memory. 8. The processor of claim 1, further comprising a plurality of filter storages including a first filter storage to store a first pattern to indicate locations in the cache memory that may store data blocks of the first priority. 9. The processor of claim 1, wherein the processor further comprises:
a first storage to store a first access history to indicate an access history for data blocks having the first priority; and a second storage to store a second access history to indicate an access history for data blocks having the second priority. 10. The processor of claim 9, wherein the control logic is to perform a hash function of an address of the incoming data block and to update a corresponding entry of the first storage based on the hash function. 11. The processor of claim 1, wherein the processor further comprises a memory controller, the memory controller including the control logic, wherein the cache memory comprises a system memory coupled to the processor, and wherein the incoming data block is to be obtained from a persistent storage coupled to the system memory. 12. The processor of claim 1, wherein the control logic is to prevent displacement of the candidate victim data block with a second incoming data block having a third priority unless data blocks of the third priority are requested more often than data blocks of the first priority or the second priority, wherein the third priority is lower than the first priority and the second priority. 13. A machine-readable medium having stored thereon data, which if used by at least one machine, causes the at least one machine to fabricate at least one integrated circuit to perform a method comprising:
responsive to a cache miss for a requested data item in a cache memory of a processor, identifying a candidate victim data item stored in a first memory coupled to the processor; determining to displace the candidate victim data item stored in the first memory with the requested data item when an override indicator indicates that a priority consideration of a displacement policy is to be overridden, wherein a priority associated with the candidate victim data item is higher than a priority associated with the requested data item; and storing the requested data item in the first memory in a location in which the candidate replacement data item was stored. 14. The machine-readable medium of claim 13, wherein the method further comprises receiving an instruction from an application to indicate a first priority level for a memory range including the requested data item. 15. The machine-readable medium of claim 14, wherein the method further comprises storing a first value in an entry of a filter storage corresponding to the requested data item responsive to the instruction, the filter storage associated with the first priority level. 16. The machine-readable medium of claim 14, wherein the method further comprises receiving the override indicator from the application, based on a particular phase of application execution. 17. The machine-readable medium of claim 13, wherein the first memory comprises a system memory coupled to the processor and in response to the displacement determination, loading the requested data item from a persistent memory coupled to the first memory into the first memory, wherein the first memory is direct mapped. 18. The machine-readable medium of claim 13, wherein the method further comprises determining whether to displace the candidate victim data item according to a stochastic determination. 19. The machine-readable medium of claim 18, wherein the method further comprises adjusting a bias of the stochastic determination according to a bias value, the bias value based at least in part on the priority associated with the requested data item and the priority associated with the candidate victim data item. 20. A system comprising:
a persistent storage to store data blocks persistently; a memory coupled to the persistent storage to cache a plurality of the data blocks obtained from the persistent storage; and a processor coupled to the memory and the persistent storage, the processor including at least one core, at least one cache memory, and a memory controller, the memory controller including a control logic to stochastically determine whether to displace a first data block stored in the memory with a second data block stored in the persistent storage, based at least in part on a first priority associated with the first data block and a second priority associated with the second data block. 21. The system of claim 20, wherein the processor further comprises a first filter storage having entries to indicate one or more first addresses within the persistent storage associated with the first priority and a second filter storage having entries to indicate one or more second addresses within the persistent storage associated with the second priority, wherein the control logic is to update an entry of the first filter storage associated with the first data block according to a hash function responsive to an indication that associates the first priority with the first data block, the indication received from an application. 22. The system of claim 21, wherein the indication comprises a user-level instruction to indicate, from the application, association of the first priority with the first data block. 23. The system of claim 21, wherein the processor further comprises:
a first storage to store a first access history to indicate an access history for data blocks having the first priority; and a second storage to store a second access history to indicate an access history for data blocks having the second priority. 24. The system of claim 23, wherein the control logic is to stochastically determine whether to displace the first data block further based at least in part on a first access history for the first data block obtained from the first storage and a second access history for the second data block obtained from the second storage. 25. The system of claim 24, wherein the control logic is to stochastically determine whether to displace the first data block further based on a first bias value or a second bias value, wherein the control logic is to obtain the first bias value if the first data block was more recently used than the second data block. | 2,100 |
4,951 | 13,705,509 | 2,117 | A system comprising a controllable alternating current power source; an active rectifier coupled to the controllable alternating current power source and configured to rectify an output of the controllable alternating current power source to supply a direct current to a load; and a controller configured to adjust at least one of a parameter of the controllable alternating current power source and a parameter of the active rectifier in response to a target output. | 1. A system, comprising:
a controllable alternating current power source; an active rectifier coupled to the controllable alternating current power source and configured to rectify an output of the controllable alternating current power source to supply a direct current to a load; and a controller configured to adjust at least one of a parameter of the controllable alternating current power source and a parameter of the active rectifier in response to a target output. 2. The system of claim 1, wherein:
the controllable alternating current power source includes an engine; the controller is configured to reduce a speed of the engine; and the controller is configured to adjust the active rectifier to boost the output of the controllable alternating current power source to the target output. 3. The system of claim 2, wherein the controller is configured to one of reduce the speed of the engine to a minimum operating speed for a targeted output level or an optimized operating speed for efficient operation. 4. The system of claim 1, wherein the active rectifier is configured to supply one of a boosted high voltage direct current or reduced voltage direct current from the controllable alternating power source to the load. 5. The system of claim 1, wherein:
the controllable alternating current power source is a high voltage power source; and the active rectifier is configured to reduce the output of the controllable alternating current power source to the target output. 6. The system of claim 1, wherein:
the controller is configured to operate the controllable alternating current power source at one of a maximum efficiency for a target output power, a target noise level for a target output power, or a target emissions level for a target output level; and the controller is configured to operate the active rectifier to achieve a target output voltage. 7. The system of claim 1, further comprising:
a second power source coupled to the active rectifier to form a combined output; wherein the controller is configured to supplement or charge the second power source with an output of the active rectifier such that the system that incorporates the second power source and controllable alternating current power source operates at a greater overall efficiency. 8. The system of claim 1, wherein:
the controller is further configured to adjust the parameter of the controllable alternating current power source such that output of the controllable alternating current power source is at a first level that, if passively rectified, is less than a second level required to reach the target output; and the controller is further configured to adjust the parameter of the active rectifier to reach the target output when the controllable alternating current power source is operating at the first level. 9. The system of claim 1, wherein the system is substantially isolated from a substantially continuous alternating current power source. 10. A system, comprising:
a controllable alternating current power source; a hybrid rectifier configured to rectify an output of the controllable alternating current power source configurable to operate in an active rectification mode and a passive rectification mode; a controller configured to switch an operation of the hybrid rectifier between the active rectification mode and the passive rectification mode in response to a threshold. 11. The system of claim 10, wherein the threshold is an operating point of the controllable alternating current power source at which an efficiency in the passive rectification mode is substantially equivalent to an efficiency in the active rectification mode. 12. The system of claim 10, further comprising:
a memory configured to store efficiency information for the controllable alternating current power source; wherein the controller is configured to switch the operation of the hybrid rectifier between the active rectification mode and the passive rectification mode in response to the efficiency information. 13. The system of claim 12, wherein the efficiency information includes one or more of fuel efficiency information, minimal noise information, and maximum service endurance information for an engine. 14. A method, comprising:
generating an alternating current with an alternating current power source having a controllable output power; rectifying the alternating current with an active rectifier; adjusting at least one of the rectification and the generation in response to a target output. 15. The method of claim 14, further comprising:
switching an operation of the rectification between an active rectification mode and a passive rectification mode in response to an output threshold 16. The method of claim 14, wherein:
generating the alternating current comprises generating the alternating current with an engine; and further comprising:
reducing a speed of the engine; and
boosting the alternating current to the target output. 17. The method of claim 16, further comprising reducing the speed of the engine to a minimum operating speed. 18. The method of claim 14, wherein the target output is a high voltage direct current output. 19. The method of claim 14, wherein:
generating the alternating current comprises generating a high voltage alternating current; and rectifying the alternating current comprises reducing the voltage output of the controllable alternating current power source to the target output. 20. The method of claim 14, further comprising:
operating the alternating current power source at a maximum efficiency for a target output power; and operating the active rectifier to achieve a target output. 21. The method of claim 14, further comprising:
generating power from a second power source; and supplementing the power from the second power source with the rectified alternating current to operate the second power source at a higher efficiency. 22. The method of claim 14, further comprising:
adjusting the alternating current power source such that output of the alternating current power source is at a first level that, if passively rectified, is less than a second level required to reach the target output; and adjusting the rectification to reach the target output when the controllable alternating current power source is operating at the first level. | A system comprising a controllable alternating current power source; an active rectifier coupled to the controllable alternating current power source and configured to rectify an output of the controllable alternating current power source to supply a direct current to a load; and a controller configured to adjust at least one of a parameter of the controllable alternating current power source and a parameter of the active rectifier in response to a target output.1. A system, comprising:
a controllable alternating current power source; an active rectifier coupled to the controllable alternating current power source and configured to rectify an output of the controllable alternating current power source to supply a direct current to a load; and a controller configured to adjust at least one of a parameter of the controllable alternating current power source and a parameter of the active rectifier in response to a target output. 2. The system of claim 1, wherein:
the controllable alternating current power source includes an engine; the controller is configured to reduce a speed of the engine; and the controller is configured to adjust the active rectifier to boost the output of the controllable alternating current power source to the target output. 3. The system of claim 2, wherein the controller is configured to one of reduce the speed of the engine to a minimum operating speed for a targeted output level or an optimized operating speed for efficient operation. 4. The system of claim 1, wherein the active rectifier is configured to supply one of a boosted high voltage direct current or reduced voltage direct current from the controllable alternating power source to the load. 5. The system of claim 1, wherein:
the controllable alternating current power source is a high voltage power source; and the active rectifier is configured to reduce the output of the controllable alternating current power source to the target output. 6. The system of claim 1, wherein:
the controller is configured to operate the controllable alternating current power source at one of a maximum efficiency for a target output power, a target noise level for a target output power, or a target emissions level for a target output level; and the controller is configured to operate the active rectifier to achieve a target output voltage. 7. The system of claim 1, further comprising:
a second power source coupled to the active rectifier to form a combined output; wherein the controller is configured to supplement or charge the second power source with an output of the active rectifier such that the system that incorporates the second power source and controllable alternating current power source operates at a greater overall efficiency. 8. The system of claim 1, wherein:
the controller is further configured to adjust the parameter of the controllable alternating current power source such that output of the controllable alternating current power source is at a first level that, if passively rectified, is less than a second level required to reach the target output; and the controller is further configured to adjust the parameter of the active rectifier to reach the target output when the controllable alternating current power source is operating at the first level. 9. The system of claim 1, wherein the system is substantially isolated from a substantially continuous alternating current power source. 10. A system, comprising:
a controllable alternating current power source; a hybrid rectifier configured to rectify an output of the controllable alternating current power source configurable to operate in an active rectification mode and a passive rectification mode; a controller configured to switch an operation of the hybrid rectifier between the active rectification mode and the passive rectification mode in response to a threshold. 11. The system of claim 10, wherein the threshold is an operating point of the controllable alternating current power source at which an efficiency in the passive rectification mode is substantially equivalent to an efficiency in the active rectification mode. 12. The system of claim 10, further comprising:
a memory configured to store efficiency information for the controllable alternating current power source; wherein the controller is configured to switch the operation of the hybrid rectifier between the active rectification mode and the passive rectification mode in response to the efficiency information. 13. The system of claim 12, wherein the efficiency information includes one or more of fuel efficiency information, minimal noise information, and maximum service endurance information for an engine. 14. A method, comprising:
generating an alternating current with an alternating current power source having a controllable output power; rectifying the alternating current with an active rectifier; adjusting at least one of the rectification and the generation in response to a target output. 15. The method of claim 14, further comprising:
switching an operation of the rectification between an active rectification mode and a passive rectification mode in response to an output threshold 16. The method of claim 14, wherein:
generating the alternating current comprises generating the alternating current with an engine; and further comprising:
reducing a speed of the engine; and
boosting the alternating current to the target output. 17. The method of claim 16, further comprising reducing the speed of the engine to a minimum operating speed. 18. The method of claim 14, wherein the target output is a high voltage direct current output. 19. The method of claim 14, wherein:
generating the alternating current comprises generating a high voltage alternating current; and rectifying the alternating current comprises reducing the voltage output of the controllable alternating current power source to the target output. 20. The method of claim 14, further comprising:
operating the alternating current power source at a maximum efficiency for a target output power; and operating the active rectifier to achieve a target output. 21. The method of claim 14, further comprising:
generating power from a second power source; and supplementing the power from the second power source with the rectified alternating current to operate the second power source at a higher efficiency. 22. The method of claim 14, further comprising:
adjusting the alternating current power source such that output of the alternating current power source is at a first level that, if passively rectified, is less than a second level required to reach the target output; and adjusting the rectification to reach the target output when the controllable alternating current power source is operating at the first level. | 2,100 |
4,952 | 15,097,704 | 2,158 | Disclosed are various embodiments that employ metadata to map stored client data to form fields and other data consumers. Data items are requested by a data consumer, such as a web form. Metadata is obtained that includes a mapping of standardized data items to the requested data items. The requested data items are generated based at least in part on the mapping and the standardized data items. | 1. A non-transitory computer-readable medium embodying a program that, when executed by at least one computing device, causes the at least one computing device to at least:
receive a plurality of standardized data items from a network service corresponding to a data provider, the plurality of standardized data items corresponding to standardized data types promulgated by a metadata central authority; determine that a network page including a web form has been requested by a data consumer, the web form requesting a plurality of requested data items; receive metadata from a network data service, the metadata including a mapping defining a correspondence between the plurality of requested data items requested and the plurality of standardized data items; generate a subset of the plurality of requested data items requested by the web form based at least in part on the metadata and the plurality of standardized data items; and execute a service call to the data consumer including the subset of the plurality of requested data items. 2. The non-transitory computer-readable medium of claim 1, wherein the program further causes the at least one computing device to generate a user interface to elicit a user-specified mapping of a data item of the plurality of requested data items to a standardized data item of the plurality of standardized data items. 3. The non-transitory computer-readable medium of claim 2 wherein the subset of the plurality of requested data items does not contain the data item of the plurality of requested data items for which the user interface elicits the user-specified mapping. 4. The non-transitory computer-readable medium of claim 2, wherein the program further causes the at least one computing device to send a request to the metadata central authority to add the user-specified mapping of the data item to the standardized data item to metadata promulgated by the metadata central authority. 5. The non-transitory computer-readable medium of claim 1, wherein the program comprises at least one of: an extension or a plugin of a browser. 6. The non-transitory computer-readable medium of claim 1, wherein the mapping includes a regular expression that defines an acceptable data format for at least one of the plurality of requested data items. 7. The non-transitory computer-readable medium of claim 1, wherein generating the subset of the plurality of requested data items comprises correlating an identifier for one of the plurality of requested data items to one of a plurality of identifiers in the mapping, the plurality of identifiers individually corresponding to respective ones of the plurality of standardized data items. 8. A system, comprising:
a data store comprising a cache of metadata; and a client computing device in communication with the data store, the client computing device being configured to at least:
determine that a network page including a form has been requested by a data consumer from a network data server, the form requesting a plurality of data items;
receive metadata corresponding to the network page, the metadata including a plurality of standardized data items;
generate the plurality of data items requested by the form based at least in part on the plurality of standardized data items and the metadata;
cause the plurality of data items to be entered into the form; and
submit the form to the network data server. 9. The system of claim 8, wherein the client computing device is further configured to at least receive the plurality of standardized data items via a user interface, the plurality of standardized data items corresponding to standardized data types. 10. The system of claim 8, wherein the client computing device is further configured to at least:
receive user input entered into the form in the network page for at least one of the plurality of data items; and determine an additional standardized data item based at least in part on the user input; and add the additional standardized data item to the plurality of standardized data items in the metadata. 11. The system of claim 8, wherein the client computing device is further configured to determine whether the cache of metadata is valid, wherein the metadata is received from the cache of metadata in response to determining that the cache is valid and the metadata is received from a metadata service in response to determining that the cache is invalid. 12. The system of claim 11, wherein the client computing device is further configured to send a request to the metadata service to determine whether the cache of the metadata is valid. 13. The system of claim 8, wherein the client computing device is further configured to identify the data consumer based at least in part on a domain name of the network page. 14. The system of claim 8, wherein the form is submitted to the network data server with the plurality of data items using at least one of: Hypertext Transfer Protocol (HTTP) GET or HTTP POST. 15. A method comprising:
determining, via at least one of one or more computing devices, that a network page including a form has been requested by a data consumer, the form requesting a plurality of requested data items; receiving, via at least one of the one or more computing devices, metadata from a network service, the metadata comprising a mapping of a plurality of standardized data items to the plurality of requested data items; generating, via at least one of the one or more computing devices, the plurality of requested data items from the plurality of standardized data items based at least in part on the mapping; and causing, via at least one of the one or more computing devices, the plurality of data items to be entered into the form. 16. The method of claim 15, further comprising generating, via at least one of the one or more computing devices, a user interface to elicit an update to the mapping of the plurality of standardized data items to the plurality of requested data items. 17. The method of claim 15, further comprising submitting, via at least one of the one or more computing devices, the form to the network service including the plurality of data items. 18. The method of claim 15, wherein the plurality of data items are entered into the form by making a call to an Application Programming Interface (API) of the data consumer. 19. The method of claim 15, wherein receiving the metadata from the network service further comprises receiving, via at least one of the one or more computing devices, the network page including the metadata embedded within the network page. 20. The method of claim 15, wherein the form is a HyperText Markup Language (HTML) web page form. | Disclosed are various embodiments that employ metadata to map stored client data to form fields and other data consumers. Data items are requested by a data consumer, such as a web form. Metadata is obtained that includes a mapping of standardized data items to the requested data items. The requested data items are generated based at least in part on the mapping and the standardized data items.1. A non-transitory computer-readable medium embodying a program that, when executed by at least one computing device, causes the at least one computing device to at least:
receive a plurality of standardized data items from a network service corresponding to a data provider, the plurality of standardized data items corresponding to standardized data types promulgated by a metadata central authority; determine that a network page including a web form has been requested by a data consumer, the web form requesting a plurality of requested data items; receive metadata from a network data service, the metadata including a mapping defining a correspondence between the plurality of requested data items requested and the plurality of standardized data items; generate a subset of the plurality of requested data items requested by the web form based at least in part on the metadata and the plurality of standardized data items; and execute a service call to the data consumer including the subset of the plurality of requested data items. 2. The non-transitory computer-readable medium of claim 1, wherein the program further causes the at least one computing device to generate a user interface to elicit a user-specified mapping of a data item of the plurality of requested data items to a standardized data item of the plurality of standardized data items. 3. The non-transitory computer-readable medium of claim 2 wherein the subset of the plurality of requested data items does not contain the data item of the plurality of requested data items for which the user interface elicits the user-specified mapping. 4. The non-transitory computer-readable medium of claim 2, wherein the program further causes the at least one computing device to send a request to the metadata central authority to add the user-specified mapping of the data item to the standardized data item to metadata promulgated by the metadata central authority. 5. The non-transitory computer-readable medium of claim 1, wherein the program comprises at least one of: an extension or a plugin of a browser. 6. The non-transitory computer-readable medium of claim 1, wherein the mapping includes a regular expression that defines an acceptable data format for at least one of the plurality of requested data items. 7. The non-transitory computer-readable medium of claim 1, wherein generating the subset of the plurality of requested data items comprises correlating an identifier for one of the plurality of requested data items to one of a plurality of identifiers in the mapping, the plurality of identifiers individually corresponding to respective ones of the plurality of standardized data items. 8. A system, comprising:
a data store comprising a cache of metadata; and a client computing device in communication with the data store, the client computing device being configured to at least:
determine that a network page including a form has been requested by a data consumer from a network data server, the form requesting a plurality of data items;
receive metadata corresponding to the network page, the metadata including a plurality of standardized data items;
generate the plurality of data items requested by the form based at least in part on the plurality of standardized data items and the metadata;
cause the plurality of data items to be entered into the form; and
submit the form to the network data server. 9. The system of claim 8, wherein the client computing device is further configured to at least receive the plurality of standardized data items via a user interface, the plurality of standardized data items corresponding to standardized data types. 10. The system of claim 8, wherein the client computing device is further configured to at least:
receive user input entered into the form in the network page for at least one of the plurality of data items; and determine an additional standardized data item based at least in part on the user input; and add the additional standardized data item to the plurality of standardized data items in the metadata. 11. The system of claim 8, wherein the client computing device is further configured to determine whether the cache of metadata is valid, wherein the metadata is received from the cache of metadata in response to determining that the cache is valid and the metadata is received from a metadata service in response to determining that the cache is invalid. 12. The system of claim 11, wherein the client computing device is further configured to send a request to the metadata service to determine whether the cache of the metadata is valid. 13. The system of claim 8, wherein the client computing device is further configured to identify the data consumer based at least in part on a domain name of the network page. 14. The system of claim 8, wherein the form is submitted to the network data server with the plurality of data items using at least one of: Hypertext Transfer Protocol (HTTP) GET or HTTP POST. 15. A method comprising:
determining, via at least one of one or more computing devices, that a network page including a form has been requested by a data consumer, the form requesting a plurality of requested data items; receiving, via at least one of the one or more computing devices, metadata from a network service, the metadata comprising a mapping of a plurality of standardized data items to the plurality of requested data items; generating, via at least one of the one or more computing devices, the plurality of requested data items from the plurality of standardized data items based at least in part on the mapping; and causing, via at least one of the one or more computing devices, the plurality of data items to be entered into the form. 16. The method of claim 15, further comprising generating, via at least one of the one or more computing devices, a user interface to elicit an update to the mapping of the plurality of standardized data items to the plurality of requested data items. 17. The method of claim 15, further comprising submitting, via at least one of the one or more computing devices, the form to the network service including the plurality of data items. 18. The method of claim 15, wherein the plurality of data items are entered into the form by making a call to an Application Programming Interface (API) of the data consumer. 19. The method of claim 15, wherein receiving the metadata from the network service further comprises receiving, via at least one of the one or more computing devices, the network page including the metadata embedded within the network page. 20. The method of claim 15, wherein the form is a HyperText Markup Language (HTML) web page form. | 2,100 |
4,953 | 14,012,039 | 2,165 | A search service executes on one or more computing systems and searches at least one index associated with content accessible through an application based on the at least one portion of the search query to provide search results associated with the application. A search results interface returns one or more search results from the search. At least one of the search results is associated with an application identifier identifying the application. The search service ranks the search results associated with the application with other search results from at least one other search of other content based on the search query. | 1. A method comprising:
receiving at least a portion of a search query by a search service; searching by the search service at least one index associated with content accessible through an application based on the at least one portion of the search query to provide one or more contextualized search results associated with the content of the application; and returning from the search service the one or more contextual search results responsive to the searching operation, each contextual search result including a reference to content associated with the search result and an application identifier identifying the application. 2. The method of claim 1 wherein the application identifier identifies the application to be launched by a client system for operation on the content, the at least a portion of the search query being received by the search service from the client system. 3. The method of claim 1 further comprising:
ranking the contextualized search results associated with the application with other search results from at least one other search of other content based on the search query, prior to the returning operation. 4. The method of claim 1 wherein at least one of the one or more contextualized search results further includes an action identifier designating an action to be performed by the application on the content referenced by the search result. 5. The method of claim 1 wherein the searching operation searches for application content, and further comprising:
searching by the search service at least one index associated with Web content; and
ranking the contextualized search results associated with the application among the one or more search results referencing the searched Web content to provide integrated search results of different search contexts, the integrated search results being returned by the search service in the returning operation. 6. The method of claim 1 wherein contextualized search results include ranking data to allow subsequently integrated ranking by a client system of the contextualized search results associated with the application among search results from a local search context to provide integrated search results of different search contexts. 7. 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:
searching by a search service at least one index associated with content accessible through an application based on at least one portion of the search query to provide one or more contextualized search results associated with the content of the application; and returning from the search service the one or more contextual search results responsive to the searching operation, each contextual search result including a reference to content associated with the search result and an application identifier identifying the application. 8. The one or more tangible computer-readable storage media of claim 7 wherein the application identifier identifies the application to be launched by a client system for operation on the content, the at least a portion of the search query being received by the search service from the client system. 9. The one or more tangible computer-readable storage media of claim 7, wherein the computer process further comprises:
ranking the contextualized search results associated with the application with other search results from at least one other search of other content based on the search query, prior to the returning operation. 10. The one or more tangible computer-readable storage media of claim 7 wherein at least one of the one or more contextualized search results further includes an action identifier designating an action to be performed by the application on the content referenced by the search result. 11. The one or more tangible computer-readable storage media of claim 7 wherein the searching operation searches for application content, and the computer process further comprises:
searching by the search service at least one index associated with Web content; and
ranking the contextualized search results associated with the application among the one or more search results referencing the searched Web content to provide integrated search results of different search contexts, the integrated search results being returned by the search service in the returning operation. 12. The one or more tangible computer-readable storage media of claim 7 wherein contextualized search results include ranking data to allow subsequent integrated ranking by a client system of the contextualized search results associated with the application among search results from a local search context to provide integrated search results of different search contexts. 13. The one or more tangible computer-readable storage media of claim 7 wherein the at least a portion of the search query is received from a client system by a search service. 14. A system comprising:
a search service that searches at least one index associated with content accessible through an application based on at least one portion of the search query to provide one or more contextualized search results associated with the content of the application; and a search results interface communicatively coupled to the search service returns the one or more contextual search results resulting from the search, each contextual search result including a reference to content associated with the search result and an application identifier identifying the application. 15. The system of claim 14 wherein the application identifier identifies the application to be launched by a client system for operation on the content, the at least a portion of the search query being received by the search service from the client system. 16. The system of claim 14 wherein the search service further ranks the contextualized search results associated with the application with other search results from at least one other search of other content based on the search query, prior to returning the one or more contextual search results. 17. The system of claim 14 wherein at least one of the one or more contextualized search results further includes an action identifier designating an action to be performed by the application on the content referenced by the search result. 18. The system of claim 14 wherein the search service searches for application content, and the search service further searches at least one index associated with Web content and ranks the contextualized search results associated with the application among the one or more search results referencing the searched Web content to provide integrated search results of different search contexts, the integrated search results being returned by the search results interface. 19. The system of claim 14 wherein contextualized search results include ranking data to allow subsequent integrated ranking by a client system of the contextualized search results associated with the application among search results from a local search context to provide integrated search results of different search contexts. 20. The system of claim 14 wherein the at least a portion of the search query is received from a client system by the search service. | A search service executes on one or more computing systems and searches at least one index associated with content accessible through an application based on the at least one portion of the search query to provide search results associated with the application. A search results interface returns one or more search results from the search. At least one of the search results is associated with an application identifier identifying the application. The search service ranks the search results associated with the application with other search results from at least one other search of other content based on the search query.1. A method comprising:
receiving at least a portion of a search query by a search service; searching by the search service at least one index associated with content accessible through an application based on the at least one portion of the search query to provide one or more contextualized search results associated with the content of the application; and returning from the search service the one or more contextual search results responsive to the searching operation, each contextual search result including a reference to content associated with the search result and an application identifier identifying the application. 2. The method of claim 1 wherein the application identifier identifies the application to be launched by a client system for operation on the content, the at least a portion of the search query being received by the search service from the client system. 3. The method of claim 1 further comprising:
ranking the contextualized search results associated with the application with other search results from at least one other search of other content based on the search query, prior to the returning operation. 4. The method of claim 1 wherein at least one of the one or more contextualized search results further includes an action identifier designating an action to be performed by the application on the content referenced by the search result. 5. The method of claim 1 wherein the searching operation searches for application content, and further comprising:
searching by the search service at least one index associated with Web content; and
ranking the contextualized search results associated with the application among the one or more search results referencing the searched Web content to provide integrated search results of different search contexts, the integrated search results being returned by the search service in the returning operation. 6. The method of claim 1 wherein contextualized search results include ranking data to allow subsequently integrated ranking by a client system of the contextualized search results associated with the application among search results from a local search context to provide integrated search results of different search contexts. 7. 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:
searching by a search service at least one index associated with content accessible through an application based on at least one portion of the search query to provide one or more contextualized search results associated with the content of the application; and returning from the search service the one or more contextual search results responsive to the searching operation, each contextual search result including a reference to content associated with the search result and an application identifier identifying the application. 8. The one or more tangible computer-readable storage media of claim 7 wherein the application identifier identifies the application to be launched by a client system for operation on the content, the at least a portion of the search query being received by the search service from the client system. 9. The one or more tangible computer-readable storage media of claim 7, wherein the computer process further comprises:
ranking the contextualized search results associated with the application with other search results from at least one other search of other content based on the search query, prior to the returning operation. 10. The one or more tangible computer-readable storage media of claim 7 wherein at least one of the one or more contextualized search results further includes an action identifier designating an action to be performed by the application on the content referenced by the search result. 11. The one or more tangible computer-readable storage media of claim 7 wherein the searching operation searches for application content, and the computer process further comprises:
searching by the search service at least one index associated with Web content; and
ranking the contextualized search results associated with the application among the one or more search results referencing the searched Web content to provide integrated search results of different search contexts, the integrated search results being returned by the search service in the returning operation. 12. The one or more tangible computer-readable storage media of claim 7 wherein contextualized search results include ranking data to allow subsequent integrated ranking by a client system of the contextualized search results associated with the application among search results from a local search context to provide integrated search results of different search contexts. 13. The one or more tangible computer-readable storage media of claim 7 wherein the at least a portion of the search query is received from a client system by a search service. 14. A system comprising:
a search service that searches at least one index associated with content accessible through an application based on at least one portion of the search query to provide one or more contextualized search results associated with the content of the application; and a search results interface communicatively coupled to the search service returns the one or more contextual search results resulting from the search, each contextual search result including a reference to content associated with the search result and an application identifier identifying the application. 15. The system of claim 14 wherein the application identifier identifies the application to be launched by a client system for operation on the content, the at least a portion of the search query being received by the search service from the client system. 16. The system of claim 14 wherein the search service further ranks the contextualized search results associated with the application with other search results from at least one other search of other content based on the search query, prior to returning the one or more contextual search results. 17. The system of claim 14 wherein at least one of the one or more contextualized search results further includes an action identifier designating an action to be performed by the application on the content referenced by the search result. 18. The system of claim 14 wherein the search service searches for application content, and the search service further searches at least one index associated with Web content and ranks the contextualized search results associated with the application among the one or more search results referencing the searched Web content to provide integrated search results of different search contexts, the integrated search results being returned by the search results interface. 19. The system of claim 14 wherein contextualized search results include ranking data to allow subsequent integrated ranking by a client system of the contextualized search results associated with the application among search results from a local search context to provide integrated search results of different search contexts. 20. The system of claim 14 wherein the at least a portion of the search query is received from a client system by the search service. | 2,100 |
4,954 | 15,079,268 | 2,158 | In a data storage system, a prior set S of prefix codes for pseudo-dynamic compression as well as data compressed utilizing prior set S are stored. While data compressed utilizing prior set S are stored in the data storage system, the number of prefix codes utilized by the data storage system for pseudo-dynamic compression are augmented. Augmenting the number of codes includes determining a new set S′ of prefix codes for pseudo-dynamic compression from a training data set selected from a workload of the data storage system and storing the new set S′ in the data storage system with the prior set S. | 1. A method for updating parameters for data compression, the method comprising:
storing, in a data storage system, a prior set S of prefix codes for pseudo-dynamic compression as well as data compressed utilizing prefix codes in the prior set S; while storing in the data storage system data compressed utilizing prefix codes in the prior set S, augmenting a number of prefix codes for pseudo-dynamic compression in the data storage system by:
determining a new set S′ of multiple prefix codes for pseudo-dynamic compression from a training data set selected from a workload of the data storage system, wherein the determining includes determining each of the multiple prefix codes in the new set S′ from a respective one of a plurality of clusters of data pages from the training data set;
storing the new set S′ in the data storage system with the prior set S; and
performing pseudo-dynamic compression on input data to be stored within the data storage system in a multi-step process including:
encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data;
encoding, by a prefix encoder, the encoded sequence of data utilizing prefix codes selected from the prefix codes stored in the data storage system to produce compressed data; and
storing the compressed data obtained from the prefix encoder in the data storage system. 2. The method of claim 1, and further comprising:
in response to determining the new set S′, phasing out prior set S by:
encoding the encoded sequence of data utilizing prefix codes in the new set S′ and not prefix codes in prior set S; and
while continuing to service data access requests, decompressing data stored in the data storage system that was compressed utilizing prefix codes in prior set S and recompressing the decompressed data utilizing prefix codes in new set S′. 3. The method of claim 2, and further comprising:
in response to the data storage system no longer storing data compressed utilizing prefix codes in prior set S, removing the prior set S from the data storage system. 4. The method of claim 2, and further comprising:
setting the new set S′ as prior set S; and repeating the augmenting and phasing out steps. 5. The method of claim 1, wherein the augmenting includes:
performing the augmenting based on at least one of a set including a time interval elapsing, a metric of data of the workload, and an imbalance in use of the prefix codes in prior set S. 6. The method of claim 1, wherein:
prior set S includes K prefix codes extracted from K clusters of data pages; new set S′ includes J prefix codes, each of J and K being an integer greater than 1; and determining the new set S′ of J prefix codes includes:
seeding each of J clusters with a respective one of J data pages selected from a training data set, wherein J is a positive integer greater than 1;
for each of the J randomly selected data pages of the workload, determining a prefix code for its cluster utilizing Huffman encoding;
assigning each remaining data page of the training data set to one of the K+J clusters whose prefix code yields the highest compression ratio; and
for each of the J clusters, updating the prefix code by performing Lempel-Ziv (LZ) encoding on all pages assigned to that cluster, forming a sequence from results of the LZ encoding, and extracting an updated prefix code for the cluster from the sequence utilizing Huffman encoding. 7. The method of claim 1, wherein the step of encoding, by a prefix encoder, the encoded sequence of data utilizing prefix codes selected from the prefix codes stored in the data storage system to produce compressed data includes:
following the augmenting, encoding, by the prefix encoder, the encoded sequence of data utilizing both the prior set S and new set S′. 8. A data processing system, comprising:
control circuitry configured to perform:
storing, in a data storage system, a prior set S of prefix codes for pseudo-dynamic compression as well as data compressed utilizing prefix codes in the prior set S;
while storing in the data storage system data compressed utilizing prefix codes in the prior set S, augmenting a number of prefix codes for pseudo-dynamic compression in the data storage system by:
determining a new set S′ of multiple prefix codes for pseudo-dynamic compression from a training data set selected from a workload of the data storage system, wherein the determining includes determining each of the multiple prefix codes in the new set S′ from a respective one of a plurality of clusters of data pages from the training data set;
storing the new set S′ in the data storage system with the prior set S; and
performing pseudo-dynamic compression on input data to be stored within the data storage system in a multi-step process including:
encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data;
encoding the encoded sequence of data utilizing prefix codes selected from the prefix codes stored in the data storage system to produce compressed data; and
storing the compressed data obtained from the prefix encoder in the data storage system. 9. The data processing system of claim 8, wherein the control circuitry is further configured to perform:
in response to determining the new set S′, phasing out prior set S by:
encoding the encoded sequence of data utilizing prefix codes in the new set S′ and not prefix codes in prior set S; and
while continuing to service data access requests, decompressing data stored in the data storage system that was compressed utilizing prefix codes in prior set S and recompressing the decompressed data utilizing prefix codes in new set S′. 10. The data processing system of claim 9, wherein the control circuitry is further configured to perform:
in response to the data storage system no longer storing data compressed utilizing prefix codes in prior set S, removing the prior set S from the data storage system. 11. The data processing system of claim 9, wherein the control circuitry is further configured to perform:
setting the new set S′ as prior set S; and repeating the augmenting and phasing out steps. 12. The data processing system of claim 8, wherein the augmenting includes:
performing the augmenting based on at least one of a set including a time interval elapsing, a metric of data of the workload, and an imbalance in use of the prefix codes in prior set S. 13. The data processing system of claim 8, wherein:
prior set S includes K prefix codes extracted from K clusters of data pages; new set S′ includes J prefix codes, each of J and K being an integer greater than 1; and determining the new set S′ of J prefix codes includes:
seeding each of J clusters with a respective one of J data pages selected from a training data set, wherein J is a positive integer greater than 1;
for each of the J randomly selected data pages of the workload, determining a prefix code for its cluster utilizing Huffman encoding;
assigning each remaining data page of the training data set to one of the K+J clusters whose prefix code yields the highest compression ratio; and
for each of the J clusters, updating the prefix code by performing Lempel-Ziv (LZ) encoding on all pages assigned to that cluster, forming a sequence from results of the LZ encoding, and extracting an updated prefix code for the cluster from the sequence utilizing Huffman encoding. 14. The data processing system of claim 8, wherein encoding, by a prefix encoder, the encoded sequence of data utilizing prefix codes selected from the prefix codes stored in the data storage system to produce compressed data includes:
following the augmenting, encoding the encoded sequence of data utilizing both the prior set S and new set S′. 15. A computer program product, the computer program product comprising:
a computer readable storage device having program instructions embodied therewith, the program instructions executable by control logic to cause the control logic to perform:
storing, in a data storage system, a prior set S of prefix codes for pseudo-dynamic compression as well as data compressed utilizing prefix codes in the prior set S;
while storing in the data storage system data compressed utilizing prefix codes in the prior set S, augmenting a number of prefix codes for pseudo-dynamic compression in the data storage system by:
determining a new set S′ of multiple prefix codes for pseudo-dynamic compression from a training data set selected from a workload of the data storage system, wherein the determining includes determining each of the multiple prefix codes in the new set S′ from a respective one of a plurality of clusters of data pages from the training data set;
storing the new set S′ in the data storage system with the prior set S; and
performing pseudo-dynamic compression on input data to be stored within the data storage system in a multi-step process including:
encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data;
encoding the encoded sequence of data utilizing prefix codes selected from the prefix codes stored in the data storage system to produce compressed data; and
storing the compressed data obtained from the prefix encoder in the data storage system. 16. The computer program product of claim 15, wherein the program instructions further cause the control logic to perform:
in response to determining the new set S′, phasing out prior set S by:
encoding the encoded sequence of data utilizing prefix codes in the new set S′ and not prefix codes in prior set S; and
while continuing to service data access requests, decompressing data stored in the data storage system that was compressed utilizing prefix codes in prior set S and recompressing the decompressed data utilizing prefix codes in new set S′. 17. The computer program product of claim 16, wherein the control logic is further configured to perform:
in response to the data storage system no longer storing data compressed utilizing prefix codes in prior set S, removing the prior set S from the data storage system. 18. The computer program product of claim 16, wherein the program instructions further cause the control logic to perform:
setting the new set S′ as prior set S; and repeating the augmenting and phasing out steps. 19. The computer program product of claim 15, wherein the augmenting comprises:
performing the augmenting based on at least one of a set including a time interval elapsing, a metric of data of the workload, and an imbalance in use of the prefix codes in prior set S. 20. The computer program product of claim 15, wherein:
prior set S includes K prefix codes extracted from K clusters of data pages; new set S′ includes J prefix codes, each of J and K being an integer greater than 1; and determining the new set S′ of J prefix codes includes:
seeding each of J clusters with a respective one of J data pages selected from a training data set, wherein J is a positive integer greater than 1;
for each of the J randomly selected data pages of the workload, determining a prefix code for its cluster utilizing Huffman encoding;
assigning each remaining data page of the training data set to one of the K+J clusters whose prefix code yields the highest compression ratio; and
for each of the J clusters, updating the prefix code by performing Lempel-Ziv (LZ) encoding on all pages assigned to that cluster, forming a sequence from results of the LZ encoding, and extracting an updated prefix code for the cluster from the sequence utilizing Huffman encoding. 21. The method of claim 1, wherein encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data includes encoding the input data utilizing a Lempel-Ziv (LZ)-based encoder. 22. The data processing system of claim 8, wherein encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data includes encoding the input data utilizing a Lempel-Ziv (LZ)-based encoder. 23. The computer program product of claim 15, wherein encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data includes encoding the input data utilizing a Lempel-Ziv (LZ)-based encoder. | In a data storage system, a prior set S of prefix codes for pseudo-dynamic compression as well as data compressed utilizing prior set S are stored. While data compressed utilizing prior set S are stored in the data storage system, the number of prefix codes utilized by the data storage system for pseudo-dynamic compression are augmented. Augmenting the number of codes includes determining a new set S′ of prefix codes for pseudo-dynamic compression from a training data set selected from a workload of the data storage system and storing the new set S′ in the data storage system with the prior set S.1. A method for updating parameters for data compression, the method comprising:
storing, in a data storage system, a prior set S of prefix codes for pseudo-dynamic compression as well as data compressed utilizing prefix codes in the prior set S; while storing in the data storage system data compressed utilizing prefix codes in the prior set S, augmenting a number of prefix codes for pseudo-dynamic compression in the data storage system by:
determining a new set S′ of multiple prefix codes for pseudo-dynamic compression from a training data set selected from a workload of the data storage system, wherein the determining includes determining each of the multiple prefix codes in the new set S′ from a respective one of a plurality of clusters of data pages from the training data set;
storing the new set S′ in the data storage system with the prior set S; and
performing pseudo-dynamic compression on input data to be stored within the data storage system in a multi-step process including:
encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data;
encoding, by a prefix encoder, the encoded sequence of data utilizing prefix codes selected from the prefix codes stored in the data storage system to produce compressed data; and
storing the compressed data obtained from the prefix encoder in the data storage system. 2. The method of claim 1, and further comprising:
in response to determining the new set S′, phasing out prior set S by:
encoding the encoded sequence of data utilizing prefix codes in the new set S′ and not prefix codes in prior set S; and
while continuing to service data access requests, decompressing data stored in the data storage system that was compressed utilizing prefix codes in prior set S and recompressing the decompressed data utilizing prefix codes in new set S′. 3. The method of claim 2, and further comprising:
in response to the data storage system no longer storing data compressed utilizing prefix codes in prior set S, removing the prior set S from the data storage system. 4. The method of claim 2, and further comprising:
setting the new set S′ as prior set S; and repeating the augmenting and phasing out steps. 5. The method of claim 1, wherein the augmenting includes:
performing the augmenting based on at least one of a set including a time interval elapsing, a metric of data of the workload, and an imbalance in use of the prefix codes in prior set S. 6. The method of claim 1, wherein:
prior set S includes K prefix codes extracted from K clusters of data pages; new set S′ includes J prefix codes, each of J and K being an integer greater than 1; and determining the new set S′ of J prefix codes includes:
seeding each of J clusters with a respective one of J data pages selected from a training data set, wherein J is a positive integer greater than 1;
for each of the J randomly selected data pages of the workload, determining a prefix code for its cluster utilizing Huffman encoding;
assigning each remaining data page of the training data set to one of the K+J clusters whose prefix code yields the highest compression ratio; and
for each of the J clusters, updating the prefix code by performing Lempel-Ziv (LZ) encoding on all pages assigned to that cluster, forming a sequence from results of the LZ encoding, and extracting an updated prefix code for the cluster from the sequence utilizing Huffman encoding. 7. The method of claim 1, wherein the step of encoding, by a prefix encoder, the encoded sequence of data utilizing prefix codes selected from the prefix codes stored in the data storage system to produce compressed data includes:
following the augmenting, encoding, by the prefix encoder, the encoded sequence of data utilizing both the prior set S and new set S′. 8. A data processing system, comprising:
control circuitry configured to perform:
storing, in a data storage system, a prior set S of prefix codes for pseudo-dynamic compression as well as data compressed utilizing prefix codes in the prior set S;
while storing in the data storage system data compressed utilizing prefix codes in the prior set S, augmenting a number of prefix codes for pseudo-dynamic compression in the data storage system by:
determining a new set S′ of multiple prefix codes for pseudo-dynamic compression from a training data set selected from a workload of the data storage system, wherein the determining includes determining each of the multiple prefix codes in the new set S′ from a respective one of a plurality of clusters of data pages from the training data set;
storing the new set S′ in the data storage system with the prior set S; and
performing pseudo-dynamic compression on input data to be stored within the data storage system in a multi-step process including:
encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data;
encoding the encoded sequence of data utilizing prefix codes selected from the prefix codes stored in the data storage system to produce compressed data; and
storing the compressed data obtained from the prefix encoder in the data storage system. 9. The data processing system of claim 8, wherein the control circuitry is further configured to perform:
in response to determining the new set S′, phasing out prior set S by:
encoding the encoded sequence of data utilizing prefix codes in the new set S′ and not prefix codes in prior set S; and
while continuing to service data access requests, decompressing data stored in the data storage system that was compressed utilizing prefix codes in prior set S and recompressing the decompressed data utilizing prefix codes in new set S′. 10. The data processing system of claim 9, wherein the control circuitry is further configured to perform:
in response to the data storage system no longer storing data compressed utilizing prefix codes in prior set S, removing the prior set S from the data storage system. 11. The data processing system of claim 9, wherein the control circuitry is further configured to perform:
setting the new set S′ as prior set S; and repeating the augmenting and phasing out steps. 12. The data processing system of claim 8, wherein the augmenting includes:
performing the augmenting based on at least one of a set including a time interval elapsing, a metric of data of the workload, and an imbalance in use of the prefix codes in prior set S. 13. The data processing system of claim 8, wherein:
prior set S includes K prefix codes extracted from K clusters of data pages; new set S′ includes J prefix codes, each of J and K being an integer greater than 1; and determining the new set S′ of J prefix codes includes:
seeding each of J clusters with a respective one of J data pages selected from a training data set, wherein J is a positive integer greater than 1;
for each of the J randomly selected data pages of the workload, determining a prefix code for its cluster utilizing Huffman encoding;
assigning each remaining data page of the training data set to one of the K+J clusters whose prefix code yields the highest compression ratio; and
for each of the J clusters, updating the prefix code by performing Lempel-Ziv (LZ) encoding on all pages assigned to that cluster, forming a sequence from results of the LZ encoding, and extracting an updated prefix code for the cluster from the sequence utilizing Huffman encoding. 14. The data processing system of claim 8, wherein encoding, by a prefix encoder, the encoded sequence of data utilizing prefix codes selected from the prefix codes stored in the data storage system to produce compressed data includes:
following the augmenting, encoding the encoded sequence of data utilizing both the prior set S and new set S′. 15. A computer program product, the computer program product comprising:
a computer readable storage device having program instructions embodied therewith, the program instructions executable by control logic to cause the control logic to perform:
storing, in a data storage system, a prior set S of prefix codes for pseudo-dynamic compression as well as data compressed utilizing prefix codes in the prior set S;
while storing in the data storage system data compressed utilizing prefix codes in the prior set S, augmenting a number of prefix codes for pseudo-dynamic compression in the data storage system by:
determining a new set S′ of multiple prefix codes for pseudo-dynamic compression from a training data set selected from a workload of the data storage system, wherein the determining includes determining each of the multiple prefix codes in the new set S′ from a respective one of a plurality of clusters of data pages from the training data set;
storing the new set S′ in the data storage system with the prior set S; and
performing pseudo-dynamic compression on input data to be stored within the data storage system in a multi-step process including:
encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data;
encoding the encoded sequence of data utilizing prefix codes selected from the prefix codes stored in the data storage system to produce compressed data; and
storing the compressed data obtained from the prefix encoder in the data storage system. 16. The computer program product of claim 15, wherein the program instructions further cause the control logic to perform:
in response to determining the new set S′, phasing out prior set S by:
encoding the encoded sequence of data utilizing prefix codes in the new set S′ and not prefix codes in prior set S; and
while continuing to service data access requests, decompressing data stored in the data storage system that was compressed utilizing prefix codes in prior set S and recompressing the decompressed data utilizing prefix codes in new set S′. 17. The computer program product of claim 16, wherein the control logic is further configured to perform:
in response to the data storage system no longer storing data compressed utilizing prefix codes in prior set S, removing the prior set S from the data storage system. 18. The computer program product of claim 16, wherein the program instructions further cause the control logic to perform:
setting the new set S′ as prior set S; and repeating the augmenting and phasing out steps. 19. The computer program product of claim 15, wherein the augmenting comprises:
performing the augmenting based on at least one of a set including a time interval elapsing, a metric of data of the workload, and an imbalance in use of the prefix codes in prior set S. 20. The computer program product of claim 15, wherein:
prior set S includes K prefix codes extracted from K clusters of data pages; new set S′ includes J prefix codes, each of J and K being an integer greater than 1; and determining the new set S′ of J prefix codes includes:
seeding each of J clusters with a respective one of J data pages selected from a training data set, wherein J is a positive integer greater than 1;
for each of the J randomly selected data pages of the workload, determining a prefix code for its cluster utilizing Huffman encoding;
assigning each remaining data page of the training data set to one of the K+J clusters whose prefix code yields the highest compression ratio; and
for each of the J clusters, updating the prefix code by performing Lempel-Ziv (LZ) encoding on all pages assigned to that cluster, forming a sequence from results of the LZ encoding, and extracting an updated prefix code for the cluster from the sequence utilizing Huffman encoding. 21. The method of claim 1, wherein encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data includes encoding the input data utilizing a Lempel-Ziv (LZ)-based encoder. 22. The data processing system of claim 8, wherein encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data includes encoding the input data utilizing a Lempel-Ziv (LZ)-based encoder. 23. The computer program product of claim 15, wherein encoding the input data utilizing a lossless data compression encoder to produce an encoded sequence of data includes encoding the input data utilizing a Lempel-Ziv (LZ)-based encoder. | 2,100 |
4,955 | 14,564,062 | 2,145 | In a virtualized computer system, gray applications that are selected to be executed in a first virtual computing instance are executed and monitored in a second virtual computing instance that is a clone of the first virtual computing instance, and classified according to their monitored behavior. This process is conducted in real-time, in response to a notification that a gray application has been selected for execution in the first virtual computing instance. The execution of the gray application in the first virtual computing instance is delayed until the first virtual computing instance receives a notification from an application admission control manager that the gray application is safe to be executed in the first virtual computing instance. Although the execution of the gray application in the first virtual computing instance is delayed, all other processes running in the first virtual computing instance continue to their execution so that a user accessing the first virtual computing instance will not experience any downtime. | 1. A method of performing admission control of an application that has been selected for execution in a first virtual computing instance, comprising:
creating a second virtual computing instance that is a clone of the first virtual computing instance; executing the application in the second virtual computing instance; during execution of the application in the second virtual computing instance, monitoring execution behavior of the application; determining from the monitored execution behavior of the application whether or not the application is to be approved for execution in the first virtual computing instance; if the application is approved for execution in the first virtual computing instance, executing the application in the first virtual computing instance; and if the application is not approved for execution in the first virtual computing instance, transmitting an error message to the first virtual computing instance and not executing the application in the first virtual computing instance. 2. The method of claim 1, wherein the first and second virtual computing instances are each a virtual machine. 3. The method of claim 1, wherein the first and second virtual computing instances are each a container that does not include a guest operating system. 4. The method of claim 1, wherein the first virtual computing instance continues to run while the application is executed in the second virtual computing instance and the execution behavior of the application is monitored. 5. The method of claim 1, further comprising:
determining whether or not the application has previously been approved for execution in the first virtual computing instance, wherein the second virtual computing instance is created responsive to determining that the application has not previously been approved for execution in the first virtual computing instance. 6. The method of claim 1, wherein monitoring the execution behavior of the application includes intercepting file events that are generated during execution of the application in the second virtual computing instance, and the file events are examined for compliance with security policies. 7. The method of claim 6, wherein the application is not approved for execution in the first virtual computing instance if, during said monitoring of the execution behavior of the application, a change to a system registry file is detected or an opening of a port to an unknown location is detected. 8. The method of claim 1, further comprising:
after executing the application in the second virtual computing instance, performing a malware scan on the second virtual computing instance; and determining from results of the malware scan whether or not the application is to be approved for execution in the first virtual computing instance, wherein the application is not approved for execution in the first virtual computing instance if malware is discovered as a result of the malware scan. 9. A non-transitory computer-readable storage medium comprising instructions executable in a computer system to cause the computer system to carry out a method of performing admission control of an application that has been selected for execution in a first virtual computing instance, the method comprising the steps of:
creating a second virtual computing instance that is a clone of the first virtual computing instance; executing the application in the second virtual computing instance; during execution of the application in the second virtual computing instance, monitoring execution behavior of the application; determining from the monitored execution behavior of the application whether or not the application is to be approved for execution in the first virtual computing instance; if the application is approved for execution in the first virtual computing instance, executing the application in the first virtual computing instance; and if the application is not approved for execution in the first virtual computing instance, transmitting an error message to the first virtual computing instance and not executing the application in the first virtual computing instance. 10. The non-transitory computer-readable storage medium of claim 9, wherein the first and second virtual computing instances are each a virtual machine. 11. The non-transitory computer-readable storage medium of claim 9, wherein the first and second virtual computing instances are each a container that does not include a guest operating system. 12. The non-transitory computer-readable storage medium of claim 9, wherein the first virtual computing instance continues to run while the application is executed in the second virtual computing instance and the execution behavior of the application is monitored. 13. The non-transitory computer-readable storage medium of claim 9, wherein the method further comprises the step of:
determining whether or not the application has previously been approved for execution in the first virtual computing instance, wherein the second virtual computing instance is created responsive to determining that the application has not previously been approved for execution in the first virtual computing instance. 14. The non-transitory computer-readable storage medium of claim 9, wherein monitoring the execution behavior of the application includes intercepting file events that are generated during execution of the application in the second virtual computing instance, and the file events are examined for compliance with security policies. 15. The non-transitory computer-readable storage medium of claim 14, wherein the application is not approved for execution in the first virtual computing instance if, during said monitoring of the execution behavior of the application, a change to a system registry file is detected or an opening of a port to an unknown location is detected. 16. The non-transitory computer-readable storage medium of claim 9, wherein the method further comprises the steps of:
after executing the application in the second virtual computing instance, performing a malware scan on the second virtual computing instance; and determining from results of the malware scan whether or not the application is to be approved for execution in the first virtual computing instance, wherein the application is not approved for execution in the first virtual computing instance if malware is discovered as a result of the malware scan. 17. A computer system comprising hardware resources including at least one processor and system memory that are configured with virtualization software to support running of a first virtual computing instance and a security virtual computing instance that communicates with an application admission control manager,
wherein the virtualization software communicates a request to execute an unknown application in the first virtual computing instance to the security machine for permission to execute the unknown application in the first virtual computing instance, and creates a second virtual computing instance that is a clone of the first virtual computing instance to execute the application in the second virtual computing instance, and wherein the application admission control manager, during execution of the application in the second virtual computing instance, monitors execution behavior of the application and determines from the monitored execution behavior of the application whether or not the application is to be approved for execution in the first virtual computing instance. 18. The computer system of claim 17, wherein
if the application is approved for execution in the first virtual computing instance, the first virtual computing instance executes the application therein; and if the application is not approved for execution in the first virtual computing instance, the first virtual computing instance displays an error message and does not execute the application therein. 19. The computer system of claim 17, wherein the virtualization software includes an inter-process communication module by which events generated in the second virtual computing instance during execution of the application in the second virtual computing instance are transmitted to the security virtual computing instance. 20. The computer system of claim 19, wherein the events include file events and network events. 21. The computer system of claim 17, wherein the first and second virtual computing instances are each a virtual machine. 22. The computer system of claim 17, wherein the first and second virtual computing instances are each a container that does not include a guest operating system. | In a virtualized computer system, gray applications that are selected to be executed in a first virtual computing instance are executed and monitored in a second virtual computing instance that is a clone of the first virtual computing instance, and classified according to their monitored behavior. This process is conducted in real-time, in response to a notification that a gray application has been selected for execution in the first virtual computing instance. The execution of the gray application in the first virtual computing instance is delayed until the first virtual computing instance receives a notification from an application admission control manager that the gray application is safe to be executed in the first virtual computing instance. Although the execution of the gray application in the first virtual computing instance is delayed, all other processes running in the first virtual computing instance continue to their execution so that a user accessing the first virtual computing instance will not experience any downtime.1. A method of performing admission control of an application that has been selected for execution in a first virtual computing instance, comprising:
creating a second virtual computing instance that is a clone of the first virtual computing instance; executing the application in the second virtual computing instance; during execution of the application in the second virtual computing instance, monitoring execution behavior of the application; determining from the monitored execution behavior of the application whether or not the application is to be approved for execution in the first virtual computing instance; if the application is approved for execution in the first virtual computing instance, executing the application in the first virtual computing instance; and if the application is not approved for execution in the first virtual computing instance, transmitting an error message to the first virtual computing instance and not executing the application in the first virtual computing instance. 2. The method of claim 1, wherein the first and second virtual computing instances are each a virtual machine. 3. The method of claim 1, wherein the first and second virtual computing instances are each a container that does not include a guest operating system. 4. The method of claim 1, wherein the first virtual computing instance continues to run while the application is executed in the second virtual computing instance and the execution behavior of the application is monitored. 5. The method of claim 1, further comprising:
determining whether or not the application has previously been approved for execution in the first virtual computing instance, wherein the second virtual computing instance is created responsive to determining that the application has not previously been approved for execution in the first virtual computing instance. 6. The method of claim 1, wherein monitoring the execution behavior of the application includes intercepting file events that are generated during execution of the application in the second virtual computing instance, and the file events are examined for compliance with security policies. 7. The method of claim 6, wherein the application is not approved for execution in the first virtual computing instance if, during said monitoring of the execution behavior of the application, a change to a system registry file is detected or an opening of a port to an unknown location is detected. 8. The method of claim 1, further comprising:
after executing the application in the second virtual computing instance, performing a malware scan on the second virtual computing instance; and determining from results of the malware scan whether or not the application is to be approved for execution in the first virtual computing instance, wherein the application is not approved for execution in the first virtual computing instance if malware is discovered as a result of the malware scan. 9. A non-transitory computer-readable storage medium comprising instructions executable in a computer system to cause the computer system to carry out a method of performing admission control of an application that has been selected for execution in a first virtual computing instance, the method comprising the steps of:
creating a second virtual computing instance that is a clone of the first virtual computing instance; executing the application in the second virtual computing instance; during execution of the application in the second virtual computing instance, monitoring execution behavior of the application; determining from the monitored execution behavior of the application whether or not the application is to be approved for execution in the first virtual computing instance; if the application is approved for execution in the first virtual computing instance, executing the application in the first virtual computing instance; and if the application is not approved for execution in the first virtual computing instance, transmitting an error message to the first virtual computing instance and not executing the application in the first virtual computing instance. 10. The non-transitory computer-readable storage medium of claim 9, wherein the first and second virtual computing instances are each a virtual machine. 11. The non-transitory computer-readable storage medium of claim 9, wherein the first and second virtual computing instances are each a container that does not include a guest operating system. 12. The non-transitory computer-readable storage medium of claim 9, wherein the first virtual computing instance continues to run while the application is executed in the second virtual computing instance and the execution behavior of the application is monitored. 13. The non-transitory computer-readable storage medium of claim 9, wherein the method further comprises the step of:
determining whether or not the application has previously been approved for execution in the first virtual computing instance, wherein the second virtual computing instance is created responsive to determining that the application has not previously been approved for execution in the first virtual computing instance. 14. The non-transitory computer-readable storage medium of claim 9, wherein monitoring the execution behavior of the application includes intercepting file events that are generated during execution of the application in the second virtual computing instance, and the file events are examined for compliance with security policies. 15. The non-transitory computer-readable storage medium of claim 14, wherein the application is not approved for execution in the first virtual computing instance if, during said monitoring of the execution behavior of the application, a change to a system registry file is detected or an opening of a port to an unknown location is detected. 16. The non-transitory computer-readable storage medium of claim 9, wherein the method further comprises the steps of:
after executing the application in the second virtual computing instance, performing a malware scan on the second virtual computing instance; and determining from results of the malware scan whether or not the application is to be approved for execution in the first virtual computing instance, wherein the application is not approved for execution in the first virtual computing instance if malware is discovered as a result of the malware scan. 17. A computer system comprising hardware resources including at least one processor and system memory that are configured with virtualization software to support running of a first virtual computing instance and a security virtual computing instance that communicates with an application admission control manager,
wherein the virtualization software communicates a request to execute an unknown application in the first virtual computing instance to the security machine for permission to execute the unknown application in the first virtual computing instance, and creates a second virtual computing instance that is a clone of the first virtual computing instance to execute the application in the second virtual computing instance, and wherein the application admission control manager, during execution of the application in the second virtual computing instance, monitors execution behavior of the application and determines from the monitored execution behavior of the application whether or not the application is to be approved for execution in the first virtual computing instance. 18. The computer system of claim 17, wherein
if the application is approved for execution in the first virtual computing instance, the first virtual computing instance executes the application therein; and if the application is not approved for execution in the first virtual computing instance, the first virtual computing instance displays an error message and does not execute the application therein. 19. The computer system of claim 17, wherein the virtualization software includes an inter-process communication module by which events generated in the second virtual computing instance during execution of the application in the second virtual computing instance are transmitted to the security virtual computing instance. 20. The computer system of claim 19, wherein the events include file events and network events. 21. The computer system of claim 17, wherein the first and second virtual computing instances are each a virtual machine. 22. The computer system of claim 17, wherein the first and second virtual computing instances are each a container that does not include a guest operating system. | 2,100 |
4,956 | 13,077,670 | 2,174 | An electronic device with a display and a touch-sensitive surface displays a first authentication user interface on the display, the first authentication user interface including a text entry field for entering a text-based authentication code; detects a first input by a user on the touch-sensitive surface while displaying the first authentication user interface; in response to detecting the first input, displays a second authentication user interface on the display, distinct from the first authentication user interface, the second authentication user interface configured for entering a gesture-based authentication code; while displaying the second authentication user interface, detects one or more gestures by the user at locations on the touch-sensitive surface that correspond to locations on the second authentication user interface; and authenticates the user in accordance with a determination that the detected one or more gestures correspond to a gesture-based authentication code for the user. | 1. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
displaying a first user interface on the display, the first user interface including a graphical object at a first location on the display;
while displaying the first user interface, detecting a first gesture by a user on the touch-sensitive surface, the first gesture starting at a location on the touch-sensitive surface that corresponds to the first location of the graphical object on the display;
in response to detecting the first gesture:
moving the graphical object across the display to a second location on the display, distinct from the first location; and
displaying a second user interface on the display, distinct from the first user interface, the second user interface including the graphical object at the second location on the display;
while displaying the second user interface, detecting a second gesture by the user on the touch-sensitive surface, the second gesture starting at a location on the touch-sensitive surface that corresponds to the second location of the graphical object on the display; and,
in response to detecting the second gesture:
moving the graphical object across the display to the first location on the display; and
displaying the first user interface on the display. 2. The device of claim 1, wherein:
the first location is adjacent to a first side of the display, and the second location is adjacent to a second side of the display, opposite the first side of the display. 3. The device of claim 2, wherein:
the first side is a top of the display, and the second side is a bottom of the display. 4. The device of claim 2, wherein:
the first side is a left side of the display, and the second side is a right side of the display. 5. The device of claim 2, wherein:
the graphical object has a length; the first side of the display has a length; and the length of the graphical object equals the length of the first side of the display. 6. The device of claim 2, wherein:
the graphical object has an activation region with an activation region length; the first side of the display has a length; and the activation region length equals the length of the first side of the display. 7. The device of claim 1, wherein:
the first gesture moves in a first direction on the touch-sensitive surface, and the second gesture moves in a second direction on the touch-sensitive surface, opposite the first direction. 8. The device of claim 1, wherein:
the touch-sensitive surface is on the display; the first gesture moves in a first direction on the touch-sensitive surface away from a side of the display closest to the first location of the graphical object on the display; and the second gesture moves in a second direction on the touch-sensitive surface away from a side of the display closest to the second location of the graphical object on the display. 9. The device of claim 1, wherein:
displaying the second user interface in response to detecting the first gesture comprises replacing display of the first user interface with display of the second user interface; and displaying the first user interface in response to detecting the second gesture comprises replacing display of the second user interface with display of the first user interface. 10. The device of claim 1, wherein:
displaying the second user interface in response to detecting the first gesture comprises displaying an animation of the second user interface replacing the first user interface; and displaying the first user interface in response to detecting the second gesture comprises displaying an animation of the first user interface replacing the second user interface. 11. The device of claim 1, wherein the first gesture is a swipe gesture and the second gesture is a swipe gesture. 12. The device of claim 1, wherein the first gesture is a drag gesture and the second gesture is a drag gesture. 13. The device of claim 1, wherein the first gesture is a tap gesture and the second gesture is a tap gesture. 14. The device of claim 1, wherein the first user interface is in a first application and the second user interface is in the first application. 15. A method, comprising:
at an electronic device with a display and a touch-sensitive surface:
displaying a first user interface on the display, the first user interface including a graphical object at a first location on the display;
while displaying the first user interface, detecting a first gesture by a user on the touch-sensitive surface, the first gesture starting at a location on the touch-sensitive surface that corresponds to the first location of the graphical object on the display;
in response to detecting the first gesture:
moving the graphical object across the display to a second location on the display, distinct from the first location; and
displaying a second user interface on the display, distinct from the first user interface, the second user interface including the graphical object at the second location on the display;
while displaying the second user interface, detecting a second gesture by the user on the touch-sensitive surface, the second gesture starting at a location on the touch-sensitive surface that corresponds to the second location of the graphical object on the display; and,
in response to detecting the second gesture:
moving the graphical object across the display to the first location on the display; and
displaying the first user interface on the display. 16. A graphical user interface on an electronic device with a display, a touch-sensitive surface, a memory, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising:
a first user interface on the display, the first user interface including a graphical object at a first location on the display; wherein: while displaying the first user interface, a first gesture by a user is detected on the touch-sensitive surface, the first gesture starting at a location on the touch-sensitive surface that corresponds to the first location of the graphical object on the display; in response to detecting the first gesture:
the graphical object is moved across the display to a second location on the display, distinct from the first location; and
a second user interface is displayed on the display, distinct from the first user interface, the second user interface including the graphical object at the second location on the display;
while displaying the second user interface, a second gesture by the user is detected on the touch-sensitive surface, the second gesture starting at a location on the touch-sensitive surface that corresponds to the second location of the graphical object on the display; and, in response to detecting the second gesture:
the graphical object is moved across the display to the first location on the display; and
the first user interface is displayed on the display. 17. 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 and a touch-sensitive surface, cause the device to:
display a first user interface on the display, the first user interface including a graphical object at a first location on the display; while displaying the first user interface, detect a first gesture by a user on the touch-sensitive surface, the first gesture starting at a location on the touch-sensitive surface that corresponds to the first location of the graphical object on the display; in response to detecting the first gesture:
move the graphical object across the display to a second location on the display, distinct from the first location; and
display a second user interface on the display, distinct from the first user interface, the second user interface including the graphical object at the second location on the display;
while displaying the second user interface, detect a second gesture by the user on the touch-sensitive surface, the second gesture starting at a location on the touch-sensitive surface that corresponds to the second location of the graphical object on the display; and, in response to detecting the second gesture:
move the graphical object across the display to the first location on the display; and
display the first user interface on the display. | An electronic device with a display and a touch-sensitive surface displays a first authentication user interface on the display, the first authentication user interface including a text entry field for entering a text-based authentication code; detects a first input by a user on the touch-sensitive surface while displaying the first authentication user interface; in response to detecting the first input, displays a second authentication user interface on the display, distinct from the first authentication user interface, the second authentication user interface configured for entering a gesture-based authentication code; while displaying the second authentication user interface, detects one or more gestures by the user at locations on the touch-sensitive surface that correspond to locations on the second authentication user interface; and authenticates the user in accordance with a determination that the detected one or more gestures correspond to a gesture-based authentication code for the user.1. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
displaying a first user interface on the display, the first user interface including a graphical object at a first location on the display;
while displaying the first user interface, detecting a first gesture by a user on the touch-sensitive surface, the first gesture starting at a location on the touch-sensitive surface that corresponds to the first location of the graphical object on the display;
in response to detecting the first gesture:
moving the graphical object across the display to a second location on the display, distinct from the first location; and
displaying a second user interface on the display, distinct from the first user interface, the second user interface including the graphical object at the second location on the display;
while displaying the second user interface, detecting a second gesture by the user on the touch-sensitive surface, the second gesture starting at a location on the touch-sensitive surface that corresponds to the second location of the graphical object on the display; and,
in response to detecting the second gesture:
moving the graphical object across the display to the first location on the display; and
displaying the first user interface on the display. 2. The device of claim 1, wherein:
the first location is adjacent to a first side of the display, and the second location is adjacent to a second side of the display, opposite the first side of the display. 3. The device of claim 2, wherein:
the first side is a top of the display, and the second side is a bottom of the display. 4. The device of claim 2, wherein:
the first side is a left side of the display, and the second side is a right side of the display. 5. The device of claim 2, wherein:
the graphical object has a length; the first side of the display has a length; and the length of the graphical object equals the length of the first side of the display. 6. The device of claim 2, wherein:
the graphical object has an activation region with an activation region length; the first side of the display has a length; and the activation region length equals the length of the first side of the display. 7. The device of claim 1, wherein:
the first gesture moves in a first direction on the touch-sensitive surface, and the second gesture moves in a second direction on the touch-sensitive surface, opposite the first direction. 8. The device of claim 1, wherein:
the touch-sensitive surface is on the display; the first gesture moves in a first direction on the touch-sensitive surface away from a side of the display closest to the first location of the graphical object on the display; and the second gesture moves in a second direction on the touch-sensitive surface away from a side of the display closest to the second location of the graphical object on the display. 9. The device of claim 1, wherein:
displaying the second user interface in response to detecting the first gesture comprises replacing display of the first user interface with display of the second user interface; and displaying the first user interface in response to detecting the second gesture comprises replacing display of the second user interface with display of the first user interface. 10. The device of claim 1, wherein:
displaying the second user interface in response to detecting the first gesture comprises displaying an animation of the second user interface replacing the first user interface; and displaying the first user interface in response to detecting the second gesture comprises displaying an animation of the first user interface replacing the second user interface. 11. The device of claim 1, wherein the first gesture is a swipe gesture and the second gesture is a swipe gesture. 12. The device of claim 1, wherein the first gesture is a drag gesture and the second gesture is a drag gesture. 13. The device of claim 1, wherein the first gesture is a tap gesture and the second gesture is a tap gesture. 14. The device of claim 1, wherein the first user interface is in a first application and the second user interface is in the first application. 15. A method, comprising:
at an electronic device with a display and a touch-sensitive surface:
displaying a first user interface on the display, the first user interface including a graphical object at a first location on the display;
while displaying the first user interface, detecting a first gesture by a user on the touch-sensitive surface, the first gesture starting at a location on the touch-sensitive surface that corresponds to the first location of the graphical object on the display;
in response to detecting the first gesture:
moving the graphical object across the display to a second location on the display, distinct from the first location; and
displaying a second user interface on the display, distinct from the first user interface, the second user interface including the graphical object at the second location on the display;
while displaying the second user interface, detecting a second gesture by the user on the touch-sensitive surface, the second gesture starting at a location on the touch-sensitive surface that corresponds to the second location of the graphical object on the display; and,
in response to detecting the second gesture:
moving the graphical object across the display to the first location on the display; and
displaying the first user interface on the display. 16. A graphical user interface on an electronic device with a display, a touch-sensitive surface, a memory, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising:
a first user interface on the display, the first user interface including a graphical object at a first location on the display; wherein: while displaying the first user interface, a first gesture by a user is detected on the touch-sensitive surface, the first gesture starting at a location on the touch-sensitive surface that corresponds to the first location of the graphical object on the display; in response to detecting the first gesture:
the graphical object is moved across the display to a second location on the display, distinct from the first location; and
a second user interface is displayed on the display, distinct from the first user interface, the second user interface including the graphical object at the second location on the display;
while displaying the second user interface, a second gesture by the user is detected on the touch-sensitive surface, the second gesture starting at a location on the touch-sensitive surface that corresponds to the second location of the graphical object on the display; and, in response to detecting the second gesture:
the graphical object is moved across the display to the first location on the display; and
the first user interface is displayed on the display. 17. 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 and a touch-sensitive surface, cause the device to:
display a first user interface on the display, the first user interface including a graphical object at a first location on the display; while displaying the first user interface, detect a first gesture by a user on the touch-sensitive surface, the first gesture starting at a location on the touch-sensitive surface that corresponds to the first location of the graphical object on the display; in response to detecting the first gesture:
move the graphical object across the display to a second location on the display, distinct from the first location; and
display a second user interface on the display, distinct from the first user interface, the second user interface including the graphical object at the second location on the display;
while displaying the second user interface, detect a second gesture by the user on the touch-sensitive surface, the second gesture starting at a location on the touch-sensitive surface that corresponds to the second location of the graphical object on the display; and, in response to detecting the second gesture:
move the graphical object across the display to the first location on the display; and
display the first user interface on the display. | 2,100 |
4,957 | 14,483,260 | 2,132 | Briefly, in accordance with one or more embodiments, a memory array comprises two or more volumes, the volumes comprising two or more dice, respectively. The volumes are connected in a daisy chain configuration such that an output of a first volume is coupled to an input of a next volume, and the dice are connected in a daisy chain configuration such that an output of a first die is coupled to an input of a next die within the volume. In such a configuration, a first die in a first volume is capable of being appointed as part of a second volume. | 1. A memory array comprising:
two or more volumes, the volumes comprising two or more dice, respectively; wherein the volumes are connected in a daisy chain configuration such that an output of a first volume is coupled to an input of a next volume; and wherein the dice are connected in a daisy chain configuration such that an output of a first die is coupled to an input of a next die within the volume. 2. A memory array as claimed in claim 1, wherein the volumes are disposed in a stacked configuration. 3. A memory device as claimed in claim 1, wherein the daisy chain configuration of the dice is part of the daisy chain configuration of the volumes such that an input of a volume is coupled to an input of a first die within the volume and an output of a last die of the volume is coupled to an output of the volume. 4. A memory array as claimed in claim 1, wherein a first die in a first volume is capable of being appointed as part of a second volume. 5. A memory array as claimed in claim 1, wherein the dice may be powered up in a staggered order a logical unit level. 6. A method to appoint dice within a memory array, comprising:
issuing a read status as a first command; configuring a volume with Feature 58h before a first FFh; configuring one or more logical units within the volume; and issuing the first FFh. 7. A method as claimed in claim 6, wherein the first FFh issued will accepted only from an appointed logical unit within the configured volume. 8. A method as claimed in claim 6, further comprising appointing a first die in another volume as part of the configured volume. 9. A method as claimed in claim 6, further comprising powering one or more dice in a staggered order in the volume or in another volume, or a combination thereof, at a logical unit level. 10. A method as claimed in claim 6, wherein one or more dice within the configured volume and one or more device within another volume may be initialized in any selected order. 11. A solid state drive (SSD), comprising:
a host interface to couple to a processor via the host interface; control logic coupled to the host interface; and a memory array coupled to the control logic, wherein the memory array comprises:
two or more volumes, the volumes comprising two or more dice, respectively;
wherein the volumes are connected in a daisy chain configuration such that an output of a first volume is coupled to an input of a next volume; and
wherein the dice are connected in a daisy chain configuration such that an output of a first die is coupled to an input of a next die within the volume. 12. A solid state drive as claimed in claim 11, wherein the volumes are disposed in a stacked configuration. 13. A solid state drive as claimed in claim 11, wherein the daisy chain configuration of the dice is part of the daisy chain configuration of the volumes such that an input of a volume is coupled to an input of a first die within the volume and an output of a last die of the volume is coupled to an output of the volume. 14. A solid state drive as claimed in claim 11, wherein a first die in a first volume is capable of being appointed as part of a second volume. 15. A solid state drive as claimed in claim 11, wherein the dice may be powered up in a staggered order a logical unit level. 16. An article of manufacture comprising a non-transitory machine-readable medium having instructions stored thereon to appoint dice within a memory array that, if executed, result in:
issuing a read status as a first command; configuring a volume with Feature 58h before a first FFh; configuring one or more logical units within the volume; and issuing the first FFh. 17. An article of manufacture as claimed in claim 6, wherein the first FFh issued will accepted only from an appointed logical unit within the configured volume. 18. An article of manufacture as claimed in claim 6, wherein the instructions, if executed, further result in appointing a first die in another volume as part of the configured volume. 19. An article of manufacture as claimed in claim 6, wherein the instructions, if executed, further result in powering one or more dice in a staggered order in the volume or in another volume, or a combination thereof, at a logical unit level. 20. An article of manufacture as claimed in claim 6, wherein one or more dice within the configured volume and one or more device within another volume may be initialized in any selected order | Briefly, in accordance with one or more embodiments, a memory array comprises two or more volumes, the volumes comprising two or more dice, respectively. The volumes are connected in a daisy chain configuration such that an output of a first volume is coupled to an input of a next volume, and the dice are connected in a daisy chain configuration such that an output of a first die is coupled to an input of a next die within the volume. In such a configuration, a first die in a first volume is capable of being appointed as part of a second volume.1. A memory array comprising:
two or more volumes, the volumes comprising two or more dice, respectively; wherein the volumes are connected in a daisy chain configuration such that an output of a first volume is coupled to an input of a next volume; and wherein the dice are connected in a daisy chain configuration such that an output of a first die is coupled to an input of a next die within the volume. 2. A memory array as claimed in claim 1, wherein the volumes are disposed in a stacked configuration. 3. A memory device as claimed in claim 1, wherein the daisy chain configuration of the dice is part of the daisy chain configuration of the volumes such that an input of a volume is coupled to an input of a first die within the volume and an output of a last die of the volume is coupled to an output of the volume. 4. A memory array as claimed in claim 1, wherein a first die in a first volume is capable of being appointed as part of a second volume. 5. A memory array as claimed in claim 1, wherein the dice may be powered up in a staggered order a logical unit level. 6. A method to appoint dice within a memory array, comprising:
issuing a read status as a first command; configuring a volume with Feature 58h before a first FFh; configuring one or more logical units within the volume; and issuing the first FFh. 7. A method as claimed in claim 6, wherein the first FFh issued will accepted only from an appointed logical unit within the configured volume. 8. A method as claimed in claim 6, further comprising appointing a first die in another volume as part of the configured volume. 9. A method as claimed in claim 6, further comprising powering one or more dice in a staggered order in the volume or in another volume, or a combination thereof, at a logical unit level. 10. A method as claimed in claim 6, wherein one or more dice within the configured volume and one or more device within another volume may be initialized in any selected order. 11. A solid state drive (SSD), comprising:
a host interface to couple to a processor via the host interface; control logic coupled to the host interface; and a memory array coupled to the control logic, wherein the memory array comprises:
two or more volumes, the volumes comprising two or more dice, respectively;
wherein the volumes are connected in a daisy chain configuration such that an output of a first volume is coupled to an input of a next volume; and
wherein the dice are connected in a daisy chain configuration such that an output of a first die is coupled to an input of a next die within the volume. 12. A solid state drive as claimed in claim 11, wherein the volumes are disposed in a stacked configuration. 13. A solid state drive as claimed in claim 11, wherein the daisy chain configuration of the dice is part of the daisy chain configuration of the volumes such that an input of a volume is coupled to an input of a first die within the volume and an output of a last die of the volume is coupled to an output of the volume. 14. A solid state drive as claimed in claim 11, wherein a first die in a first volume is capable of being appointed as part of a second volume. 15. A solid state drive as claimed in claim 11, wherein the dice may be powered up in a staggered order a logical unit level. 16. An article of manufacture comprising a non-transitory machine-readable medium having instructions stored thereon to appoint dice within a memory array that, if executed, result in:
issuing a read status as a first command; configuring a volume with Feature 58h before a first FFh; configuring one or more logical units within the volume; and issuing the first FFh. 17. An article of manufacture as claimed in claim 6, wherein the first FFh issued will accepted only from an appointed logical unit within the configured volume. 18. An article of manufacture as claimed in claim 6, wherein the instructions, if executed, further result in appointing a first die in another volume as part of the configured volume. 19. An article of manufacture as claimed in claim 6, wherein the instructions, if executed, further result in powering one or more dice in a staggered order in the volume or in another volume, or a combination thereof, at a logical unit level. 20. An article of manufacture as claimed in claim 6, wherein one or more dice within the configured volume and one or more device within another volume may be initialized in any selected order | 2,100 |
4,958 | 14,793,327 | 2,159 | A source system receives, from at least one of the user associated with an entity or the human operator associated with the source system, an indication to suppress all listings associated with the entity on one or more provider systems, wherein the indication comprises identification data of the entity and an indication that the identification data of the entity is no longer valid. The source system retrieves, from a database associated with the source system, a list of one or more provider systems associated with the source system and having at least one listing corresponding to the entity. For each provider system in the list of one or more provider systems: the source system searches the provider system for listings having identification data matching the identification data of the entity. The source system receives, from the provider system, one or more matching listings having identification data matching the identification data of the entity, wherein each listing of one or more matching listings has a corresponding provider-supplied external identifier assigned by the provider system. The source system transmits, to the provider system, a request to suppress the one or more matching listings, the request to suppress the one or more matching listings comprising a list of the one or more corresponding provider-supplied external identifiers. | 1. A method comprising:
receiving, by a processing device of a source system, a first indication to suppress one or more listings associated with an entity on one or more provider systems, wherein a second indication comprises first identification data of the entity and an indication that the identification data of the entity is no longer valid; retrieving, from a database associated with the processing device, a list of one or more provider systems associated with the processing device and having at least one listing corresponding to the entity; and for each provider system in the list of one or more provider systems:
searching the provider system, by the processing device, for listings having identification data matching the identification data of the entity;
receiving, by the processing device from the provider system, one or more matching listings having second identification data matching the first identification data of the entity, wherein each listing of one or more matching listings has a corresponding provider-supplied external identifier; and
transmitting, by the processing device to the provider system, a request to suppress the one or more matching listings, the request to suppress the one or more matching listings comprising a list of the one or more corresponding provider-supplied external identifiers to indicate the one or more matching listings to suppress. 2. The method of claim 1, wherein,
responsive to receiving an acknowledgement from the provider system that the provider system has accepted the request to suppress the one or more matching listings in view of the one or more corresponding provider-supplied external identifiers,
receiving, by the processing device from the provider system, a confirmation that the provider system has suppressed the one or more matching listings. 3. The method of claim 2,
wherein the request is transmitted to the provider system using an application programming interface; and wherein the acknowledgement and the confirmation are received by the processing device from the provider system using the application programming interface. 4. The method of claim 2,
wherein the request is transmitted to the provider system using a first feed; wherein the acknowledgement is received by the source system from the provider system using the first feed; and wherein the confirmation is received by the source system from the provider system using a second feed. 5. The method of claim 2, wherein,
responsive to receiving, by the processing device from the provider system, the confirmation that the provider system has suppressed the remaining one or more potential matching listings as one or more designated duplicate listings,
verifying, by the processing device on the provider system, that the one or more designated duplicate listings have been suppressed on the provider system. 6. The method of claim 5, wherein verifying that the one or more designated duplicate listings have been suppressed on the provider system comprises, after transmitting the request to suppress the one or more matching listings, transmitting to the provider system the list of the one or more corresponding provider-supplied external identifiers. 7. The method of claim 5, wherein said verifying comprises visiting, by the processing device on the provider system, one or more universal resource locators (URL) associated with the one or more matching listings. 8. The method of claim 5, wherein said verifying comprises employing, by the processing device, an application programming interface (API) to search the provider system for the one or more matching listings. 9. The method of claim 5, wherein said verifying comprises receiving an indication from the provider system that the one or more matching listings no longer exist on the provider system. 10. The method of claim 9, wherein the second indication is one or more listing not found responses. 11. The method of claim 9, wherein said verifying comprises:
receiving, by the processing device from the provider system, a search results page; and determining, by the processing device, that the search results page does not contain the one or more matching listings. 12. The method of claim 2, wherein receiving a confirmation that the provider system has suppressed the one or more matching listings comprises receiving a receipt file, the receipt file comprising one or more records corresponding to the one or more matching listings, each record of the one or more records comprising a provider-supplied external identifier associated a corresponding matching listing, a universal resource locator associated with the corresponding matching listing, and an indication that the corresponding matching listing is not in service on the provider system. 13. The method of claim 1, further comprising:
receiving, by the processing device, third identification data of a replacement entity for delivery of an enhanced listing to a plurality of provider systems; and for each provider system of the plurality of provider systems:
transmitting, from the processing device to the provider system, fourth identification data of the replacement entity and the enhanced listing to the provider system without a provider-supplied external identifier as an indication to the provider system to create a listing using the enhanced content. 14. A system comprising:
a memory; and a processing device of a source system, operatively coupled to the memory, to:
receive, a first indication to suppress one or more listings associated with an entity on one or more provider systems, wherein a second indication comprises first identification data of the entity and an indication that the identification data of the entity is no longer valid;
retrieve, from a database associated with the processing device, a list of one or more provider systems associated with the processing device and having at least one listing corresponding to the entity; and
for each provider system in the list of one or more provider systems:
search the provider system for listings having identification data matching the identification data of the entity;
receive, from the provider system, one or more matching listings having second identification data matching the first identification data of the entity, wherein each listing of one or more matching listings has a corresponding provider-supplied external identifier; and
transmit, to the provider system, a request to suppress the one or more matching listings, the request to suppress the one or more matching listings comprising a list of the one or more corresponding provider-supplied external identifiers to indicate the one or more matching listings to suppress. 15. The system of claim 14, wherein,
responsive to receiving an acknowledgement from the provider system that the provider system has accepted the request to suppress the one or more matching listings in view of the one or more corresponding provider-supplied external identifiers, the processing device is further to receive a confirmation that the provider system has suppressed the one or more matching listings. 16. The system of claim 15,
wherein the request is transmitted to the provider system using an application programming interface; and wherein the acknowledgement and the confirmation are received by the processing device from the provider system using the application programming interface. 17. The system of claim 15,
wherein the request is transmitted to the provider system using a first feed; wherein the acknowledgement is received by the processing device from the provider system using the first feed; and wherein the confirmation is received by the processing device from the provider system using a second feed. 18. The system of claim 14, wherein,
responsive to receiving, by the processing device from the provider system, the confirmation that the provider system has suppressed the remaining one or more potential matching listings as one or more designated duplicate listings, the processing device is further to verify, on the provider system, that the one or more designated duplicate listings have been suppressed on the provider system. 19. The system of claim 18, wherein verifying that the one or more designated duplicate listings have been suppressed on the provider system comprises, after transmitting the request to suppress the one or more matching listings, transmitting to the provider system the list of the one or more corresponding provider-supplied external identifiers. 20. A non-transitory computer readable storage medium including instructions that, when executed by a processing device of a source system, cause the processing device to:
receive, by the processing device, a first indication to suppress one or more listings associated with an entity on one or more provider systems, wherein a second indication comprises first identification data of the entity and an indication that the identification data of the entity is no longer valid; retrieve, from a database associated with the processing device, a list of one or more provider systems associated with the processing device and having at least one listing corresponding to the entity; and for each provider system in the list of one or more provider systems:
search the provider system, by the processing device, for listings having identification data matching the identification data of the entity;
receive, by the processing device from the provider system, one or more matching listings having second identification data matching the first identification data of the entity, wherein each listing of one or more matching listings has a corresponding provider-supplied external identifier; and
transmit, by the processing device to the provider system, a request to suppress the one or more matching listings, the request to suppress the one or more matching listings comprising a list of the one or more corresponding provider-supplied external identifiers to indicate the one or more matching listings to suppress. 21. The non-transitory computer readable storage medium of claim 19, wherein,
responsive to receiving an acknowledgement from the provider system that the provider system has accepted the request to suppress the one or more matching listings in view of the one or more corresponding provider-supplied external identifiers,
receive, by the processing device from the provider system, a confirmation that the provider system has suppressed the one or more matching listings. 22. The non-transitory computer readable storage medium of claim 21,
wherein the request is transmitted to the provider system using an application programming interface; and wherein the acknowledgement and the confirmation are received by the processing device from the provider system using the application programming interface. 23. The non-transitory computer readable storage medium of claim 21,
wherein the request is transmitted to the provider system using a first feed; wherein the acknowledgement is received by the source system from the provider system using the first feed; and wherein the confirmation is received by the processing device from the provider system using a second feed. 24. The non-transitory computer readable storage medium of claim 21, wherein,
responsive to receiving, by the processing device from the provider system, the confirmation that the provider system has suppressed the remaining one or more potential matching listings as one or more designated duplicate listings,
verify, by the processing device on the provider system, that the one or more designated duplicate listings have been suppressed on the provider system. 25. The non-transitory computer readable storage medium of claim 24, wherein verifying that the one or more designated duplicate listings have been suppressed on the provider system comprises, after transmitting the request to suppress the one or more matching listings, transmit to the provider system the list of the one or more corresponding provider-supplied external identifiers. | A source system receives, from at least one of the user associated with an entity or the human operator associated with the source system, an indication to suppress all listings associated with the entity on one or more provider systems, wherein the indication comprises identification data of the entity and an indication that the identification data of the entity is no longer valid. The source system retrieves, from a database associated with the source system, a list of one or more provider systems associated with the source system and having at least one listing corresponding to the entity. For each provider system in the list of one or more provider systems: the source system searches the provider system for listings having identification data matching the identification data of the entity. The source system receives, from the provider system, one or more matching listings having identification data matching the identification data of the entity, wherein each listing of one or more matching listings has a corresponding provider-supplied external identifier assigned by the provider system. The source system transmits, to the provider system, a request to suppress the one or more matching listings, the request to suppress the one or more matching listings comprising a list of the one or more corresponding provider-supplied external identifiers.1. A method comprising:
receiving, by a processing device of a source system, a first indication to suppress one or more listings associated with an entity on one or more provider systems, wherein a second indication comprises first identification data of the entity and an indication that the identification data of the entity is no longer valid; retrieving, from a database associated with the processing device, a list of one or more provider systems associated with the processing device and having at least one listing corresponding to the entity; and for each provider system in the list of one or more provider systems:
searching the provider system, by the processing device, for listings having identification data matching the identification data of the entity;
receiving, by the processing device from the provider system, one or more matching listings having second identification data matching the first identification data of the entity, wherein each listing of one or more matching listings has a corresponding provider-supplied external identifier; and
transmitting, by the processing device to the provider system, a request to suppress the one or more matching listings, the request to suppress the one or more matching listings comprising a list of the one or more corresponding provider-supplied external identifiers to indicate the one or more matching listings to suppress. 2. The method of claim 1, wherein,
responsive to receiving an acknowledgement from the provider system that the provider system has accepted the request to suppress the one or more matching listings in view of the one or more corresponding provider-supplied external identifiers,
receiving, by the processing device from the provider system, a confirmation that the provider system has suppressed the one or more matching listings. 3. The method of claim 2,
wherein the request is transmitted to the provider system using an application programming interface; and wherein the acknowledgement and the confirmation are received by the processing device from the provider system using the application programming interface. 4. The method of claim 2,
wherein the request is transmitted to the provider system using a first feed; wherein the acknowledgement is received by the source system from the provider system using the first feed; and wherein the confirmation is received by the source system from the provider system using a second feed. 5. The method of claim 2, wherein,
responsive to receiving, by the processing device from the provider system, the confirmation that the provider system has suppressed the remaining one or more potential matching listings as one or more designated duplicate listings,
verifying, by the processing device on the provider system, that the one or more designated duplicate listings have been suppressed on the provider system. 6. The method of claim 5, wherein verifying that the one or more designated duplicate listings have been suppressed on the provider system comprises, after transmitting the request to suppress the one or more matching listings, transmitting to the provider system the list of the one or more corresponding provider-supplied external identifiers. 7. The method of claim 5, wherein said verifying comprises visiting, by the processing device on the provider system, one or more universal resource locators (URL) associated with the one or more matching listings. 8. The method of claim 5, wherein said verifying comprises employing, by the processing device, an application programming interface (API) to search the provider system for the one or more matching listings. 9. The method of claim 5, wherein said verifying comprises receiving an indication from the provider system that the one or more matching listings no longer exist on the provider system. 10. The method of claim 9, wherein the second indication is one or more listing not found responses. 11. The method of claim 9, wherein said verifying comprises:
receiving, by the processing device from the provider system, a search results page; and determining, by the processing device, that the search results page does not contain the one or more matching listings. 12. The method of claim 2, wherein receiving a confirmation that the provider system has suppressed the one or more matching listings comprises receiving a receipt file, the receipt file comprising one or more records corresponding to the one or more matching listings, each record of the one or more records comprising a provider-supplied external identifier associated a corresponding matching listing, a universal resource locator associated with the corresponding matching listing, and an indication that the corresponding matching listing is not in service on the provider system. 13. The method of claim 1, further comprising:
receiving, by the processing device, third identification data of a replacement entity for delivery of an enhanced listing to a plurality of provider systems; and for each provider system of the plurality of provider systems:
transmitting, from the processing device to the provider system, fourth identification data of the replacement entity and the enhanced listing to the provider system without a provider-supplied external identifier as an indication to the provider system to create a listing using the enhanced content. 14. A system comprising:
a memory; and a processing device of a source system, operatively coupled to the memory, to:
receive, a first indication to suppress one or more listings associated with an entity on one or more provider systems, wherein a second indication comprises first identification data of the entity and an indication that the identification data of the entity is no longer valid;
retrieve, from a database associated with the processing device, a list of one or more provider systems associated with the processing device and having at least one listing corresponding to the entity; and
for each provider system in the list of one or more provider systems:
search the provider system for listings having identification data matching the identification data of the entity;
receive, from the provider system, one or more matching listings having second identification data matching the first identification data of the entity, wherein each listing of one or more matching listings has a corresponding provider-supplied external identifier; and
transmit, to the provider system, a request to suppress the one or more matching listings, the request to suppress the one or more matching listings comprising a list of the one or more corresponding provider-supplied external identifiers to indicate the one or more matching listings to suppress. 15. The system of claim 14, wherein,
responsive to receiving an acknowledgement from the provider system that the provider system has accepted the request to suppress the one or more matching listings in view of the one or more corresponding provider-supplied external identifiers, the processing device is further to receive a confirmation that the provider system has suppressed the one or more matching listings. 16. The system of claim 15,
wherein the request is transmitted to the provider system using an application programming interface; and wherein the acknowledgement and the confirmation are received by the processing device from the provider system using the application programming interface. 17. The system of claim 15,
wherein the request is transmitted to the provider system using a first feed; wherein the acknowledgement is received by the processing device from the provider system using the first feed; and wherein the confirmation is received by the processing device from the provider system using a second feed. 18. The system of claim 14, wherein,
responsive to receiving, by the processing device from the provider system, the confirmation that the provider system has suppressed the remaining one or more potential matching listings as one or more designated duplicate listings, the processing device is further to verify, on the provider system, that the one or more designated duplicate listings have been suppressed on the provider system. 19. The system of claim 18, wherein verifying that the one or more designated duplicate listings have been suppressed on the provider system comprises, after transmitting the request to suppress the one or more matching listings, transmitting to the provider system the list of the one or more corresponding provider-supplied external identifiers. 20. A non-transitory computer readable storage medium including instructions that, when executed by a processing device of a source system, cause the processing device to:
receive, by the processing device, a first indication to suppress one or more listings associated with an entity on one or more provider systems, wherein a second indication comprises first identification data of the entity and an indication that the identification data of the entity is no longer valid; retrieve, from a database associated with the processing device, a list of one or more provider systems associated with the processing device and having at least one listing corresponding to the entity; and for each provider system in the list of one or more provider systems:
search the provider system, by the processing device, for listings having identification data matching the identification data of the entity;
receive, by the processing device from the provider system, one or more matching listings having second identification data matching the first identification data of the entity, wherein each listing of one or more matching listings has a corresponding provider-supplied external identifier; and
transmit, by the processing device to the provider system, a request to suppress the one or more matching listings, the request to suppress the one or more matching listings comprising a list of the one or more corresponding provider-supplied external identifiers to indicate the one or more matching listings to suppress. 21. The non-transitory computer readable storage medium of claim 19, wherein,
responsive to receiving an acknowledgement from the provider system that the provider system has accepted the request to suppress the one or more matching listings in view of the one or more corresponding provider-supplied external identifiers,
receive, by the processing device from the provider system, a confirmation that the provider system has suppressed the one or more matching listings. 22. The non-transitory computer readable storage medium of claim 21,
wherein the request is transmitted to the provider system using an application programming interface; and wherein the acknowledgement and the confirmation are received by the processing device from the provider system using the application programming interface. 23. The non-transitory computer readable storage medium of claim 21,
wherein the request is transmitted to the provider system using a first feed; wherein the acknowledgement is received by the source system from the provider system using the first feed; and wherein the confirmation is received by the processing device from the provider system using a second feed. 24. The non-transitory computer readable storage medium of claim 21, wherein,
responsive to receiving, by the processing device from the provider system, the confirmation that the provider system has suppressed the remaining one or more potential matching listings as one or more designated duplicate listings,
verify, by the processing device on the provider system, that the one or more designated duplicate listings have been suppressed on the provider system. 25. The non-transitory computer readable storage medium of claim 24, wherein verifying that the one or more designated duplicate listings have been suppressed on the provider system comprises, after transmitting the request to suppress the one or more matching listings, transmit to the provider system the list of the one or more corresponding provider-supplied external identifiers. | 2,100 |
4,959 | 12,015,270 | 2,145 | Embodiments of the present invention address deficiencies of the art in respect to social bookmarking and provide a method, system and computer program product for automated surfacing of tagged content adjunct to a vertical application. In an embodiment of the invention, a method for automatically surfacing tagged content in a vertical application can be provided. The method can include receiving and parsing text from content in an end user application, comparing the parsed text to social bookmarks and associated metadata from a social bookmarking system and matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison, and directing a visual emphasis of the matched portions of the content in the end user application, whereby the end user application is unmodified to perform the receiving, comparing and directing steps. | 1. A method for automatically surfacing tagged content adjunct to a vertical application, the method comprising:
receiving and parsing text from content in an end user application; comparing the parsed text to social bookmarks and associated metadata from a social bookmarking system and matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison; and, directing a visual emphasis of the matched portions of the content in the end user application, whereby the end user application is unmodified to perform the receiving, comparing and directing steps. 2. The method of claim 1, wherein comparing the parsed text to social bookmarks and associated metadata from a social bookmarking system and matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison, further comprises restricting the parsed text to a limited vocabulary when comparing the parsed text to the social bookmarks and associated metadata. 3. The method of claim 1, further comprising directing the toggling of the visual emphasis of the matched portions of the content in the end user application. 4. The method of claim 1, further comprising directing an appendage of a source indicator for the visually emphasized matched portions of the content. 5. A social bookmarking data processing system comprising:
auto-surfacing logic coupled to but separate from an end user application executing in an end user computing device and a social bookmarking system executing in a host server and managing a plurality of social bookmarks, the logic comprising program code enabled to receive the content from the display, to parse the content into text, for comparing to the social bookmarks and associated metadata, and for matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison, and to direct the end user application to visually emphasize the matched portions of the content. 6. The system of claim 5, wherein the auto-surfacing logic subclasses a display event in the end user application. 7. The system of claim 5, wherein the auto-surfacing logic is a helper application coupled to the end user application. 8. The system of claim 5, wherein the auto-surfacing logic resides in the host server and has a hook into the end user application. 9. The system of claim 5, wherein the auto-surfacing logic resides in the end user computing device. 10. A computer program product comprising a computer usable medium embodying computer usable program code for automatically surfacing tagged content adjunct to a vertical application, the computer program product comprising:
computer usable program code for receiving and parsing text from content in an end user application; computer usable program code for comparing the parsed text to social bookmarks and associated metadata from a social bookmarking system and matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison; and, computer usable program code for directing a visual emphasis of the matched portions of the content in the end user application, whereby the end user application is unmodified to perform the receiving, comparing and directing steps. 11. The computer program product of claim 10, wherein the computer usable program code for comparing the parsed text to social bookmarks and associated metadata from a social bookmarking system and matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison, further comprises computer usable program code for restricting the parsed text to a limited vocabulary when comparing the parsed text to the social bookmarks and associated metadata. 12. The computer program product of claim 10, further comprising computer usable program code for directing the toggling of the visual emphasis of the matched portions of the content in the end user application. 13. The computer program product of claim 10, further comprising computer usable program code for directing an appendage of a source indicator for the visually emphasized matched portions of the content. | Embodiments of the present invention address deficiencies of the art in respect to social bookmarking and provide a method, system and computer program product for automated surfacing of tagged content adjunct to a vertical application. In an embodiment of the invention, a method for automatically surfacing tagged content in a vertical application can be provided. The method can include receiving and parsing text from content in an end user application, comparing the parsed text to social bookmarks and associated metadata from a social bookmarking system and matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison, and directing a visual emphasis of the matched portions of the content in the end user application, whereby the end user application is unmodified to perform the receiving, comparing and directing steps.1. A method for automatically surfacing tagged content adjunct to a vertical application, the method comprising:
receiving and parsing text from content in an end user application; comparing the parsed text to social bookmarks and associated metadata from a social bookmarking system and matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison; and, directing a visual emphasis of the matched portions of the content in the end user application, whereby the end user application is unmodified to perform the receiving, comparing and directing steps. 2. The method of claim 1, wherein comparing the parsed text to social bookmarks and associated metadata from a social bookmarking system and matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison, further comprises restricting the parsed text to a limited vocabulary when comparing the parsed text to the social bookmarks and associated metadata. 3. The method of claim 1, further comprising directing the toggling of the visual emphasis of the matched portions of the content in the end user application. 4. The method of claim 1, further comprising directing an appendage of a source indicator for the visually emphasized matched portions of the content. 5. A social bookmarking data processing system comprising:
auto-surfacing logic coupled to but separate from an end user application executing in an end user computing device and a social bookmarking system executing in a host server and managing a plurality of social bookmarks, the logic comprising program code enabled to receive the content from the display, to parse the content into text, for comparing to the social bookmarks and associated metadata, and for matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison, and to direct the end user application to visually emphasize the matched portions of the content. 6. The system of claim 5, wherein the auto-surfacing logic subclasses a display event in the end user application. 7. The system of claim 5, wherein the auto-surfacing logic is a helper application coupled to the end user application. 8. The system of claim 5, wherein the auto-surfacing logic resides in the host server and has a hook into the end user application. 9. The system of claim 5, wherein the auto-surfacing logic resides in the end user computing device. 10. A computer program product comprising a computer usable medium embodying computer usable program code for automatically surfacing tagged content adjunct to a vertical application, the computer program product comprising:
computer usable program code for receiving and parsing text from content in an end user application; computer usable program code for comparing the parsed text to social bookmarks and associated metadata from a social bookmarking system and matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison; and, computer usable program code for directing a visual emphasis of the matched portions of the content in the end user application, whereby the end user application is unmodified to perform the receiving, comparing and directing steps. 11. The computer program product of claim 10, wherein the computer usable program code for comparing the parsed text to social bookmarks and associated metadata from a social bookmarking system and matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison, further comprises computer usable program code for restricting the parsed text to a limited vocabulary when comparing the parsed text to the social bookmarks and associated metadata. 12. The computer program product of claim 10, further comprising computer usable program code for directing the toggling of the visual emphasis of the matched portions of the content in the end user application. 13. The computer program product of claim 10, further comprising computer usable program code for directing an appendage of a source indicator for the visually emphasized matched portions of the content. | 2,100 |
4,960 | 14,061,627 | 2,121 | A perspective selection may be used to identify one or more algorithms that may be of interest to an end user and that are associated with the selected perspective. The perspective selection may be used to determine an algorithm for the predicted data of interest and to determine the relevant data for the determined algorithm to generate the predicted data. The relevant data may be retrieved from a backend system and used with the determined algorithm to generate the predicted data. The predicted data may be output to a client device to display a visualization of the predicted data for easy consumption by an end user. | 1. A method for generating predicted data based on a perspective selection, the method comprising:
receiving, at a processing module, a perspective selection from a client device; determining, using a processing module, one or more algorithms to generate predictive data based, at least in part, on the perspective selection; determining, using a processing module, relevant data based, at least in part, on the determined one or more algorithms; retrieving, using a processing module, the relevant data from a backend system; and generating, using a processing module, predicted data using the one or more algorithms and the retrieved relevant data. 2. The method of claim 1 further comprising:
storing, in a predictive analysis data store, the generated predicted data; and
outputting the generated predicted data to the client device. 3. The method of claim 2, wherein the retrieving of the relevant data from the backend system includes identifying a view of a virtual data model module associated with the relevant data. 4. The method of claim 2 further comprising:
outputting one or more options to the client device based on the determined one or more algorithms;
receiving an option selection from the client device; and
determining, using a processing module, an algorithm of the one or more algorithms to generate predictive data based on the perspective selection and the option selection;
wherein the determining of the relevant data is based on the determined algorithm of the one or more algorithms. 5. The method of claim 1, wherein the perspective selection corresponds to a role in a business. 6. The method of claim 1 further comprising:
receiving, at a processing module, a second perspective selection from the client device;
determining, using a processing module, a second algorithm to generate second predictive data based, at least in part, on the second perspective selection; and
generating, using a processing module, the second predicted data using the second algorithm. 7. The method of claim 6, wherein generating the second predicted data using the second algorithm is based, at least in part, on the generated predicted data that used the one or more algorithms and the retrieved relevant data. 8. A system comprising:
a processing module; and a non-transitory computer-readable storage device storing instructions that, when executed by the processing module, cause the processing module to perform operations comprising:
receiving a first perspective selection from a client device, wherein the perspective selection corresponds to a role in a business;
determining a first algorithm to generate first predictive data based, at least in part, on the first perspective selection;
determining relevant data based, at least in part, on the determined first algorithm;
retrieving the relevant data from a backend system;
generating first predicted data using the determined first algorithm and the retrieved relevant data; and
storing the generated first predicted data in a predictive analysis data store. 9. The system of claim 8, wherein the instructions cause the processing module to perform operations further comprising:
outputting the generated first predicted data to the client device to be displayed as part of a first visualization. 10. The system of claim 8, wherein the retrieving of the relevant data from the backend system includes identifying a view of a virtual data model module associated with the relevant data. 11. The system of claim 8, wherein the instructions cause the processing module to perform operations further comprising:
outputting one or more options to the client device based on the determined first algorithm; and receiving an option selection from the client device; wherein the determining of the relevant data is based on the option selection and the determined first algorithm. 12. The system of claim 8, wherein the instructions cause the processing module to perform operations further comprising:
receiving a second perspective selection from the client device; determining a second algorithm to generate second predictive data based, at least in part, on the second perspective selection; and generating the second predicted data using the second algorithm and the first predicted data. 13. The system of claim 12, wherein generating the second predicted data using the second algorithm is based, at least in part, on the generated predicted data that used the one or more algorithms and the retrieved relevant data. 14. The system of claim 13, wherein the instructions cause the processing module to perform operations further comprising:
outputting the generated second predicted data to the client device to be displayed as part of a second visualization. 15. A non-transitory computer-readable storage device storing instructions that, when executed by a processing module, cause the processing module to perform operations comprising:
receiving a perspective selection from a client device; determining an algorithm to generate predictive data based, at least in part, on the perspective selection; determining relevant data based, at least in part, on the determined algorithm; retrieving the relevant data from a backend system, wherein the retrieving of relevant data from the backend system includes identifying a view of a virtual data model module associated with the relevant data; and generating predicted data using the determined algorithm e retrieved relevant data. 16. The non-transitory computer-readable storage device of claim 15, wherein the perspective selection corresponds to a role in a business. 17. The non-transitory computer-readable storage device of claim 15, wherein the perspective selection is associated with a first set of algorithms, wherein each algorithm of the first set of algorithms is associated with relevant data for the each algorithm, the non-transitory computer-readable storage device storing instructions that cause the processing module to perform operations further comprising:
outputting a set of options to the client device based on the first set of algorithms; and receiving an option selection from the client device based on the set of options outputted; wherein the determining of the algorithm to generate predictive data is further based on the option selection, and wherein the determining of the relevant data is based on the option selection and the determined algorithm. 18. The non-transitory computer-readable storage device of claim 15, wherein the retrieving of the relevant data from the backend system includes identifying a view of a virtual data model module associated with the relevant data. 19. The non-transitory computer-readable storage device of claim 18 storing instructions that cause the processing module to perform operations further comprising:
receiving a second perspective selection from the client device;
determining a second algorithm to generate second predictive data based, at least in part, on the second perspective selection; and
generating the second predicted data using the second algorithm and the predicted data generated using the determined algorithm and the retrieved relevant data. 20. The non-transitory computer-readable storage device of claim 15 storing instructions that cause the processing module to perform operations further comprising:
outputting the generated predicted data to the client device to be displayed as part of a visualization. | A perspective selection may be used to identify one or more algorithms that may be of interest to an end user and that are associated with the selected perspective. The perspective selection may be used to determine an algorithm for the predicted data of interest and to determine the relevant data for the determined algorithm to generate the predicted data. The relevant data may be retrieved from a backend system and used with the determined algorithm to generate the predicted data. The predicted data may be output to a client device to display a visualization of the predicted data for easy consumption by an end user.1. A method for generating predicted data based on a perspective selection, the method comprising:
receiving, at a processing module, a perspective selection from a client device; determining, using a processing module, one or more algorithms to generate predictive data based, at least in part, on the perspective selection; determining, using a processing module, relevant data based, at least in part, on the determined one or more algorithms; retrieving, using a processing module, the relevant data from a backend system; and generating, using a processing module, predicted data using the one or more algorithms and the retrieved relevant data. 2. The method of claim 1 further comprising:
storing, in a predictive analysis data store, the generated predicted data; and
outputting the generated predicted data to the client device. 3. The method of claim 2, wherein the retrieving of the relevant data from the backend system includes identifying a view of a virtual data model module associated with the relevant data. 4. The method of claim 2 further comprising:
outputting one or more options to the client device based on the determined one or more algorithms;
receiving an option selection from the client device; and
determining, using a processing module, an algorithm of the one or more algorithms to generate predictive data based on the perspective selection and the option selection;
wherein the determining of the relevant data is based on the determined algorithm of the one or more algorithms. 5. The method of claim 1, wherein the perspective selection corresponds to a role in a business. 6. The method of claim 1 further comprising:
receiving, at a processing module, a second perspective selection from the client device;
determining, using a processing module, a second algorithm to generate second predictive data based, at least in part, on the second perspective selection; and
generating, using a processing module, the second predicted data using the second algorithm. 7. The method of claim 6, wherein generating the second predicted data using the second algorithm is based, at least in part, on the generated predicted data that used the one or more algorithms and the retrieved relevant data. 8. A system comprising:
a processing module; and a non-transitory computer-readable storage device storing instructions that, when executed by the processing module, cause the processing module to perform operations comprising:
receiving a first perspective selection from a client device, wherein the perspective selection corresponds to a role in a business;
determining a first algorithm to generate first predictive data based, at least in part, on the first perspective selection;
determining relevant data based, at least in part, on the determined first algorithm;
retrieving the relevant data from a backend system;
generating first predicted data using the determined first algorithm and the retrieved relevant data; and
storing the generated first predicted data in a predictive analysis data store. 9. The system of claim 8, wherein the instructions cause the processing module to perform operations further comprising:
outputting the generated first predicted data to the client device to be displayed as part of a first visualization. 10. The system of claim 8, wherein the retrieving of the relevant data from the backend system includes identifying a view of a virtual data model module associated with the relevant data. 11. The system of claim 8, wherein the instructions cause the processing module to perform operations further comprising:
outputting one or more options to the client device based on the determined first algorithm; and receiving an option selection from the client device; wherein the determining of the relevant data is based on the option selection and the determined first algorithm. 12. The system of claim 8, wherein the instructions cause the processing module to perform operations further comprising:
receiving a second perspective selection from the client device; determining a second algorithm to generate second predictive data based, at least in part, on the second perspective selection; and generating the second predicted data using the second algorithm and the first predicted data. 13. The system of claim 12, wherein generating the second predicted data using the second algorithm is based, at least in part, on the generated predicted data that used the one or more algorithms and the retrieved relevant data. 14. The system of claim 13, wherein the instructions cause the processing module to perform operations further comprising:
outputting the generated second predicted data to the client device to be displayed as part of a second visualization. 15. A non-transitory computer-readable storage device storing instructions that, when executed by a processing module, cause the processing module to perform operations comprising:
receiving a perspective selection from a client device; determining an algorithm to generate predictive data based, at least in part, on the perspective selection; determining relevant data based, at least in part, on the determined algorithm; retrieving the relevant data from a backend system, wherein the retrieving of relevant data from the backend system includes identifying a view of a virtual data model module associated with the relevant data; and generating predicted data using the determined algorithm e retrieved relevant data. 16. The non-transitory computer-readable storage device of claim 15, wherein the perspective selection corresponds to a role in a business. 17. The non-transitory computer-readable storage device of claim 15, wherein the perspective selection is associated with a first set of algorithms, wherein each algorithm of the first set of algorithms is associated with relevant data for the each algorithm, the non-transitory computer-readable storage device storing instructions that cause the processing module to perform operations further comprising:
outputting a set of options to the client device based on the first set of algorithms; and receiving an option selection from the client device based on the set of options outputted; wherein the determining of the algorithm to generate predictive data is further based on the option selection, and wherein the determining of the relevant data is based on the option selection and the determined algorithm. 18. The non-transitory computer-readable storage device of claim 15, wherein the retrieving of the relevant data from the backend system includes identifying a view of a virtual data model module associated with the relevant data. 19. The non-transitory computer-readable storage device of claim 18 storing instructions that cause the processing module to perform operations further comprising:
receiving a second perspective selection from the client device;
determining a second algorithm to generate second predictive data based, at least in part, on the second perspective selection; and
generating the second predicted data using the second algorithm and the predicted data generated using the determined algorithm and the retrieved relevant data. 20. The non-transitory computer-readable storage device of claim 15 storing instructions that cause the processing module to perform operations further comprising:
outputting the generated predicted data to the client device to be displayed as part of a visualization. | 2,100 |
4,961 | 14,252,661 | 2,167 | Relational graphs may be used to extract information. Similarities between the relational graphs and the items they represent may be determined. For example, when applied to video searching, relational graphs may be obtained from searching videos to extract objects, events and/or relations therebetween. Each relational graph may comprise a plurality of nodes and edges, wherein at least some of the detected objects and events are represented by each node, and wherein each edge and represents a relationship between two nodes. Subgraphs may be extracted from each relational graph and dimension reduction may be performed on the subgraphs to obtain a reduced variable set which may then be used to perform searches, such as similarity analyses of videos. | 1. A method of performing video searching, comprising:
maintaining a storage of a plurality of grouped events in the form of a plurality of corresponding relational graphs, each relational graph having a total possible number of subgraphs; for at least a first grouped event having a corresponding first relational graph, indexing a first set of subgraphs including a plurality of subgraphs, the first set of subgraphs including at least one subgraph having at least 1 nodes; performing dimension reduction for the first grouped event to form a plurality of subgraph groupings, each subgraph grouping including one or more subgraphs of the first set of subgraphs; receiving a search request for a video search, the search request for a portion of a video that includes at least a second grouped event; and based on the plurality of subgraph groupings, determining that the second grouped event matches the first grouped event. 2. The method of claim 1, wherein the first set of subgraphs include all subgraphs of the first relational graph having an order of 1 and all subgraphs of the first relational graph having an order of 2. 3. The method of claim 1, further comprising:
performing the dimension reduction by selecting a predetermined number of topics, wherein each subgraph grouping is associated with a respective topic. 4. The method of claim 3, wherein:
the predetermined number of topics is less than the total possible number of subgraphs of the first relational graph. 5. The method of claim 4, wherein:
the predetermined number of topics is at least two orders of magnitude smaller than the total possible number of subgraphs of the first relational graph. 6. The method of claim 5, wherein a particular subgraph is associated with a plurality of different topics and is weighted differently in at least one of the topics compared to the others. 7. The method of claim 1, wherein the second grouped event has corresponding second relational graph, and further comprising:
for the second grouped event, indexing a second set of subgraphs including a plurality of subgraphs, the second set of subgraphs including at least one subgraph having an order of 2; and performing dimension reduction for the second grouped event to form a plurality of subgraph groupings, each subgraph grouping including one or more subgraphs of the second set of subgraphs, wherein determining that the second grouped event matches the first grouped event further includes:
comparing the plurality of subgraph groupings of the second grouped event to the plurality of subgraph groupings of the first grouped event. 8. The method of claim 1, wherein each subgraph of the first set of indexed subgraphs is associated with a weighting factor. 9. The method of claim 8, wherein the weighting factor for a particular subgraph of the first set of indexed subgraphs is learned based on a frequency of occurrence of the particular subgraph from a large set of training data. 10. The method of claim 1, further comprising:
based on the plurality of subgraph groupings, determining that the second grouped event matches a third grouped event different from the first grouped event; and ranking the first grouped event as a search result having a higher rank than the third grouped event. 11. The method of claim 1, further comprising:
forming the first relational graph by performing semantic video analysis of a video clip. 12. A method of retrieving a video clip, comprising:
receiving a video search query for a portion of video that includes a first grouped event, the first grouped event corresponding to a first relational graph; indexing a first set of subgraphs for the first grouped event based on the first relational graph, the first set of subgraphs including at least one subgraph having an order of 2; performing dimension reduction for the first grouped event to form a plurality of first subgraph groupings, each first subgraph grouping including one or more subgraphs of the first set of subgraphs; comparing the plurality of first subgraph groupings to a plurality of stored subgraph groupings that correspond to stored grouped events; based on the comparison, determining that the first grouped event matches a stored subgraph grouping of the plurality of stored subgraph groupings; and retrieving a video clip corresponding to the stored subgraph grouping in response to the determining. 13. The method of claim 12, wherein the each first subgraph grouping corresponds to a topic related to the video and the stored subgraph grouping corresponds to a topic related to the video clip. 14. The method of claim 12, wherein the retrieved video clip is ranked among a plurality of retrieved video clips based on the comparison. 15. A method of performing video searching, comprising:
maintaining a storage of a plurality of relational graphs including at least a first relational graph, the first relational graph corresponding to a first event in a video and having a total possible number of subgraphs of M; for at least a first event having a corresponding first relational graph, indexing a first set of subgraphs including a plurality of subgraphs, the first set of subgraphs including at least one subgraph having an order of 2; forming a plurality of N subgraph groupings, each subgraph grouping including one or more subgraphs of the first set of subgraphs, wherein N is less than M; receiving a search request for a video search, the search request for a portion of a video that includes at least a second event; and based on the plurality of subgraph groupings, determining that the second event matches the first grouped event. 16. The method of claim 15, wherein N is at least two orders of magnitude smaller than M. 17. A method of performing searching, comprising:
maintaining a storage of a plurality of relational graphs, each relational graph representing a set of related information and having a total possible number of subgraphs; for at least a first relational graph corresponding to a first set of related information, indexing a first set of subgraphs including a plurality of subgraphs, the first set of subgraphs including p subgraphs and at least one subgraph having an order of 2; performing dimension reduction for the first relational graph to form k variables derived from the p subgraphs, k being an integer less than p; receiving a search request, the search request for a second set of related information; and based on the k variables, determining that the second set of related information matches the first set of related information. 18. The method of claim 17, wherein:
the k variables comprise k subgraph groupings, each subgraph grouping including a group of subgraphs from the p subgraphs; each set of related information is a grouped event that is part of a video; and receiving the search request includes receiving a video clip search request. 19. The method of claim 18, wherein the second grouped event has corresponding second relational graph, and further comprising:
for the second grouped event, indexing a second set of subgraphs including a plurality of subgraphs, the second set of subgraphs including at least one subgraph having an order of 2; and performing dimension reduction for the second grouped event to form a plurality of subgraph groupings, each subgraph grouping including one or more subgraphs of the second set of subgraphs, wherein determining that the second grouped event matches the first grouped event further includes: comparing the plurality of subgraph groupings of the second grouped event to the k subgraph groupings of the first grouped event. 20. A method of analyzing video images, comprising:
analyzing plural videos to detect objects and events in each video; in response to the analyzing, creating a relational graph for each video to obtain a plurality of relational graphs, each relational graph comprising a plurality of nodes and edges, wherein at least some of the detected objects and events are represented by each node, and wherein each edge and represents a relationship between two nodes; obtaining p subgraphs from the plurality of relational graphs, where p is an integer greater than 1, the p subgraphs forming portions of the relational graphs, at least some of the p subgraphs comprising at least two nodes of the relational graphs and an edge therebetween; performing dimension reduction on the plurality of p subgraphs to obtain a vector of k elements for each of the videos, k being an integer less than p; and searching a first video using the vector. 21. The method of claim 20, wherein the dimension reduction comprises topic modeling and each of the k elements comprise a topic, each topic being identified using one or more of the p subgraphs. 22. The method of claim 21,
wherein the vector comprises k weights each associated with a topic identified by topic modeling, the method further comprising: searching the first video by performing a comparison using the weight values. 23. The method of claim 21, further comprising describing each topic with a vector of weights associated with one or more of the p subgraphs. 24. The method of claim 23, wherein topic modeling comprises determining topics by performing an analysis of subgraphs of all of the plurality of videos. 25. A non-transitory, tangible, computer readable storage medium comprising a program that when executed by a computer system performs the method of claim 1. 26. A computer system comprising:
the non-transitory, tangible, computer readable storage medium of claim 25; and a processor configured to execute the program stored in the non-transitory, tangible, computer readable storage medium. | Relational graphs may be used to extract information. Similarities between the relational graphs and the items they represent may be determined. For example, when applied to video searching, relational graphs may be obtained from searching videos to extract objects, events and/or relations therebetween. Each relational graph may comprise a plurality of nodes and edges, wherein at least some of the detected objects and events are represented by each node, and wherein each edge and represents a relationship between two nodes. Subgraphs may be extracted from each relational graph and dimension reduction may be performed on the subgraphs to obtain a reduced variable set which may then be used to perform searches, such as similarity analyses of videos.1. A method of performing video searching, comprising:
maintaining a storage of a plurality of grouped events in the form of a plurality of corresponding relational graphs, each relational graph having a total possible number of subgraphs; for at least a first grouped event having a corresponding first relational graph, indexing a first set of subgraphs including a plurality of subgraphs, the first set of subgraphs including at least one subgraph having at least 1 nodes; performing dimension reduction for the first grouped event to form a plurality of subgraph groupings, each subgraph grouping including one or more subgraphs of the first set of subgraphs; receiving a search request for a video search, the search request for a portion of a video that includes at least a second grouped event; and based on the plurality of subgraph groupings, determining that the second grouped event matches the first grouped event. 2. The method of claim 1, wherein the first set of subgraphs include all subgraphs of the first relational graph having an order of 1 and all subgraphs of the first relational graph having an order of 2. 3. The method of claim 1, further comprising:
performing the dimension reduction by selecting a predetermined number of topics, wherein each subgraph grouping is associated with a respective topic. 4. The method of claim 3, wherein:
the predetermined number of topics is less than the total possible number of subgraphs of the first relational graph. 5. The method of claim 4, wherein:
the predetermined number of topics is at least two orders of magnitude smaller than the total possible number of subgraphs of the first relational graph. 6. The method of claim 5, wherein a particular subgraph is associated with a plurality of different topics and is weighted differently in at least one of the topics compared to the others. 7. The method of claim 1, wherein the second grouped event has corresponding second relational graph, and further comprising:
for the second grouped event, indexing a second set of subgraphs including a plurality of subgraphs, the second set of subgraphs including at least one subgraph having an order of 2; and performing dimension reduction for the second grouped event to form a plurality of subgraph groupings, each subgraph grouping including one or more subgraphs of the second set of subgraphs, wherein determining that the second grouped event matches the first grouped event further includes:
comparing the plurality of subgraph groupings of the second grouped event to the plurality of subgraph groupings of the first grouped event. 8. The method of claim 1, wherein each subgraph of the first set of indexed subgraphs is associated with a weighting factor. 9. The method of claim 8, wherein the weighting factor for a particular subgraph of the first set of indexed subgraphs is learned based on a frequency of occurrence of the particular subgraph from a large set of training data. 10. The method of claim 1, further comprising:
based on the plurality of subgraph groupings, determining that the second grouped event matches a third grouped event different from the first grouped event; and ranking the first grouped event as a search result having a higher rank than the third grouped event. 11. The method of claim 1, further comprising:
forming the first relational graph by performing semantic video analysis of a video clip. 12. A method of retrieving a video clip, comprising:
receiving a video search query for a portion of video that includes a first grouped event, the first grouped event corresponding to a first relational graph; indexing a first set of subgraphs for the first grouped event based on the first relational graph, the first set of subgraphs including at least one subgraph having an order of 2; performing dimension reduction for the first grouped event to form a plurality of first subgraph groupings, each first subgraph grouping including one or more subgraphs of the first set of subgraphs; comparing the plurality of first subgraph groupings to a plurality of stored subgraph groupings that correspond to stored grouped events; based on the comparison, determining that the first grouped event matches a stored subgraph grouping of the plurality of stored subgraph groupings; and retrieving a video clip corresponding to the stored subgraph grouping in response to the determining. 13. The method of claim 12, wherein the each first subgraph grouping corresponds to a topic related to the video and the stored subgraph grouping corresponds to a topic related to the video clip. 14. The method of claim 12, wherein the retrieved video clip is ranked among a plurality of retrieved video clips based on the comparison. 15. A method of performing video searching, comprising:
maintaining a storage of a plurality of relational graphs including at least a first relational graph, the first relational graph corresponding to a first event in a video and having a total possible number of subgraphs of M; for at least a first event having a corresponding first relational graph, indexing a first set of subgraphs including a plurality of subgraphs, the first set of subgraphs including at least one subgraph having an order of 2; forming a plurality of N subgraph groupings, each subgraph grouping including one or more subgraphs of the first set of subgraphs, wherein N is less than M; receiving a search request for a video search, the search request for a portion of a video that includes at least a second event; and based on the plurality of subgraph groupings, determining that the second event matches the first grouped event. 16. The method of claim 15, wherein N is at least two orders of magnitude smaller than M. 17. A method of performing searching, comprising:
maintaining a storage of a plurality of relational graphs, each relational graph representing a set of related information and having a total possible number of subgraphs; for at least a first relational graph corresponding to a first set of related information, indexing a first set of subgraphs including a plurality of subgraphs, the first set of subgraphs including p subgraphs and at least one subgraph having an order of 2; performing dimension reduction for the first relational graph to form k variables derived from the p subgraphs, k being an integer less than p; receiving a search request, the search request for a second set of related information; and based on the k variables, determining that the second set of related information matches the first set of related information. 18. The method of claim 17, wherein:
the k variables comprise k subgraph groupings, each subgraph grouping including a group of subgraphs from the p subgraphs; each set of related information is a grouped event that is part of a video; and receiving the search request includes receiving a video clip search request. 19. The method of claim 18, wherein the second grouped event has corresponding second relational graph, and further comprising:
for the second grouped event, indexing a second set of subgraphs including a plurality of subgraphs, the second set of subgraphs including at least one subgraph having an order of 2; and performing dimension reduction for the second grouped event to form a plurality of subgraph groupings, each subgraph grouping including one or more subgraphs of the second set of subgraphs, wherein determining that the second grouped event matches the first grouped event further includes: comparing the plurality of subgraph groupings of the second grouped event to the k subgraph groupings of the first grouped event. 20. A method of analyzing video images, comprising:
analyzing plural videos to detect objects and events in each video; in response to the analyzing, creating a relational graph for each video to obtain a plurality of relational graphs, each relational graph comprising a plurality of nodes and edges, wherein at least some of the detected objects and events are represented by each node, and wherein each edge and represents a relationship between two nodes; obtaining p subgraphs from the plurality of relational graphs, where p is an integer greater than 1, the p subgraphs forming portions of the relational graphs, at least some of the p subgraphs comprising at least two nodes of the relational graphs and an edge therebetween; performing dimension reduction on the plurality of p subgraphs to obtain a vector of k elements for each of the videos, k being an integer less than p; and searching a first video using the vector. 21. The method of claim 20, wherein the dimension reduction comprises topic modeling and each of the k elements comprise a topic, each topic being identified using one or more of the p subgraphs. 22. The method of claim 21,
wherein the vector comprises k weights each associated with a topic identified by topic modeling, the method further comprising: searching the first video by performing a comparison using the weight values. 23. The method of claim 21, further comprising describing each topic with a vector of weights associated with one or more of the p subgraphs. 24. The method of claim 23, wherein topic modeling comprises determining topics by performing an analysis of subgraphs of all of the plurality of videos. 25. A non-transitory, tangible, computer readable storage medium comprising a program that when executed by a computer system performs the method of claim 1. 26. A computer system comprising:
the non-transitory, tangible, computer readable storage medium of claim 25; and a processor configured to execute the program stored in the non-transitory, tangible, computer readable storage medium. | 2,100 |
4,962 | 12,409,561 | 2,157 | One embodiment is a method that receives a description of services desired by a service requestor and then crawls web sites to extract information on services offered by service providers. The extracted information is used to transform the description of services desired by the service requestor into an improved description of services. | 1) A method, comprising:
receiving a description of services desired by a service requester; crawling web sites to extract information on services offered by service providers; and using the extracted information to transform the description of services desired by the service requestor into an improved description of services. 2) The method of claim 1 further comprising, providing the description of services to a search engine that discovers the web sites. 3) The method of claim 1 further comprising:
extracting keywords from the description of services; providing the extracted keywords to a search engine that discovers web sites that provide services described by the keywords. 4) The method of claim 1 further comprising, presenting the service requester with differences between the description of services and the extracted information on services offered by the service providers. 5) The method of claim 1 further comprising:
determining terms common at a majority of the web sites, the terms being used to describe the services offered by the service providers; using the terms to generate the improved description of services; using the improved description of services to produce an ordered list of service providers that best meet requirements of the service requestor. 6) A computer, comprising:
a processor that analyzes information on services offered at web sites of different web service providers, discovers commonalities among the services offered by the different web service providers, and outputs results of the commonalities to a service requestor requesting the services. 7) The computer of claim 6, wherein the output includes a list of terms used by a majority of the different web service providers at the web sites to identify information that the service providers need to enable the service requester to generate an improved description of desired services. 8) The computer of claim 6, wherein the output includes questions used on forms by a majority of the different web service providers at the web sites. 9) The computer of claim 6, wherein the output includes a comparison of a search request for services desired by the service requestor and the services offered at the web sites by the different web service providers. 10) The computer of claim 6, wherein the processor uses the commonalities to enhance a textual description of services desired by the service requestor. 11) A tangible computer readable storage medium having instructions for causing a computer to execute a method, comprising:
providing a description of services by a service requestor to a search engine that discovers web sites of services providers; crawling the web sites to extract information on services offered by the service providers; analyzing the extracted information to discover similarities of the services offered by the service providers; and providing an analysis of the similarities to the service requestor to transform and enhance the description of services. 12) The tangible computer readable storage medium of claim 11 further comprising, presenting the service requestor with differences between the description of services and the extracted information on services offered by the service providers. 13) The tangible computer readable storage medium of claim 11 further comprising, refining, by the service requestor, the description of services to add options available from the service provider, the options not being known to the service requester before the service requestor provided the description of services to the search engine. 14) The tangible computer readable storage medium of claim 11, wherein the similarities include types of questions asked on forms at the web sites of the service providers and terminology used at the web sites to describe services being offered. 15) The tangible computer readable storage medium of claim 11 further comprising, processing the extracted information to remove unnecessary description that describes the services offered by the service providers at the web sites. | One embodiment is a method that receives a description of services desired by a service requestor and then crawls web sites to extract information on services offered by service providers. The extracted information is used to transform the description of services desired by the service requestor into an improved description of services.1) A method, comprising:
receiving a description of services desired by a service requester; crawling web sites to extract information on services offered by service providers; and using the extracted information to transform the description of services desired by the service requestor into an improved description of services. 2) The method of claim 1 further comprising, providing the description of services to a search engine that discovers the web sites. 3) The method of claim 1 further comprising:
extracting keywords from the description of services; providing the extracted keywords to a search engine that discovers web sites that provide services described by the keywords. 4) The method of claim 1 further comprising, presenting the service requester with differences between the description of services and the extracted information on services offered by the service providers. 5) The method of claim 1 further comprising:
determining terms common at a majority of the web sites, the terms being used to describe the services offered by the service providers; using the terms to generate the improved description of services; using the improved description of services to produce an ordered list of service providers that best meet requirements of the service requestor. 6) A computer, comprising:
a processor that analyzes information on services offered at web sites of different web service providers, discovers commonalities among the services offered by the different web service providers, and outputs results of the commonalities to a service requestor requesting the services. 7) The computer of claim 6, wherein the output includes a list of terms used by a majority of the different web service providers at the web sites to identify information that the service providers need to enable the service requester to generate an improved description of desired services. 8) The computer of claim 6, wherein the output includes questions used on forms by a majority of the different web service providers at the web sites. 9) The computer of claim 6, wherein the output includes a comparison of a search request for services desired by the service requestor and the services offered at the web sites by the different web service providers. 10) The computer of claim 6, wherein the processor uses the commonalities to enhance a textual description of services desired by the service requestor. 11) A tangible computer readable storage medium having instructions for causing a computer to execute a method, comprising:
providing a description of services by a service requestor to a search engine that discovers web sites of services providers; crawling the web sites to extract information on services offered by the service providers; analyzing the extracted information to discover similarities of the services offered by the service providers; and providing an analysis of the similarities to the service requestor to transform and enhance the description of services. 12) The tangible computer readable storage medium of claim 11 further comprising, presenting the service requestor with differences between the description of services and the extracted information on services offered by the service providers. 13) The tangible computer readable storage medium of claim 11 further comprising, refining, by the service requestor, the description of services to add options available from the service provider, the options not being known to the service requester before the service requestor provided the description of services to the search engine. 14) The tangible computer readable storage medium of claim 11, wherein the similarities include types of questions asked on forms at the web sites of the service providers and terminology used at the web sites to describe services being offered. 15) The tangible computer readable storage medium of claim 11 further comprising, processing the extracted information to remove unnecessary description that describes the services offered by the service providers at the web sites. | 2,100 |
4,963 | 14,459,234 | 2,139 | A method provides security in a computing system including a processor having a logical address space and external system memory having physical address space. The method comprises hiding memory access patterns, including dynamically remapping the logical address space to the physical address space in response to data accesses to the logical address space. | 1. A method of providing security in a computing system including a processor having a logical address space and external system memory having physical address space, the method comprising:
hiding memory access patterns including dynamically remapping the logical address space to the physical address space in response to data accesses to the logical address space. 2. The method of claim 1, wherein the external system memory holds current programs and data that are in use, and communicates with the processor over a data path that is accessible to an attacker. 3. The method of claim 1, wherein the remapping is performed at each and every data access to the logical address space. 4. The method of claim 1, wherein each remapping includes remapping a logical address from first a physical address to a second physical address; and wherein hiding the memory access patterns further includes storing data at the second physical address. 5. The method of claim 1, wherein for each read operation at a logical address, data is read from a first physical address in the external system memory, the logical address is remapped from the first physical address to a second physical address, and the data is moved from the first physical address to the second physical address, yet the logical address is unchanged. 6. The method of claim 1, wherein for each write operation to a logical address, the logical address is remapped from a first physical address to a second physical address, and data is stored at the second physical address, yet the logical address is unchanged. 7. The method of claim 6, wherein each write operation is preceded by a dummy read operation, in which data is read from the first physical address but is not acted upon. 8. The method of claim 1, wherein the physical address space is larger than the logical address space by at least one physical address, whereby at least one physical address is unmapped; wherein a first data structure contains entry values for those physical addresses mapped to logical addresses; wherein a second data structure contains an entry value for each unmapped physical address; and wherein an entry value indexed in the first data structure is replaced by an entry value selected from the second data structure. 9. The method of claim 8, wherein each replaced entry value is added to the second data structure. 10. The method of claim 8, wherein each entry value in the second data structure is selected randomly or pseudorandomly. 11. The method of claim 8, wherein each entry value is an offset from a corresponding beginning address of a protected window of the external system memory. 12. A computing system comprising:
a processor having logical address space; external system memory having physical address space; and a memory controller for hiding memory access patterns with respect to the external system memory, wherein hiding the memory access patterns includes dynamically remapping the logical address space to the physical address space in response to data accesses to the logical address space. 13. The computing system of claim 12, wherein the processor and the memory controller are on a die of a central processing unit. 14. The computing system of claim 12, wherein the computing system is a virtual machine having a hardware layer and virtual machine software that implement the memory controller. 15. The computing system of claim 12, wherein the computing system is a system-on-a-chip including a circuit that communicates with the external system memory; and wherein the circuit is configured to dynamically perform the memory address remapping. 16. The computing system of claim 15, wherein the circuit is a Secure Memory Transaction Unit. 17. The computing system of claim 12, wherein the memory controller is configured to perform the remapping at each and every data access to a logical address. 18. The computing system of claim 12, wherein the memory controller is configured to remap a logical address from first a physical address to a second physical address, and to store data at the second physical address. 19. The computing system of claim 12, wherein the physical address space is larger than the logical address space by at least one physical address, whereby at least one physical address is unmapped; wherein when a data access to a logical address is made, the logical address is already mapped to a first physical address via a first offset; and wherein the memory controller is configured to select a second offset to an unmapped second physical address, and replace the first offset with the second offset. 20. A memory controller for a computing system including external system memory, the memory controller comprising a dedicated processor configured to hide memory access patterns with respect to the external system memory, including remapping a logical address from a first physical address of the external system memory to a second physical address of the external system memory in response to a data access to the logical address space; and sending data to the external system memory for storage at the second physical address. | A method provides security in a computing system including a processor having a logical address space and external system memory having physical address space. The method comprises hiding memory access patterns, including dynamically remapping the logical address space to the physical address space in response to data accesses to the logical address space.1. A method of providing security in a computing system including a processor having a logical address space and external system memory having physical address space, the method comprising:
hiding memory access patterns including dynamically remapping the logical address space to the physical address space in response to data accesses to the logical address space. 2. The method of claim 1, wherein the external system memory holds current programs and data that are in use, and communicates with the processor over a data path that is accessible to an attacker. 3. The method of claim 1, wherein the remapping is performed at each and every data access to the logical address space. 4. The method of claim 1, wherein each remapping includes remapping a logical address from first a physical address to a second physical address; and wherein hiding the memory access patterns further includes storing data at the second physical address. 5. The method of claim 1, wherein for each read operation at a logical address, data is read from a first physical address in the external system memory, the logical address is remapped from the first physical address to a second physical address, and the data is moved from the first physical address to the second physical address, yet the logical address is unchanged. 6. The method of claim 1, wherein for each write operation to a logical address, the logical address is remapped from a first physical address to a second physical address, and data is stored at the second physical address, yet the logical address is unchanged. 7. The method of claim 6, wherein each write operation is preceded by a dummy read operation, in which data is read from the first physical address but is not acted upon. 8. The method of claim 1, wherein the physical address space is larger than the logical address space by at least one physical address, whereby at least one physical address is unmapped; wherein a first data structure contains entry values for those physical addresses mapped to logical addresses; wherein a second data structure contains an entry value for each unmapped physical address; and wherein an entry value indexed in the first data structure is replaced by an entry value selected from the second data structure. 9. The method of claim 8, wherein each replaced entry value is added to the second data structure. 10. The method of claim 8, wherein each entry value in the second data structure is selected randomly or pseudorandomly. 11. The method of claim 8, wherein each entry value is an offset from a corresponding beginning address of a protected window of the external system memory. 12. A computing system comprising:
a processor having logical address space; external system memory having physical address space; and a memory controller for hiding memory access patterns with respect to the external system memory, wherein hiding the memory access patterns includes dynamically remapping the logical address space to the physical address space in response to data accesses to the logical address space. 13. The computing system of claim 12, wherein the processor and the memory controller are on a die of a central processing unit. 14. The computing system of claim 12, wherein the computing system is a virtual machine having a hardware layer and virtual machine software that implement the memory controller. 15. The computing system of claim 12, wherein the computing system is a system-on-a-chip including a circuit that communicates with the external system memory; and wherein the circuit is configured to dynamically perform the memory address remapping. 16. The computing system of claim 15, wherein the circuit is a Secure Memory Transaction Unit. 17. The computing system of claim 12, wherein the memory controller is configured to perform the remapping at each and every data access to a logical address. 18. The computing system of claim 12, wherein the memory controller is configured to remap a logical address from first a physical address to a second physical address, and to store data at the second physical address. 19. The computing system of claim 12, wherein the physical address space is larger than the logical address space by at least one physical address, whereby at least one physical address is unmapped; wherein when a data access to a logical address is made, the logical address is already mapped to a first physical address via a first offset; and wherein the memory controller is configured to select a second offset to an unmapped second physical address, and replace the first offset with the second offset. 20. A memory controller for a computing system including external system memory, the memory controller comprising a dedicated processor configured to hide memory access patterns with respect to the external system memory, including remapping a logical address from a first physical address of the external system memory to a second physical address of the external system memory in response to a data access to the logical address space; and sending data to the external system memory for storage at the second physical address. | 2,100 |
4,964 | 14,618,303 | 2,175 | An application on a computing device includes a digital ink system that supports the input and output of digital ink in a markup language document. Digital ink refers to a digital representation of object (e.g., pen or finger) strokes on an input device that can be displayed on an output device. The markup language document can include, for example, an edit box in which the digital ink and optionally other data can be input. As the input object moves over the input device, data identifying the locations of the input object are captured and embedded in a markup language element of the document. The digital ink system also allows documents including digital ink to be displayed, the digital ink system displaying the digital ink along with any other data included in the document. | 1. A method comprising:
receiving, by an application, digital ink user input for a markup language document; generating a digital ink markup language element that includes data describing the digital ink user input; embedding the digital ink markup language element in the markup language document, the markup language document also including in one or more additional elements additional data describing additional content to be displayed when displaying the markup language document; and transmitting the markup language document with the digital ink markup language element to a storage device. 2. The method as recited in claim 1, further comprising:
accessing a service via a data network; and obtaining the markup language document from the service. 3. The method as recited in claim 1, further comprising:
receiving a user request to copy a portion of the markup language document, the portion including at least some of the digital ink; and providing, in response to the user request, at least a portion of the digital ink markup language element to a copy and paste system. 4. The method as recited in claim 1, further comprising:
receiving a user request to paste content into the markup language document, the content to be pasted including data describing additional digital ink; and embedding the additional digital ink in the markup language document. 5. The method as recited in claim 1, further comprising preserving, in the markup language document, the z-order of the digital ink and the additional content. 6. The method as recited in claim 1, the application displaying an edit box in which digital ink is to be input, the digital ink user input including both multiple locations within the edit box and multiple locations beyond the edit box, the method further comprising:
including, in the digital ink markup language element, data identifying both the multiple locations within the edit box and the multiple locations beyond the edit box; and displaying, as a digital ink stroke for the digital ink user input, only the multiple locations within the edit box. 7. The method as recited in claim 1, further comprising:
using a first one or more program threads to receive the digital ink user input and display a digital ink stroke for the digital ink user input; and using a second one or more program threads to display the additional content. 8. The method as recited in claim 1, further comprising:
receiving, after receiving the digital ink user input, a first user request to undo the digital ink user input; and removing, in response to the first user request, the digital ink markup language element from the markup language document. 9. The method as recited in claim 8, further comprising:
receiving, after receiving the first user request to undo the digital ink user input, a second request to redo the digital ink user input; and adding, in response to the second user request, the digital ink markup language element back into the markup language document. 10. The method as recited in claim 1, further comprising:
receiving, after receiving the digital ink user input, a user request to erase a portion of the digital ink; and deleting, from the digital ink markup language element, data identifying locations of the digital ink corresponding to the portion. 11. The method as recited in claim 1, further comprising:
receiving a user inputs specifying characteristics of the digital ink, the characteristics including one or more characteristics selected from the group including: shape, color, and width; and adding, in the digital ink markup language element, an additional element that identifies the user specified characteristics of the digital ink. 12. The method as recited in claim 1, further comprising:
recognizing one or more characters represented by the digital ink user input; and adding, in the digital ink markup language element, an additional element that identifies the recognized one or more characters, an identification of a user that provided the digital ink user input, and a timestamp of digital ink strokes of the digital ink user input. 13. A method comprising:
accessing a storage device to obtain a markup language document, the markup language document including a digital ink markup language element as well as one or more additional elements including additional data; extracting, from the digital ink markup language element, data describing digital ink of the markup language document; extracting, from the one or more additional elements, the additional data describing additional content of the markup language document; and displaying, as a visual representation of the markup language document, the digital ink as well as the additional content. 14. The method as recited in claim 13, the accessing the storage device comprising accessing the storage device via a data network. 15. A computing device comprising:
a processing system comprising one or more processors; one or more computer-readable storage media having stored thereon multiple instructions that, responsive to execution by the processing system, cause the processing system to perform acts comprising:
receiving, by an application of the computing device, a user input indicating digital ink for a first markup language document;
generating a digital ink markup language element that includes data describing the digital ink;
embedding the digital ink markup language element in the first markup language document, the markup language document also including in one or more additional elements additional data describing additional content to be displayed when displaying the first markup language document; and
transmitting the first markup language document with the digital ink markup language element to a storage device. 16. The computing device as recited in claim 15, the acts further comprising:
accessing a service via the Internet; and obtaining the markup language document from the service. 17. The computing device as recited in claim 15, the acts further comprising:
accessing the storage device to obtain a second markup language document, the second markup language document including a digital ink markup language element as well as one or more additional elements including additional data; extracting, from the second digital ink markup language element of the second markup language document, data describing digital ink of the second markup language document; extracting, from the one or more additional elements of the second markup language document, the additional data describing additional content of the second markup language document; and displaying, as a visual representation of the second markup language document, the digital ink of the second markup language document as well as the additional content of the second markup language document. 18. The computing device as recited in claim 15, the one or more processors executing the application as multiple threads, and the acts further comprising:
using a first one or more program threads of the multiple threads to receive the digital ink user input and display a digital ink stroke for the digital ink; and using a second one or more program threads of the multiple threads to embed the digital ink in the first markup language document. 19. The computing device as recited in claim 15, the acts further comprising:
receiving a user request to copy a portion of the first markup language document, the portion including at least some of the digital ink; and providing, in response to the user request, at least a portion of the digital ink markup language element to a copy and paste system. 20. The computing device as recited in claim 15, the acts further comprising:
receiving a user request to paste content into the first markup language document, the content to be pasted including data describing additional digital ink; and embedding the additional digital ink in the markup language document. | An application on a computing device includes a digital ink system that supports the input and output of digital ink in a markup language document. Digital ink refers to a digital representation of object (e.g., pen or finger) strokes on an input device that can be displayed on an output device. The markup language document can include, for example, an edit box in which the digital ink and optionally other data can be input. As the input object moves over the input device, data identifying the locations of the input object are captured and embedded in a markup language element of the document. The digital ink system also allows documents including digital ink to be displayed, the digital ink system displaying the digital ink along with any other data included in the document.1. A method comprising:
receiving, by an application, digital ink user input for a markup language document; generating a digital ink markup language element that includes data describing the digital ink user input; embedding the digital ink markup language element in the markup language document, the markup language document also including in one or more additional elements additional data describing additional content to be displayed when displaying the markup language document; and transmitting the markup language document with the digital ink markup language element to a storage device. 2. The method as recited in claim 1, further comprising:
accessing a service via a data network; and obtaining the markup language document from the service. 3. The method as recited in claim 1, further comprising:
receiving a user request to copy a portion of the markup language document, the portion including at least some of the digital ink; and providing, in response to the user request, at least a portion of the digital ink markup language element to a copy and paste system. 4. The method as recited in claim 1, further comprising:
receiving a user request to paste content into the markup language document, the content to be pasted including data describing additional digital ink; and embedding the additional digital ink in the markup language document. 5. The method as recited in claim 1, further comprising preserving, in the markup language document, the z-order of the digital ink and the additional content. 6. The method as recited in claim 1, the application displaying an edit box in which digital ink is to be input, the digital ink user input including both multiple locations within the edit box and multiple locations beyond the edit box, the method further comprising:
including, in the digital ink markup language element, data identifying both the multiple locations within the edit box and the multiple locations beyond the edit box; and displaying, as a digital ink stroke for the digital ink user input, only the multiple locations within the edit box. 7. The method as recited in claim 1, further comprising:
using a first one or more program threads to receive the digital ink user input and display a digital ink stroke for the digital ink user input; and using a second one or more program threads to display the additional content. 8. The method as recited in claim 1, further comprising:
receiving, after receiving the digital ink user input, a first user request to undo the digital ink user input; and removing, in response to the first user request, the digital ink markup language element from the markup language document. 9. The method as recited in claim 8, further comprising:
receiving, after receiving the first user request to undo the digital ink user input, a second request to redo the digital ink user input; and adding, in response to the second user request, the digital ink markup language element back into the markup language document. 10. The method as recited in claim 1, further comprising:
receiving, after receiving the digital ink user input, a user request to erase a portion of the digital ink; and deleting, from the digital ink markup language element, data identifying locations of the digital ink corresponding to the portion. 11. The method as recited in claim 1, further comprising:
receiving a user inputs specifying characteristics of the digital ink, the characteristics including one or more characteristics selected from the group including: shape, color, and width; and adding, in the digital ink markup language element, an additional element that identifies the user specified characteristics of the digital ink. 12. The method as recited in claim 1, further comprising:
recognizing one or more characters represented by the digital ink user input; and adding, in the digital ink markup language element, an additional element that identifies the recognized one or more characters, an identification of a user that provided the digital ink user input, and a timestamp of digital ink strokes of the digital ink user input. 13. A method comprising:
accessing a storage device to obtain a markup language document, the markup language document including a digital ink markup language element as well as one or more additional elements including additional data; extracting, from the digital ink markup language element, data describing digital ink of the markup language document; extracting, from the one or more additional elements, the additional data describing additional content of the markup language document; and displaying, as a visual representation of the markup language document, the digital ink as well as the additional content. 14. The method as recited in claim 13, the accessing the storage device comprising accessing the storage device via a data network. 15. A computing device comprising:
a processing system comprising one or more processors; one or more computer-readable storage media having stored thereon multiple instructions that, responsive to execution by the processing system, cause the processing system to perform acts comprising:
receiving, by an application of the computing device, a user input indicating digital ink for a first markup language document;
generating a digital ink markup language element that includes data describing the digital ink;
embedding the digital ink markup language element in the first markup language document, the markup language document also including in one or more additional elements additional data describing additional content to be displayed when displaying the first markup language document; and
transmitting the first markup language document with the digital ink markup language element to a storage device. 16. The computing device as recited in claim 15, the acts further comprising:
accessing a service via the Internet; and obtaining the markup language document from the service. 17. The computing device as recited in claim 15, the acts further comprising:
accessing the storage device to obtain a second markup language document, the second markup language document including a digital ink markup language element as well as one or more additional elements including additional data; extracting, from the second digital ink markup language element of the second markup language document, data describing digital ink of the second markup language document; extracting, from the one or more additional elements of the second markup language document, the additional data describing additional content of the second markup language document; and displaying, as a visual representation of the second markup language document, the digital ink of the second markup language document as well as the additional content of the second markup language document. 18. The computing device as recited in claim 15, the one or more processors executing the application as multiple threads, and the acts further comprising:
using a first one or more program threads of the multiple threads to receive the digital ink user input and display a digital ink stroke for the digital ink; and using a second one or more program threads of the multiple threads to embed the digital ink in the first markup language document. 19. The computing device as recited in claim 15, the acts further comprising:
receiving a user request to copy a portion of the first markup language document, the portion including at least some of the digital ink; and providing, in response to the user request, at least a portion of the digital ink markup language element to a copy and paste system. 20. The computing device as recited in claim 15, the acts further comprising:
receiving a user request to paste content into the first markup language document, the content to be pasted including data describing additional digital ink; and embedding the additional digital ink in the markup language document. | 2,100 |
4,965 | 14,294,028 | 2,167 | A query can be executed over incomplete data and produce a partial result. Moreover, the partial result or portion thereof can be classified in accordance with a partial result taxonomy. In accordance with one aspect, the taxonomy can be defined in terms of data correctness and cardinality properties. Further, partial result analysis can be performed at various degrees of granularity. Classified partial result can be presented on a display device to allow user to view and optionally interact with the partial result. | 1. A method, comprising:
employing at least one processor configured to execute computer-executable instructions stored in memory to perform the following acts: classifying a partial result or portion thereof arising from evaluation of a query over incomplete data in accordance with a partial result taxonomy. 2. The method of claim 1 further comprises classifying the partial result or portion thereof in terms of data correctness. 3. The method of claim 1 further comprises classifying the partial result or portion thereof in terms of cardinality. 4. The method of claim 3 further comprises classifying the partial result or portion thereof in terms of at least one cardinality property of complete, incomplete, phantom, or indeterminate. 5. The method of claim 1 further comprises classifying the partial result or portion thereof based on one or more query operators of a query plan for the query. 6. The method of claim 1 further comprises classifying the partial result or portion thereof based on identifying of one or more data sources that are unavailable to provide complete data. 7. The method of claim 1 further comprises classifying the partial result set or portion thereof based on a description of how data is partitioned over one or more data sources. 8. The method of claim 1 further comprises presenting on a display device the result and classification associated with the result or portion thereof. 9. The method of claim 1 further comprising reclassifying the partial result set or portion thereof based on input from a user that adjusts a classification associated with at least one query operator output. 10. A system, comprising:
a processor coupled to a memory, the processor configured to execute the following computer-executable component stored in the memory: a first component configured to evaluate a query over incomplete data and return a partial result; and a second component configured to classify the partial result or portion thereof in accordance with a partial result taxonomy. 11. The system of claim 10, the second component is further configured to classify the partial result or portion thereof in terms of data correctness. 12. The system of claim 10, the second component is further configured to classify the partial result or portion thereof in terms of cardinality. 13. The system of claim 12, the second component is further configured to classify the partial result or portion thereof in terms of at least one cardinality property of complete, incomplete, phantom, or indeterminate. 14. The system of claim 10, the second component is further configured to classify the partial result or portion thereof based on one or more operators of a query plan that implements the query. 15. The system of claim 10, the second component is further configured to classify the partial result or portion thereof based on identification of one or more data sources unavailable to provide complete results. 16. The system of claim 10 further comprises a third component configured to render the classified partial result on a display device. 17. A computer-readable storage medium having instructions stored thereon that enable at least one processor to perform a method upon execution of the instructions, the method comprising:
classifying a partial result or portion thereof arising from evaluation of a query over incomplete data in accordance with a partial result taxonomy. 18. The computer-readable storage medium of claim 17, the method further comprises classifying the partial result or portion thereof in terms of data correctness. 19. The computer-readable storage medium of claim 18, the method further comprises classifying the partial result or portion thereof in terms of at least one cardinality property of complete, incomplete, phantom, or indeterminate. 20. The computer-readable storage medium of claim 17, the method further comprises rendering on a display device the result and classification associated with the result or portion thereof. | A query can be executed over incomplete data and produce a partial result. Moreover, the partial result or portion thereof can be classified in accordance with a partial result taxonomy. In accordance with one aspect, the taxonomy can be defined in terms of data correctness and cardinality properties. Further, partial result analysis can be performed at various degrees of granularity. Classified partial result can be presented on a display device to allow user to view and optionally interact with the partial result.1. A method, comprising:
employing at least one processor configured to execute computer-executable instructions stored in memory to perform the following acts: classifying a partial result or portion thereof arising from evaluation of a query over incomplete data in accordance with a partial result taxonomy. 2. The method of claim 1 further comprises classifying the partial result or portion thereof in terms of data correctness. 3. The method of claim 1 further comprises classifying the partial result or portion thereof in terms of cardinality. 4. The method of claim 3 further comprises classifying the partial result or portion thereof in terms of at least one cardinality property of complete, incomplete, phantom, or indeterminate. 5. The method of claim 1 further comprises classifying the partial result or portion thereof based on one or more query operators of a query plan for the query. 6. The method of claim 1 further comprises classifying the partial result or portion thereof based on identifying of one or more data sources that are unavailable to provide complete data. 7. The method of claim 1 further comprises classifying the partial result set or portion thereof based on a description of how data is partitioned over one or more data sources. 8. The method of claim 1 further comprises presenting on a display device the result and classification associated with the result or portion thereof. 9. The method of claim 1 further comprising reclassifying the partial result set or portion thereof based on input from a user that adjusts a classification associated with at least one query operator output. 10. A system, comprising:
a processor coupled to a memory, the processor configured to execute the following computer-executable component stored in the memory: a first component configured to evaluate a query over incomplete data and return a partial result; and a second component configured to classify the partial result or portion thereof in accordance with a partial result taxonomy. 11. The system of claim 10, the second component is further configured to classify the partial result or portion thereof in terms of data correctness. 12. The system of claim 10, the second component is further configured to classify the partial result or portion thereof in terms of cardinality. 13. The system of claim 12, the second component is further configured to classify the partial result or portion thereof in terms of at least one cardinality property of complete, incomplete, phantom, or indeterminate. 14. The system of claim 10, the second component is further configured to classify the partial result or portion thereof based on one or more operators of a query plan that implements the query. 15. The system of claim 10, the second component is further configured to classify the partial result or portion thereof based on identification of one or more data sources unavailable to provide complete results. 16. The system of claim 10 further comprises a third component configured to render the classified partial result on a display device. 17. A computer-readable storage medium having instructions stored thereon that enable at least one processor to perform a method upon execution of the instructions, the method comprising:
classifying a partial result or portion thereof arising from evaluation of a query over incomplete data in accordance with a partial result taxonomy. 18. The computer-readable storage medium of claim 17, the method further comprises classifying the partial result or portion thereof in terms of data correctness. 19. The computer-readable storage medium of claim 18, the method further comprises classifying the partial result or portion thereof in terms of at least one cardinality property of complete, incomplete, phantom, or indeterminate. 20. The computer-readable storage medium of claim 17, the method further comprises rendering on a display device the result and classification associated with the result or portion thereof. | 2,100 |
4,966 | 14,417,578 | 2,176 | Positioning of a cursor over a component in a system schematic displayed on a graphical user interface is detected and the component is highlighted. Selection of the component is detected and a translucent heads up display (“HUD”) is drawn over the highlighted component. A portion of the highlighted component under the HUD is un-highlighted. Positioning of the cursor over a HUD parameter-adjustment control is detected and the HUD parameter-adjustment control is highlighted. Selection of the HUD parameter-adjustment control is detected and a HUD display of an original value of the parameter for the component is replaced with a display of an adjusted value computed by adjusting the original value by the amount associated with the selected HUD adjustment button. Positioning of the cursor away from the component is detected and the drawing of the HUD is removed and the component is un-highlighted. | 1. A method comprising:
detecting positioning of a cursor over a component in a system schematic displayed on a graphical user interface and, as a result, highlighting the component; detecting selection of the component and, as a result, drawing a translucent heads up display (“HUD”) over the highlighted component, wherein the HUD comprises:
a display of a parameter associated with the component,
a display of an original value for the parameter, and
a plurality of parameter-adjustment controls, wherein each parameter-adjustment control has associated with it an amount to adjust the value of the parameter;
un-highlighting a portion of the highlighted component, wherein the un-highlighted portion is under the HUD; detecting positioning of the cursor over a HUD parameter-adjustment control and, as a result, highlighting the HUD parameter-adjustment control; detecting selection of the HUD parameter-adjustment control and, as a result, replacing the display of the original value of the parameter for the component with a display of an adjusted value computed by adjusting the original value by the amount associated with the selected HUD adjustment button; and detecting positioning of the cursor away from the component and, as a result, removing the drawing of the HUD and un-highlighting the component. 2. The method of 1 wherein the adjusted value is computed from the original value by an arithmetic operation selected from the group consisting of addition, subtraction, multiplication, and division. 3. The method of claim 1 wherein:
the system schematic includes a label adjacent to and associated with the component; and
highlighting the component includes highlighting the label. 4. The method of claim 1 wherein drawing the HUD comprises:
drawing the plurality of parameter-adjustment controls in a ring. 5. The method of claim 1 wherein drawing the HUD comprises:
determining that one of the amounts associated with one of the plurality of parameter-adjustment controls is invalid; and
drawing the one parameter-adjustment control as greyed out. 6. The method of claim 1 wherein:
detecting selection of the component comprises detecting a click on the component; and
detecting selection of the HUD adjustment button comprises detecting a click on the HUD adjustment button. 7. The method of claim 1 wherein:
each of the plurality of parameter-adjustment controls includes a display of its associated adjustment amount. 8. The method of claim 1 wherein:
the amounts associated with each parameter-adjustment control have a magnitude and a sign. 9. The method of claim 1 further comprising:
detecting selection of a parameter-selection control on the HUD and, as a result, replacing the display on the HUD of the parameter and the adjustment buttons for the parameter with a second parameter and parameter-adjustment controls for the second parameter. 10. The method of claim 1 wherein detecting selection of the component further results in associating the HUD with the selected component. 11. The method of claim 1 wherein detecting selection of the component further results in changing the cursor from a pre-selection cursor to a post-selection cursor. 12. The method of claim 1 wherein detecting positioning of the cursor away from the component further results in changing the cursor from a post-selection cursor to a pre-selection cursor. 13. A method comprising:
detecting selection of a component in a system schematic displayed on a graphical user interface and, as a result, drawing a heads up display (“HUD”) over the component, wherein the HUD comprises:
a display of a parameter assigned to the component,
a display of an original value for the parameter, and
a parameter-adjustment control, wherein the parameter-adjustment control has associated with it an amount to adjust the value of the parameter; and
detecting N selections of the parameter-adjustment control, wherein N is greater than 1 and a time between each pair of consecutive selections in the N selections is less than a multiple-selection threshold, and, as a result, replacing the display of the original value for the parameter with a display of the original value adjusted by the amount associated with the selected HUD adjustment button multiplied by N. 14. The method of claim 13 wherein the HUD further comprises:
a plurality of parameter-adjustment controls, wherein each parameter-adjustment control has associated with it an amount to adjust the value of the parameter. 15. The method of claim 13 wherein the parameter-adjustment control is a button. 16. The method of claim 13 wherein:
detecting N selections of the parameter-adjustment control comprises detecting N clicks on the parameter-adjustment control. 17. The method of claim 13 wherein detecting N selections of the parameter-adjustment control further results in replacing a version of the original value saved in a memory with the original value adjusted by the amount associated with the selected HUD adjustment button multiplied by N. 18. A method comprising:
detecting positioning of a cursor over a component in a system schematic displayed on a graphical user interface and, as a result, highlighting the component; detecting selection of the component and, as a result, drawing a translucent heads up display (“HUD”) over the highlighted component; and detecting positioning of the cursor away from the component and, as a result, removing the drawing of the HUD and un-highlighting the component. 19. The method of claim 18 wherein detecting selection of the component further results in changing the cursor from a pre-selection cursor to a post-selection cursor, which is different from the pre-selection cursor. 20. The method of claim 18 wherein detecting positioning of the cursor away from the component further results in changing the cursor from a post-selection cursor to a pre-selection cursor, which is different from the post-selection cursor. | Positioning of a cursor over a component in a system schematic displayed on a graphical user interface is detected and the component is highlighted. Selection of the component is detected and a translucent heads up display (“HUD”) is drawn over the highlighted component. A portion of the highlighted component under the HUD is un-highlighted. Positioning of the cursor over a HUD parameter-adjustment control is detected and the HUD parameter-adjustment control is highlighted. Selection of the HUD parameter-adjustment control is detected and a HUD display of an original value of the parameter for the component is replaced with a display of an adjusted value computed by adjusting the original value by the amount associated with the selected HUD adjustment button. Positioning of the cursor away from the component is detected and the drawing of the HUD is removed and the component is un-highlighted.1. A method comprising:
detecting positioning of a cursor over a component in a system schematic displayed on a graphical user interface and, as a result, highlighting the component; detecting selection of the component and, as a result, drawing a translucent heads up display (“HUD”) over the highlighted component, wherein the HUD comprises:
a display of a parameter associated with the component,
a display of an original value for the parameter, and
a plurality of parameter-adjustment controls, wherein each parameter-adjustment control has associated with it an amount to adjust the value of the parameter;
un-highlighting a portion of the highlighted component, wherein the un-highlighted portion is under the HUD; detecting positioning of the cursor over a HUD parameter-adjustment control and, as a result, highlighting the HUD parameter-adjustment control; detecting selection of the HUD parameter-adjustment control and, as a result, replacing the display of the original value of the parameter for the component with a display of an adjusted value computed by adjusting the original value by the amount associated with the selected HUD adjustment button; and detecting positioning of the cursor away from the component and, as a result, removing the drawing of the HUD and un-highlighting the component. 2. The method of 1 wherein the adjusted value is computed from the original value by an arithmetic operation selected from the group consisting of addition, subtraction, multiplication, and division. 3. The method of claim 1 wherein:
the system schematic includes a label adjacent to and associated with the component; and
highlighting the component includes highlighting the label. 4. The method of claim 1 wherein drawing the HUD comprises:
drawing the plurality of parameter-adjustment controls in a ring. 5. The method of claim 1 wherein drawing the HUD comprises:
determining that one of the amounts associated with one of the plurality of parameter-adjustment controls is invalid; and
drawing the one parameter-adjustment control as greyed out. 6. The method of claim 1 wherein:
detecting selection of the component comprises detecting a click on the component; and
detecting selection of the HUD adjustment button comprises detecting a click on the HUD adjustment button. 7. The method of claim 1 wherein:
each of the plurality of parameter-adjustment controls includes a display of its associated adjustment amount. 8. The method of claim 1 wherein:
the amounts associated with each parameter-adjustment control have a magnitude and a sign. 9. The method of claim 1 further comprising:
detecting selection of a parameter-selection control on the HUD and, as a result, replacing the display on the HUD of the parameter and the adjustment buttons for the parameter with a second parameter and parameter-adjustment controls for the second parameter. 10. The method of claim 1 wherein detecting selection of the component further results in associating the HUD with the selected component. 11. The method of claim 1 wherein detecting selection of the component further results in changing the cursor from a pre-selection cursor to a post-selection cursor. 12. The method of claim 1 wherein detecting positioning of the cursor away from the component further results in changing the cursor from a post-selection cursor to a pre-selection cursor. 13. A method comprising:
detecting selection of a component in a system schematic displayed on a graphical user interface and, as a result, drawing a heads up display (“HUD”) over the component, wherein the HUD comprises:
a display of a parameter assigned to the component,
a display of an original value for the parameter, and
a parameter-adjustment control, wherein the parameter-adjustment control has associated with it an amount to adjust the value of the parameter; and
detecting N selections of the parameter-adjustment control, wherein N is greater than 1 and a time between each pair of consecutive selections in the N selections is less than a multiple-selection threshold, and, as a result, replacing the display of the original value for the parameter with a display of the original value adjusted by the amount associated with the selected HUD adjustment button multiplied by N. 14. The method of claim 13 wherein the HUD further comprises:
a plurality of parameter-adjustment controls, wherein each parameter-adjustment control has associated with it an amount to adjust the value of the parameter. 15. The method of claim 13 wherein the parameter-adjustment control is a button. 16. The method of claim 13 wherein:
detecting N selections of the parameter-adjustment control comprises detecting N clicks on the parameter-adjustment control. 17. The method of claim 13 wherein detecting N selections of the parameter-adjustment control further results in replacing a version of the original value saved in a memory with the original value adjusted by the amount associated with the selected HUD adjustment button multiplied by N. 18. A method comprising:
detecting positioning of a cursor over a component in a system schematic displayed on a graphical user interface and, as a result, highlighting the component; detecting selection of the component and, as a result, drawing a translucent heads up display (“HUD”) over the highlighted component; and detecting positioning of the cursor away from the component and, as a result, removing the drawing of the HUD and un-highlighting the component. 19. The method of claim 18 wherein detecting selection of the component further results in changing the cursor from a pre-selection cursor to a post-selection cursor, which is different from the pre-selection cursor. 20. The method of claim 18 wherein detecting positioning of the cursor away from the component further results in changing the cursor from a post-selection cursor to a pre-selection cursor, which is different from the post-selection cursor. | 2,100 |
4,967 | 14,583,389 | 2,136 | Methods and apparatus implementing Hardware/Software co-optimization to improve performance and energy for inter-VM communication for NFVs and other producer-consumer workloads. The apparatus include multi-core processors with multi-level cache hierarchies including and L1 and L2 cache for each core and a shared last-level cache (LLC). One or more machine-level instructions are provided for proactively demoting cachelines from lower cache levels to higher cache levels, including demoting cachelines from L1/L2 caches to an LLC. Techniques are also provided for implementing hardware/software co-optimization in multi-socket NUMA architecture system, wherein cachelines may be selectively demoted and pushed to an LLC in a remote socket. In addition, techniques are disclosure for implementing early snooping in multi-socket systems to reduce latency when accessing cachelines on remote sockets. | 1. A processor, configured to be implemented in a computer system, comprising:
a plurality of cores, each having at least one associated cache occupying a respective level in a cache hierarchy; a last level cache (LLC), communicatively coupled to the plurality of cores; and a memory controller, communicatively coupled to the plurality of cores, configured to support access to external system memory when the processor is installed in the computer system; wherein each of the caches associated with a core, and the LLC include a plurality of cacheline slots for storing cacheline data, and wherein the processor is further is configured to support a machine instruction that when executed causes the processor to demote a cacheline from a lower-level cache to a higher-level cache. 2. The processor of claim 1, wherein execution of the machine instruction causes the cacheline to be demoted to the LLC. 3. The processor of claim 2, wherein execution of the machine instruction causes a write-back of the cacheline to system memory. 4. The processor of claim 1, wherein the cacheline is held in a first cache at an associated level in a cache hierarchy, and wherein execution of the machine instruction causes the cacheline to be demoted to a cache that is two levels below the first cache. 5. The processor of claim 1, wherein the processor includes a third level (L3) cache and a fourth level (L4) cache comprising the LLC. 6. The processor of claim 1, wherein the computer system is a multi-socketed computer system employing a Non-Uniform Memory Access (NUMA) architecture in which multiple instances of the processor are to be installed, each socket including a processor and local system memory, and the processor further includes a socket-to-socket interconnect interface configured to facilitate communication between processors installed in different sockets, and wherein execution of the machine instruction causes a processor operating as a local socket to:
demote a cacheline to the LLC cache on the local socket; and push a copy of the cacheline to an LLC of a processor installed in a remote socket, wherein the cacheline is pushed via the socket-to-socket interconnect interface. 7. The processor of claim 6, wherein execution of the instruction causes the processor to release ownership of the cacheline in the processor operating as the local socket. 8. The processor of claim 6, wherein execution of the instruction causes the processor to mark the cacheline as (S)hared. 9. The processor of claim 6, wherein execution of the instruction causes the processor to:
write-back the cacheline from the LLC on the local socket to system memory on the local socket; and release the cacheline in the LLC on the local socket. 10. The processor of claim 6, wherein the processor is further configured to:
receive a cacheline that has been pushed from a processor operating in a remote socket via the socket-to-socket interconnect interface; and store the cacheline in its LLC. 11. A processor, configured to be implemented in a multi-socketed computer system employing a Non-Uniform Memory Access (NUMA) architecture in which multiple instances of the processor are to be installed, each socket including a processor and local system memory, the processor comprising:
a plurality of cores, each having an associated level 1 (L2) cache and a level 2 (L2) cache; a last level cache (LLC), communicatively coupled to the plurality of cores; a memory controller, communicatively coupled to the plurality of cores, configured to support access to external system memory when the processor is installed in the computer system; and a socket-to-socket interconnect interface, communicatively coupled to LLC; wherein each of the L1 caches, L2 caches, and LLC include a plurality of cacheline slots for storing cacheline data and an associated cache agent, and wherein the processor is further configured to, in response to a memory access request issued by a core for a data object stored in system memory on a remote socket, snoop at least one of the core's L1 and L2 caches and the processor's LLC for a cacheline storing a copy of the data object, each snoop resulting in a miss; and issue an early snoop from the processor to the processor in the remote socket, the early snoop sent via the socket-to-socket interconnect interface. 12. The processor of claim 11, wherein the processor issues the early snoop to the processor in the remote socket without checking it local system memory for the data object. 13. The processor of claim 11, wherein the processor is further configured to:
monitor cacheline access patterns to caches on the local socket and one or more remote sockets; and determine whether to issue an early snoop for a given data object based on access information obtained by monitoring the memory access patterns. 14. The processor of claim 13, wherein the processor is further configured to:
one of receive or access information relating to one or more shared memory regions in a global memory address space comprising system memory in the local socket and at least one remote socket; and monitor cacheline accesses to the one or more shared memory regions. 15. The processor of claim 13, wherein the processor is configured to implement a tag in cachelines and employ the tag to monitor access patterns. 16. The processor of claim 15, wherein the processor is configured to:
monitor an access pattern for a given cacheline; determine if the cacheline is consistently served from a remote socket; update the cacheline tag to indicate the cacheline is to be accessed via the remote socket; and subsequently, when an access to the cacheline is misses the local LLC, issuing an early snoop to the remote socket. 17. The processor of any of claim 13, wherein the processor further includes embedded logic to implement a caching home agent (CHA) that is configured to monitor cacheline access patterns and issue early snoops for cachelines based on their cacheline access patterns. 18. A method implemented on a processor including a plurality of cores, each having at least one associated cache occupying a respective layer in a cache hierarchy, and a last level cache (LLC) that is shared among the plurality of cores, the processor further including a memory controller to access system memory when the processor is installed in a computer system, the method comprising:
demoting a cacheline from a lower-level cache to a higher-level cache via execution of an associated cacheline demotion machine instruction. 19. The method of claim 18, wherein execution of the machine instruction causes the cacheline to be demoted to the LLC. 20. The method of claim 19, wherein execution of the machine instruction causes a write-back of the cacheline to system memory. 21. The method of any of claim 18, wherein the cacheline is held in a first cache at an associated level in a cache hierarchy, and wherein execution of the machine instruction causes the cacheline to be demoted to a cache that is two levels below the first cache. 22. The method of claim 21, wherein the computer system is a multi-socketed computer system employing a Non-Uniform Memory Access (NUMA) architecture in which multiple instances of the processor are installed, each socket including a processor and local system memory, and the processor further includes a socket-to-socket interconnect interface configured to facilitate communication between processors installed in different sockets, the method further comprising:
demoting a cacheline to the LLC cache on the local socket; and pushing a copy of the cacheline to an LLC of a processor installed in a remote socket, wherein the cacheline is pushed via the socket-to-socket interconnect interface. 23. The method of claim 22, further comprising releasing ownership of the cacheline in the processor operating as the local socket. 24. The method of claim 22, further comprising:
performing a write-back of the cacheline from the LLC on the local socket to system memory on the local socket; and releasing the cacheline in the LLC on the local socket. 25. The method of claim 22, further comprising:
receiving a cacheline that has been pushed from a processor operating in a remote socket via the socket-to-socket interconnect interface; and storing the cacheline in the LLC of the processor to which the cacheline is pushed. | Methods and apparatus implementing Hardware/Software co-optimization to improve performance and energy for inter-VM communication for NFVs and other producer-consumer workloads. The apparatus include multi-core processors with multi-level cache hierarchies including and L1 and L2 cache for each core and a shared last-level cache (LLC). One or more machine-level instructions are provided for proactively demoting cachelines from lower cache levels to higher cache levels, including demoting cachelines from L1/L2 caches to an LLC. Techniques are also provided for implementing hardware/software co-optimization in multi-socket NUMA architecture system, wherein cachelines may be selectively demoted and pushed to an LLC in a remote socket. In addition, techniques are disclosure for implementing early snooping in multi-socket systems to reduce latency when accessing cachelines on remote sockets.1. A processor, configured to be implemented in a computer system, comprising:
a plurality of cores, each having at least one associated cache occupying a respective level in a cache hierarchy; a last level cache (LLC), communicatively coupled to the plurality of cores; and a memory controller, communicatively coupled to the plurality of cores, configured to support access to external system memory when the processor is installed in the computer system; wherein each of the caches associated with a core, and the LLC include a plurality of cacheline slots for storing cacheline data, and wherein the processor is further is configured to support a machine instruction that when executed causes the processor to demote a cacheline from a lower-level cache to a higher-level cache. 2. The processor of claim 1, wherein execution of the machine instruction causes the cacheline to be demoted to the LLC. 3. The processor of claim 2, wherein execution of the machine instruction causes a write-back of the cacheline to system memory. 4. The processor of claim 1, wherein the cacheline is held in a first cache at an associated level in a cache hierarchy, and wherein execution of the machine instruction causes the cacheline to be demoted to a cache that is two levels below the first cache. 5. The processor of claim 1, wherein the processor includes a third level (L3) cache and a fourth level (L4) cache comprising the LLC. 6. The processor of claim 1, wherein the computer system is a multi-socketed computer system employing a Non-Uniform Memory Access (NUMA) architecture in which multiple instances of the processor are to be installed, each socket including a processor and local system memory, and the processor further includes a socket-to-socket interconnect interface configured to facilitate communication between processors installed in different sockets, and wherein execution of the machine instruction causes a processor operating as a local socket to:
demote a cacheline to the LLC cache on the local socket; and push a copy of the cacheline to an LLC of a processor installed in a remote socket, wherein the cacheline is pushed via the socket-to-socket interconnect interface. 7. The processor of claim 6, wherein execution of the instruction causes the processor to release ownership of the cacheline in the processor operating as the local socket. 8. The processor of claim 6, wherein execution of the instruction causes the processor to mark the cacheline as (S)hared. 9. The processor of claim 6, wherein execution of the instruction causes the processor to:
write-back the cacheline from the LLC on the local socket to system memory on the local socket; and release the cacheline in the LLC on the local socket. 10. The processor of claim 6, wherein the processor is further configured to:
receive a cacheline that has been pushed from a processor operating in a remote socket via the socket-to-socket interconnect interface; and store the cacheline in its LLC. 11. A processor, configured to be implemented in a multi-socketed computer system employing a Non-Uniform Memory Access (NUMA) architecture in which multiple instances of the processor are to be installed, each socket including a processor and local system memory, the processor comprising:
a plurality of cores, each having an associated level 1 (L2) cache and a level 2 (L2) cache; a last level cache (LLC), communicatively coupled to the plurality of cores; a memory controller, communicatively coupled to the plurality of cores, configured to support access to external system memory when the processor is installed in the computer system; and a socket-to-socket interconnect interface, communicatively coupled to LLC; wherein each of the L1 caches, L2 caches, and LLC include a plurality of cacheline slots for storing cacheline data and an associated cache agent, and wherein the processor is further configured to, in response to a memory access request issued by a core for a data object stored in system memory on a remote socket, snoop at least one of the core's L1 and L2 caches and the processor's LLC for a cacheline storing a copy of the data object, each snoop resulting in a miss; and issue an early snoop from the processor to the processor in the remote socket, the early snoop sent via the socket-to-socket interconnect interface. 12. The processor of claim 11, wherein the processor issues the early snoop to the processor in the remote socket without checking it local system memory for the data object. 13. The processor of claim 11, wherein the processor is further configured to:
monitor cacheline access patterns to caches on the local socket and one or more remote sockets; and determine whether to issue an early snoop for a given data object based on access information obtained by monitoring the memory access patterns. 14. The processor of claim 13, wherein the processor is further configured to:
one of receive or access information relating to one or more shared memory regions in a global memory address space comprising system memory in the local socket and at least one remote socket; and monitor cacheline accesses to the one or more shared memory regions. 15. The processor of claim 13, wherein the processor is configured to implement a tag in cachelines and employ the tag to monitor access patterns. 16. The processor of claim 15, wherein the processor is configured to:
monitor an access pattern for a given cacheline; determine if the cacheline is consistently served from a remote socket; update the cacheline tag to indicate the cacheline is to be accessed via the remote socket; and subsequently, when an access to the cacheline is misses the local LLC, issuing an early snoop to the remote socket. 17. The processor of any of claim 13, wherein the processor further includes embedded logic to implement a caching home agent (CHA) that is configured to monitor cacheline access patterns and issue early snoops for cachelines based on their cacheline access patterns. 18. A method implemented on a processor including a plurality of cores, each having at least one associated cache occupying a respective layer in a cache hierarchy, and a last level cache (LLC) that is shared among the plurality of cores, the processor further including a memory controller to access system memory when the processor is installed in a computer system, the method comprising:
demoting a cacheline from a lower-level cache to a higher-level cache via execution of an associated cacheline demotion machine instruction. 19. The method of claim 18, wherein execution of the machine instruction causes the cacheline to be demoted to the LLC. 20. The method of claim 19, wherein execution of the machine instruction causes a write-back of the cacheline to system memory. 21. The method of any of claim 18, wherein the cacheline is held in a first cache at an associated level in a cache hierarchy, and wherein execution of the machine instruction causes the cacheline to be demoted to a cache that is two levels below the first cache. 22. The method of claim 21, wherein the computer system is a multi-socketed computer system employing a Non-Uniform Memory Access (NUMA) architecture in which multiple instances of the processor are installed, each socket including a processor and local system memory, and the processor further includes a socket-to-socket interconnect interface configured to facilitate communication between processors installed in different sockets, the method further comprising:
demoting a cacheline to the LLC cache on the local socket; and pushing a copy of the cacheline to an LLC of a processor installed in a remote socket, wherein the cacheline is pushed via the socket-to-socket interconnect interface. 23. The method of claim 22, further comprising releasing ownership of the cacheline in the processor operating as the local socket. 24. The method of claim 22, further comprising:
performing a write-back of the cacheline from the LLC on the local socket to system memory on the local socket; and releasing the cacheline in the LLC on the local socket. 25. The method of claim 22, further comprising:
receiving a cacheline that has been pushed from a processor operating in a remote socket via the socket-to-socket interconnect interface; and storing the cacheline in the LLC of the processor to which the cacheline is pushed. | 2,100 |
4,968 | 15,262,516 | 2,193 | Based on creation or assignment of a first artifact for a collaborative product development in an enterprise, identifying first text in the first artifact is identified. For each of a plurality of stored artifacts of the enterprise, a determination is made of whether the stored artifact includes a second text that matches the first text identified in the first artifact to a degree that satisfies a matching threshold. In response to determining satisfaction of the matching threshold, a determination is made of whether the first artifact satisfies a collaboration criterion that is based, at least in part, on an attribute of at least one of the first artifact and the stored artifact. In response to determining that the collaboration criterion is satisfied, a collaboration notification regarding the stored artifact is transmitted. | 1. A method comprising:
creating or assigning a first artifact document that includes a description of a component of a product that is included in a product development cycle, and wherein the description is associated with a product development entity and includes a description of functionality of the product; in response to said creating or assigning the first artifact document, utilizing a text-based search engine to identify search terms in the first artifact document; and for each of a plurality of artifact documents currently stored by a development enterprise,
determining whether the stored artifact document includes text that matches the identified search terms in the first artifact document to a degree that satisfies a matching threshold; and
in response to determining satisfaction of the matching threshold,
determining whether the first artifact document satisfies a collaboration criterion that is based, at least in part, on an attribute of the first artifact document and the stored artifact document; and
in response to determining that the collaboration criterion is satisfied, transmitting to the product development entity a collaboration notification regarding the stored artifact document. 2. The method of claim 1, wherein transmitting the collaboration notification comprises transmitting the collaboration notification to at least one of a device of a member and a device of a team in the enterprise assigned the first artifact. 3. The method of claim 1, wherein the collaboration criterion comprises that a member assigned to the first artifact be within N vertical levels of the enterprise of a member assigned to the stored artifact. 4. The method of claim 1, wherein the collaboration criterion comprises that a member assigned to the stored artifact be within a logical boundary of the enterprise. 5. The method of claim 1, wherein the collaboration criterion comprises that development performed as defined by the stored artifact document be within a physical boundary of the enterprise. 6. The method of claim 5, wherein the collaboration criterion comprises that development to be performed as defined in the first artifact document be within a same physical boundary as development performed as defined in the stored artifact document. 7. The method of claim 1, wherein the first artifact document comprises a new story defining a requirement of the product being developed in the development enterprise, wherein the new story is part of a first epic, wherein the collaboration criterion comprises that the stored artifact document be in the first epic. 8. The method of claim 1, wherein the first artifact document is created to satisfy a first enterprise objective among a limited set of enterprise objectives, wherein the collaboration criterion comprises that the stored artifact document be in a same enterprise objective within the limited set of enterprise objectives. 9. The method of claim 1, wherein the attribute of the stored artifact document comprises a stage of development of the product. 10. The method of claim 1, wherein at least one other stored artifact document is marked as private, wherein the at least one other stored artifact document marked as private is excluded from the determining. 11. An apparatus comprising:
a processor; and a machine-readable medium having program code executable by the processor to cause the apparatus to:
create or assign a first artifact document that includes a description of a component of a product that is included in a product development cycle, and wherein the description is associated with a product development entity and includes a description of functionality of the product;
in response to said creating or assigning the first artifact document, utilize a text-based search engine to identify search terms in the first artifact document; and
for each of a plurality of artifact documents currently stored by a development enterprise,
determine whether the stored artifact document includes text that matches the identified search terms in the first artifact document to a degree that satisfies a matching threshold; and
in response to a determination satisfaction of the matching threshold,
determine whether the first artifact document satisfies a collaboration criterion that is based, at least in part, on an attribute of the first artifact document and the stored artifact document; and
in response to a determination the first artifact satisfies the collaboration criterion, transmitting to the product development entity a collaboration notification regarding the stored artifact document. 12. The apparatus of claim 11, wherein the program code executable by the processor to cause the apparatus to transmit the collaboration notification comprises program code executable by the processor to cause the apparatus to transmit the collaboration notification to at least one of a device of a member and a device of a team in the enterprise assigned the first artifact. 13. The apparatus of claim 11, wherein the collaboration criterion comprises that a member assigned to the first artifact be within N vertical levels of the enterprise of a member assigned to the stored artifact. 14. The apparatus of claim 11, wherein the collaboration criterion comprises that a member assigned to the stored artifact be within a logical boundary of the enterprise. 15. The apparatus of claim 11, wherein the collaboration criterion comprises that development performed as defined in the stored artifact document be within a physical boundary of the enterprise. 16. The apparatus of claim 15, wherein the collaboration criterion comprises that development to be performed as defined in the first artifact document be within a same physical boundary as development performed as defined in the stored artifact document. 17. The apparatus of claim 11, wherein the first artifact document comprises a new story defining a requirement of the product being developed in the development enterprise, wherein the new story is part of a first epic, wherein the collaboration criterion comprises that the stored artifact document be in the first epic. 18. The apparatus of claim 11, wherein the attribute of the stored artifact document comprises a stage of development of the product. 19. One or more non-transitory machine-readable media comprising program code for collaboration in an enterprise, the program code to:
create or assign a first artifact document that includes a description of a component of a product that is included in a product development cycle, and wherein the description is associated with a product development entity and includes a description of functionality of the product; in response to said creating or assigning the first artifact document, utilize a text-based search engine to identify search terms in the first artifact document; and for each of a plurality of artifact documents currently stored by a development enterprise,
determine whether the stored artifact document includes text that matches the identified search terms in the first artifact document to a degree that satisfies a matching threshold; and
in response to determining satisfaction of the matching threshold,
determine whether first artifact document satisfies a collaboration criterion comprising that the product development entity assigned to the first artifact be within N vertical levels of a product development entity within the development enterprise that is assigned the stored artifact document; and
in response to a that the collaboration criterion is satisfied, transmit to the product development entity a collaboration notification of the stored artifact document. 20. The one or more non-transitory machine-readable media of claim 19, wherein the first artifact document is created to satisfy a first enterprise objective among a limited set of enterprise objectives, wherein the collaboration criterion comprises that the stored artifact document be in a same enterprise objective within the limited set of enterprise objectives. | Based on creation or assignment of a first artifact for a collaborative product development in an enterprise, identifying first text in the first artifact is identified. For each of a plurality of stored artifacts of the enterprise, a determination is made of whether the stored artifact includes a second text that matches the first text identified in the first artifact to a degree that satisfies a matching threshold. In response to determining satisfaction of the matching threshold, a determination is made of whether the first artifact satisfies a collaboration criterion that is based, at least in part, on an attribute of at least one of the first artifact and the stored artifact. In response to determining that the collaboration criterion is satisfied, a collaboration notification regarding the stored artifact is transmitted.1. A method comprising:
creating or assigning a first artifact document that includes a description of a component of a product that is included in a product development cycle, and wherein the description is associated with a product development entity and includes a description of functionality of the product; in response to said creating or assigning the first artifact document, utilizing a text-based search engine to identify search terms in the first artifact document; and for each of a plurality of artifact documents currently stored by a development enterprise,
determining whether the stored artifact document includes text that matches the identified search terms in the first artifact document to a degree that satisfies a matching threshold; and
in response to determining satisfaction of the matching threshold,
determining whether the first artifact document satisfies a collaboration criterion that is based, at least in part, on an attribute of the first artifact document and the stored artifact document; and
in response to determining that the collaboration criterion is satisfied, transmitting to the product development entity a collaboration notification regarding the stored artifact document. 2. The method of claim 1, wherein transmitting the collaboration notification comprises transmitting the collaboration notification to at least one of a device of a member and a device of a team in the enterprise assigned the first artifact. 3. The method of claim 1, wherein the collaboration criterion comprises that a member assigned to the first artifact be within N vertical levels of the enterprise of a member assigned to the stored artifact. 4. The method of claim 1, wherein the collaboration criterion comprises that a member assigned to the stored artifact be within a logical boundary of the enterprise. 5. The method of claim 1, wherein the collaboration criterion comprises that development performed as defined by the stored artifact document be within a physical boundary of the enterprise. 6. The method of claim 5, wherein the collaboration criterion comprises that development to be performed as defined in the first artifact document be within a same physical boundary as development performed as defined in the stored artifact document. 7. The method of claim 1, wherein the first artifact document comprises a new story defining a requirement of the product being developed in the development enterprise, wherein the new story is part of a first epic, wherein the collaboration criterion comprises that the stored artifact document be in the first epic. 8. The method of claim 1, wherein the first artifact document is created to satisfy a first enterprise objective among a limited set of enterprise objectives, wherein the collaboration criterion comprises that the stored artifact document be in a same enterprise objective within the limited set of enterprise objectives. 9. The method of claim 1, wherein the attribute of the stored artifact document comprises a stage of development of the product. 10. The method of claim 1, wherein at least one other stored artifact document is marked as private, wherein the at least one other stored artifact document marked as private is excluded from the determining. 11. An apparatus comprising:
a processor; and a machine-readable medium having program code executable by the processor to cause the apparatus to:
create or assign a first artifact document that includes a description of a component of a product that is included in a product development cycle, and wherein the description is associated with a product development entity and includes a description of functionality of the product;
in response to said creating or assigning the first artifact document, utilize a text-based search engine to identify search terms in the first artifact document; and
for each of a plurality of artifact documents currently stored by a development enterprise,
determine whether the stored artifact document includes text that matches the identified search terms in the first artifact document to a degree that satisfies a matching threshold; and
in response to a determination satisfaction of the matching threshold,
determine whether the first artifact document satisfies a collaboration criterion that is based, at least in part, on an attribute of the first artifact document and the stored artifact document; and
in response to a determination the first artifact satisfies the collaboration criterion, transmitting to the product development entity a collaboration notification regarding the stored artifact document. 12. The apparatus of claim 11, wherein the program code executable by the processor to cause the apparatus to transmit the collaboration notification comprises program code executable by the processor to cause the apparatus to transmit the collaboration notification to at least one of a device of a member and a device of a team in the enterprise assigned the first artifact. 13. The apparatus of claim 11, wherein the collaboration criterion comprises that a member assigned to the first artifact be within N vertical levels of the enterprise of a member assigned to the stored artifact. 14. The apparatus of claim 11, wherein the collaboration criterion comprises that a member assigned to the stored artifact be within a logical boundary of the enterprise. 15. The apparatus of claim 11, wherein the collaboration criterion comprises that development performed as defined in the stored artifact document be within a physical boundary of the enterprise. 16. The apparatus of claim 15, wherein the collaboration criterion comprises that development to be performed as defined in the first artifact document be within a same physical boundary as development performed as defined in the stored artifact document. 17. The apparatus of claim 11, wherein the first artifact document comprises a new story defining a requirement of the product being developed in the development enterprise, wherein the new story is part of a first epic, wherein the collaboration criterion comprises that the stored artifact document be in the first epic. 18. The apparatus of claim 11, wherein the attribute of the stored artifact document comprises a stage of development of the product. 19. One or more non-transitory machine-readable media comprising program code for collaboration in an enterprise, the program code to:
create or assign a first artifact document that includes a description of a component of a product that is included in a product development cycle, and wherein the description is associated with a product development entity and includes a description of functionality of the product; in response to said creating or assigning the first artifact document, utilize a text-based search engine to identify search terms in the first artifact document; and for each of a plurality of artifact documents currently stored by a development enterprise,
determine whether the stored artifact document includes text that matches the identified search terms in the first artifact document to a degree that satisfies a matching threshold; and
in response to determining satisfaction of the matching threshold,
determine whether first artifact document satisfies a collaboration criterion comprising that the product development entity assigned to the first artifact be within N vertical levels of a product development entity within the development enterprise that is assigned the stored artifact document; and
in response to a that the collaboration criterion is satisfied, transmit to the product development entity a collaboration notification of the stored artifact document. 20. The one or more non-transitory machine-readable media of claim 19, wherein the first artifact document is created to satisfy a first enterprise objective among a limited set of enterprise objectives, wherein the collaboration criterion comprises that the stored artifact document be in a same enterprise objective within the limited set of enterprise objectives. | 2,100 |
4,969 | 14,420,208 | 2,127 | A detailed listing of all claims that are, or were, in the present application, irrespective of whether the claim(s) remain(s) under examination in the application is presented below. The claims are presented in ascending order and each includes one status identifier. Those claims not cancelled or withdrawn but amended by the current amendment utilize the following notations for amendment: 1. deleted matter is shown by strikethrough for six or more characters and double brackets for five or fewer characters; and 2. added matter is shown by underlining. | 1. A method implemented by computer for simulating karstification phenomena in a karst zone, comprising:
a/ receiving a geological model of the karst zone, this model comprising at least one local geological parameter that is a function of the local coordinates in this model; b/ simulating the displacement of a particle in the geological model, said particle having coordinates in said model, said displacement being probabilized by taking into account: at least the local geological parameter, and
at least one advective direction, this advective direction being a function of said coordinates of the particle in the geological model;
c/ modifying the geological parameter according to the displacement of the particle and according to an aggressivity of the particle;
in which the aggressivity of the particle is a function of said coordinates of the particle. 2. The method as claimed in claim 1, in which the geological model is meshed and in which the geological parameter is a function of at least one mesh in contact with the displacement of the particle. 3. The method as claimed in claim 1, in which the geological parameter is a function of a direction in which the displacement of the particle is simulated. 4. The method as claimed in claim 1, in which the simulation of the displacement of the particle is performed for a plurality of simulation times, and in that the geological model defined is a function of this simulation time. 5. The method as claimed in claim 1, in which the steps b/ and c/ are performed for a plurality of particles. 6. The method as claimed in claim 1, in which the method further comprises:
d/ determining a mixing zone between a first sub-part of the geological model and a second sub-part of the geological model, the first sub-part of the geological model modeling a sub-part comprising salt water and the second sub-part of the geological model modeling a sub-part comprising fresh water,
the first sub-part of the geological model modeling the sub-part comprising salt water comprising a zone adjacent to this mixing zone;
the second sub-part of the geological model modeling the sub-part comprising fresh water comprises a zone adjacent to this mixing zone;
and in which the aggressivity of the particle exhibits a local maximum in the mixing zone in a zone resulting from the union of:
the adjacent zone of the first sub-part,
the adjacent zone of the second sub-part, and
the mixing zone. 7. The method as claimed in claim 6, in which the simulation of the movement of the particle is performed for a plurality of simulation times, and in that at least one sub-part out of the first sub-part and the second sub-part is a function of this simulation time. 8. (canceled) 9. A device for simulating karstification phenomena in a karst zone, said device being configured to implement the following steps:
a/ receiving a geological model of the karst zone, this model comprising at least one local geological parameter that is a function of the local coordinates in this model; b/ simulating the displacement of a particle in the geological model, said particle having coordinates in said model, said displacement being probabilized by taking into account: at least the local geological parameter, and
at least one advective direction, this advective direction being a function of said coordinates of the particle in the geological model;
c/ modifying the geological parameter according to the displacement of the particle and according to an aggressivity of the particle; in which the aggressivity of the particle is a function of said coordinates of the particle. 10. 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 of a karst zone, this model comprising at least one local geological parameter that is a function of the local coordinates in this model; b/ simulating the displacement of a particle in the geological model, said particle having coordinates in said model, said displacement being probabilized by taking into account:
at least the local geological parameter, and
at least one advective direction, this advective direction being a function of said coordinates of the particle in the geological model;
c/ modifying the geological parameter according to the displacement of the particle and according to an aggressivity of the particle;
in which the aggressivity of the particle is a function of said coordinates of the particle. | A detailed listing of all claims that are, or were, in the present application, irrespective of whether the claim(s) remain(s) under examination in the application is presented below. The claims are presented in ascending order and each includes one status identifier. Those claims not cancelled or withdrawn but amended by the current amendment utilize the following notations for amendment: 1. deleted matter is shown by strikethrough for six or more characters and double brackets for five or fewer characters; and 2. added matter is shown by underlining.1. A method implemented by computer for simulating karstification phenomena in a karst zone, comprising:
a/ receiving a geological model of the karst zone, this model comprising at least one local geological parameter that is a function of the local coordinates in this model; b/ simulating the displacement of a particle in the geological model, said particle having coordinates in said model, said displacement being probabilized by taking into account: at least the local geological parameter, and
at least one advective direction, this advective direction being a function of said coordinates of the particle in the geological model;
c/ modifying the geological parameter according to the displacement of the particle and according to an aggressivity of the particle;
in which the aggressivity of the particle is a function of said coordinates of the particle. 2. The method as claimed in claim 1, in which the geological model is meshed and in which the geological parameter is a function of at least one mesh in contact with the displacement of the particle. 3. The method as claimed in claim 1, in which the geological parameter is a function of a direction in which the displacement of the particle is simulated. 4. The method as claimed in claim 1, in which the simulation of the displacement of the particle is performed for a plurality of simulation times, and in that the geological model defined is a function of this simulation time. 5. The method as claimed in claim 1, in which the steps b/ and c/ are performed for a plurality of particles. 6. The method as claimed in claim 1, in which the method further comprises:
d/ determining a mixing zone between a first sub-part of the geological model and a second sub-part of the geological model, the first sub-part of the geological model modeling a sub-part comprising salt water and the second sub-part of the geological model modeling a sub-part comprising fresh water,
the first sub-part of the geological model modeling the sub-part comprising salt water comprising a zone adjacent to this mixing zone;
the second sub-part of the geological model modeling the sub-part comprising fresh water comprises a zone adjacent to this mixing zone;
and in which the aggressivity of the particle exhibits a local maximum in the mixing zone in a zone resulting from the union of:
the adjacent zone of the first sub-part,
the adjacent zone of the second sub-part, and
the mixing zone. 7. The method as claimed in claim 6, in which the simulation of the movement of the particle is performed for a plurality of simulation times, and in that at least one sub-part out of the first sub-part and the second sub-part is a function of this simulation time. 8. (canceled) 9. A device for simulating karstification phenomena in a karst zone, said device being configured to implement the following steps:
a/ receiving a geological model of the karst zone, this model comprising at least one local geological parameter that is a function of the local coordinates in this model; b/ simulating the displacement of a particle in the geological model, said particle having coordinates in said model, said displacement being probabilized by taking into account: at least the local geological parameter, and
at least one advective direction, this advective direction being a function of said coordinates of the particle in the geological model;
c/ modifying the geological parameter according to the displacement of the particle and according to an aggressivity of the particle; in which the aggressivity of the particle is a function of said coordinates of the particle. 10. 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 of a karst zone, this model comprising at least one local geological parameter that is a function of the local coordinates in this model; b/ simulating the displacement of a particle in the geological model, said particle having coordinates in said model, said displacement being probabilized by taking into account:
at least the local geological parameter, and
at least one advective direction, this advective direction being a function of said coordinates of the particle in the geological model;
c/ modifying the geological parameter according to the displacement of the particle and according to an aggressivity of the particle;
in which the aggressivity of the particle is a function of said coordinates of the particle. | 2,100 |
4,970 | 13,939,380 | 2,137 | A system includes a device coupleable to a first memory. The device includes a second memory to cache data from the first memory. The second memory is to store a set of compressed pages of the first memory and a set of page descriptors. Each compressed page includes a set of compressed data blocks. Each page descriptor represents a corresponding page and includes a set of location identifiers that identify the locations of the compressed data blocks of the corresponding page in the second memory. The device further includes compression logic to compress data blocks of a page to be stored to the second memory and decompression logic to decompress compressed data blocks of a page accessed from the second memory. | 1. A system comprising:
a device coupleable to a first memory, the device comprising:
a second memory to cache data from the first memory, wherein the second memory is to store a set of compressed pages of the first memory and a set of page descriptors, each compressed page comprising a set of compressed data blocks, and each page descriptor representing a corresponding page and comprising a set of location identifiers that identify the locations of the compressed data blocks of the corresponding page in the second memory. 2. The system of claim 1, wherein the device further comprises:
compression logic to compress data blocks of a page to be stored to the second memory; and decompression logic to decompress compressed data blocks of a page accessed from the second memory. 3. The system of claim 1, further comprising:
the first memory, wherein the first memory comprises a non-volatile memory; and wherein the second memory comprises a volatile memory. 4. The system of claim 1, wherein:
the device comprises an integrated circuit (IC) package comprising the second memory and a processor, and the first memory comprises a memory device external to the IC package. 5. The system of claim 1, wherein:
each page descriptor includes an address value for the corresponding page; and the device further comprises:
control logic to, in response to a memory access request to the device, identify a compressed data block of a compressed page stored in the second memory as storing requested data based on the address values of the page descriptors, identify a location of the compressed data block in the second memory based on the location identifiers of a page descriptor associated with the page, and access the compressed data block from the identified location. 6. The system of claim 5, further comprising:
decompression logic to decompress the accessed compressed data block to generate a decompressed data block; and wherein the control logic further is to provide the decompressed data block for storage at the first memory. 7. The system of claim 5, wherein the control logic further is to provide the accessed compressed data block for storage at the first memory. 8. The system of claim 7, further comprising:
the first memory, wherein the first memory comprises:
decompression logic to decompress the accessed compressed data block to generate a decompressed data block for storage at a corresponding page of the first memory. 9. The system of claim 8, wherein the first memory further comprises:
compression logic to compress a data block of a page accessed from the first memory prior to transfer of the data block to the device. 10. A method comprising:
storing, at a first memory, a set of compressed pages from a second memory and a set of page descriptors, each compressed page comprising a set of compressed data blocks, and each page descriptor representing a corresponding page and comprising a set of location identifiers that identify the locations of the compressed data blocks of the corresponding page in the first memory. 11. The method of claim 10, further comprising:
in response to a memory access request to the device:
identifying a compressed page of the set of compressed pages as storing requested data based on the set of page descriptors;
identifying a location of a compressed data block of the identified compressed page that stores the requested data based on the set of location identifiers of the page descriptor associated with the identified compressed page; and
accessing the compressed data block from the identified location. 12. The method of claim 11, further comprising:
decompressing the accessed compressed data block to generate a decompressed data block. 13. The method of claim 12, further comprising:
providing the decompressed data block for storage at the first memory. 14. The method of claim 11, further comprising:
transmitting the accessed compressed data block to the first memory for storage. 15. The method of claim 14, further comprising:
decompressing, at the first memory, the accessed compressed data block to generate a decompressed data block; and storing the decompressed data block at the corresponding page of the second memory. 16. The method of claim 10, wherein storing the set of compressed pages comprises:
receiving, at the first memory, a page from the second memory; compressing the page to generate a set of compressed data blocks; storing the set of compressed data blocks at the first memory; generating a page descriptor, the page descriptor comprising location identifiers identifying the locations in the first memory of the compressed data blocks of the set; and storing the page descriptor to a page descriptor table in the first memory. 17. A non-transitory computer readable storage medium embodying a set of executable instructions, the set of executable instructions to manipulate a computer system to perform a portion of a process to fabricate at least part of a device, the device coupleable to a first memory and comprising:
a second memory to cache data from the first memory, wherein the second memory is to store a set of compressed pages of the first memory and a set of page descriptors, each compressed page comprising a set of compressed data blocks, and each page descriptor representing a corresponding page and comprising a set of location identifiers that identify the locations of the compressed data blocks of the corresponding page in the second memory. 18. The computer readable storage medium of claim 17, wherein the device further comprises:
compression logic to compress data blocks of a page to be stored to the second memory; and decompression logic to decompress compressed data blocks of a page accessed from the second memory. 19. The computer readable storage medium of claim 17, wherein:
each page descriptor includes an address value for the corresponding page; and the device further comprises:
control logic to, in response to a memory access request to the device, identify a compressed data block of a compressed page stored in the second memory as storing requested data based on the address values of the page descriptors, identify a location of the compressed data block in the second memory based on the location identifiers of a page descriptor associated with the page, and access the compressed data block from the identified location. 20. The computer readable storage medium of claim 19, wherein the device further comprises:
decompression logic to decompress the accessed compressed data block to generate a decompressed data block; and wherein the control logic further is to provide the decompressed data block for storage at the first memory. | A system includes a device coupleable to a first memory. The device includes a second memory to cache data from the first memory. The second memory is to store a set of compressed pages of the first memory and a set of page descriptors. Each compressed page includes a set of compressed data blocks. Each page descriptor represents a corresponding page and includes a set of location identifiers that identify the locations of the compressed data blocks of the corresponding page in the second memory. The device further includes compression logic to compress data blocks of a page to be stored to the second memory and decompression logic to decompress compressed data blocks of a page accessed from the second memory.1. A system comprising:
a device coupleable to a first memory, the device comprising:
a second memory to cache data from the first memory, wherein the second memory is to store a set of compressed pages of the first memory and a set of page descriptors, each compressed page comprising a set of compressed data blocks, and each page descriptor representing a corresponding page and comprising a set of location identifiers that identify the locations of the compressed data blocks of the corresponding page in the second memory. 2. The system of claim 1, wherein the device further comprises:
compression logic to compress data blocks of a page to be stored to the second memory; and decompression logic to decompress compressed data blocks of a page accessed from the second memory. 3. The system of claim 1, further comprising:
the first memory, wherein the first memory comprises a non-volatile memory; and wherein the second memory comprises a volatile memory. 4. The system of claim 1, wherein:
the device comprises an integrated circuit (IC) package comprising the second memory and a processor, and the first memory comprises a memory device external to the IC package. 5. The system of claim 1, wherein:
each page descriptor includes an address value for the corresponding page; and the device further comprises:
control logic to, in response to a memory access request to the device, identify a compressed data block of a compressed page stored in the second memory as storing requested data based on the address values of the page descriptors, identify a location of the compressed data block in the second memory based on the location identifiers of a page descriptor associated with the page, and access the compressed data block from the identified location. 6. The system of claim 5, further comprising:
decompression logic to decompress the accessed compressed data block to generate a decompressed data block; and wherein the control logic further is to provide the decompressed data block for storage at the first memory. 7. The system of claim 5, wherein the control logic further is to provide the accessed compressed data block for storage at the first memory. 8. The system of claim 7, further comprising:
the first memory, wherein the first memory comprises:
decompression logic to decompress the accessed compressed data block to generate a decompressed data block for storage at a corresponding page of the first memory. 9. The system of claim 8, wherein the first memory further comprises:
compression logic to compress a data block of a page accessed from the first memory prior to transfer of the data block to the device. 10. A method comprising:
storing, at a first memory, a set of compressed pages from a second memory and a set of page descriptors, each compressed page comprising a set of compressed data blocks, and each page descriptor representing a corresponding page and comprising a set of location identifiers that identify the locations of the compressed data blocks of the corresponding page in the first memory. 11. The method of claim 10, further comprising:
in response to a memory access request to the device:
identifying a compressed page of the set of compressed pages as storing requested data based on the set of page descriptors;
identifying a location of a compressed data block of the identified compressed page that stores the requested data based on the set of location identifiers of the page descriptor associated with the identified compressed page; and
accessing the compressed data block from the identified location. 12. The method of claim 11, further comprising:
decompressing the accessed compressed data block to generate a decompressed data block. 13. The method of claim 12, further comprising:
providing the decompressed data block for storage at the first memory. 14. The method of claim 11, further comprising:
transmitting the accessed compressed data block to the first memory for storage. 15. The method of claim 14, further comprising:
decompressing, at the first memory, the accessed compressed data block to generate a decompressed data block; and storing the decompressed data block at the corresponding page of the second memory. 16. The method of claim 10, wherein storing the set of compressed pages comprises:
receiving, at the first memory, a page from the second memory; compressing the page to generate a set of compressed data blocks; storing the set of compressed data blocks at the first memory; generating a page descriptor, the page descriptor comprising location identifiers identifying the locations in the first memory of the compressed data blocks of the set; and storing the page descriptor to a page descriptor table in the first memory. 17. A non-transitory computer readable storage medium embodying a set of executable instructions, the set of executable instructions to manipulate a computer system to perform a portion of a process to fabricate at least part of a device, the device coupleable to a first memory and comprising:
a second memory to cache data from the first memory, wherein the second memory is to store a set of compressed pages of the first memory and a set of page descriptors, each compressed page comprising a set of compressed data blocks, and each page descriptor representing a corresponding page and comprising a set of location identifiers that identify the locations of the compressed data blocks of the corresponding page in the second memory. 18. The computer readable storage medium of claim 17, wherein the device further comprises:
compression logic to compress data blocks of a page to be stored to the second memory; and decompression logic to decompress compressed data blocks of a page accessed from the second memory. 19. The computer readable storage medium of claim 17, wherein:
each page descriptor includes an address value for the corresponding page; and the device further comprises:
control logic to, in response to a memory access request to the device, identify a compressed data block of a compressed page stored in the second memory as storing requested data based on the address values of the page descriptors, identify a location of the compressed data block in the second memory based on the location identifiers of a page descriptor associated with the page, and access the compressed data block from the identified location. 20. The computer readable storage medium of claim 19, wherein the device further comprises:
decompression logic to decompress the accessed compressed data block to generate a decompressed data block; and wherein the control logic further is to provide the decompressed data block for storage at the first memory. | 2,100 |
4,971 | 14,327,506 | 2,199 | A heterogeneous processing system is described herein that provides a software hypervisor to autonomously control operating system thread scheduling across big and little cores without the operating system's awareness or involvement to improve energy efficiency or meet other processing goals. The system presents a finite set of virtualized compute cores to the operating system to which the system schedules threads for execution. Subsequently, the hypervisor intelligently controls the physical assignment and selection of which core(s) execute each thread to manage energy use or other processing requirements. By using a software hypervisor to abstract the underlying big and little computer architecture, the performance and power operating differences between the cores remain opaque to the operating system. The inherent indirection also decouples the release of hardware with new capabilities from the operating system release schedule. | 1. A computer-implemented method for providing operating system-decoupled heterogeneous computing through a hypervisor, the method comprising:
determining capabilities of two or more physical processing cores accessible to a computing device, wherein the capabilities include one or more power profiles offered by each physical processing core and performance characteristics of each physical processing core; accessing hypervisor policy information that specifies one or more goals for scheduling operating system threads on the physical processing cores; creating one or more virtual cores to expose to an operating system, wherein each virtual core isolates the operating system from determined differences in capabilities among the physical processing cores; and invoking the operating system and presenting the one or more virtual cores to the operating system while isolating the operating system from the physical processing cores. 2. The computer-implemented method of claim 1, further comprising:
activating the hypervisor, the hypervisor interfacing between the operating system and the physical processing cores; and identifying at least one operating system that the hypervisor will manage access and scheduling of the physical processing cores. 3. The computer-implemented method of claim 1, wherein the one or more goals include one or more of a performance goal and/or a power usage goal. 4. The computer-implemented method of claim 1, wherein the hypervisor policy information includes one or more of Minimum Power, Maximum Performance, Minimal Power Performance on Demand, and/or Maximum Performance Power Down on Idle. 5. The computer-implemented method of claim 1, further comprising:
receiving a thread scheduling request from the operating system to run a thread on an identified virtual core; and selecting at least one physical processing core on which to execute the thread. 6. The computer-implemented method of claim 5, wherein the selection is based on a scheduling policy and available system facilities. 7. The computer-implemented method of claim 6, wherein the scheduling policy is based on power usage. 8. A computer-readable storage medium, not comprising a signal per se, including instructions, upon execution, cause a processor to perform actions comprising:
determining capabilities of two or more physical processing cores accessible to a computing device, wherein the capabilities include one or more power profiles offered by each physical processing core and performance characteristics of each physical processing core; accessing hypervisor policy information that specifies one or more goals for scheduling operating system threads on the physical processing cores; creating one or more virtual cores to expose to an operating system, wherein each virtual core isolates the operating system from determined differences in capabilities among the physical processing cores; and invoking the operating system and presenting the one or more virtual cores to the operating system while isolating the operating system from the physical processing cores. 9. The computer-readable storage medium of claim 8, further comprising:
activating the hypervisor, the hypervisor interfacing between the operating system and the physical processing cores; and identifying at least one operating system that the hypervisor will manage access and scheduling of the physical processing cores. 10. The computer-readable storage medium of claim 8, wherein the one or more goals include one or more of a performance goal and/or a power usage goal. 11. The computer-readable storage medium of claim 8, wherein the hypervisor policy information includes one or more of Minimum Power, Maximum Performance, Minimal Power Performance on Demand, and/or Maximum Performance Power Down on Idle. 12. The computer-readable storage medium of claim 8, further comprising:
receiving a thread scheduling request from the operating system to run a thread on an identified virtual core; and selecting at least one physical processing core on which to execute the thread. 13. The computer-readable storage medium of claim 8, wherein the selection is based on a scheduling policy and available system facilities. 14. The computer-readable storage medium of claim 8, wherein the scheduling policy is based on power usage. 15. A computer system for providing operating system-decoupled heterogeneous computing, the system comprising:
two or more physical processing cores; a memory, the memory including:
hypervisor policy information that specifies one or more goals for scheduling operating system threads, wherein at least one goal is based on power usage; and
a hypervisor, interfacing between an operating system and the two or more physical processing cores, the hypervisor:
determining capabilities of the two or more physical processing cores, wherein the capabilities include one or more power profiles offered by each physical processing core and performance characteristics of each physical processing core,
creating one or more virtual cores to expose to the operating system based on the hypervisor policy information; and
invoking the operating system and presenting the one or more virtual cores to the operating system while isolating the operating system from the physical processing cores. 16. The computer system of claim 15, wherein the hypervisor policy information includes one or more of Minimum Power, Maximum Performance, Minimal Power, Performance on Demand, and/or Power Down on Idle. 17. The computer system of claim 15, further comprising:
receiving a thread scheduling request from the operating system to run a thread on an identified virtual core; and selecting at least one physical processing core on which to execute the thread. 18. The computer system of claim 17, wherein the selection is based on a scheduling policy and available system facilities. 19. The computer system of claim 17, wherein the hypervisor migrates the thread to another physical processing core after the thread has begun executing. 20. The computer system of claim 17, wherein the hypervisor employs processor voltage and frequency modifications to reduce power or increase performance up to a threshold before selecting a core. | A heterogeneous processing system is described herein that provides a software hypervisor to autonomously control operating system thread scheduling across big and little cores without the operating system's awareness or involvement to improve energy efficiency or meet other processing goals. The system presents a finite set of virtualized compute cores to the operating system to which the system schedules threads for execution. Subsequently, the hypervisor intelligently controls the physical assignment and selection of which core(s) execute each thread to manage energy use or other processing requirements. By using a software hypervisor to abstract the underlying big and little computer architecture, the performance and power operating differences between the cores remain opaque to the operating system. The inherent indirection also decouples the release of hardware with new capabilities from the operating system release schedule.1. A computer-implemented method for providing operating system-decoupled heterogeneous computing through a hypervisor, the method comprising:
determining capabilities of two or more physical processing cores accessible to a computing device, wherein the capabilities include one or more power profiles offered by each physical processing core and performance characteristics of each physical processing core; accessing hypervisor policy information that specifies one or more goals for scheduling operating system threads on the physical processing cores; creating one or more virtual cores to expose to an operating system, wherein each virtual core isolates the operating system from determined differences in capabilities among the physical processing cores; and invoking the operating system and presenting the one or more virtual cores to the operating system while isolating the operating system from the physical processing cores. 2. The computer-implemented method of claim 1, further comprising:
activating the hypervisor, the hypervisor interfacing between the operating system and the physical processing cores; and identifying at least one operating system that the hypervisor will manage access and scheduling of the physical processing cores. 3. The computer-implemented method of claim 1, wherein the one or more goals include one or more of a performance goal and/or a power usage goal. 4. The computer-implemented method of claim 1, wherein the hypervisor policy information includes one or more of Minimum Power, Maximum Performance, Minimal Power Performance on Demand, and/or Maximum Performance Power Down on Idle. 5. The computer-implemented method of claim 1, further comprising:
receiving a thread scheduling request from the operating system to run a thread on an identified virtual core; and selecting at least one physical processing core on which to execute the thread. 6. The computer-implemented method of claim 5, wherein the selection is based on a scheduling policy and available system facilities. 7. The computer-implemented method of claim 6, wherein the scheduling policy is based on power usage. 8. A computer-readable storage medium, not comprising a signal per se, including instructions, upon execution, cause a processor to perform actions comprising:
determining capabilities of two or more physical processing cores accessible to a computing device, wherein the capabilities include one or more power profiles offered by each physical processing core and performance characteristics of each physical processing core; accessing hypervisor policy information that specifies one or more goals for scheduling operating system threads on the physical processing cores; creating one or more virtual cores to expose to an operating system, wherein each virtual core isolates the operating system from determined differences in capabilities among the physical processing cores; and invoking the operating system and presenting the one or more virtual cores to the operating system while isolating the operating system from the physical processing cores. 9. The computer-readable storage medium of claim 8, further comprising:
activating the hypervisor, the hypervisor interfacing between the operating system and the physical processing cores; and identifying at least one operating system that the hypervisor will manage access and scheduling of the physical processing cores. 10. The computer-readable storage medium of claim 8, wherein the one or more goals include one or more of a performance goal and/or a power usage goal. 11. The computer-readable storage medium of claim 8, wherein the hypervisor policy information includes one or more of Minimum Power, Maximum Performance, Minimal Power Performance on Demand, and/or Maximum Performance Power Down on Idle. 12. The computer-readable storage medium of claim 8, further comprising:
receiving a thread scheduling request from the operating system to run a thread on an identified virtual core; and selecting at least one physical processing core on which to execute the thread. 13. The computer-readable storage medium of claim 8, wherein the selection is based on a scheduling policy and available system facilities. 14. The computer-readable storage medium of claim 8, wherein the scheduling policy is based on power usage. 15. A computer system for providing operating system-decoupled heterogeneous computing, the system comprising:
two or more physical processing cores; a memory, the memory including:
hypervisor policy information that specifies one or more goals for scheduling operating system threads, wherein at least one goal is based on power usage; and
a hypervisor, interfacing between an operating system and the two or more physical processing cores, the hypervisor:
determining capabilities of the two or more physical processing cores, wherein the capabilities include one or more power profiles offered by each physical processing core and performance characteristics of each physical processing core,
creating one or more virtual cores to expose to the operating system based on the hypervisor policy information; and
invoking the operating system and presenting the one or more virtual cores to the operating system while isolating the operating system from the physical processing cores. 16. The computer system of claim 15, wherein the hypervisor policy information includes one or more of Minimum Power, Maximum Performance, Minimal Power, Performance on Demand, and/or Power Down on Idle. 17. The computer system of claim 15, further comprising:
receiving a thread scheduling request from the operating system to run a thread on an identified virtual core; and selecting at least one physical processing core on which to execute the thread. 18. The computer system of claim 17, wherein the selection is based on a scheduling policy and available system facilities. 19. The computer system of claim 17, wherein the hypervisor migrates the thread to another physical processing core after the thread has begun executing. 20. The computer system of claim 17, wherein the hypervisor employs processor voltage and frequency modifications to reduce power or increase performance up to a threshold before selecting a core. | 2,100 |
4,972 | 14,759,704 | 2,145 | Embodiments are the creating of a plan artifact. A location, with respect to a virtual canvas, of each of a plurality of user interactions is identified. A plurality of noes are caused to be displayed on the virtual canvas wherein each node is displayed at a position corresponding to a location of one of the plurality of user interactions. Links between selected pairs of the displayed nodes are identified based on at least one of a user defined virtual canvas path and relative proximities between the displayed nodes. A connection is caused to be displayed between each pair of nodes identified as linked. A plan artifact defined at least in part by the displayed nodes and identified links is created. | 1. A memory resource storing instructions that when executed cause a processing resource to:
identify, with respect to a virtual canvas, a location of each of a plurality of user interactions; cause a display of a plurality of nodes on the virtual canvas wherein each node is displayed at a position corresponding to a location of one of the plurality of user interactions; identify links between selected pairs of the displayed nodes based on at least one of a user defined virtual canvas path and relative proximities between the displayed nodes; cause a display of a connection between each pair of nodes identified as linked; and create a plan artifact defined at least in part by the displayed nodes and identified links. 2. The memory resource of claim 1, wherein the instructions when executed cause the processing resource to, for each user interaction, cause a display of a pinwheel user interface control having a plurality of node buttons positioned around a center point, wherein the center point defines a position for placing a selected node on the virtual canvas, the selected node being a node associated with a user selected one of the node buttons. 3. The memory resource of claim 1, wherein:
the virtual canvas path is a path over the virtual canvas that passes through two or more of the displayed nodes, and the instructions includes instructions that when executed cause the processing resource to identify a user interaction with the virtual canvas defining the virtual canvas path. 4. The memory resource of claim 1, wherein:
the plurality of user selected nodes represent varying object types; the instructions, when executed cause the processing resource to examine the varying object types to identify link compatibilities between the plurality of displayed nodes; the instructions when executed cause the processing resource to identify the links between selected pairs of the displayed nodes based on the identified link compatibilities and at least one of a user defined virtual canvas path and relative proximities between the displayed nodes. 5. The memory resource of claim 1, wherein:
each displayed node functions as a control that when selected allows a user to modify node parameters associated with the node and each connection functions as a control that when selected allows a user to modify links parameters associated with the connection's corresponding link; and the instructions include instructions that when executed cause the processing resource to create the plan artifact defined by the displayed nodes the identified links, the node parameters, and the link parameters. 6. A system, comprising a computer readable resource storing instructions that when executed cause a processing resource to implement an interface engine and a link engine, wherein:
the interface engine is configured to cause a display of a virtual canvas and a control for selecting from among a plurality of available nodes, and in response to a user interaction with the control, cause a display of a plurality of user selected nodes positioned on the virtual canvas according to the user's interaction with the control; the link engine is configured to identify links between selected pairs of the displayed nodes based on at least one of a user defined virtual canvas path and relative proximities between the displayed nodes; the interface engine is configured to cause a display of a connection between each pair of nodes identified by the link engine as linked. 7. The system of claim 6, comprising a plan engine configured to create a plan artifact specifying the identified links and objects represented by the displayed nodes. 8. The system of claim 6, wherein the interface engine, upon user interaction with the virtual canvas at user selected position, causes a display of the control, the control including a plurality of node buttons positioned in a circular fashion around the position, the interface engine being configured to cause a selected one of the plurality of nodes to be displayed at the position according to a user interaction with one of the plurality of node buttons. 9. The system of claim 6, wherein,
the virtual canvas path is a path over the virtual canvas that passes through two or more of the displayed nodes, and the interface engine is configured to identify a user interaction with the virtual canvas, the interaction defining the virtual canvas path. 10. The system of claim 6, wherein:
each displayed node functions as a control that when selected allows a user to select parameters associated with an object represented by the node and each connections represents a link that when selected allows a user to select parameters associated with the link represented by that connection; the system comprises a plan engine configured to create a plan artifact specifying the identified links, objects represented by the displayed nodes, and the user selected parameters. 11. A method, comprising:
causing a display of a virtual canvas; in response to a plurality of user interactions with the displayed virtual canvas, causing a display of a plurality of user selected nodes at positions on the virtual canvas corresponding to locations of the plurality of user interactions; generating link data defining links between selected pairs of the displayed nodes, the pairs selected according to one or more of a user defined virtual canvas path and relative proximities of the plurality of user selected nodes as positioned on the virtual canvas; and utilizing the link data to cause a display of a connection between each of the selected pairs of the displayed nodes, each connection representing a corresponding link. 12. The method of claim 11, wherein:
the plurality of user selected nodes represents objects of varying types; the method comprising examining the varying object types to identify link compatibilities between the objects; generating link data comprises generating link data defining links between selected pairs of the displayed nodes, the pairs selected according to the identified link compatibilities and one or more of the user defined virtual canvas path and the relative proximities of the plurality of user selected nodes. 13. The method of claim 11, wherein causing a display of a plurality of user selected nodes comprises, for each user interaction with the virtual canvas:
causing a display of a pin wheel interface control having a plurality of node buttons positioned around a center point having a position on the virtual canvas corresponding to that user interaction; and causing a display of a user selected node corresponding to the user's interaction with a selected one of the node buttons, that node being positioned at the center point. 14. The method of claim 11, comprising identifying a user interaction with the virtual canvas, the user interaction defining the virtual canvas path, the virtual canvas path passing through two or more of the displayed nodes. 15. The method of claim 11, wherein:
each displayed node functions as a control that when selected allows a user to select a parameter for an object represented by that node and each displayed connection functions as a control that when selected allows a user to select a parameter for a link represented by that connection; and the method comprises creating a plan artifact defining the objects represented by the displayed nodes, the links represented by the displayed connections, and corresponding parameters selected by the user. | Embodiments are the creating of a plan artifact. A location, with respect to a virtual canvas, of each of a plurality of user interactions is identified. A plurality of noes are caused to be displayed on the virtual canvas wherein each node is displayed at a position corresponding to a location of one of the plurality of user interactions. Links between selected pairs of the displayed nodes are identified based on at least one of a user defined virtual canvas path and relative proximities between the displayed nodes. A connection is caused to be displayed between each pair of nodes identified as linked. A plan artifact defined at least in part by the displayed nodes and identified links is created.1. A memory resource storing instructions that when executed cause a processing resource to:
identify, with respect to a virtual canvas, a location of each of a plurality of user interactions; cause a display of a plurality of nodes on the virtual canvas wherein each node is displayed at a position corresponding to a location of one of the plurality of user interactions; identify links between selected pairs of the displayed nodes based on at least one of a user defined virtual canvas path and relative proximities between the displayed nodes; cause a display of a connection between each pair of nodes identified as linked; and create a plan artifact defined at least in part by the displayed nodes and identified links. 2. The memory resource of claim 1, wherein the instructions when executed cause the processing resource to, for each user interaction, cause a display of a pinwheel user interface control having a plurality of node buttons positioned around a center point, wherein the center point defines a position for placing a selected node on the virtual canvas, the selected node being a node associated with a user selected one of the node buttons. 3. The memory resource of claim 1, wherein:
the virtual canvas path is a path over the virtual canvas that passes through two or more of the displayed nodes, and the instructions includes instructions that when executed cause the processing resource to identify a user interaction with the virtual canvas defining the virtual canvas path. 4. The memory resource of claim 1, wherein:
the plurality of user selected nodes represent varying object types; the instructions, when executed cause the processing resource to examine the varying object types to identify link compatibilities between the plurality of displayed nodes; the instructions when executed cause the processing resource to identify the links between selected pairs of the displayed nodes based on the identified link compatibilities and at least one of a user defined virtual canvas path and relative proximities between the displayed nodes. 5. The memory resource of claim 1, wherein:
each displayed node functions as a control that when selected allows a user to modify node parameters associated with the node and each connection functions as a control that when selected allows a user to modify links parameters associated with the connection's corresponding link; and the instructions include instructions that when executed cause the processing resource to create the plan artifact defined by the displayed nodes the identified links, the node parameters, and the link parameters. 6. A system, comprising a computer readable resource storing instructions that when executed cause a processing resource to implement an interface engine and a link engine, wherein:
the interface engine is configured to cause a display of a virtual canvas and a control for selecting from among a plurality of available nodes, and in response to a user interaction with the control, cause a display of a plurality of user selected nodes positioned on the virtual canvas according to the user's interaction with the control; the link engine is configured to identify links between selected pairs of the displayed nodes based on at least one of a user defined virtual canvas path and relative proximities between the displayed nodes; the interface engine is configured to cause a display of a connection between each pair of nodes identified by the link engine as linked. 7. The system of claim 6, comprising a plan engine configured to create a plan artifact specifying the identified links and objects represented by the displayed nodes. 8. The system of claim 6, wherein the interface engine, upon user interaction with the virtual canvas at user selected position, causes a display of the control, the control including a plurality of node buttons positioned in a circular fashion around the position, the interface engine being configured to cause a selected one of the plurality of nodes to be displayed at the position according to a user interaction with one of the plurality of node buttons. 9. The system of claim 6, wherein,
the virtual canvas path is a path over the virtual canvas that passes through two or more of the displayed nodes, and the interface engine is configured to identify a user interaction with the virtual canvas, the interaction defining the virtual canvas path. 10. The system of claim 6, wherein:
each displayed node functions as a control that when selected allows a user to select parameters associated with an object represented by the node and each connections represents a link that when selected allows a user to select parameters associated with the link represented by that connection; the system comprises a plan engine configured to create a plan artifact specifying the identified links, objects represented by the displayed nodes, and the user selected parameters. 11. A method, comprising:
causing a display of a virtual canvas; in response to a plurality of user interactions with the displayed virtual canvas, causing a display of a plurality of user selected nodes at positions on the virtual canvas corresponding to locations of the plurality of user interactions; generating link data defining links between selected pairs of the displayed nodes, the pairs selected according to one or more of a user defined virtual canvas path and relative proximities of the plurality of user selected nodes as positioned on the virtual canvas; and utilizing the link data to cause a display of a connection between each of the selected pairs of the displayed nodes, each connection representing a corresponding link. 12. The method of claim 11, wherein:
the plurality of user selected nodes represents objects of varying types; the method comprising examining the varying object types to identify link compatibilities between the objects; generating link data comprises generating link data defining links between selected pairs of the displayed nodes, the pairs selected according to the identified link compatibilities and one or more of the user defined virtual canvas path and the relative proximities of the plurality of user selected nodes. 13. The method of claim 11, wherein causing a display of a plurality of user selected nodes comprises, for each user interaction with the virtual canvas:
causing a display of a pin wheel interface control having a plurality of node buttons positioned around a center point having a position on the virtual canvas corresponding to that user interaction; and causing a display of a user selected node corresponding to the user's interaction with a selected one of the node buttons, that node being positioned at the center point. 14. The method of claim 11, comprising identifying a user interaction with the virtual canvas, the user interaction defining the virtual canvas path, the virtual canvas path passing through two or more of the displayed nodes. 15. The method of claim 11, wherein:
each displayed node functions as a control that when selected allows a user to select a parameter for an object represented by that node and each displayed connection functions as a control that when selected allows a user to select a parameter for a link represented by that connection; and the method comprises creating a plan artifact defining the objects represented by the displayed nodes, the links represented by the displayed connections, and corresponding parameters selected by the user. | 2,100 |
4,973 | 15,172,755 | 2,157 | Methods, apparatuses, and computer-readable media for efficiently locating data feeds are disclosed that allow a user to receive a list of all available content from RSS feeds on a website. Users request a list of content by typing terms corresponding to the desired results into a designated URL address as a single string. The system parses the single string and determines what results to provide to the user based on a hierarchy of RSS items comprising pre-determined nodes, assets, categories, and keywords. Matching results are mashed up, an RSS feed template is applied to the results, and the list is presented to the user. | 1. A method executed by one or more computing devices for efficiently locating data feeds, the method comprising:
receiving, by at least one of the one or more computing devices, a universal resource identifier from a client device, wherein the universal resource identifier comprises a single string of characters entered as an address in a web browser and wherein the single string of characters comprises a plurality of characters corresponding to a domain operator and a plurality of characters corresponding to one or more user-entered terms; parsing, by at least one of the one or more computing devices, the single string of characters to identify the domain operator and the one or more user-entered terms; querying, by at least one of the one or more computing devices, an application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms; generating, by at least one of the one or more computing devices, a webpage containing one or more links to content of the data feeds corresponding to the one or more user-entered terms; and transmitting, by at least one of the one or more computing devices, the webpage to the client device. 2. The method of claim 1, further comprising:
identifying, by at least one of the one or more computing devices, each of the one or more user-entered terms as one of a predefined term and a not predefined term; wherein for each predefined term, querying the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms comprises navigating a node structure to identify data feeds categorized in the node structure under the predefined term; and wherein for each not predefined term, querying the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms comprises performing a keyword search of a set of data feeds to identify the data feeds containing the not predefined term. 3. The method of claim 2, wherein each identified predefined term is organized within a hierarchy of predefined terms. 4. The method of claim 1, wherein single string of characters comprises a plurality of characters corresponding to a second domain operator, the method further comprising:
querying, by at least one of the one or more computing devices, a second application programming interface corresponding to the second domain operator for data feeds corresponding to the one or more user-entered terms. 5. The method of claim 4, wherein generating the webpage containing one or more links to the content of the data feeds corresponding to the one or more user-entered terms comprises:
mashing up the content of the data feeds from the domain operator and the second domain operator. 6. The method of claim 1, wherein the data feeds are Really Simple Syndication feeds. 7. The method of claim 1, wherein single string of characters comprises a plurality of characters corresponding to at least two user-entered terms and a user-entered logical connector indicating a logical relation between the at least two user-entered terms, and wherein querying the application programming interface comprises:
querying the application programming interface corresponding to the domain operator for data feeds corresponding to the at least two user-entered terms logically connected by the user-entered logical connector. 8. An apparatus for efficiently locating data feeds, the apparatus comprising:
one or more processors; and one or more memories operatively coupled to at least one of the one or more processors and having instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
receive a universal resource identifier from a client device, wherein the universal resource identifier comprises a single string of characters entered as an address in a web browser and wherein the single string of characters comprises a plurality of characters corresponding to a domain operator and a plurality of characters corresponding to one or more user-entered terms;
parse the single string of characters to identify the domain operator and the one or more user-entered terms;
query an application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms;
generate a webpage containing one or more links to content of the data feeds corresponding to the one or more user-entered terms; and
transmit the webpage to the client device. 9. The apparatus of claim 8, wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
identify each of the one or more user-entered terms as one of a predefined term and a not predefined term; wherein for each predefined term, 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 query the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more processors to navigate a node structure to identify data feeds categorized in the node structure under the predefined term; and wherein for each not predefined term, 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 query the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more processors to perform a keyword search of a set of data feeds to identify the data feeds containing the not predefined term. 10. The apparatus of claim 9, wherein each identified predefined term is organized within a hierarchy of predefined terms. 11. The apparatus of claim 8, wherein single string of characters comprises a plurality of characters corresponding to a second domain operator and wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
query a second application programming interface corresponding to the second domain operator for data feeds corresponding to the one or more user-entered terms. 12. The apparatus of claim 11, 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 webpage containing one or more links to the content of the data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more processors to:
mash up the content of the data feeds from the domain operator and the second domain operator. 13. The apparatus of claim 8, wherein the data feeds are Really Simple Syndication feeds. 14. The apparatus of claim 8, wherein single string of characters comprises a plurality of characters corresponding to at least two user-entered terms and a user-entered logical connector indicating a logical relation between the at least two user-entered terms and 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 query the application programming interface further cause at least one of the one or more processors to:
query the application programming interface corresponding to the domain operator for data feeds corresponding to the at least two user-entered terms logically connected by the user-entered logical connector. 15. 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:
receive a universal resource identifier from a client device, wherein the universal resource identifier comprises a single string of characters entered as an address in a web browser and wherein the single string of characters comprises a plurality of characters corresponding to a domain operator and a plurality of characters corresponding to one or more user-entered terms; parse the single string of characters to identify the domain operator and the one or more user-entered terms; query an application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms; generate a webpage containing one or more links to content of the data feeds corresponding to the one or more user-entered terms; and transmit the webpage to the client device. 16. The at least one non-transitory computer-readable medium of claim 15, further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to:
identify each of the one or more user-entered terms as one of a predefined term and a not predefined term; wherein for each predefined term, 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 query the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more computing devices to navigate a node structure to identify data feeds categorized in the node structure under the predefined term; and wherein for each not predefined term, 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 query the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more computing devices to perform a keyword search of a set of data feeds to identify the data feeds containing the not predefined term. 17. The at least one non-transitory computer-readable medium of claim 16, wherein each identified predefined term is organized within a hierarchy of predefined terms. 18. The at least one non-transitory computer-readable medium of claim 15, wherein single string of characters comprises a plurality of characters corresponding to a second domain operator and further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to:
query a second application programming interface corresponding to the second domain operator for data feeds corresponding to the one or more user-entered terms. 19. The at least one non-transitory computer-readable medium of claim 18, 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 webpage containing one or more links to the content of the data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more computing devices to:
mash up the content of the data feeds from the domain operator and the second domain operator. 20. The at least one non-transitory computer-readable medium of claim 15, wherein the data feeds are Really Simple Syndication feeds. 21. The at least one non-transitory computer-readable medium of claim 15, wherein single string of characters comprises a plurality of characters corresponding to at least two user-entered terms and a user-entered logical connector indicating a logical relation between the at least two user-entered terms and 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 query the application programming interface further cause at least one of the one or more computing devices to:
query the application programming interface corresponding to the domain operator for data feeds corresponding to the at least two user-entered terms logically connected by the user-entered logical connector. | Methods, apparatuses, and computer-readable media for efficiently locating data feeds are disclosed that allow a user to receive a list of all available content from RSS feeds on a website. Users request a list of content by typing terms corresponding to the desired results into a designated URL address as a single string. The system parses the single string and determines what results to provide to the user based on a hierarchy of RSS items comprising pre-determined nodes, assets, categories, and keywords. Matching results are mashed up, an RSS feed template is applied to the results, and the list is presented to the user.1. A method executed by one or more computing devices for efficiently locating data feeds, the method comprising:
receiving, by at least one of the one or more computing devices, a universal resource identifier from a client device, wherein the universal resource identifier comprises a single string of characters entered as an address in a web browser and wherein the single string of characters comprises a plurality of characters corresponding to a domain operator and a plurality of characters corresponding to one or more user-entered terms; parsing, by at least one of the one or more computing devices, the single string of characters to identify the domain operator and the one or more user-entered terms; querying, by at least one of the one or more computing devices, an application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms; generating, by at least one of the one or more computing devices, a webpage containing one or more links to content of the data feeds corresponding to the one or more user-entered terms; and transmitting, by at least one of the one or more computing devices, the webpage to the client device. 2. The method of claim 1, further comprising:
identifying, by at least one of the one or more computing devices, each of the one or more user-entered terms as one of a predefined term and a not predefined term; wherein for each predefined term, querying the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms comprises navigating a node structure to identify data feeds categorized in the node structure under the predefined term; and wherein for each not predefined term, querying the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms comprises performing a keyword search of a set of data feeds to identify the data feeds containing the not predefined term. 3. The method of claim 2, wherein each identified predefined term is organized within a hierarchy of predefined terms. 4. The method of claim 1, wherein single string of characters comprises a plurality of characters corresponding to a second domain operator, the method further comprising:
querying, by at least one of the one or more computing devices, a second application programming interface corresponding to the second domain operator for data feeds corresponding to the one or more user-entered terms. 5. The method of claim 4, wherein generating the webpage containing one or more links to the content of the data feeds corresponding to the one or more user-entered terms comprises:
mashing up the content of the data feeds from the domain operator and the second domain operator. 6. The method of claim 1, wherein the data feeds are Really Simple Syndication feeds. 7. The method of claim 1, wherein single string of characters comprises a plurality of characters corresponding to at least two user-entered terms and a user-entered logical connector indicating a logical relation between the at least two user-entered terms, and wherein querying the application programming interface comprises:
querying the application programming interface corresponding to the domain operator for data feeds corresponding to the at least two user-entered terms logically connected by the user-entered logical connector. 8. An apparatus for efficiently locating data feeds, the apparatus comprising:
one or more processors; and one or more memories operatively coupled to at least one of the one or more processors and having instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
receive a universal resource identifier from a client device, wherein the universal resource identifier comprises a single string of characters entered as an address in a web browser and wherein the single string of characters comprises a plurality of characters corresponding to a domain operator and a plurality of characters corresponding to one or more user-entered terms;
parse the single string of characters to identify the domain operator and the one or more user-entered terms;
query an application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms;
generate a webpage containing one or more links to content of the data feeds corresponding to the one or more user-entered terms; and
transmit the webpage to the client device. 9. The apparatus of claim 8, wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
identify each of the one or more user-entered terms as one of a predefined term and a not predefined term; wherein for each predefined term, 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 query the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more processors to navigate a node structure to identify data feeds categorized in the node structure under the predefined term; and wherein for each not predefined term, 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 query the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more processors to perform a keyword search of a set of data feeds to identify the data feeds containing the not predefined term. 10. The apparatus of claim 9, wherein each identified predefined term is organized within a hierarchy of predefined terms. 11. The apparatus of claim 8, wherein single string of characters comprises a plurality of characters corresponding to a second domain operator and wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
query a second application programming interface corresponding to the second domain operator for data feeds corresponding to the one or more user-entered terms. 12. The apparatus of claim 11, 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 webpage containing one or more links to the content of the data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more processors to:
mash up the content of the data feeds from the domain operator and the second domain operator. 13. The apparatus of claim 8, wherein the data feeds are Really Simple Syndication feeds. 14. The apparatus of claim 8, wherein single string of characters comprises a plurality of characters corresponding to at least two user-entered terms and a user-entered logical connector indicating a logical relation between the at least two user-entered terms and 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 query the application programming interface further cause at least one of the one or more processors to:
query the application programming interface corresponding to the domain operator for data feeds corresponding to the at least two user-entered terms logically connected by the user-entered logical connector. 15. 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:
receive a universal resource identifier from a client device, wherein the universal resource identifier comprises a single string of characters entered as an address in a web browser and wherein the single string of characters comprises a plurality of characters corresponding to a domain operator and a plurality of characters corresponding to one or more user-entered terms; parse the single string of characters to identify the domain operator and the one or more user-entered terms; query an application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms; generate a webpage containing one or more links to content of the data feeds corresponding to the one or more user-entered terms; and transmit the webpage to the client device. 16. The at least one non-transitory computer-readable medium of claim 15, further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to:
identify each of the one or more user-entered terms as one of a predefined term and a not predefined term; wherein for each predefined term, 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 query the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more computing devices to navigate a node structure to identify data feeds categorized in the node structure under the predefined term; and wherein for each not predefined term, 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 query the application programming interface corresponding to the domain operator for data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more computing devices to perform a keyword search of a set of data feeds to identify the data feeds containing the not predefined term. 17. The at least one non-transitory computer-readable medium of claim 16, wherein each identified predefined term is organized within a hierarchy of predefined terms. 18. The at least one non-transitory computer-readable medium of claim 15, wherein single string of characters comprises a plurality of characters corresponding to a second domain operator and further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to:
query a second application programming interface corresponding to the second domain operator for data feeds corresponding to the one or more user-entered terms. 19. The at least one non-transitory computer-readable medium of claim 18, 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 webpage containing one or more links to the content of the data feeds corresponding to the one or more user-entered terms further cause at least one of the one or more computing devices to:
mash up the content of the data feeds from the domain operator and the second domain operator. 20. The at least one non-transitory computer-readable medium of claim 15, wherein the data feeds are Really Simple Syndication feeds. 21. The at least one non-transitory computer-readable medium of claim 15, wherein single string of characters comprises a plurality of characters corresponding to at least two user-entered terms and a user-entered logical connector indicating a logical relation between the at least two user-entered terms and 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 query the application programming interface further cause at least one of the one or more computing devices to:
query the application programming interface corresponding to the domain operator for data feeds corresponding to the at least two user-entered terms logically connected by the user-entered logical connector. | 2,100 |
4,974 | 11,866,248 | 2,159 | Systems and methods are provided that employ a client side browser application and server side website applications that use optimization, prefetching, and caching of user interactions. These are used in combination with mouseover callouts to provide browsable search result refinements and additional product information. The systems and methods can be applied to site search applications and site-wide navigation and can be integrated with web analytics solutions to optimize the user interface and information provided based on real time end user browsing trends. | 1. An active browsing system comprising:
a server application configured to serve content to a web browser and to provide a search service; and a client application configured to provide a search request to the server application and to receive a search result from the server application, the client application further configured to display the search result from the server application and to detect an event, wherein in response to the event the client application is further configured to obtain additional information and to display the additional information in association with the search result. 2. The active browsing system of claim 1 wherein the client application, in response to the event, obtains the additional information by providing an additional search request to the search service of the server application and receives the additional information in response to the additional search request. 3. The active browsing system of claim 1 wherein the client application, in response to the event, obtains the additional information from a cache where the additional information has been preloaded. 4. The active browsing system of claim 1 wherein the event is a mouse event, keyboard event, an audio event, a touch screen event, or an eye movement. 5. The active browsing system of claim 1 wherein the additional information is displayed in a callout. 6. The active browsing system of claim 1 wherein the client application is further configured to determine a most likely event and to obtain the additional information from the server application associated with the most likely event and to store the additional information in a memory, wherein if the event is the most likely event, the additional information is retrieved from the memory and displayed and wherein if the event is not the most likely event, the additional information is obtained via the search service and displayed. 7. The active browsing system of claim 6 wherein the most likely event is determined based upon historical browsing data. 8. A method for providing information to a browser comprising:
receiving a search request from the browser; providing an initial search result to the browser for display; detecting an event associated with a display of the initial search result; obtaining additional search result information in response to detecting the event; and providing the additional search result information to the browser for display over the initial search result. 9. The method of claim 8 wherein the step of obtaining further comprises:
receiving an additional search request from the browser; and providing the additional search result information to the browser. 10. The method of claim 8 wherein the step of obtaining further comprises obtaining the additional information from a cache where the additional information has been preloaded. 11. The method of claim 8 wherein the event is a mouse event, keyboard event, an audio event, a touch screen event, or an eye movement. 12. The method of claim 8 wherein the additional information is displayed in a callout. 13. A method for providing information to a browser comprising:
receiving a search request from the browser; providing a first search result to the browser; displaying the first search result by the web browser; determining a likely next event; obtaining additional search result information associated with the likely next event; storing the additional search result information in a memory; detecting an event associated with the displaying of the first search result by the web browser; retrieving the additional search result information from the memory if the detected event is the likely next event; and displaying the additional search result information over the first search result by the web browser. 14. The method of claim 13 wherein the memory is a cache. 15. The method of claim 13 further comprising:
determining if the detected event is the likely next event; and receiving a search request from the browser for the additional search result information, if the event is not the likely next event. 16. The method of claim 13 wherein the step of determining a likely next event further comprises analyzing historical browsing data. 17. The method of claim 13 wherein the search request is received by a server. 18. The method of claim 13 wherein the event is a mouse event, keyboard event, an audio event, a touch screen event, or an eye movement. 19. The method of claim 13 wherein the step of displaying the additional information further comprises displaying the additional information in a callout on the web page. | Systems and methods are provided that employ a client side browser application and server side website applications that use optimization, prefetching, and caching of user interactions. These are used in combination with mouseover callouts to provide browsable search result refinements and additional product information. The systems and methods can be applied to site search applications and site-wide navigation and can be integrated with web analytics solutions to optimize the user interface and information provided based on real time end user browsing trends.1. An active browsing system comprising:
a server application configured to serve content to a web browser and to provide a search service; and a client application configured to provide a search request to the server application and to receive a search result from the server application, the client application further configured to display the search result from the server application and to detect an event, wherein in response to the event the client application is further configured to obtain additional information and to display the additional information in association with the search result. 2. The active browsing system of claim 1 wherein the client application, in response to the event, obtains the additional information by providing an additional search request to the search service of the server application and receives the additional information in response to the additional search request. 3. The active browsing system of claim 1 wherein the client application, in response to the event, obtains the additional information from a cache where the additional information has been preloaded. 4. The active browsing system of claim 1 wherein the event is a mouse event, keyboard event, an audio event, a touch screen event, or an eye movement. 5. The active browsing system of claim 1 wherein the additional information is displayed in a callout. 6. The active browsing system of claim 1 wherein the client application is further configured to determine a most likely event and to obtain the additional information from the server application associated with the most likely event and to store the additional information in a memory, wherein if the event is the most likely event, the additional information is retrieved from the memory and displayed and wherein if the event is not the most likely event, the additional information is obtained via the search service and displayed. 7. The active browsing system of claim 6 wherein the most likely event is determined based upon historical browsing data. 8. A method for providing information to a browser comprising:
receiving a search request from the browser; providing an initial search result to the browser for display; detecting an event associated with a display of the initial search result; obtaining additional search result information in response to detecting the event; and providing the additional search result information to the browser for display over the initial search result. 9. The method of claim 8 wherein the step of obtaining further comprises:
receiving an additional search request from the browser; and providing the additional search result information to the browser. 10. The method of claim 8 wherein the step of obtaining further comprises obtaining the additional information from a cache where the additional information has been preloaded. 11. The method of claim 8 wherein the event is a mouse event, keyboard event, an audio event, a touch screen event, or an eye movement. 12. The method of claim 8 wherein the additional information is displayed in a callout. 13. A method for providing information to a browser comprising:
receiving a search request from the browser; providing a first search result to the browser; displaying the first search result by the web browser; determining a likely next event; obtaining additional search result information associated with the likely next event; storing the additional search result information in a memory; detecting an event associated with the displaying of the first search result by the web browser; retrieving the additional search result information from the memory if the detected event is the likely next event; and displaying the additional search result information over the first search result by the web browser. 14. The method of claim 13 wherein the memory is a cache. 15. The method of claim 13 further comprising:
determining if the detected event is the likely next event; and receiving a search request from the browser for the additional search result information, if the event is not the likely next event. 16. The method of claim 13 wherein the step of determining a likely next event further comprises analyzing historical browsing data. 17. The method of claim 13 wherein the search request is received by a server. 18. The method of claim 13 wherein the event is a mouse event, keyboard event, an audio event, a touch screen event, or an eye movement. 19. The method of claim 13 wherein the step of displaying the additional information further comprises displaying the additional information in a callout on the web page. | 2,100 |
4,975 | 14,793,706 | 2,132 | A computer program product is provided for efficiently managing storage in a multi-tiered storage system. The computer program product comprises a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a processor to cause the processor to receive a command from an application, where the command is directed to at least one object. The program instructions are further executable by the processor to cause the processor to determine storage for the at least one object in a multi-tiered storage system based on the command, and store the at least one object in accordance with the determined storage. | 1. A computer program product for efficiently managing storage in a multi-tiered storage system, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising:
receiving, by the processor, a command from an application, wherein the command is directed to at least one object; determining, by the processor, storage for the at least one object in a multi-tiered storage system based on the command; and storing, by the processor, the at least one object in accordance with the determined storage. 2. The computer program product of claim 1, wherein the command includes at least one of collocation and anti-collocation guidance from the application for the at least one object. 3. The computer program product of claim 1, wherein the command is included in metadata of at least one of: the at least one object, a container, and a storage tier. 4. The computer program product of claim 1:
wherein the command tags the at least one object as cold; wherein the storage for the at least one object is determined based on the at least one object being tagged as cold; and wherein storing the at least one object in accordance with the determined storage includes moving the at least one object to a lower storage tier. 5. The computer program product of claim 1, wherein the command includes a document that identifies the at least one object. 6. The computer program product of claim 5, wherein storing the at least one object in accordance with the determined storage includes moving the at least one object to a higher storage tier in response to receiving the document that identifies the at least one object. 7. The computer program product of claim 6, wherein the higher storage tier includes at least one of flash storage and a hard disk drive. 8. The computer program product of claim 1, wherein the command includes a document that identifies a size of the at least one object. 9. The computer program product of claim 8:
wherein the storage for the at least one object is determined based on the size of the at least one object; and wherein the storage for the at least one object is allocated for the at least one object based on the size of the at least one object prior to receiving the at least one object. 10. A computer program product for efficiently handling batch requests, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising:
receiving, by the processor, from a client, a message identifying at least one object; generating, by the processor, a response to the message based on the at least one object identified in the message; and sending, by the processor, the response to the client. 11. The computer program product of claim 10, wherein the message from the client indicates that the client intends to store the at least one object. 12. The computer program product of claim 11, wherein the response to the client identifies at least one node for direct access by the client for storing the at least one object to the at least one node, such that a load balancer is bypassed by the direct access by the client. 13. The computer program product of claim 10, wherein the message from the client indicates that the client intends to retrieve the at least one object from at least one node. 14. The computer program product of claim 10, wherein the response to the client identifies the at least one node for direct access by the client for retrieving the at least one object from the at least one node, such that a load balancer is bypassed by the direct access by the client. 15. A computer program product for optimizing storage of data copies, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising:
identifying, by the processor, at least two disks for storing at least two copies of data, wherein each of the disks is for storing one of the copies of the data selecting, by the processor, one of the disks of the at least two disks as a primary disk; and storing, by the processor, one of the copies of the data to the primary disk, wherein the one of the copies of the data stored to the primary disk is stored within a predetermined region of the primary disk. 16. The computer program product of claim 15, wherein the primary disk is divided into two or more regions, and the predetermined region of the primary disk includes a first 1/n of an area of the primary disk. 17. The computer program product of claim 16, wherein the predetermined region of the primary disk includes a first 1/3 of the area of the primary disk, and the copy of the data stored to the primary disk is stored within the first 1/3 of the area of the primary disk. 18. The computer program product of claim 16, wherein the copies of the data other than the copy stored to the primary disk are backup copies of the data, and the copies of the data other than the copy stored to the primary disk are stored to one or more other disks of the at least two disks. 19. The computer program product of claim 18, a read request for the data is received after storing the copies of the data. 20. The computer program product of claim 19, wherein the read request for the data is forwarded to the primary disk. | A computer program product is provided for efficiently managing storage in a multi-tiered storage system. The computer program product comprises a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a processor to cause the processor to receive a command from an application, where the command is directed to at least one object. The program instructions are further executable by the processor to cause the processor to determine storage for the at least one object in a multi-tiered storage system based on the command, and store the at least one object in accordance with the determined storage.1. A computer program product for efficiently managing storage in a multi-tiered storage system, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising:
receiving, by the processor, a command from an application, wherein the command is directed to at least one object; determining, by the processor, storage for the at least one object in a multi-tiered storage system based on the command; and storing, by the processor, the at least one object in accordance with the determined storage. 2. The computer program product of claim 1, wherein the command includes at least one of collocation and anti-collocation guidance from the application for the at least one object. 3. The computer program product of claim 1, wherein the command is included in metadata of at least one of: the at least one object, a container, and a storage tier. 4. The computer program product of claim 1:
wherein the command tags the at least one object as cold; wherein the storage for the at least one object is determined based on the at least one object being tagged as cold; and wherein storing the at least one object in accordance with the determined storage includes moving the at least one object to a lower storage tier. 5. The computer program product of claim 1, wherein the command includes a document that identifies the at least one object. 6. The computer program product of claim 5, wherein storing the at least one object in accordance with the determined storage includes moving the at least one object to a higher storage tier in response to receiving the document that identifies the at least one object. 7. The computer program product of claim 6, wherein the higher storage tier includes at least one of flash storage and a hard disk drive. 8. The computer program product of claim 1, wherein the command includes a document that identifies a size of the at least one object. 9. The computer program product of claim 8:
wherein the storage for the at least one object is determined based on the size of the at least one object; and wherein the storage for the at least one object is allocated for the at least one object based on the size of the at least one object prior to receiving the at least one object. 10. A computer program product for efficiently handling batch requests, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising:
receiving, by the processor, from a client, a message identifying at least one object; generating, by the processor, a response to the message based on the at least one object identified in the message; and sending, by the processor, the response to the client. 11. The computer program product of claim 10, wherein the message from the client indicates that the client intends to store the at least one object. 12. The computer program product of claim 11, wherein the response to the client identifies at least one node for direct access by the client for storing the at least one object to the at least one node, such that a load balancer is bypassed by the direct access by the client. 13. The computer program product of claim 10, wherein the message from the client indicates that the client intends to retrieve the at least one object from at least one node. 14. The computer program product of claim 10, wherein the response to the client identifies the at least one node for direct access by the client for retrieving the at least one object from the at least one node, such that a load balancer is bypassed by the direct access by the client. 15. A computer program product for optimizing storage of data copies, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising:
identifying, by the processor, at least two disks for storing at least two copies of data, wherein each of the disks is for storing one of the copies of the data selecting, by the processor, one of the disks of the at least two disks as a primary disk; and storing, by the processor, one of the copies of the data to the primary disk, wherein the one of the copies of the data stored to the primary disk is stored within a predetermined region of the primary disk. 16. The computer program product of claim 15, wherein the primary disk is divided into two or more regions, and the predetermined region of the primary disk includes a first 1/n of an area of the primary disk. 17. The computer program product of claim 16, wherein the predetermined region of the primary disk includes a first 1/3 of the area of the primary disk, and the copy of the data stored to the primary disk is stored within the first 1/3 of the area of the primary disk. 18. The computer program product of claim 16, wherein the copies of the data other than the copy stored to the primary disk are backup copies of the data, and the copies of the data other than the copy stored to the primary disk are stored to one or more other disks of the at least two disks. 19. The computer program product of claim 18, a read request for the data is received after storing the copies of the data. 20. The computer program product of claim 19, wherein the read request for the data is forwarded to the primary disk. | 2,100 |
4,976 | 14,094,190 | 2,159 | A database management system returns data from a database table in response to a database query. It does so by assessing whether the database table has any rows of data. When there are no rows of data in the table, execution of the query is halted until data is placed in the database table and then the data that placed in the database table is returned in response to the query. | 1. A computer-implemented method for use in returning data from a database table in response to a query, the method comprising:
assessing whether the database table has any rows of data; and when the database table has no rows of data:
halting execution of the query until data is placed in the database table; and thereafter
returning the data that was placed in the database table. 2. The method of claim 1, where returning the data further comprises resuming execution of the query. 3. The method of claim 1, further comprising, deleting the data from the database table after returning it. 4. A relational database management system for use in delivering data from a database table in response to a query, the system comprising:
one or more data-storage facilities that together store a database; and a database-management component configured to:
assess whether the database table has any rows; and
when the database table has no rows:
halt execution of the query until a row is created in the database table; and thereafter
return data from the row. 5. The system of claim 4, where the database-management component is also configured to resume execution of the query after the row is created in the database table. 6. The system of claim 4, where the database-management component is further configured to delete the row from the database table after it is returned the data from that row. | A database management system returns data from a database table in response to a database query. It does so by assessing whether the database table has any rows of data. When there are no rows of data in the table, execution of the query is halted until data is placed in the database table and then the data that placed in the database table is returned in response to the query.1. A computer-implemented method for use in returning data from a database table in response to a query, the method comprising:
assessing whether the database table has any rows of data; and when the database table has no rows of data:
halting execution of the query until data is placed in the database table; and thereafter
returning the data that was placed in the database table. 2. The method of claim 1, where returning the data further comprises resuming execution of the query. 3. The method of claim 1, further comprising, deleting the data from the database table after returning it. 4. A relational database management system for use in delivering data from a database table in response to a query, the system comprising:
one or more data-storage facilities that together store a database; and a database-management component configured to:
assess whether the database table has any rows; and
when the database table has no rows:
halt execution of the query until a row is created in the database table; and thereafter
return data from the row. 5. The system of claim 4, where the database-management component is also configured to resume execution of the query after the row is created in the database table. 6. The system of claim 4, where the database-management component is further configured to delete the row from the database table after it is returned the data from that row. | 2,100 |
4,977 | 14,794,610 | 2,166 | A method including receiving at least one search term (e.g. HIV) from an interface (e.g. a web browser on a personal computer). The method may search a network for documents (e.g. web pages) that include at least a portion of the search term. The method may determine the source (e.g. news outlets such as National Geographic or the National Enquirer) and sort the documents based on the source of the documents. A search engine may implement a method that uses the source to qualify (e.g. sort) search results based on the source of the documents. | 1.-20. (canceled) 21. An electronic device comprising:
a processor; a non-transitory storage medium coupled to the processor and configured to store instructions for execution by the processor to cause the electronic device to:
receive at least one search term from an interface;
search a network for documents that comprise at least a portion of the at least one search term;
determine a source of resulting documents of the search;
determine the relevance of the resulting documents based at least on the source of the resulting documents comprising qualifying the source of the resulting documents based at least on:
reputation of the source; and
equivalence to at least one pre-qualified source input by a user;
sort the resulting documents based at least on the qualifying the source of the resulting documents. 22. The electronic device of claim 21, wherein qualifying the source of the resulting documents comprises one or more of:
comparing the reputation of the source of each resulting document to others of the resulting documents; comparing a number of documents that are accessible from the source of each resulting document to the source of others of the resulting documents; or comparing the equivalence of each source of the resulting documents to at least one pre-qualified source input by a user. 23. The electronic device of claim 21, wherein qualifying the source of the resulting documents comprising comparing the established reputation of the source of each resulting document to other resulting documents. 24. The electronic device of claim 21, wherein qualifying the source of the resulting documents comprising comparing the equivalence to at least one pre-qualified source input by a user of each resulting document to other resulting documents. 25. The electronic device of claim 21, wherein:
the interface is at least one of an internet interface or an intranet interface; and the network is at least one of an internet network or an intranet network. 26. The electronic device of claim 21, wherein the documents include at least one of:
web pages; published articles; audio clips; video clips; or electronic documents. 27. The electronic device of claim 21, wherein the source is at least one of:
one or more person that authored documents; one or more person that published documents; one or more person quoted in documents; one or more person associated with the at least one search term; one or more organization that authored documents; one or more organization that published documents; one or more organization that are quoted in documents; or one or more organization associated with the at least one search term. 28. The electronic device of claim 21, wherein the determining the relevance of the documents is based on the source of the documents and the match quality of the documents to the at least one search term. 29. The electronic device of claim 21, comprising outputting to the interface identification of the documents in a manner based on the relative relevance of the documents. 30. The electronic device of claim 29, wherein the manner based on the relative relevance of the documents comprises listing the documents in order of most relevant to least relevant. 31. The electronic device of claim 21, comprising outputting to the interface identification of the source of the documents in a manner based on the relative qualification of the source. 32. The electronic device of claim 31, wherein the manner based on the relative qualification of the source comprises listing the sources in order of most qualified to least qualified. 33. The electronic device of claim 31, comprising outputting to the interface identification of the documents grouped by the source of the documents in a manner based on the relative qualification of the source. 34. The electronic device of claim 31, wherein the outputting comprises:
outputting at least one source of the documents; receiving a selection of at least one of the at least one source; and outputting at least one of the documents associated with the at least one selected source. 35. The electronic device of claim 34, wherein the outputting the at least one source of the documents comprises outputting qualification characteristics of the at least one source. 36. The electronic device of claim 21, wherein the reputation of the source is based on at least one of:
credibility of one or more person that authored documents; credibility of one or more person that published documents; credibility of one or more person quoted in documents; credibility of one or more person associated with the at least one search term; credibility of one or more organization that authored documents; credibility of one or more organization that published documents; credibility of one or more organization that are quoted in documents; or credibility of one or more organization associated with the at least one search term. 37. The electronic device of claim 21, wherein the qualifying the source of the documents is based on relative quantity of documents found during the search that are from the source. 38. The electronic device of claim 21, wherein:
the at least one search term includes at least one preferred source; and the qualifying the source of the documents is based on the source being one of the at least one preferred source. 39. A computer implemented method comprising:
receiving at least one search term from an interface; searching a network for documents that comprise at least a portion of the at least one search term; determining a source of resulting documents of the search; determining the relevance of the resulting documents based at least on the source of the resulting documents comprising qualifying the source of the resulting documents based at least on; reputation of the source; and equivalence to at least one pre-qualified source input by a user; sorting the resulting documents based at least on the qualifying the source of the resulting documents. 40. A non-transitory medium configured to store instructions to cause an electronic device to perform functions, the instructions comprising:
receiving at least one search term from an interface; searching a network for documents that comprise at least a portion of the at least one search term; determining a source of resulting documents of the search; determining the relevance of the resulting documents based at least on the source of the resulting documents comprising qualifying the source of the resulting documents based at least on;
reputation of the source; and
equivalence to at least one pre-qualified source input by a user;
sorting the resulting documents based at least on the qualifying the source of the resulting documents; wherein qualifying the source of the resulting documents comprises comparing the established reputation of the source and the equivalence to at least one pre-qualified source input of each resulting document to the established reputation of the source and the equivalence to at least one pre-qualified source input of each other resulting document. | A method including receiving at least one search term (e.g. HIV) from an interface (e.g. a web browser on a personal computer). The method may search a network for documents (e.g. web pages) that include at least a portion of the search term. The method may determine the source (e.g. news outlets such as National Geographic or the National Enquirer) and sort the documents based on the source of the documents. A search engine may implement a method that uses the source to qualify (e.g. sort) search results based on the source of the documents.1.-20. (canceled) 21. An electronic device comprising:
a processor; a non-transitory storage medium coupled to the processor and configured to store instructions for execution by the processor to cause the electronic device to:
receive at least one search term from an interface;
search a network for documents that comprise at least a portion of the at least one search term;
determine a source of resulting documents of the search;
determine the relevance of the resulting documents based at least on the source of the resulting documents comprising qualifying the source of the resulting documents based at least on:
reputation of the source; and
equivalence to at least one pre-qualified source input by a user;
sort the resulting documents based at least on the qualifying the source of the resulting documents. 22. The electronic device of claim 21, wherein qualifying the source of the resulting documents comprises one or more of:
comparing the reputation of the source of each resulting document to others of the resulting documents; comparing a number of documents that are accessible from the source of each resulting document to the source of others of the resulting documents; or comparing the equivalence of each source of the resulting documents to at least one pre-qualified source input by a user. 23. The electronic device of claim 21, wherein qualifying the source of the resulting documents comprising comparing the established reputation of the source of each resulting document to other resulting documents. 24. The electronic device of claim 21, wherein qualifying the source of the resulting documents comprising comparing the equivalence to at least one pre-qualified source input by a user of each resulting document to other resulting documents. 25. The electronic device of claim 21, wherein:
the interface is at least one of an internet interface or an intranet interface; and the network is at least one of an internet network or an intranet network. 26. The electronic device of claim 21, wherein the documents include at least one of:
web pages; published articles; audio clips; video clips; or electronic documents. 27. The electronic device of claim 21, wherein the source is at least one of:
one or more person that authored documents; one or more person that published documents; one or more person quoted in documents; one or more person associated with the at least one search term; one or more organization that authored documents; one or more organization that published documents; one or more organization that are quoted in documents; or one or more organization associated with the at least one search term. 28. The electronic device of claim 21, wherein the determining the relevance of the documents is based on the source of the documents and the match quality of the documents to the at least one search term. 29. The electronic device of claim 21, comprising outputting to the interface identification of the documents in a manner based on the relative relevance of the documents. 30. The electronic device of claim 29, wherein the manner based on the relative relevance of the documents comprises listing the documents in order of most relevant to least relevant. 31. The electronic device of claim 21, comprising outputting to the interface identification of the source of the documents in a manner based on the relative qualification of the source. 32. The electronic device of claim 31, wherein the manner based on the relative qualification of the source comprises listing the sources in order of most qualified to least qualified. 33. The electronic device of claim 31, comprising outputting to the interface identification of the documents grouped by the source of the documents in a manner based on the relative qualification of the source. 34. The electronic device of claim 31, wherein the outputting comprises:
outputting at least one source of the documents; receiving a selection of at least one of the at least one source; and outputting at least one of the documents associated with the at least one selected source. 35. The electronic device of claim 34, wherein the outputting the at least one source of the documents comprises outputting qualification characteristics of the at least one source. 36. The electronic device of claim 21, wherein the reputation of the source is based on at least one of:
credibility of one or more person that authored documents; credibility of one or more person that published documents; credibility of one or more person quoted in documents; credibility of one or more person associated with the at least one search term; credibility of one or more organization that authored documents; credibility of one or more organization that published documents; credibility of one or more organization that are quoted in documents; or credibility of one or more organization associated with the at least one search term. 37. The electronic device of claim 21, wherein the qualifying the source of the documents is based on relative quantity of documents found during the search that are from the source. 38. The electronic device of claim 21, wherein:
the at least one search term includes at least one preferred source; and the qualifying the source of the documents is based on the source being one of the at least one preferred source. 39. A computer implemented method comprising:
receiving at least one search term from an interface; searching a network for documents that comprise at least a portion of the at least one search term; determining a source of resulting documents of the search; determining the relevance of the resulting documents based at least on the source of the resulting documents comprising qualifying the source of the resulting documents based at least on; reputation of the source; and equivalence to at least one pre-qualified source input by a user; sorting the resulting documents based at least on the qualifying the source of the resulting documents. 40. A non-transitory medium configured to store instructions to cause an electronic device to perform functions, the instructions comprising:
receiving at least one search term from an interface; searching a network for documents that comprise at least a portion of the at least one search term; determining a source of resulting documents of the search; determining the relevance of the resulting documents based at least on the source of the resulting documents comprising qualifying the source of the resulting documents based at least on;
reputation of the source; and
equivalence to at least one pre-qualified source input by a user;
sorting the resulting documents based at least on the qualifying the source of the resulting documents; wherein qualifying the source of the resulting documents comprises comparing the established reputation of the source and the equivalence to at least one pre-qualified source input of each resulting document to the established reputation of the source and the equivalence to at least one pre-qualified source input of each other resulting document. | 2,100 |
4,978 | 14,361,637 | 2,169 | Methods, systems, and apparatus, including computer programs encoded on a computer-readable storage medium, for evaluating a creative. A method includes: identifying one or more selection keywords that are associated with a creative, the selection keywords used in determining when the creative is shown in response to received content requests that include one or more request keywords; identifying matching criteria for comparing the selection keywords and the request keywords, the matching criteria defined by a range from an exact match to a broad match and including a matching threshold, in the range; establishing a bid modifier associated with the matching criteria, the bid modifier modifying a bid associated with the creative based on an extent of a match determined between the selection keywords and the request keywords for a given content request; and evaluating the creative responsive to received content requests based on the matching criteria and the bid modifier. | 1. A method comprising:
identifying one or more selection keywords that are associated with a creative, the selection keywords used in determining when the creative is shown in response to received content requests that include one or more request keywords; identifying matching criteria for comparing the selection keywords and the request keywords, the matching criteria defined by a range from an exact match to a broad match, and wherein the matching criteria includes a matching threshold in the range; establishing a bid modifier that is associated with the matching criteria, the bid modifier modifying a bid associated with the creative based on an extent of a match that is determined between the selection keywords and the request keywords for a given content request; and evaluating the creative responsive to received content requests based at least in part on the matching criteria and the bid modifier. 2. The method of claim 1 wherein identifying the matching criteria includes suggesting a matching criteria for a content sponsor associated with the creative. 3. The method of claim 1 wherein identifying the matching criteria includes enabling selection of a matching criteria from an entire portion of the range by a content sponsor associated with the creative. 4. The method of claim 3 wherein enabling selection of matching criteria includes presenting an interface to a content sponsor associated with the creative, the interface including a control for specifying matching criteria in the range. 5. The method of claim 4 wherein the control is a sliding scale. 6. The method of claim 1 wherein establishing the bid modifier includes automatically selecting the bid modifier for a content sponsor associated with the creative. 7. The method of claim 1 wherein establishing the bid modifier further includes enabling selection of the bid modifier by a content sponsor associated with the creative. 8. The method of claim 6 wherein enabling selection of the bid modifier includes presenting an interface to the content sponsor associated with the creative, the interface including a control for adjusting the bid modifier over the range. 9. The method of claim 7 wherein the control enables selection of different bid modifiers for different portions of the range. 10. The method of claim 7 wherein the control enables selection of a function to define an adjustment of the bid modifier over the range. 11. The method of claim 1 further comprising receiving a selection of matching criteria in the range. 12. The method of claim 10 further comprising receiving a selection of a bid modifier to be associated with the received selection of the matching criteria. 13. The method of claim 1 further comprising establishing a plurality of bid modifiers to be applied to different matching criteria over the range, and applying one of the plurality of bid modifiers for a given request based on an extent of match between the selection keywords and request keywords for the given request. 14. The method of claim 1 further comprising:
receiving a request for content, the request for content including one or more request keywords;
comparing the request keywords to the selection keywords associated with the creative;
determining an extent of a match based on the comparison; and
determining when the matching criteria is satisfied based on the extent and, when so, using the bid modifier in evaluating whether to serve the creative responsive to the request. 15. The method of claim 1 wherein the creative is an advertisement. 16. A computer program product tangibly embodied in a computer-readable storage device and comprising instructions that, when executed by a processor, cause the processor to:
identify one or more selection keywords that are associated with a creative, the selection keywords used in determining when the creative is shown in response to received content requests that include one or more request keywords; identify matching criteria for comparing the selection keywords and the request keywords, the matching criteria defined by a range from an exact match to a broad match and including a matching threshold in the range, wherein the identifying includes presenting an interface to a content sponsor associated with the creative, the interface including a first control for specifying the matching threshold; establish a bid modifier that is associated with the matching criteria, the bid modifier modifying a bid associated with the creative based on an extent of a match that is determined between the selection keywords and the request keywords for a given content request, wherein the establishing includes enabling selection of the bid modifier by the content sponsor using a second control included in the interface; and evaluate the creative responsive to received content requests based at least in part on the matching criteria and the bid modifier. 17. The product of claim 16 wherein identifying the matching criteria includes providing a suggestion for the matching criteria to the content sponsor. 18. The product of claim 16 wherein the first control is a sliding scale. 19. The product of claim 16 wherein establishing the bid modifier includes automatically selecting the bid modifier for the content sponsor. 20. The product of claim 16 wherein the second control enables selection of different bid modifiers for different portions of the range. 21. The product of claim 16 wherein the second control enables selection of a function to define an adjustment of the bid modifier over the range. 22. The product of claim 16 wherein the creative is an advertisement. 23. A system comprising:
one or more processors; and one or more memory elements including instructions that when executed cause the one or more processors to: identify one or more selection keywords that are associated with a creative, the selection keywords used in determining when the creative is shown in response to received content requests that include one or more request keywords; identify matching criteria for comparing the selection keywords and the request keywords, the matching criteria defined by a range from an exact match to a broad match, and wherein the matching criteria includes a matching threshold in the range; establish a bid modifier that is associated with the matching criteria, the bid modifier modifying a bid associated with the creative based on an extent of a match that is determined between the selection keywords and the request keywords for a given content request; and evaluate the creative responsive to received content requests based at least in part on the matching criteria and the bid modifier. 24. The system of claim 23 wherein identifying the matching criteria includes suggesting a matching criteria for a content sponsor associated with the creative. 25. The system of claim 23 wherein identifying the matching criteria includes enabling selection of a matching criteria from an entire portion of the range by a content sponsor associated with the creative. 26. The system of claim 24 wherein enabling selection of matching criteria includes presenting an interface to a content sponsor associated with the creative, the interface including a control for specifying matching criteria in the range. 27. The system of claim 26 wherein the control is a sliding scale. 28. The system of claim 23 wherein establishing the bid modifier includes automatically selecting the bid modifier for a content sponsor associated with the creative. 29. The system of claim 23 wherein establishing the bid modifier further includes enabling selection of the bid modifier by a content sponsor associated with the creative. 30. The system of claim 29 wherein enabling selection of the bid modifier includes presenting an interface to the content sponsor associated with the creative, the interface including a control for adjusting the bid modifier over the range. | Methods, systems, and apparatus, including computer programs encoded on a computer-readable storage medium, for evaluating a creative. A method includes: identifying one or more selection keywords that are associated with a creative, the selection keywords used in determining when the creative is shown in response to received content requests that include one or more request keywords; identifying matching criteria for comparing the selection keywords and the request keywords, the matching criteria defined by a range from an exact match to a broad match and including a matching threshold, in the range; establishing a bid modifier associated with the matching criteria, the bid modifier modifying a bid associated with the creative based on an extent of a match determined between the selection keywords and the request keywords for a given content request; and evaluating the creative responsive to received content requests based on the matching criteria and the bid modifier.1. A method comprising:
identifying one or more selection keywords that are associated with a creative, the selection keywords used in determining when the creative is shown in response to received content requests that include one or more request keywords; identifying matching criteria for comparing the selection keywords and the request keywords, the matching criteria defined by a range from an exact match to a broad match, and wherein the matching criteria includes a matching threshold in the range; establishing a bid modifier that is associated with the matching criteria, the bid modifier modifying a bid associated with the creative based on an extent of a match that is determined between the selection keywords and the request keywords for a given content request; and evaluating the creative responsive to received content requests based at least in part on the matching criteria and the bid modifier. 2. The method of claim 1 wherein identifying the matching criteria includes suggesting a matching criteria for a content sponsor associated with the creative. 3. The method of claim 1 wherein identifying the matching criteria includes enabling selection of a matching criteria from an entire portion of the range by a content sponsor associated with the creative. 4. The method of claim 3 wherein enabling selection of matching criteria includes presenting an interface to a content sponsor associated with the creative, the interface including a control for specifying matching criteria in the range. 5. The method of claim 4 wherein the control is a sliding scale. 6. The method of claim 1 wherein establishing the bid modifier includes automatically selecting the bid modifier for a content sponsor associated with the creative. 7. The method of claim 1 wherein establishing the bid modifier further includes enabling selection of the bid modifier by a content sponsor associated with the creative. 8. The method of claim 6 wherein enabling selection of the bid modifier includes presenting an interface to the content sponsor associated with the creative, the interface including a control for adjusting the bid modifier over the range. 9. The method of claim 7 wherein the control enables selection of different bid modifiers for different portions of the range. 10. The method of claim 7 wherein the control enables selection of a function to define an adjustment of the bid modifier over the range. 11. The method of claim 1 further comprising receiving a selection of matching criteria in the range. 12. The method of claim 10 further comprising receiving a selection of a bid modifier to be associated with the received selection of the matching criteria. 13. The method of claim 1 further comprising establishing a plurality of bid modifiers to be applied to different matching criteria over the range, and applying one of the plurality of bid modifiers for a given request based on an extent of match between the selection keywords and request keywords for the given request. 14. The method of claim 1 further comprising:
receiving a request for content, the request for content including one or more request keywords;
comparing the request keywords to the selection keywords associated with the creative;
determining an extent of a match based on the comparison; and
determining when the matching criteria is satisfied based on the extent and, when so, using the bid modifier in evaluating whether to serve the creative responsive to the request. 15. The method of claim 1 wherein the creative is an advertisement. 16. A computer program product tangibly embodied in a computer-readable storage device and comprising instructions that, when executed by a processor, cause the processor to:
identify one or more selection keywords that are associated with a creative, the selection keywords used in determining when the creative is shown in response to received content requests that include one or more request keywords; identify matching criteria for comparing the selection keywords and the request keywords, the matching criteria defined by a range from an exact match to a broad match and including a matching threshold in the range, wherein the identifying includes presenting an interface to a content sponsor associated with the creative, the interface including a first control for specifying the matching threshold; establish a bid modifier that is associated with the matching criteria, the bid modifier modifying a bid associated with the creative based on an extent of a match that is determined between the selection keywords and the request keywords for a given content request, wherein the establishing includes enabling selection of the bid modifier by the content sponsor using a second control included in the interface; and evaluate the creative responsive to received content requests based at least in part on the matching criteria and the bid modifier. 17. The product of claim 16 wherein identifying the matching criteria includes providing a suggestion for the matching criteria to the content sponsor. 18. The product of claim 16 wherein the first control is a sliding scale. 19. The product of claim 16 wherein establishing the bid modifier includes automatically selecting the bid modifier for the content sponsor. 20. The product of claim 16 wherein the second control enables selection of different bid modifiers for different portions of the range. 21. The product of claim 16 wherein the second control enables selection of a function to define an adjustment of the bid modifier over the range. 22. The product of claim 16 wherein the creative is an advertisement. 23. A system comprising:
one or more processors; and one or more memory elements including instructions that when executed cause the one or more processors to: identify one or more selection keywords that are associated with a creative, the selection keywords used in determining when the creative is shown in response to received content requests that include one or more request keywords; identify matching criteria for comparing the selection keywords and the request keywords, the matching criteria defined by a range from an exact match to a broad match, and wherein the matching criteria includes a matching threshold in the range; establish a bid modifier that is associated with the matching criteria, the bid modifier modifying a bid associated with the creative based on an extent of a match that is determined between the selection keywords and the request keywords for a given content request; and evaluate the creative responsive to received content requests based at least in part on the matching criteria and the bid modifier. 24. The system of claim 23 wherein identifying the matching criteria includes suggesting a matching criteria for a content sponsor associated with the creative. 25. The system of claim 23 wherein identifying the matching criteria includes enabling selection of a matching criteria from an entire portion of the range by a content sponsor associated with the creative. 26. The system of claim 24 wherein enabling selection of matching criteria includes presenting an interface to a content sponsor associated with the creative, the interface including a control for specifying matching criteria in the range. 27. The system of claim 26 wherein the control is a sliding scale. 28. The system of claim 23 wherein establishing the bid modifier includes automatically selecting the bid modifier for a content sponsor associated with the creative. 29. The system of claim 23 wherein establishing the bid modifier further includes enabling selection of the bid modifier by a content sponsor associated with the creative. 30. The system of claim 29 wherein enabling selection of the bid modifier includes presenting an interface to the content sponsor associated with the creative, the interface including a control for adjusting the bid modifier over the range. | 2,100 |
4,979 | 13,705,515 | 2,153 | Methods, systems, and software are disclosed herein for facilitating personas in communication exchange environments. Aspects of the disclosure include search requests to search for relevant personas. In response to each of the search requests, different contact sources are searched for any relevant contacts. Any relevant personas can then be returned having contact information assembled from the relevant contacts. | 1. One or more computer readable storage media having stored thereon program instructions for facilitating a communication exchange environment that, when executed by a computing system, direct the computing system to at least:
in response to a search request comprising search criteria with which to search for relevant personas, identify a plurality of persona identities based on the search criteria; in response to identifying the plurality of persona identities, identify in a plurality of contact sources a plurality of contacts associated with the plurality of persona identities; and initiate a reply to the search request comprising a plurality of personas, each of the plurality of personas corresponding to a persona identity of the plurality of persona identities and comprising contact information assembled from at least a portion of the plurality of contacts. 2. The one or more computer readable storage media of claim 1 wherein, for at least one persona of the plurality of personas, the portion of the plurality of contacts from which the contact information is assembled comprises a first contact identified from a first contact source of the plurality of contact sources and a second contact identified from a second contact source of the plurality of contact sources. 3. The one or more computer readable storage media of claim 2 wherein, for the at least one persona of the plurality of personas, the persona identity represents a person and the contact information comprises a first email address for the person assembled from the first contact and a second email address for the person assembled from the second contact. 4. The one or more computer readable storage media of claim 3 wherein to initiate the reply, the program instructions further direct the computing system to communicate with a communication application that initiated the search request. 5. The one or more computer readable storage media of claim 4 wherein the search request further comprises reply criteria with which to populate the relevant personas and wherein the program instructions further direct the computing system to assemble the contact information from the portion of the plurality of contacts based on the reply criteria. 6. The one or more computer readable storage media of claim 1 wherein the search criteria comprises a search string, the search string having been input while initiating a communication to identify a person associated with the communication. 7. The one or more computer readable storage media of claim 1 wherein the program instructions, to assemble the contact information from at least the portion of the plurality of contacts, further direct the computing system to interface with a contacts folder to retrieve at least a portion of the contact information and interface with an organization directory service to retrieve at least another portion of the contact information. 8. The one or more computer readable storage media of claim 1 wherein the program instructions, to assemble the contact information from at least the portion of the plurality of contacts, further direct the computing system to interface with a contacts folder to retrieve at least a portion of the contact information and interface with a social network service to retrieve at least another portion of the contact information. 9. A computing apparatus comprising:
one or more computer readable storage media; and program instructions stored on the computer readable storage media for facilitating a communication exchange environment that, when executed by a processing system, direct the processing system to at least:
initiate a search request comprising search criteria with which to search for any contacts in a plurality of different contact sources with which to generate personas;
receive at least one persona in reply to the search request, the at last one persona comprising contact information assembled from a plurality of different contacts in the plurality of different contact sources; and
initiate presentation of a view of the at least one persona, the view comprising at least a portion of the contact information. 10. The computing apparatus of claim 9 comprising the processing system coupled with the one or more computer readable storage media by computer readable communication media, the processing system configured to execute the program instructions. 11. The computing apparatus of claim 9 wherein the program instructions comprise a communication application and wherein the communication application communicates the search request to a communication exchange system, and wherein the search request further comprises reply criteria by which the communication exchange system assembles the contact information. 12. The computing apparatus of claim 9 wherein the search criteria comprises a search string, the search string input while initiating a communication to identify a person associated with the communication. 13. The computing apparatus of claim 9 wherein the plurality of different contact sources comprises a contacts folder and an organization directory service. 14. The computing apparatus of claim 9 wherein the plurality of different contact sources comprises a contacts folder and a social networking service. 15. A method of operating a communication exchange system to facilitate personas in a communication exchange environment, the method comprising:
receiving a plurality of search requests to search for relevant personas initiated by a plurality of application platforms in the communication exchange environment; in response to each of the plurality of search requests, searching a plurality of different contact sources for any relevant contacts; and returning a plurality of relevant personas to the plurality of application platforms in the communication exchange environment, each of the plurality of relevant personas comprising contact information assembled from the relevant contacts. 16. The method of claim 15 wherein each of the plurality of search requests comprises search criteria used when searching the plurality of different contact sources for the relevant contacts. 17. The method of claim 15 wherein each of the plurality of application platforms in the communication exchange environment includes a communication application and wherein the search criteria comprises a search string input to the communication application when initiating a communication. 18. The method of claim 15 wherein each of the plurality of search requests further comprises reply criteria specifying with which portions of the relevant contacts to generate the contact information. 19. The method of claim 15 wherein the plurality of different contact sources comprises a contacts folder and an organization directory service. 20. The method of claim 15 wherein the plurality of different contact sources comprises a contacts folder and a social networking service. | Methods, systems, and software are disclosed herein for facilitating personas in communication exchange environments. Aspects of the disclosure include search requests to search for relevant personas. In response to each of the search requests, different contact sources are searched for any relevant contacts. Any relevant personas can then be returned having contact information assembled from the relevant contacts.1. One or more computer readable storage media having stored thereon program instructions for facilitating a communication exchange environment that, when executed by a computing system, direct the computing system to at least:
in response to a search request comprising search criteria with which to search for relevant personas, identify a plurality of persona identities based on the search criteria; in response to identifying the plurality of persona identities, identify in a plurality of contact sources a plurality of contacts associated with the plurality of persona identities; and initiate a reply to the search request comprising a plurality of personas, each of the plurality of personas corresponding to a persona identity of the plurality of persona identities and comprising contact information assembled from at least a portion of the plurality of contacts. 2. The one or more computer readable storage media of claim 1 wherein, for at least one persona of the plurality of personas, the portion of the plurality of contacts from which the contact information is assembled comprises a first contact identified from a first contact source of the plurality of contact sources and a second contact identified from a second contact source of the plurality of contact sources. 3. The one or more computer readable storage media of claim 2 wherein, for the at least one persona of the plurality of personas, the persona identity represents a person and the contact information comprises a first email address for the person assembled from the first contact and a second email address for the person assembled from the second contact. 4. The one or more computer readable storage media of claim 3 wherein to initiate the reply, the program instructions further direct the computing system to communicate with a communication application that initiated the search request. 5. The one or more computer readable storage media of claim 4 wherein the search request further comprises reply criteria with which to populate the relevant personas and wherein the program instructions further direct the computing system to assemble the contact information from the portion of the plurality of contacts based on the reply criteria. 6. The one or more computer readable storage media of claim 1 wherein the search criteria comprises a search string, the search string having been input while initiating a communication to identify a person associated with the communication. 7. The one or more computer readable storage media of claim 1 wherein the program instructions, to assemble the contact information from at least the portion of the plurality of contacts, further direct the computing system to interface with a contacts folder to retrieve at least a portion of the contact information and interface with an organization directory service to retrieve at least another portion of the contact information. 8. The one or more computer readable storage media of claim 1 wherein the program instructions, to assemble the contact information from at least the portion of the plurality of contacts, further direct the computing system to interface with a contacts folder to retrieve at least a portion of the contact information and interface with a social network service to retrieve at least another portion of the contact information. 9. A computing apparatus comprising:
one or more computer readable storage media; and program instructions stored on the computer readable storage media for facilitating a communication exchange environment that, when executed by a processing system, direct the processing system to at least:
initiate a search request comprising search criteria with which to search for any contacts in a plurality of different contact sources with which to generate personas;
receive at least one persona in reply to the search request, the at last one persona comprising contact information assembled from a plurality of different contacts in the plurality of different contact sources; and
initiate presentation of a view of the at least one persona, the view comprising at least a portion of the contact information. 10. The computing apparatus of claim 9 comprising the processing system coupled with the one or more computer readable storage media by computer readable communication media, the processing system configured to execute the program instructions. 11. The computing apparatus of claim 9 wherein the program instructions comprise a communication application and wherein the communication application communicates the search request to a communication exchange system, and wherein the search request further comprises reply criteria by which the communication exchange system assembles the contact information. 12. The computing apparatus of claim 9 wherein the search criteria comprises a search string, the search string input while initiating a communication to identify a person associated with the communication. 13. The computing apparatus of claim 9 wherein the plurality of different contact sources comprises a contacts folder and an organization directory service. 14. The computing apparatus of claim 9 wherein the plurality of different contact sources comprises a contacts folder and a social networking service. 15. A method of operating a communication exchange system to facilitate personas in a communication exchange environment, the method comprising:
receiving a plurality of search requests to search for relevant personas initiated by a plurality of application platforms in the communication exchange environment; in response to each of the plurality of search requests, searching a plurality of different contact sources for any relevant contacts; and returning a plurality of relevant personas to the plurality of application platforms in the communication exchange environment, each of the plurality of relevant personas comprising contact information assembled from the relevant contacts. 16. The method of claim 15 wherein each of the plurality of search requests comprises search criteria used when searching the plurality of different contact sources for the relevant contacts. 17. The method of claim 15 wherein each of the plurality of application platforms in the communication exchange environment includes a communication application and wherein the search criteria comprises a search string input to the communication application when initiating a communication. 18. The method of claim 15 wherein each of the plurality of search requests further comprises reply criteria specifying with which portions of the relevant contacts to generate the contact information. 19. The method of claim 15 wherein the plurality of different contact sources comprises a contacts folder and an organization directory service. 20. The method of claim 15 wherein the plurality of different contact sources comprises a contacts folder and a social networking service. | 2,100 |
4,980 | 11,543,635 | 2,157 | A system may include an enhancement unit and a matching unit. The enhancement unit may be to compute an enhanced request set of keywords that include keywords of a request set of keywords of a service request and a related keyword. The related keyword may be represented by an ontology concept that has a relation to a further ontology concept representing a keyword of the request set. The matching unit may be to identify a service match the service request by computing a similarity between the enhanced request set of keywords and a service set of keywords of the service. | 1. A system comprising:
an enhancement unit to compute an enhanced request set of keywords comprising keywords of a request set of keywords of a service request and a related keyword, the related keyword being represented by an ontology concept that has a relation to a further ontology concept representing a keyword of the request set of keywords; and a matching unit to identify a service to match the service request by computing a similarity between the enhanced request set of keywords and a service set of keywords of the service. 2. The system of claim 1, the ontology concept being a concept of a first ontology and the further ontology concept being a concept of a second ontology, the first ontology being linked to the second ontology by a relation between a first concept of the first ontology and a second concept of the second ontology. 3. The system of claim 1, the ontology concept being a concept of a domain ontology. 4. The system of claim 1, the enhancement unit further to: identify a further related keyword, the further related keyword being represented by a concept of a domain independent ontology, the concept of the domain independent ontology having a relation to a still further ontology concept that represents a further keyword of the request set of keywords; and specify a service category of the service using the further related keyword. 5. The system of claim 1, the matching unit further to compute the similarity by identifying a reduced representation of the enhanced request set of keywords, by identifying a further reduced representation of the service set of keywords, and by identifying the similarity with a value to which the reduced representation and the further reduced representation are mapped. 6. The system of claim 5, the reduced representation and the further reduced representation comprising representations of selected correlations between keywords of documents related to a plurality of services and the documents related to the plurality of services. 7. The system of claim 6, the matching unit to compute the similarity by using latent semantic indexing. 8. The system of claim 1, the matching unit to further rank the identified service with respect to a further service according to the similarity between the enhanced request set of keywords and the service set of keywords. 9. The system of claim 1, further comprising a ranking unit to rank the identified service with respect to a further service based on any one of a group of criteria including: quality weights for quality of service parameters of the identified service and a usage index of the identified service. 10. The system of claim 1, further comprising a mapping unit to identify a semantic service that is to match the service request and that is annotated according to a service ontology by identifying a request ontology having concepts representing one or more keywords of the request set of keywords and by using a mapping between the concepts representing the one or more keywords and concepts of the semantic service to compute a number of concepts related to the service request and the semantic service. 11. The system of claim 1, further comprising a preprocessing unit to parse the service request and to identify the keywords of the request set of keywords with terms of the service request in a standardized format. 12. The system of claim 1, further comprising a preprocessing unit to parse a document related to the service and to identify the keywords of the service set of keywords with terms of the document in a standardized format. 13. The system of claim 12, the preprocessing unit further to identify a keyword of the service set of keywords with a term extracted from any one of a group of tags including: a document tag of a document related to the service and a tag of an operation parameter of the service. 14. A method comprising:
computing an enhanced request set of keywords comprising keywords of a request set of keywords of a service request and a related keyword, the related keyword being represented by an ontology concept that has a relation to a further ontology concept representing a keyword of the request set of keywords; and identifying a service to match the service request by computing a similarity between the enhanced request set of keywords and a service set of keywords of the service. 15. The method of claim 14, the ontology concept being a concept of a first ontology and the further ontology concept being a concept of a second ontology, the first ontology being linked to the second ontology by a relation between a first concept of the first ontology and a second concept of the second ontology. 16. The method of claim 14, computing the enhanced request set of keywords comprising identifying a domain ontology and searching the domain ontology to identify the ontology concept. 17. The method of claim 14, further comprising: identifying a further related keyword, the further related keyword being represented by a concept of a domain independent ontology, the concept of the domain independent ontology having a relation to a still further ontology concept that represents a further keyword of the request set of keywords; and specifying a service category of the service using the further related keyword. 18. The method of claim 14, computing the similarity comprising identifying a reduced representation of the enhanced request set of keywords, identifying a further reduced representation of the service set of keywords, and identifying the similarity with a value to which the reduced representation and the further reduced representation are mapped. 19. The method of claim 18, the reduced representation and the further reduced representation comprising representations of selected correlations between keywords of documents related to a plurality of services and the documents related to the plurality of services. 20. The method of claim 19, computing the similarity by using latent semantic indexing. 21. The method of claim 14, further ranking the identified service with respect to a further service according to the similarity between the enhanced request set of keywords and the service set of keywords. 22. The method of claim 14, further ranking the identified service with respect to a further service based on any one of a group of criteria including: quality weights for quality of service parameters of the identified service and a usage index of the identified service. 23. The method of claim 14, further identifying a semantic service to match the service request and annotated according to a service ontology by identifying a request ontology having concepts representing one or more keywords of the request set of keywords and by using a mapping between the concepts representing the one or more keywords and concepts of the semantic service to compute a number of concepts related to the service request and the semantic service. 24. The method of claim 14, further parsing the service request and identifying the keywords of the request set of keywords with terms of the service request in a standardized format. 25. The method of claim 14, further parsing a document related to the service and identifying the keywords of the service set of keywords with terms of the document in a standardized format. 26. The method of claim 25, identifying a keyword of the service set of keywords with a term extracted from any one of a group of tags including: a document tag of a document related to the service and a tag of an operation parameter of the service. 27. A computer program product having instructions that are executable by a computer system, the computer program product comprising instructions of: an enhancement module to compute an enhanced request set of keywords comprising keywords of a request set of keywords of a service request and a related keyword, the related keyword being represented by an ontology concept that has a relation to a further ontology concept representing a keyword of the request set of keywords; and
a matching module to identify a service to match the service request by computing a similarity between the enhanced request set of keywords and a service set of keywords of the service. 28. A system comprising:
first means for computing an enhanced request set of keywords comprising keywords of a request set of keywords of a service request and a related keyword, the related keyword being represented by an ontology concept that has a relation to a further ontology concept representing a keyword of the request set of keywords; and second means for identifying a service to match the service request by computing a similarity between the enhanced request set of keywords and a service set of keywords of the service. | A system may include an enhancement unit and a matching unit. The enhancement unit may be to compute an enhanced request set of keywords that include keywords of a request set of keywords of a service request and a related keyword. The related keyword may be represented by an ontology concept that has a relation to a further ontology concept representing a keyword of the request set. The matching unit may be to identify a service match the service request by computing a similarity between the enhanced request set of keywords and a service set of keywords of the service.1. A system comprising:
an enhancement unit to compute an enhanced request set of keywords comprising keywords of a request set of keywords of a service request and a related keyword, the related keyword being represented by an ontology concept that has a relation to a further ontology concept representing a keyword of the request set of keywords; and a matching unit to identify a service to match the service request by computing a similarity between the enhanced request set of keywords and a service set of keywords of the service. 2. The system of claim 1, the ontology concept being a concept of a first ontology and the further ontology concept being a concept of a second ontology, the first ontology being linked to the second ontology by a relation between a first concept of the first ontology and a second concept of the second ontology. 3. The system of claim 1, the ontology concept being a concept of a domain ontology. 4. The system of claim 1, the enhancement unit further to: identify a further related keyword, the further related keyword being represented by a concept of a domain independent ontology, the concept of the domain independent ontology having a relation to a still further ontology concept that represents a further keyword of the request set of keywords; and specify a service category of the service using the further related keyword. 5. The system of claim 1, the matching unit further to compute the similarity by identifying a reduced representation of the enhanced request set of keywords, by identifying a further reduced representation of the service set of keywords, and by identifying the similarity with a value to which the reduced representation and the further reduced representation are mapped. 6. The system of claim 5, the reduced representation and the further reduced representation comprising representations of selected correlations between keywords of documents related to a plurality of services and the documents related to the plurality of services. 7. The system of claim 6, the matching unit to compute the similarity by using latent semantic indexing. 8. The system of claim 1, the matching unit to further rank the identified service with respect to a further service according to the similarity between the enhanced request set of keywords and the service set of keywords. 9. The system of claim 1, further comprising a ranking unit to rank the identified service with respect to a further service based on any one of a group of criteria including: quality weights for quality of service parameters of the identified service and a usage index of the identified service. 10. The system of claim 1, further comprising a mapping unit to identify a semantic service that is to match the service request and that is annotated according to a service ontology by identifying a request ontology having concepts representing one or more keywords of the request set of keywords and by using a mapping between the concepts representing the one or more keywords and concepts of the semantic service to compute a number of concepts related to the service request and the semantic service. 11. The system of claim 1, further comprising a preprocessing unit to parse the service request and to identify the keywords of the request set of keywords with terms of the service request in a standardized format. 12. The system of claim 1, further comprising a preprocessing unit to parse a document related to the service and to identify the keywords of the service set of keywords with terms of the document in a standardized format. 13. The system of claim 12, the preprocessing unit further to identify a keyword of the service set of keywords with a term extracted from any one of a group of tags including: a document tag of a document related to the service and a tag of an operation parameter of the service. 14. A method comprising:
computing an enhanced request set of keywords comprising keywords of a request set of keywords of a service request and a related keyword, the related keyword being represented by an ontology concept that has a relation to a further ontology concept representing a keyword of the request set of keywords; and identifying a service to match the service request by computing a similarity between the enhanced request set of keywords and a service set of keywords of the service. 15. The method of claim 14, the ontology concept being a concept of a first ontology and the further ontology concept being a concept of a second ontology, the first ontology being linked to the second ontology by a relation between a first concept of the first ontology and a second concept of the second ontology. 16. The method of claim 14, computing the enhanced request set of keywords comprising identifying a domain ontology and searching the domain ontology to identify the ontology concept. 17. The method of claim 14, further comprising: identifying a further related keyword, the further related keyword being represented by a concept of a domain independent ontology, the concept of the domain independent ontology having a relation to a still further ontology concept that represents a further keyword of the request set of keywords; and specifying a service category of the service using the further related keyword. 18. The method of claim 14, computing the similarity comprising identifying a reduced representation of the enhanced request set of keywords, identifying a further reduced representation of the service set of keywords, and identifying the similarity with a value to which the reduced representation and the further reduced representation are mapped. 19. The method of claim 18, the reduced representation and the further reduced representation comprising representations of selected correlations between keywords of documents related to a plurality of services and the documents related to the plurality of services. 20. The method of claim 19, computing the similarity by using latent semantic indexing. 21. The method of claim 14, further ranking the identified service with respect to a further service according to the similarity between the enhanced request set of keywords and the service set of keywords. 22. The method of claim 14, further ranking the identified service with respect to a further service based on any one of a group of criteria including: quality weights for quality of service parameters of the identified service and a usage index of the identified service. 23. The method of claim 14, further identifying a semantic service to match the service request and annotated according to a service ontology by identifying a request ontology having concepts representing one or more keywords of the request set of keywords and by using a mapping between the concepts representing the one or more keywords and concepts of the semantic service to compute a number of concepts related to the service request and the semantic service. 24. The method of claim 14, further parsing the service request and identifying the keywords of the request set of keywords with terms of the service request in a standardized format. 25. The method of claim 14, further parsing a document related to the service and identifying the keywords of the service set of keywords with terms of the document in a standardized format. 26. The method of claim 25, identifying a keyword of the service set of keywords with a term extracted from any one of a group of tags including: a document tag of a document related to the service and a tag of an operation parameter of the service. 27. A computer program product having instructions that are executable by a computer system, the computer program product comprising instructions of: an enhancement module to compute an enhanced request set of keywords comprising keywords of a request set of keywords of a service request and a related keyword, the related keyword being represented by an ontology concept that has a relation to a further ontology concept representing a keyword of the request set of keywords; and
a matching module to identify a service to match the service request by computing a similarity between the enhanced request set of keywords and a service set of keywords of the service. 28. A system comprising:
first means for computing an enhanced request set of keywords comprising keywords of a request set of keywords of a service request and a related keyword, the related keyword being represented by an ontology concept that has a relation to a further ontology concept representing a keyword of the request set of keywords; and second means for identifying a service to match the service request by computing a similarity between the enhanced request set of keywords and a service set of keywords of the service. | 2,100 |
4,981 | 14,497,645 | 2,125 | An adaptive probabilistic semantic computer-implemented system and method links semantic chains comprising subject, predicate, and object triples and an associated probability with behavioral-based chains comprising a system user, predicate, and object triples, and infers user preferences based on the linked chains. Recommendations are generated for delivery to system users based on the preference inferences. Explanations may be provided to recommendation recipients as to why they received recommendations, and the explanations may convey a sense of confidence in accordance with probabilistic semantic associations. | 1. A computer-implemented method:
accessing automatically a first behavioral chain comprising a representation of a first user of a computer-implemented system, a first predicate, and a first object of the first predicate; accessing automatically a first semantic chain comprising a first subject, a second predicate, a second object of the predicate, and a first semantic chain weighting associated with the first semantic chain, wherein the first subject corresponds to the first object of the first predicate; linking automatically the first semantic chain and the first behavioral chain; inferring automatically a preference of the first user of the computer-implemented system based, at least in part, on the linked first semantic chain and first behavioral chain and the first semantic chain weighting; and selecting automatically a recommendation for delivery to the first user of the computer-implemented system, wherein the recommendation is selected based, at least in part, on the inferred preference. 2. The method of claim 1, further comprising:
accessing automatically the first behavioral chain comprising the first predicate, wherein the first predicate is automatically inferred from one or more usage behaviors. 3. The method of claim 1, further comprising:
accessing automatically the first behavioral chain comprising the first object of the first predicate, wherein the first object of the first predicate comprises a representation of a second user of the computer-implemented system. 4. The method of claim 1, further comprising:
accessing automatically the first semantic chain weighting that is associated with the first semantic chain, wherein the first semantic chain weighting is automatically generated by a processor-based device from a statistical analysis of computer-implemented content. 5. The method of claim 1, further comprising:
accessing automatically the first semantic chain weighting that is associated with the first semantic chain, wherein the first semantic chain weighting is automatically generated by a processor-based device from an inference based, at least in part, on a plurality of usage behaviors. 6. The method of claim 1, further comprising:
inferring automatically the preference of the first user of the computer-implemented system, wherein the inferring of the preference is further based on a first behavioral chain weighting associated with the first behavioral chain. 7. The method of claim 6, further comprising:
inferring automatically the preference of the first user of the computer-implemented system, wherein the inferring of the preference is further based on the first behavioral chain weighting associated with the first behavioral chain, wherein the first behavioral chain weighting is automatically generated by a processor-based device from an inference based, at least in part, on a plurality of usage behaviors. 8. A computer-implemented system comprising one or more processor-based devices configured to:
access a first behavioral chain comprising a representation of a first user of a computer-implemented system, a first predicate, and a first object of the first predicate; access a first semantic chain comprising a first subject, a second predicate, a second object of the predicate, and a first semantic chain weighting associated with the first semantic chain, wherein the first subject corresponds to the first object of the first predicate; link the first semantic chain and the first behavioral chain; infer a preference of the first user of the computer-implemented system based, at least in part, on the linked first semantic chain and first behavioral chain and the first semantic chain weighting; and select a recommendation for delivery to the first user of the computer-implemented system, wherein the recommendation is selected based, at least in part, on the inferred preference. 9. The system of claim 8, further comprising the one or more processor-based devices configured to:
access the first behavioral chain comprising the first predicate, wherein the first predicate comprises a usage behavior of the first user with respect to the first object. 10. The system of claim 8, further comprising the one or more processor-based devices configured to:
access the first behavioral chain comprising the first predicate, wherein the first predicate is automatically inferred from a plurality of usage behaviors. 11. The system of claim 8, further comprising the one or more processor-based devices configured to:
access the first behavioral chain comprising the representation of the first object of the first predicate, wherein the first of object of the first predicate comprises a representation of a second user of the computer-implemented system. 12. The system of claim 8, further comprising the one or more processor-based devices configured to:
access the first semantic chain weighting associated with the first semantic chain, wherein the first semantic chain weighting associated with the first semantic chain comprises a probability that the first semantic chain represents objective reality. 13. The system of claim 8, further comprising the one or more processor-based devices configured to:
access the first semantic chain weighting associated with the first semantic chain, wherein the first semantic chain weighting associated with the first semantic chain comprises a probability that the first semantic chain is valid for interpreting specified content. 14. The system of claim 8, further comprising the one or more processor-based devices configured to:
infer the preference of the first user of the computer-implemented system, wherein the inference of the preference is further based on a first behavioral chain weighting associated with the first behavioral chain. 15. The system of claim 8, further comprising the one or more processor-based devices configured to:
infer the preference of the first user of the computer-implemented system, wherein the inference of the preference is further based on automatically linking the first semantic chain with a second semantic chain. 16. A computer-implemented system comprising one or more processor-based devices configured to:
access a first behavioral chain comprising a representation of a first user of a computer-implemented system, a first predicate, and a representation of a first object of the first predicate; access a first semantic chain comprising a first subject, a second predicate, a second object of the predicate, and a first semantic chain weighting associated with the first semantic chain, wherein the first subject corresponds to the first object of the first predicate; link the first semantic chain and the first behavioral chain; infer a preference of the first user of the computer-implemented system based, at least in part, on the linked first semantic chain and first behavioral chain and the first semantic chain weighting; generate a recommendation for delivery to the first user of the computer-implemented system, wherein the recommendation is generated based, at least in part, on the inferred preference; and generate an explanation for delivery to the first user as to why the recommendation was delivered to the first user, wherein the explanation is based, at least in part, on the linked first semantic chain and first behavioral chain. 17. The system of claim 16, further comprising the one or more processor-based devices configured to:
access the first semantic chain comprising the first predicate, wherein the first predicate comprises an inference of a preference of the first user with respect to the first object that is derived from one or more usage behaviors. 18. The system of claim 16, further comprising the one or more processor-based devices configured to:
generate the explanation, wherein the explanation is in a natural language format, and is in accordance with a mapping of natural language to the linked first semantic chain and the first behavioral chain. 19. The system of claim 16, further comprising the one or more processor-based devices configured to:
generate the explanation, wherein the explanation is further based on a linked second semantic chain and a second behavioral chain. 20. The system of claim 16, further comprising the one or more processor-based devices configured to:
generate the explanation, wherein the explanation comprises one or more phrases that convey a sense of confidence with respect to the recommendation, wherein the sense of confidence is derived, at least in part, from the first semantic chain weighting. | An adaptive probabilistic semantic computer-implemented system and method links semantic chains comprising subject, predicate, and object triples and an associated probability with behavioral-based chains comprising a system user, predicate, and object triples, and infers user preferences based on the linked chains. Recommendations are generated for delivery to system users based on the preference inferences. Explanations may be provided to recommendation recipients as to why they received recommendations, and the explanations may convey a sense of confidence in accordance with probabilistic semantic associations.1. A computer-implemented method:
accessing automatically a first behavioral chain comprising a representation of a first user of a computer-implemented system, a first predicate, and a first object of the first predicate; accessing automatically a first semantic chain comprising a first subject, a second predicate, a second object of the predicate, and a first semantic chain weighting associated with the first semantic chain, wherein the first subject corresponds to the first object of the first predicate; linking automatically the first semantic chain and the first behavioral chain; inferring automatically a preference of the first user of the computer-implemented system based, at least in part, on the linked first semantic chain and first behavioral chain and the first semantic chain weighting; and selecting automatically a recommendation for delivery to the first user of the computer-implemented system, wherein the recommendation is selected based, at least in part, on the inferred preference. 2. The method of claim 1, further comprising:
accessing automatically the first behavioral chain comprising the first predicate, wherein the first predicate is automatically inferred from one or more usage behaviors. 3. The method of claim 1, further comprising:
accessing automatically the first behavioral chain comprising the first object of the first predicate, wherein the first object of the first predicate comprises a representation of a second user of the computer-implemented system. 4. The method of claim 1, further comprising:
accessing automatically the first semantic chain weighting that is associated with the first semantic chain, wherein the first semantic chain weighting is automatically generated by a processor-based device from a statistical analysis of computer-implemented content. 5. The method of claim 1, further comprising:
accessing automatically the first semantic chain weighting that is associated with the first semantic chain, wherein the first semantic chain weighting is automatically generated by a processor-based device from an inference based, at least in part, on a plurality of usage behaviors. 6. The method of claim 1, further comprising:
inferring automatically the preference of the first user of the computer-implemented system, wherein the inferring of the preference is further based on a first behavioral chain weighting associated with the first behavioral chain. 7. The method of claim 6, further comprising:
inferring automatically the preference of the first user of the computer-implemented system, wherein the inferring of the preference is further based on the first behavioral chain weighting associated with the first behavioral chain, wherein the first behavioral chain weighting is automatically generated by a processor-based device from an inference based, at least in part, on a plurality of usage behaviors. 8. A computer-implemented system comprising one or more processor-based devices configured to:
access a first behavioral chain comprising a representation of a first user of a computer-implemented system, a first predicate, and a first object of the first predicate; access a first semantic chain comprising a first subject, a second predicate, a second object of the predicate, and a first semantic chain weighting associated with the first semantic chain, wherein the first subject corresponds to the first object of the first predicate; link the first semantic chain and the first behavioral chain; infer a preference of the first user of the computer-implemented system based, at least in part, on the linked first semantic chain and first behavioral chain and the first semantic chain weighting; and select a recommendation for delivery to the first user of the computer-implemented system, wherein the recommendation is selected based, at least in part, on the inferred preference. 9. The system of claim 8, further comprising the one or more processor-based devices configured to:
access the first behavioral chain comprising the first predicate, wherein the first predicate comprises a usage behavior of the first user with respect to the first object. 10. The system of claim 8, further comprising the one or more processor-based devices configured to:
access the first behavioral chain comprising the first predicate, wherein the first predicate is automatically inferred from a plurality of usage behaviors. 11. The system of claim 8, further comprising the one or more processor-based devices configured to:
access the first behavioral chain comprising the representation of the first object of the first predicate, wherein the first of object of the first predicate comprises a representation of a second user of the computer-implemented system. 12. The system of claim 8, further comprising the one or more processor-based devices configured to:
access the first semantic chain weighting associated with the first semantic chain, wherein the first semantic chain weighting associated with the first semantic chain comprises a probability that the first semantic chain represents objective reality. 13. The system of claim 8, further comprising the one or more processor-based devices configured to:
access the first semantic chain weighting associated with the first semantic chain, wherein the first semantic chain weighting associated with the first semantic chain comprises a probability that the first semantic chain is valid for interpreting specified content. 14. The system of claim 8, further comprising the one or more processor-based devices configured to:
infer the preference of the first user of the computer-implemented system, wherein the inference of the preference is further based on a first behavioral chain weighting associated with the first behavioral chain. 15. The system of claim 8, further comprising the one or more processor-based devices configured to:
infer the preference of the first user of the computer-implemented system, wherein the inference of the preference is further based on automatically linking the first semantic chain with a second semantic chain. 16. A computer-implemented system comprising one or more processor-based devices configured to:
access a first behavioral chain comprising a representation of a first user of a computer-implemented system, a first predicate, and a representation of a first object of the first predicate; access a first semantic chain comprising a first subject, a second predicate, a second object of the predicate, and a first semantic chain weighting associated with the first semantic chain, wherein the first subject corresponds to the first object of the first predicate; link the first semantic chain and the first behavioral chain; infer a preference of the first user of the computer-implemented system based, at least in part, on the linked first semantic chain and first behavioral chain and the first semantic chain weighting; generate a recommendation for delivery to the first user of the computer-implemented system, wherein the recommendation is generated based, at least in part, on the inferred preference; and generate an explanation for delivery to the first user as to why the recommendation was delivered to the first user, wherein the explanation is based, at least in part, on the linked first semantic chain and first behavioral chain. 17. The system of claim 16, further comprising the one or more processor-based devices configured to:
access the first semantic chain comprising the first predicate, wherein the first predicate comprises an inference of a preference of the first user with respect to the first object that is derived from one or more usage behaviors. 18. The system of claim 16, further comprising the one or more processor-based devices configured to:
generate the explanation, wherein the explanation is in a natural language format, and is in accordance with a mapping of natural language to the linked first semantic chain and the first behavioral chain. 19. The system of claim 16, further comprising the one or more processor-based devices configured to:
generate the explanation, wherein the explanation is further based on a linked second semantic chain and a second behavioral chain. 20. The system of claim 16, further comprising the one or more processor-based devices configured to:
generate the explanation, wherein the explanation comprises one or more phrases that convey a sense of confidence with respect to the recommendation, wherein the sense of confidence is derived, at least in part, from the first semantic chain weighting. | 2,100 |
4,982 | 14,779,010 | 2,143 | An apparatus, method, and computer program product for: receiving an indication of a lock signal at a first point in time, receiving an indication of an unlock signal at a second point in time, determining a lock period based on the first point in time and the second point in time, and, in dependence on the determined lock period, selecting a user interface view for displaying upon unlocking a device, wherein the unlocking is performed in response to the received indication of the unlock signal. | 1. A method comprising:
receiving an indication of a lock signal at a first point in time; receiving an indication of an unlock signal at a second point in time; determining a lock period based on the first point in time and the second point in time; and in dependence on the determined lock period, selecting a user interface view for displaying upon unlocking a device, wherein the unlocking is performed in response to the received indication of the unlock signal. 2. A method according to claim 1, wherein the selected user interface view comprises a first user interface view, if the determined lock period is greater than a pre-defined threshold value. 3. A method according to claim 1, wherein the selected user interface view comprises a home screen. 4. A method according to claim 1, wherein the selected user interface view comprises a second user interface view, if the determined lock period is less than a pre-defined threshold value. 5. A method according to claim 1, wherein the selected user interface view comprises a previously used application. 6. A method according to claim 5, wherein the previously used application comprises an application that was active upon receiving the indication of a lock signal. 7. A method according to claim 2, wherein the pre-defined threshold value depends on the application that was active upon receiving the indication of a lock signal. 8. An apparatus, comprising:
a processor, memory including computer program code, the memory and the computer program code configured to, working with the processor, cause the apparatus to perform at least the following: receive an indication of a lock signal at a first point in time; receive an indication of an unlock signal at a second point in time; determine a lock period based on the first point in time and the second point in time; and in dependence on the determined lock period, select a user interface view for displaying upon unlocking a device, wherein the unlocking is performed in response to the received indication of the unlock signal. 9. An apparatus according to claim 8, wherein the selected user interface view comprises a first user interface view, if the determined lock period is greater than a pre-defined threshold value. 10. An apparatus according to claim 8, wherein the selected user interface view comprises a home screen. 11. An apparatus according to claim 8, wherein the selected user interface view comprises a second user interface view, if the determined lock period is less than a pre-defined threshold value. 12. An apparatus according to claim 8, wherein the selected user interface view comprises a previously used application. 13. An apparatus according to claim 12, wherein the previously used application comprises an application that was active upon receiving the indication of a lock signal. 14. An apparatus according to claim 9, wherein the pre-defined threshold value depends on the application that was active upon receiving the indication of a lock signal. 15. A computer program product comprising a computer-readable medium bearing computer program code embodied therein for use with a computer, the computer program code comprising:
code for receiving an indication of a lock signal at a first point in time; code for receiving an indication of an unlock signal at a second point in time; code for determining a lock period based on the first point in time and the second point in time; and code for, in dependence on the determined lock period, selecting a user interface view for displaying upon unlocking a device, wherein the unlocking is performed in response to the received indication of the unlock signal. | An apparatus, method, and computer program product for: receiving an indication of a lock signal at a first point in time, receiving an indication of an unlock signal at a second point in time, determining a lock period based on the first point in time and the second point in time, and, in dependence on the determined lock period, selecting a user interface view for displaying upon unlocking a device, wherein the unlocking is performed in response to the received indication of the unlock signal.1. A method comprising:
receiving an indication of a lock signal at a first point in time; receiving an indication of an unlock signal at a second point in time; determining a lock period based on the first point in time and the second point in time; and in dependence on the determined lock period, selecting a user interface view for displaying upon unlocking a device, wherein the unlocking is performed in response to the received indication of the unlock signal. 2. A method according to claim 1, wherein the selected user interface view comprises a first user interface view, if the determined lock period is greater than a pre-defined threshold value. 3. A method according to claim 1, wherein the selected user interface view comprises a home screen. 4. A method according to claim 1, wherein the selected user interface view comprises a second user interface view, if the determined lock period is less than a pre-defined threshold value. 5. A method according to claim 1, wherein the selected user interface view comprises a previously used application. 6. A method according to claim 5, wherein the previously used application comprises an application that was active upon receiving the indication of a lock signal. 7. A method according to claim 2, wherein the pre-defined threshold value depends on the application that was active upon receiving the indication of a lock signal. 8. An apparatus, comprising:
a processor, memory including computer program code, the memory and the computer program code configured to, working with the processor, cause the apparatus to perform at least the following: receive an indication of a lock signal at a first point in time; receive an indication of an unlock signal at a second point in time; determine a lock period based on the first point in time and the second point in time; and in dependence on the determined lock period, select a user interface view for displaying upon unlocking a device, wherein the unlocking is performed in response to the received indication of the unlock signal. 9. An apparatus according to claim 8, wherein the selected user interface view comprises a first user interface view, if the determined lock period is greater than a pre-defined threshold value. 10. An apparatus according to claim 8, wherein the selected user interface view comprises a home screen. 11. An apparatus according to claim 8, wherein the selected user interface view comprises a second user interface view, if the determined lock period is less than a pre-defined threshold value. 12. An apparatus according to claim 8, wherein the selected user interface view comprises a previously used application. 13. An apparatus according to claim 12, wherein the previously used application comprises an application that was active upon receiving the indication of a lock signal. 14. An apparatus according to claim 9, wherein the pre-defined threshold value depends on the application that was active upon receiving the indication of a lock signal. 15. A computer program product comprising a computer-readable medium bearing computer program code embodied therein for use with a computer, the computer program code comprising:
code for receiving an indication of a lock signal at a first point in time; code for receiving an indication of an unlock signal at a second point in time; code for determining a lock period based on the first point in time and the second point in time; and code for, in dependence on the determined lock period, selecting a user interface view for displaying upon unlocking a device, wherein the unlocking is performed in response to the received indication of the unlock signal. | 2,100 |
4,983 | 14,305,021 | 2,128 | A finite-element-analysis simulator may simulate a pre-bend operation of an object design, performed to a raw material in forming an object, to produce simulated pre-bend results, adjust stress tensor components of the simulated pre-bend results to eliminate residual elastic deformation from the simulated pre-bend results, and complete object simulation of the raw material using the adjusted simulated pre-bend results. | 1. A system comprising:
a memory storing a finite-element-analysis simulator; and a processor configured to execute the finite-element-analysis simulator to
simulate a pre-bend operation of an object design, performed to a raw material in forming an object, to produce simulated pre-bend results,
adjust stress tensor components of the simulated pre-bend results to eliminate residual elastic deformation from the simulated pre-bend results, and
complete object simulation of the raw material using the adjusted simulated pre-bend results. 2. The system of claim 1, wherein the raw material is at least one of a tubular ductile metal and a shaped extrusion. 3. The system of claim 1, wherein the processor is further configured to execute the finite-element-analysis simulator to:
simulate a pre-forming operation of the object design according to the adjusted simulated pre-bend results to produce simulated pre-forming results; and simulate a hydroforming operation of the object design according to the simulated pre-forming results to produce simulated hydroforming results. 4. The system of claim 1, wherein the processor is further configured to execute the finite-element-analysis simulator to simulate a hydroforming operation of the object design according to the adjusted simulated pre-bend results to produce simulated hydroforming results. 5. The system of claim 1, wherein the processor is further configured to execute the finite-element-analysis simulator to:
discretize a geometry of the object into a set of finite element nodes connected together as a mesh approximating the geometry of the object; simulate the pre-bend operation to produce simulated pre-bend results for each of the set of finite elements; and adjust stress tensor components of the simulated pre-bend results associated with each of the finite elements to eliminate the residual elastic deformation from the simulated pre-bend results. 6. The system of claim 1, wherein the processor is further configured to execute the finite-element-analysis simulator to eliminate the residual elastic deformation from the simulated pre-bend results by resetting the stress tensor components of the simulated pre-bend results to a substantially negligible amount of stress. 7. The system of claim 6, wherein the substantially negligible amount of stress is zero. 8. The system of claim 6, wherein the substantially negligible amount of stress is reset in conformance with adjustments made to an amount of overbending performed during manufacture of the object from the raw material. 9. A computer-implemented method comprising:
simulating, by a hydroforming simulator of raw materials executed by a processing device, a pre-bend operation of an object design performed to a raw material in forming an object, to produce simulated pre-bend results; adjusting, by the hydroforming simulator, stress tensor components of the simulated pre-bend results to eliminate residual elastic deformation from the simulated pre-bend results; and completing the hydroforming simulation using the adjusted simulated pre-bend results. 10. The method of claim 9, further comprising:
simulating a pre-forming operation of the object design according to the adjusted simulated pre-bend results to produce simulated pre-forming results; and simulating a hydroforming operation of the object design according to the simulated pre-forming results to produce simulated hydroforming results. 11. The method of claim 9, further comprising:
discretizing a geometry of the object into a set of finite element nodes connected together as a mesh approximating the geometry of the object; simulating the pre-bend operation to produce simulated pre-bend results for each of the set of finite elements; and adjusting stress tensor components of the simulated pre-bend results associated with each of the finite elements to eliminate residual elastic deformation from the simulated pre-bend results. 12. The method of claim 9, further comprising executing the hydroforming simulator to eliminate residual elastic deformation from the simulated pre-bend results by resetting the stress tensor components of the simulated pre-bend results to a substantially negligible amount of stress. 13. The method of claim 12, wherein the substantially negligible amount of stress is zero. 14. The method of claim 12, wherein the substantially negligible amount of stress is reset in conformance with adjustments made to an amount of overbending performed during manufacture of the object from the raw material that is outside the object design of the object. 15. A non-transitory computer-readable medium storing instructions of a finite-element-analysis simulator, that, when executed by at least one processor, are configured to cause the at least one processor to:
simulate a pre-bend operation of an object design performed to a raw material in forming an object, to produce simulated pre-bend results; adjust, by the finite-element-analysis simulator, stress tensor components of the simulated pre-bend results to eliminate residual elastic deformation from the simulated pre-bend results; and complete the finite-element-analysis simulation using the adjusted simulated pre-bend results. 16. The medium of claim 15, further storing instructions configured to cause the at least one processor to:
simulate a pre-forming operation of the object design according to the adjusted simulated pre-bend results to produce simulated pre-forming results; and simulate a hydroforming operation of the object design according to the simulated pre-forming results to produce simulated hydroforming results. 17. The medium of claim 15, further storing instructions configured to cause the at least one processor to:
discretize a geometry of the object into a set of finite element nodes connected together as a mesh approximating the geometry of the object; simulate the pre-bend operation to produce simulated pre-bend results for each of the set of finite element nodes; and adjust stress tensor components of the simulated pre-bend results associated with each of the finite elements to eliminate residual elastic deformation from the simulated pre-bend results. 18. The medium of claim 15, further storing instructions configured to cause the at least one processor to eliminate residual elastic deformation from the simulated pre-bend results by resetting the stress tensor components of the simulated pre-bend results to a substantially negligible amount of stress. 19. The medium of claim 18, wherein the substantially negligible amount of stress is zero. 20. The medium of claim 18, wherein the substantially negligible amount of stress is reset in conformance with adjustments made to an amount of overbending performed during manufacture of the object from the raw material that is outside the object design of the object. | A finite-element-analysis simulator may simulate a pre-bend operation of an object design, performed to a raw material in forming an object, to produce simulated pre-bend results, adjust stress tensor components of the simulated pre-bend results to eliminate residual elastic deformation from the simulated pre-bend results, and complete object simulation of the raw material using the adjusted simulated pre-bend results.1. A system comprising:
a memory storing a finite-element-analysis simulator; and a processor configured to execute the finite-element-analysis simulator to
simulate a pre-bend operation of an object design, performed to a raw material in forming an object, to produce simulated pre-bend results,
adjust stress tensor components of the simulated pre-bend results to eliminate residual elastic deformation from the simulated pre-bend results, and
complete object simulation of the raw material using the adjusted simulated pre-bend results. 2. The system of claim 1, wherein the raw material is at least one of a tubular ductile metal and a shaped extrusion. 3. The system of claim 1, wherein the processor is further configured to execute the finite-element-analysis simulator to:
simulate a pre-forming operation of the object design according to the adjusted simulated pre-bend results to produce simulated pre-forming results; and simulate a hydroforming operation of the object design according to the simulated pre-forming results to produce simulated hydroforming results. 4. The system of claim 1, wherein the processor is further configured to execute the finite-element-analysis simulator to simulate a hydroforming operation of the object design according to the adjusted simulated pre-bend results to produce simulated hydroforming results. 5. The system of claim 1, wherein the processor is further configured to execute the finite-element-analysis simulator to:
discretize a geometry of the object into a set of finite element nodes connected together as a mesh approximating the geometry of the object; simulate the pre-bend operation to produce simulated pre-bend results for each of the set of finite elements; and adjust stress tensor components of the simulated pre-bend results associated with each of the finite elements to eliminate the residual elastic deformation from the simulated pre-bend results. 6. The system of claim 1, wherein the processor is further configured to execute the finite-element-analysis simulator to eliminate the residual elastic deformation from the simulated pre-bend results by resetting the stress tensor components of the simulated pre-bend results to a substantially negligible amount of stress. 7. The system of claim 6, wherein the substantially negligible amount of stress is zero. 8. The system of claim 6, wherein the substantially negligible amount of stress is reset in conformance with adjustments made to an amount of overbending performed during manufacture of the object from the raw material. 9. A computer-implemented method comprising:
simulating, by a hydroforming simulator of raw materials executed by a processing device, a pre-bend operation of an object design performed to a raw material in forming an object, to produce simulated pre-bend results; adjusting, by the hydroforming simulator, stress tensor components of the simulated pre-bend results to eliminate residual elastic deformation from the simulated pre-bend results; and completing the hydroforming simulation using the adjusted simulated pre-bend results. 10. The method of claim 9, further comprising:
simulating a pre-forming operation of the object design according to the adjusted simulated pre-bend results to produce simulated pre-forming results; and simulating a hydroforming operation of the object design according to the simulated pre-forming results to produce simulated hydroforming results. 11. The method of claim 9, further comprising:
discretizing a geometry of the object into a set of finite element nodes connected together as a mesh approximating the geometry of the object; simulating the pre-bend operation to produce simulated pre-bend results for each of the set of finite elements; and adjusting stress tensor components of the simulated pre-bend results associated with each of the finite elements to eliminate residual elastic deformation from the simulated pre-bend results. 12. The method of claim 9, further comprising executing the hydroforming simulator to eliminate residual elastic deformation from the simulated pre-bend results by resetting the stress tensor components of the simulated pre-bend results to a substantially negligible amount of stress. 13. The method of claim 12, wherein the substantially negligible amount of stress is zero. 14. The method of claim 12, wherein the substantially negligible amount of stress is reset in conformance with adjustments made to an amount of overbending performed during manufacture of the object from the raw material that is outside the object design of the object. 15. A non-transitory computer-readable medium storing instructions of a finite-element-analysis simulator, that, when executed by at least one processor, are configured to cause the at least one processor to:
simulate a pre-bend operation of an object design performed to a raw material in forming an object, to produce simulated pre-bend results; adjust, by the finite-element-analysis simulator, stress tensor components of the simulated pre-bend results to eliminate residual elastic deformation from the simulated pre-bend results; and complete the finite-element-analysis simulation using the adjusted simulated pre-bend results. 16. The medium of claim 15, further storing instructions configured to cause the at least one processor to:
simulate a pre-forming operation of the object design according to the adjusted simulated pre-bend results to produce simulated pre-forming results; and simulate a hydroforming operation of the object design according to the simulated pre-forming results to produce simulated hydroforming results. 17. The medium of claim 15, further storing instructions configured to cause the at least one processor to:
discretize a geometry of the object into a set of finite element nodes connected together as a mesh approximating the geometry of the object; simulate the pre-bend operation to produce simulated pre-bend results for each of the set of finite element nodes; and adjust stress tensor components of the simulated pre-bend results associated with each of the finite elements to eliminate residual elastic deformation from the simulated pre-bend results. 18. The medium of claim 15, further storing instructions configured to cause the at least one processor to eliminate residual elastic deformation from the simulated pre-bend results by resetting the stress tensor components of the simulated pre-bend results to a substantially negligible amount of stress. 19. The medium of claim 18, wherein the substantially negligible amount of stress is zero. 20. The medium of claim 18, wherein the substantially negligible amount of stress is reset in conformance with adjustments made to an amount of overbending performed during manufacture of the object from the raw material that is outside the object design of the object. | 2,100 |
4,984 | 15,382,522 | 2,153 | In certain embodiments, queries may be facilitated via request-prediction-based temporary storage of query results. In some embodiments, a request for query results may be predicted. Responsive to the request prediction, queries for data related to calculating a set of values may be performed. A subset of the related data may be obtained based on the performed queries. The performance of the queries may be caused to stop prior to obtaining other subsets of the related data. The set of values may be predicted based on the subset of the related data. The predicted set of values may be caused to be stored in temporary data storage. The request may be obtained from a client device subsequent to the storage of the predicted set of values. The predicted set of values may be obtained from the temporary data storage based on the request from the client device. | 1. A method of facilitating queries via request-prediction-based temporary storage of query results, the method being implemented by a computer system that comprises one or more processors executing computer program instructions that, when executed, perform the method, the method comprising:
predicting that a request will occur in the future, the predicted request comprising a predicted inquiry for a set of values; performing multiple queries for data related to calculating the set of values
wherein the multiple queries are performed in response to the request being predicted, and
wherein the related data comprises a first subset of the related data and other subsets of the related data;
obtaining the first subset of the related data based on at least some of the performed multiple queries; causing the performance of the multiple queries to stop prior to obtaining the other subsets of the related data; predicting the set of values based on the first subset of the related data without the other subsets of the related data; causing the predicted set of values to be stored in a temporary data storage; obtaining a subsequent request, matching the predicted request from a client device subsequent to the storage of the predicted set of values; obtaining the predicted set of values from the temporary data storage based on the subsequent request from the client device; and providing the predicted set of values for presentation at the client device. 2. The method of claim 1, further comprising:
updating the predicted set of values based on the other subsets of the related data subsequent to the predicted set of values being provided for presentation at the client device; and providing the updated predicted set of values for presentation at the client device. 3. The method of claim 1, further comprising:
determining frequency information indicating a frequency of requests matching the request; and selecting, based on the frequency information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 4. The method of claim 1, further comprising:
determining cost information indicating costs for performing respective queries of a set of queries that would have been performed to respond to the request had the request been obtained from the client device; and selecting, based on the cost information, the multiple queries to be performed from among the set of queries. 5. The method of claim 1, further comprising:
determining cost information indicating costs for performing respective ones of the multiple queries or for storing data in the temporary data storage, wherein causing the performance of the multiple queries to stop comprises causing, based on the cost information, the performance of the multiple queries to stop prior to obtaining the other subsets of the related data. 6. The method of claim 1, further comprising:
determining preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for a sorting order for presenting data; and selecting, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 7. The method of claim 1, further comprising:
determining preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for an amount of data to be presented at a given time; and selecting, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 8. The method of claim 1, further comprising:
determining preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for a format in which to present data; and selecting, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 9. The method of claim 1, further comprising:
predicting another request for query results; determining frequency information indicating a frequency of requests matching the other request; determining cost information indicating a cost for storing data in the temporary data storage; and determining, based on the frequency information and the cost information, not to perform any queries related to the other request for obtaining related results for storage in the temporary data storage. 10. (canceled) 11. A system comprising:
a computer system that comprises one or more processors programmed with computer program instructions that, when executed, cause the computer system to:
predict that a request will occur in the future, the predicted request comprising a predicted inquiry for a set of values;
perform multiple queries for data related to calculating the set of values,
wherein the multiple queries are performed in response to the request being predicted, and
wherein the related data comprises a first subset of the related data and other subsets of the related data;
obtain the first subset of the related data based on at least some of the performed multiple queries;
cause the performance of the multiple queries to stop prior to obtaining the other subsets of the related data;
predict the set of values based on the first subset of the related data without the other subsets of the related data;
cause the predicted set of values to be stored in a temporary data storage;
obtain a subsequent request, matching the predicted request, from a client device subsequent to the storage of the predicted set of values;
obtain the predicted set of values from the temporary data storage based on the subsequent request from the client device; and
provide the predicted set of values for presentation at the client device. 12. The system of claim 11, wherein the computer system is caused to:
update the predicted set of values based on the other subsets of the related data subsequent to the predicted set of values being provided for presentation at the client device; and provide the updated predicted set of values for presentation at the client device. 13. The system of claim 11, wherein the computer system is caused to:
determine frequency information indicating a frequency of requests matching the request; and select, based on the frequency information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 14. The system of claim 11, wherein the computer system is caused to:
determine cost information indicating costs for performing respective queries of a set of queries that would have been performed to respond to the request had the request been obtained from the client device; and select, based on the cost information, the multiple queries to be performed from among the set of queries. 15. The system of claim 11, wherein the computer system is caused to:
determine cost information indicating costs for performing respective ones of the multiple queries or for storing data in the temporary data storage, wherein causing the performance of the multiple queries to stop comprises causing, based on the cost information, the performance of the multiple queries to stop prior to obtaining the other subsets of the related data. 16. The system of claim 11, wherein the computer system is caused to:
determine preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for a sorting order for presenting data; and select, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 17. The system of claim 11, wherein the computer system is caused to:
determine preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for an amount of data to be presented at a given time; and select, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 18. The system of claim 11, wherein the computer system is caused to:
determine preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for a format in which to present data; and select, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 19. The system of claim 11, wherein the computer system is caused to:
predict another request for query results; determine frequency information indicating a frequency of requests matching the other request; determine cost information indicating a cost for storing data in the temporary data storage; and determine, based on the frequency information and the cost information, not to perform any queries related to the other request for obtaining related results for storage in the temporary data storage. 20. (canceled) 21. A method of facilitating queries via request-prediction-based temporary storage of query results, the method being implemented by a computer system that comprises one or more processors executing computer program instructions that, when executed, perform the method, the method comprising:
predicting that a request will occur in the future based on request history information; performing multiple queries for data related to calculating a set of values that will be represented in a presentation at a client device when a future request matching the predicted request is obtained from the client device,
wherein the multiple queries are performed in response to the request being predicted, and
wherein the related data comprises a first subset of the related data and other subsets of the related data;
obtaining the first subset of the related data based on at least some of the performed multiple queries; causing the performance of the multiple queries to stop prior to obtaining the other subsets of the related data; predicting the set of values based on the first subset of the related data without the other subsets of the related data; causing the predicted set of values to be stored in a temporary data storage; obtaining a subsequent request, matching the predicted request, from the client device subsequent to the storage of the predicted set of values; obtaining the predicted set of values from the temporary data storage based on the subsequent request from the client device; and providing the predicted set of values for presentation at the client device. 22. The method of claim 21, further comprising:
updating the predicted set of values based on the other subsets of the related data subsequent to the predicted set of values being provided for presentation at the client device; and providing the updated predicted set of values for presentation at the client device. | In certain embodiments, queries may be facilitated via request-prediction-based temporary storage of query results. In some embodiments, a request for query results may be predicted. Responsive to the request prediction, queries for data related to calculating a set of values may be performed. A subset of the related data may be obtained based on the performed queries. The performance of the queries may be caused to stop prior to obtaining other subsets of the related data. The set of values may be predicted based on the subset of the related data. The predicted set of values may be caused to be stored in temporary data storage. The request may be obtained from a client device subsequent to the storage of the predicted set of values. The predicted set of values may be obtained from the temporary data storage based on the request from the client device.1. A method of facilitating queries via request-prediction-based temporary storage of query results, the method being implemented by a computer system that comprises one or more processors executing computer program instructions that, when executed, perform the method, the method comprising:
predicting that a request will occur in the future, the predicted request comprising a predicted inquiry for a set of values; performing multiple queries for data related to calculating the set of values
wherein the multiple queries are performed in response to the request being predicted, and
wherein the related data comprises a first subset of the related data and other subsets of the related data;
obtaining the first subset of the related data based on at least some of the performed multiple queries; causing the performance of the multiple queries to stop prior to obtaining the other subsets of the related data; predicting the set of values based on the first subset of the related data without the other subsets of the related data; causing the predicted set of values to be stored in a temporary data storage; obtaining a subsequent request, matching the predicted request from a client device subsequent to the storage of the predicted set of values; obtaining the predicted set of values from the temporary data storage based on the subsequent request from the client device; and providing the predicted set of values for presentation at the client device. 2. The method of claim 1, further comprising:
updating the predicted set of values based on the other subsets of the related data subsequent to the predicted set of values being provided for presentation at the client device; and providing the updated predicted set of values for presentation at the client device. 3. The method of claim 1, further comprising:
determining frequency information indicating a frequency of requests matching the request; and selecting, based on the frequency information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 4. The method of claim 1, further comprising:
determining cost information indicating costs for performing respective queries of a set of queries that would have been performed to respond to the request had the request been obtained from the client device; and selecting, based on the cost information, the multiple queries to be performed from among the set of queries. 5. The method of claim 1, further comprising:
determining cost information indicating costs for performing respective ones of the multiple queries or for storing data in the temporary data storage, wherein causing the performance of the multiple queries to stop comprises causing, based on the cost information, the performance of the multiple queries to stop prior to obtaining the other subsets of the related data. 6. The method of claim 1, further comprising:
determining preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for a sorting order for presenting data; and selecting, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 7. The method of claim 1, further comprising:
determining preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for an amount of data to be presented at a given time; and selecting, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 8. The method of claim 1, further comprising:
determining preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for a format in which to present data; and selecting, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 9. The method of claim 1, further comprising:
predicting another request for query results; determining frequency information indicating a frequency of requests matching the other request; determining cost information indicating a cost for storing data in the temporary data storage; and determining, based on the frequency information and the cost information, not to perform any queries related to the other request for obtaining related results for storage in the temporary data storage. 10. (canceled) 11. A system comprising:
a computer system that comprises one or more processors programmed with computer program instructions that, when executed, cause the computer system to:
predict that a request will occur in the future, the predicted request comprising a predicted inquiry for a set of values;
perform multiple queries for data related to calculating the set of values,
wherein the multiple queries are performed in response to the request being predicted, and
wherein the related data comprises a first subset of the related data and other subsets of the related data;
obtain the first subset of the related data based on at least some of the performed multiple queries;
cause the performance of the multiple queries to stop prior to obtaining the other subsets of the related data;
predict the set of values based on the first subset of the related data without the other subsets of the related data;
cause the predicted set of values to be stored in a temporary data storage;
obtain a subsequent request, matching the predicted request, from a client device subsequent to the storage of the predicted set of values;
obtain the predicted set of values from the temporary data storage based on the subsequent request from the client device; and
provide the predicted set of values for presentation at the client device. 12. The system of claim 11, wherein the computer system is caused to:
update the predicted set of values based on the other subsets of the related data subsequent to the predicted set of values being provided for presentation at the client device; and provide the updated predicted set of values for presentation at the client device. 13. The system of claim 11, wherein the computer system is caused to:
determine frequency information indicating a frequency of requests matching the request; and select, based on the frequency information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 14. The system of claim 11, wherein the computer system is caused to:
determine cost information indicating costs for performing respective queries of a set of queries that would have been performed to respond to the request had the request been obtained from the client device; and select, based on the cost information, the multiple queries to be performed from among the set of queries. 15. The system of claim 11, wherein the computer system is caused to:
determine cost information indicating costs for performing respective ones of the multiple queries or for storing data in the temporary data storage, wherein causing the performance of the multiple queries to stop comprises causing, based on the cost information, the performance of the multiple queries to stop prior to obtaining the other subsets of the related data. 16. The system of claim 11, wherein the computer system is caused to:
determine preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for a sorting order for presenting data; and select, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 17. The system of claim 11, wherein the computer system is caused to:
determine preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for an amount of data to be presented at a given time; and select, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 18. The system of claim 11, wherein the computer system is caused to:
determine preference information indicating one or more preferences related to a manner in which to present data, the one or more preferences comprising a preference for a format in which to present data; and select, based on the preference information, the multiple queries to be performed from among a set of queries that would have been performed to respond to the request had the request been obtained from the client device. 19. The system of claim 11, wherein the computer system is caused to:
predict another request for query results; determine frequency information indicating a frequency of requests matching the other request; determine cost information indicating a cost for storing data in the temporary data storage; and determine, based on the frequency information and the cost information, not to perform any queries related to the other request for obtaining related results for storage in the temporary data storage. 20. (canceled) 21. A method of facilitating queries via request-prediction-based temporary storage of query results, the method being implemented by a computer system that comprises one or more processors executing computer program instructions that, when executed, perform the method, the method comprising:
predicting that a request will occur in the future based on request history information; performing multiple queries for data related to calculating a set of values that will be represented in a presentation at a client device when a future request matching the predicted request is obtained from the client device,
wherein the multiple queries are performed in response to the request being predicted, and
wherein the related data comprises a first subset of the related data and other subsets of the related data;
obtaining the first subset of the related data based on at least some of the performed multiple queries; causing the performance of the multiple queries to stop prior to obtaining the other subsets of the related data; predicting the set of values based on the first subset of the related data without the other subsets of the related data; causing the predicted set of values to be stored in a temporary data storage; obtaining a subsequent request, matching the predicted request, from the client device subsequent to the storage of the predicted set of values; obtaining the predicted set of values from the temporary data storage based on the subsequent request from the client device; and providing the predicted set of values for presentation at the client device. 22. The method of claim 21, further comprising:
updating the predicted set of values based on the other subsets of the related data subsequent to the predicted set of values being provided for presentation at the client device; and providing the updated predicted set of values for presentation at the client device. | 2,100 |
4,985 | 12,970,127 | 2,198 | A state machine includes a rule selector. The rule selector receives input data, and one or more transition rules. The one or more transition rules including a next state. The state machine also includes a character classifier communicatively coupled to the rule selector. The character classifier includes a plurality of base classes. The character classifier receiving the input data, and sending one or more of the plurality of base classes to the rule selector in response to receiving the input data. The rule selector selects one of the one or more transition rules in response to determining that the input data and one of the plurality of base classes correspond to the transition rule. The current state of the state machine is then set to the next state of the selected one of the one or more transition rules. | 1. A state machine, comprising:
a hardware rule selector, the rule selector being configured to receive input data, and one or more transition rules, the one or more transition rules comprising a next state; a hardware character classifier communicatively coupled to the rule selector, the character classifier comprising a plurality of base classes and being configured to receive the input data and to send one or more of the plurality of base classes to the rule selector in response to receiving the input data; and the rule selector being further configured to select one of the one or more transition rules in response to determining that the input data and one of the plurality of base classes correspond to the transition rule, and to set a current state of the state machine to the next state of the selected one of the one or more transition rules. 2. The state machine of claim 1, wherein the input data comprises an input data bit vector, and the plurality of base classes comprise one or more base class bit vectors. 3. The state machine of claim 2, wherein the rule selector is configured to select the transition rule using one or more bitwise operations against the input data bit vector, and the one or more base class bit vectors. 4. The state machine of claim 3, wherein the rule selector comprises one or more AND gates, and at least one OR gate, and wherein the rule selector is configured to perform the one or more bitwise operations against the input data bit vector, and one or more of the one or more base class bit vectors using the one or more AND gates, and at least one OR gate. 5. The state machine of claim 3, wherein the rule selector is configured to use a rule select bit in the bitwise operation to select one of the one or more base class bit vectors. 6. A system for base class mapping, comprising:
a hardware pattern compiler module, the pattern compiler module for compiling a deterministic finite automaton (DFA), the compiling comprising: receiving a plurality of base class vectors and a plurality of negated base class vectors; receiving one or more unmapped transition rules in an unmapped list; and processing each of the one or more unmapped transition rules, the processing comprising:
selecting and removing one unmapped transition rule from the unmapped list;
creating an input vector from the selected transition rule;
generating one or more mapped rules from the input vector; and
storing the one or more mapped rules in a mapped list. 7. The system of claim 6, wherein the unmapped list is sorted according to a decreasing class size, and the unmapped transition rules are processed according to the sorted order. 8. The system of claim 6, wherein the generating comprises mapping the input vector to a regular rule. 9. The system of claim 6, wherein the generating comprises mapping the input vector to a base class combination. 10. The system of claim 9, wherein when the input vector comprises characters that are not in the base class combination, the processing further comprises:
creating a new unmapped transition rule; adding the characters to the new unmapped transition rule; and placing the new unmapped transition rule in the unmapped list. 11. The system of claim 10 wherein the unmapped list is sorted according to a decreasing class size in response to the placing. 12. The system of claim 9, wherein when the base class combination comprises characters that are not in the input vector, the processing further comprises:
incrementing a priority of each transition rule in the unmapped list and the mapped list; creating a new unmapped transition rule; adding the characters to the new unmapped transition rule; setting a priority of the new unmapped transition rule; and placing the new unmapped transition rule in the unmapped list. 13. The system of claim 12 wherein the unmapped list is sorted according to a decreasing class size in response to the placing. 14. The system of claim 9, wherein when the base class combination is equal to the input vector, the processing further comprises:
creating a new mapped transition rule; adding the base class combination to the new mapped transition rule; and placing the new mapped transition rule in the mapped list. 15. A computer implemented method for base class mapping, comprising:
receiving, on a computer, a plurality of base class vectors and a plurality of negated base class vectors; receiving, on the computer, one or more unmapped transition rules in an unmapped list; and processing, on the computer, each of the one or more unmapped transition rules, the processing comprising:
selecting and removing one unmapped transition rule from the unmapped list;
creating an input vector from the selected transition rule;
generating one or more mapped rules from the input vector; and
storing the one or more mapped rules in a mapped list. 16. The method of claim 15, wherein the unmapped list is sorted according to a decreasing class size, and the unmapped transition rules are processed according to the sorted order. 17. The method of claim 15, wherein the generating comprises mapping the input vector to a regular rule. 18. The method of claim 15, wherein the generating comprises mapping the input vector to a base class combination. 19. The method of claim 18, wherein when the input vector comprises characters that are not in the base class combination, the processing further comprises:
creating a new unmapped transition rule; adding the characters to the new unmapped transition rule; and placing the new unmapped transition rule in the unmapped list. 20. The method of claim 19 wherein the unmapped list is sorted according to a decreasing class size in response to the placing. 21. The method of claim 18, wherein when the base class combination comprises characters that are not in the input vector, the processing further comprises:
incrementing a priority of each transition rule in the unmapped list and the mapped list; creating a new unmapped transition rule; adding the characters to the new unmapped transition rule; setting a priority of the new unmapped transition rule; and placing the new unmapped transition rule in the unmapped list. 22. The method of claim 21 wherein the unmapped list is sorted according to a decreasing class size in response to the placing. 23. The method of claim 18, wherein when the base class combination is equal to the input vector, the processing further comprises:
creating a new mapped transition rule; adding the base class combination to the new mapped transition rule; and placing the new mapped transition rule in the mapped list. | A state machine includes a rule selector. The rule selector receives input data, and one or more transition rules. The one or more transition rules including a next state. The state machine also includes a character classifier communicatively coupled to the rule selector. The character classifier includes a plurality of base classes. The character classifier receiving the input data, and sending one or more of the plurality of base classes to the rule selector in response to receiving the input data. The rule selector selects one of the one or more transition rules in response to determining that the input data and one of the plurality of base classes correspond to the transition rule. The current state of the state machine is then set to the next state of the selected one of the one or more transition rules.1. A state machine, comprising:
a hardware rule selector, the rule selector being configured to receive input data, and one or more transition rules, the one or more transition rules comprising a next state; a hardware character classifier communicatively coupled to the rule selector, the character classifier comprising a plurality of base classes and being configured to receive the input data and to send one or more of the plurality of base classes to the rule selector in response to receiving the input data; and the rule selector being further configured to select one of the one or more transition rules in response to determining that the input data and one of the plurality of base classes correspond to the transition rule, and to set a current state of the state machine to the next state of the selected one of the one or more transition rules. 2. The state machine of claim 1, wherein the input data comprises an input data bit vector, and the plurality of base classes comprise one or more base class bit vectors. 3. The state machine of claim 2, wherein the rule selector is configured to select the transition rule using one or more bitwise operations against the input data bit vector, and the one or more base class bit vectors. 4. The state machine of claim 3, wherein the rule selector comprises one or more AND gates, and at least one OR gate, and wherein the rule selector is configured to perform the one or more bitwise operations against the input data bit vector, and one or more of the one or more base class bit vectors using the one or more AND gates, and at least one OR gate. 5. The state machine of claim 3, wherein the rule selector is configured to use a rule select bit in the bitwise operation to select one of the one or more base class bit vectors. 6. A system for base class mapping, comprising:
a hardware pattern compiler module, the pattern compiler module for compiling a deterministic finite automaton (DFA), the compiling comprising: receiving a plurality of base class vectors and a plurality of negated base class vectors; receiving one or more unmapped transition rules in an unmapped list; and processing each of the one or more unmapped transition rules, the processing comprising:
selecting and removing one unmapped transition rule from the unmapped list;
creating an input vector from the selected transition rule;
generating one or more mapped rules from the input vector; and
storing the one or more mapped rules in a mapped list. 7. The system of claim 6, wherein the unmapped list is sorted according to a decreasing class size, and the unmapped transition rules are processed according to the sorted order. 8. The system of claim 6, wherein the generating comprises mapping the input vector to a regular rule. 9. The system of claim 6, wherein the generating comprises mapping the input vector to a base class combination. 10. The system of claim 9, wherein when the input vector comprises characters that are not in the base class combination, the processing further comprises:
creating a new unmapped transition rule; adding the characters to the new unmapped transition rule; and placing the new unmapped transition rule in the unmapped list. 11. The system of claim 10 wherein the unmapped list is sorted according to a decreasing class size in response to the placing. 12. The system of claim 9, wherein when the base class combination comprises characters that are not in the input vector, the processing further comprises:
incrementing a priority of each transition rule in the unmapped list and the mapped list; creating a new unmapped transition rule; adding the characters to the new unmapped transition rule; setting a priority of the new unmapped transition rule; and placing the new unmapped transition rule in the unmapped list. 13. The system of claim 12 wherein the unmapped list is sorted according to a decreasing class size in response to the placing. 14. The system of claim 9, wherein when the base class combination is equal to the input vector, the processing further comprises:
creating a new mapped transition rule; adding the base class combination to the new mapped transition rule; and placing the new mapped transition rule in the mapped list. 15. A computer implemented method for base class mapping, comprising:
receiving, on a computer, a plurality of base class vectors and a plurality of negated base class vectors; receiving, on the computer, one or more unmapped transition rules in an unmapped list; and processing, on the computer, each of the one or more unmapped transition rules, the processing comprising:
selecting and removing one unmapped transition rule from the unmapped list;
creating an input vector from the selected transition rule;
generating one or more mapped rules from the input vector; and
storing the one or more mapped rules in a mapped list. 16. The method of claim 15, wherein the unmapped list is sorted according to a decreasing class size, and the unmapped transition rules are processed according to the sorted order. 17. The method of claim 15, wherein the generating comprises mapping the input vector to a regular rule. 18. The method of claim 15, wherein the generating comprises mapping the input vector to a base class combination. 19. The method of claim 18, wherein when the input vector comprises characters that are not in the base class combination, the processing further comprises:
creating a new unmapped transition rule; adding the characters to the new unmapped transition rule; and placing the new unmapped transition rule in the unmapped list. 20. The method of claim 19 wherein the unmapped list is sorted according to a decreasing class size in response to the placing. 21. The method of claim 18, wherein when the base class combination comprises characters that are not in the input vector, the processing further comprises:
incrementing a priority of each transition rule in the unmapped list and the mapped list; creating a new unmapped transition rule; adding the characters to the new unmapped transition rule; setting a priority of the new unmapped transition rule; and placing the new unmapped transition rule in the unmapped list. 22. The method of claim 21 wherein the unmapped list is sorted according to a decreasing class size in response to the placing. 23. The method of claim 18, wherein when the base class combination is equal to the input vector, the processing further comprises:
creating a new mapped transition rule; adding the base class combination to the new mapped transition rule; and placing the new mapped transition rule in the mapped list. | 2,100 |
4,986 | 14,359,932 | 2,113 | A controller for operably coupling a drive unit to a host unit in a serial advanced technology attachment (SATA) system is described. The controller comprises a hardware processor arranged to: receive a plurality of SATA data frames; identify a first primitive sequence in at least one of the plurality of SATA data frames that adversely affects a performance of the SATA system; and replace the identified first primitive sequence with a second primitive sequence in response thereto. | 1. A controller for operably coupling a drive unit to a host unit in a serial advanced technology attachment (SATA) system, wherein the controller comprises a hardware processor arranged to:
receive a plurality of SATA data frames; identify a first primitive sequence in at least one of the plurality of SATA data frames, wherein the first primitive sequence adversely affects a performance of the SATA system; and replace the identified first primitive sequence with a second primitive sequence in response thereto. 2. The controller of claim 1 further comprising at least one primitive sequence queue module operably coupled to the hardware processor and arranged to provide the second primitive sequence to replace the identified first primitive sequence. 3. The controller of claim 1 wherein the controller further comprises a Primitive Modification Control (PMC) module operably coupled to the hardware processor and arranged to compare a primitive message of at least one SATA data frame with stored primitive data. 4. The controller of claim 3 wherein the PMC module is arranged to compare as a first input a primitive sequence from the plurality of SATA data frames with a second input of a primitive sequence output from a current primitive sequence queue (CPSQ) module and assume responsibility in outputting a transmission from the controller in response to detecting a match of said first input and said second input. 5. The controller of claim 4, wherein the PMC module is operably coupled to a modified primitive sequence queue (MPSQ) module and arranged to output a primitive sequence from the MPSQ module in response to detecting the match. 6. The controller of claim 4, wherein the PMC module comprises a masking register for masking a transition from outputting the received plurality of SATA data frames to outputting the second primitive sequence. 7. The controller of claim 4, wherein a last entry in the current primitive sequence queue comprises a ‘last entry’ indicator. 8. The controller of claim 4, wherein the PMC module is arranged to prepare an entry to an Exception Status Queue (ESQ) module coupled thereto, with information about the modified sequence. 9. The controller of claim 1 wherein the hardware processor identifies the first primitive sequence that adversely affects a performance of the SATA system by detecting an error or performance limiting event in at least one of: the primitive or primitive sequence. 10. The controller of claim 9, wherein in response to detecting an error or performance limiting event the hardware processor diverts the sequence comprising the primitive or primitive sequence in error to a software processor for handling of the sequence. 11. The controller of claim 3, wherein the PMC module comprises a frame tag input that functions as a frame identifier and includes control information. 12. The controller of claim 1, wherein the hardware processor is arranged to identify a first primitive sequence in at least one of the plurality of SATA data frames that adversely affects a performance of the SATA system; and replace the identified first primitive sequence with a second primitive sequence in response to a mode bit being activated. 13. A serial advanced technology attachment (SATA) system comprising the controller of claim 1. 14. A method of performance improvement in a serial advanced technology attachment (SATA) system, the method comprising:
receiving a plurality of SATA data frames; identifying, in at least one of the plurality of SATA data frames, a first primitive sequence that adversely affects a performance of the SATA system; and replacing the identified first primitive sequence with a second primitive sequence in response thereto. 15. A non-transitory computer program product comprising executable program code stored therein for performance improvement in a serial advanced technology attachment (SATA) system, the program code comprising instructions operable for performing a the method comprising:
receiving a plurality of SATA data frames; identifying, in at least one of the plurality of SATA data frames, a first primitive sequence that adversely affects a performance of the SATA system; and replacing the identified first primitive sequence with a second primitive sequence in response thereto. | A controller for operably coupling a drive unit to a host unit in a serial advanced technology attachment (SATA) system is described. The controller comprises a hardware processor arranged to: receive a plurality of SATA data frames; identify a first primitive sequence in at least one of the plurality of SATA data frames that adversely affects a performance of the SATA system; and replace the identified first primitive sequence with a second primitive sequence in response thereto.1. A controller for operably coupling a drive unit to a host unit in a serial advanced technology attachment (SATA) system, wherein the controller comprises a hardware processor arranged to:
receive a plurality of SATA data frames; identify a first primitive sequence in at least one of the plurality of SATA data frames, wherein the first primitive sequence adversely affects a performance of the SATA system; and replace the identified first primitive sequence with a second primitive sequence in response thereto. 2. The controller of claim 1 further comprising at least one primitive sequence queue module operably coupled to the hardware processor and arranged to provide the second primitive sequence to replace the identified first primitive sequence. 3. The controller of claim 1 wherein the controller further comprises a Primitive Modification Control (PMC) module operably coupled to the hardware processor and arranged to compare a primitive message of at least one SATA data frame with stored primitive data. 4. The controller of claim 3 wherein the PMC module is arranged to compare as a first input a primitive sequence from the plurality of SATA data frames with a second input of a primitive sequence output from a current primitive sequence queue (CPSQ) module and assume responsibility in outputting a transmission from the controller in response to detecting a match of said first input and said second input. 5. The controller of claim 4, wherein the PMC module is operably coupled to a modified primitive sequence queue (MPSQ) module and arranged to output a primitive sequence from the MPSQ module in response to detecting the match. 6. The controller of claim 4, wherein the PMC module comprises a masking register for masking a transition from outputting the received plurality of SATA data frames to outputting the second primitive sequence. 7. The controller of claim 4, wherein a last entry in the current primitive sequence queue comprises a ‘last entry’ indicator. 8. The controller of claim 4, wherein the PMC module is arranged to prepare an entry to an Exception Status Queue (ESQ) module coupled thereto, with information about the modified sequence. 9. The controller of claim 1 wherein the hardware processor identifies the first primitive sequence that adversely affects a performance of the SATA system by detecting an error or performance limiting event in at least one of: the primitive or primitive sequence. 10. The controller of claim 9, wherein in response to detecting an error or performance limiting event the hardware processor diverts the sequence comprising the primitive or primitive sequence in error to a software processor for handling of the sequence. 11. The controller of claim 3, wherein the PMC module comprises a frame tag input that functions as a frame identifier and includes control information. 12. The controller of claim 1, wherein the hardware processor is arranged to identify a first primitive sequence in at least one of the plurality of SATA data frames that adversely affects a performance of the SATA system; and replace the identified first primitive sequence with a second primitive sequence in response to a mode bit being activated. 13. A serial advanced technology attachment (SATA) system comprising the controller of claim 1. 14. A method of performance improvement in a serial advanced technology attachment (SATA) system, the method comprising:
receiving a plurality of SATA data frames; identifying, in at least one of the plurality of SATA data frames, a first primitive sequence that adversely affects a performance of the SATA system; and replacing the identified first primitive sequence with a second primitive sequence in response thereto. 15. A non-transitory computer program product comprising executable program code stored therein for performance improvement in a serial advanced technology attachment (SATA) system, the program code comprising instructions operable for performing a the method comprising:
receiving a plurality of SATA data frames; identifying, in at least one of the plurality of SATA data frames, a first primitive sequence that adversely affects a performance of the SATA system; and replacing the identified first primitive sequence with a second primitive sequence in response thereto. | 2,100 |
4,987 | 12,721,589 | 2,169 | A social networking activity reporting system (“SNARS”) and techniques are used for notifying a user of a client-side electronic device about updates (“activity items,” or “AIs”) from the user's social network. A relevance formula, which includes at least one time-dependent portion and at least one time-independent portion, is used to calculate a relevance score for an AI. For each AI, the time-dependent portion includes at least one factor based on a dynamic relationship between the user and the AI (for example, the relationship between the user or others in the user's social network and the publisher; or the amount of interaction the user or others in the user's social network have had with the item or subject). The AIs are presented in ascending or descending order based on the relevance scores. The relevance formula may be updated and re-applied to the same or a different set of activity items. | 1. A computer-readable storage medium encoded with computer-executable instructions which, when executed by a processor associated with a client-side electronic device, perform a method comprising:
identifying a group of online social networking resources; from time to time, identifying activity items comprising items of social networking content that have been published via online social networking resources within the group of online social networking resources, each activity item having a publisher and a subject, and having been published at a publishing time; at a selected time, forming a set of identified activity items, the set including activity items having different publishers and published via different online social networking resources; for each activity item in the set, identifying a dynamic relationship between a user of the client-side electronic device and either the subject of the activity item or the publisher of the activity item or both; for each activity item in the set, calculating a relevance score using a relevance formula based on the dynamic relationship; based on the calculated relevance score, determining a presentation order for each activity item in the set; and via the client-side electronic device, presenting each activity item in the set to the user in accordance with the determined presentation order. 2. The computer-readable storage medium according to claim 1, wherein the method further comprises:
storing the set; at a time after the selected time, identifying an updated relevance formula, different from the relevance formula; and for each activity item in the stored set, calculating a new relevance score using the new relevance formula; based on the calculated new relevance scores, determining a new presentation order for each activity item in the stored set; and presenting each activity item in the stored set to the user of the client-side electronic device in accordance with the determined new presentation order. 3. The computer-readable storage medium according to claim 1, wherein the method further comprises:
at a subsequent time after the selected time, identifying at least one new activity item comprising an item of social networking content that was published via an online social networking resource within the group of online social networking resources, the new activity item having a publisher and a subject, and having been published at a publishing time after the publishing times of each of the activity items of the set; forming a new set of activity items, the new set including the set of identified activity items and the new activity item; for each activity item in the new set, identifying the dynamic relationship between the user of the client-side electronic device and either the subject of the activity item or the publisher of the activity item or both; for each activity item in the new set, calculating a relevance score using the relevance formula; based on the calculated relevance scores, determining a new presentation order for each activity item in the new set; and presenting each activity item in the new set to the user of the client-side electronic device in accordance with the new presentation order. 4. The computer-readable storage medium according to claim 1,
wherein the relevance formula includes at least one time-dependent portion and at least one time-independent portion, the dynamic relationship a factor associated with the time-dependent portion. 5. The computer-readable storage medium according to claim 4, wherein the method further comprises:
assigning a first weight to the at least one time-independent portion; and assigning a second weight to the at least one time-dependent portion, the relevance scores calculated based on the assigned first and second weights. 6. The computer-readable storage medium according to claim 1, wherein for each activity item, the dynamic relationship is selected from the group comprising: an online relationship between the publisher and the user; an explicit or inferred interest of the user in the subject; and an amount of online interaction other people in the user's social network have had with the activity item or subject. 7. The computer-readable storage medium according to claim 1, wherein the plurality of online publishers comprise members of the user's social network. 8. The computer-readable storage medium according to claim 1, wherein the presentation order is selected from the group comprising: ascending relevance order; and descending relevance order. 9. The computer-readable storage medium according to claim 1, wherein identifying activity items comprises receiving activity items from an online server, and wherein the relevance formula is received from the online server. 10. A computer-readable storage medium encoded with computer-executable instructions which, when executed by a processor associated with an online server, perform a method comprising:
identifying a group of online social networking resources; from time to time, identifying activity items comprising items of social networking content that have been published via online social networking resources within the group of online social networking resources, each activity item having a publisher and a subject, and having been published at a publishing time; at a selected time, forming a set of identified activity items, the set including activity items having different publishers and published via different online social networking resources; for each activity item in the set, identifying a dynamic relationship between a user of a client-side electronic device and either the subject of the activity item or the publisher of the activity item or both; and for each activity item in the set, calculating a relevance score using a relevance formula based on the dynamic relationship. 11. The computer-readable storage medium according to claim 10,
wherein identifying the plurality of online publishers comprises identifying one or more social networking resources associated with each of the plurality of online publishers, and wherein identifying the set of activity items comprises accessing the one or more social networking resources, and retrieving individual activity items comprising the set. 12. The computer-readable storage medium according to claim 10, wherein the method further comprises:
transmitting the relevance formula to the client-side electronic device; and transmitting the set to the client-side electronic device. 13. The computer-readable storage medium according to claim 10, wherein the method further comprises:
at a subsequent time after the selected time, identifying at least one new activity item comprising an item of social networking content that was published via an online social networking resource within the group of online social networking resources, the new activity item having a publisher and a subject, and having been published at a publishing time after the publishing times of each of the activity items of the set; forming a new set of activity items, the new set including the set of identified activity items and the new activity item; for each activity item in the new set, identifying the dynamic relationship between a user of the client-side electronic device and either the subject of the activity item or the publisher of the activity item or both; for each activity item in the new set, calculating a relevance score using the relevance formula; and based on the calculated relevance scores, determining a new presentation order for each activity item in the new set. 14. The computer-readable storage medium according to claim 10,
wherein the relevance formula includes at least one time-dependent portion and at least one time-independent portion, the dynamic relationship a factor associated with the time-dependent portion. 15. The computer-readable storage medium according to claim 14, wherein the method further comprises:
assigning a first weight to the at least one time-independent portion; and assigning a second weight to the at least one time-dependent portion, the relevance scores calculated based on the assigned first and second weights. 16. The computer-readable storage medium according to claim 12, wherein the dynamic relationship is selected from the group comprising: an online relationship between the publisher and the user; an explicit or inferred interest of the user in the subject; and an amount of online interaction other people in the user's social network have had with the activity item or subject. 17. A system for reporting social networking activity to a user of a client-side electronic device, the system comprising:
a computer-readable storage medium; and a processor responsive to the computer-readable storage medium and to one or more computer programs stored in the computer-readable storage medium, the one or more computer programs, when loaded into the processor, operable to perform a method comprising: identifying a group of online social networking resources, from time to time, receiving from an online server activity items comprising items of social networking content that have been published via online social networking resources within the group of online social networking resources, each activity item having a publisher and a subject, and having been published at a publishing time, at a selected time, forming a set of identified activity items, the set including activity items having different publishers and published via different online social networking resources, for each activity item in the set, identifying a dynamic relationship between a user of the client-side electronic device and either the subject of the activity item or the publisher of the activity item or both, receiving a relevance formula from the online server, the relevance formula including at least one time-dependent portion and at least one time-independent portion, the dynamic relationship a factor associated with the time-dependent portion, for each activity item in the set, calculating a relevance score using the relevance formula, based on the calculated relevance score, determining a presentation order for each activity item in the set, and via the client-side electronic device, presenting each activity item in the set to the user in accordance with the determined presentation order. 18. The system according to claim 17, wherein the method further comprises
storing the set, at a time after the selected time, identifying an updated relevance formula, different from the relevance formula, and for each activity item in the stored set, calculating a new relevance score using the new relevance formula, based on the calculated new relevance scores, determining a new presentation order for each activity item in the stored set, and presenting each activity item in the stored set to the user of the client-side electronic device in accordance with the determined new presentation order. 19. The system according to claim 17, wherein time-independent portion includes a factor based on the subject of the activity item. 20. The system according to claim 17, wherein for each activity item, the dynamic relationship is selected from the group comprising: an online relationship between the publisher and the user; an explicit or inferred interest of the user in the subject; and an amount of online interaction other people have had with the activity item or subject. | A social networking activity reporting system (“SNARS”) and techniques are used for notifying a user of a client-side electronic device about updates (“activity items,” or “AIs”) from the user's social network. A relevance formula, which includes at least one time-dependent portion and at least one time-independent portion, is used to calculate a relevance score for an AI. For each AI, the time-dependent portion includes at least one factor based on a dynamic relationship between the user and the AI (for example, the relationship between the user or others in the user's social network and the publisher; or the amount of interaction the user or others in the user's social network have had with the item or subject). The AIs are presented in ascending or descending order based on the relevance scores. The relevance formula may be updated and re-applied to the same or a different set of activity items.1. A computer-readable storage medium encoded with computer-executable instructions which, when executed by a processor associated with a client-side electronic device, perform a method comprising:
identifying a group of online social networking resources; from time to time, identifying activity items comprising items of social networking content that have been published via online social networking resources within the group of online social networking resources, each activity item having a publisher and a subject, and having been published at a publishing time; at a selected time, forming a set of identified activity items, the set including activity items having different publishers and published via different online social networking resources; for each activity item in the set, identifying a dynamic relationship between a user of the client-side electronic device and either the subject of the activity item or the publisher of the activity item or both; for each activity item in the set, calculating a relevance score using a relevance formula based on the dynamic relationship; based on the calculated relevance score, determining a presentation order for each activity item in the set; and via the client-side electronic device, presenting each activity item in the set to the user in accordance with the determined presentation order. 2. The computer-readable storage medium according to claim 1, wherein the method further comprises:
storing the set; at a time after the selected time, identifying an updated relevance formula, different from the relevance formula; and for each activity item in the stored set, calculating a new relevance score using the new relevance formula; based on the calculated new relevance scores, determining a new presentation order for each activity item in the stored set; and presenting each activity item in the stored set to the user of the client-side electronic device in accordance with the determined new presentation order. 3. The computer-readable storage medium according to claim 1, wherein the method further comprises:
at a subsequent time after the selected time, identifying at least one new activity item comprising an item of social networking content that was published via an online social networking resource within the group of online social networking resources, the new activity item having a publisher and a subject, and having been published at a publishing time after the publishing times of each of the activity items of the set; forming a new set of activity items, the new set including the set of identified activity items and the new activity item; for each activity item in the new set, identifying the dynamic relationship between the user of the client-side electronic device and either the subject of the activity item or the publisher of the activity item or both; for each activity item in the new set, calculating a relevance score using the relevance formula; based on the calculated relevance scores, determining a new presentation order for each activity item in the new set; and presenting each activity item in the new set to the user of the client-side electronic device in accordance with the new presentation order. 4. The computer-readable storage medium according to claim 1,
wherein the relevance formula includes at least one time-dependent portion and at least one time-independent portion, the dynamic relationship a factor associated with the time-dependent portion. 5. The computer-readable storage medium according to claim 4, wherein the method further comprises:
assigning a first weight to the at least one time-independent portion; and assigning a second weight to the at least one time-dependent portion, the relevance scores calculated based on the assigned first and second weights. 6. The computer-readable storage medium according to claim 1, wherein for each activity item, the dynamic relationship is selected from the group comprising: an online relationship between the publisher and the user; an explicit or inferred interest of the user in the subject; and an amount of online interaction other people in the user's social network have had with the activity item or subject. 7. The computer-readable storage medium according to claim 1, wherein the plurality of online publishers comprise members of the user's social network. 8. The computer-readable storage medium according to claim 1, wherein the presentation order is selected from the group comprising: ascending relevance order; and descending relevance order. 9. The computer-readable storage medium according to claim 1, wherein identifying activity items comprises receiving activity items from an online server, and wherein the relevance formula is received from the online server. 10. A computer-readable storage medium encoded with computer-executable instructions which, when executed by a processor associated with an online server, perform a method comprising:
identifying a group of online social networking resources; from time to time, identifying activity items comprising items of social networking content that have been published via online social networking resources within the group of online social networking resources, each activity item having a publisher and a subject, and having been published at a publishing time; at a selected time, forming a set of identified activity items, the set including activity items having different publishers and published via different online social networking resources; for each activity item in the set, identifying a dynamic relationship between a user of a client-side electronic device and either the subject of the activity item or the publisher of the activity item or both; and for each activity item in the set, calculating a relevance score using a relevance formula based on the dynamic relationship. 11. The computer-readable storage medium according to claim 10,
wherein identifying the plurality of online publishers comprises identifying one or more social networking resources associated with each of the plurality of online publishers, and wherein identifying the set of activity items comprises accessing the one or more social networking resources, and retrieving individual activity items comprising the set. 12. The computer-readable storage medium according to claim 10, wherein the method further comprises:
transmitting the relevance formula to the client-side electronic device; and transmitting the set to the client-side electronic device. 13. The computer-readable storage medium according to claim 10, wherein the method further comprises:
at a subsequent time after the selected time, identifying at least one new activity item comprising an item of social networking content that was published via an online social networking resource within the group of online social networking resources, the new activity item having a publisher and a subject, and having been published at a publishing time after the publishing times of each of the activity items of the set; forming a new set of activity items, the new set including the set of identified activity items and the new activity item; for each activity item in the new set, identifying the dynamic relationship between a user of the client-side electronic device and either the subject of the activity item or the publisher of the activity item or both; for each activity item in the new set, calculating a relevance score using the relevance formula; and based on the calculated relevance scores, determining a new presentation order for each activity item in the new set. 14. The computer-readable storage medium according to claim 10,
wherein the relevance formula includes at least one time-dependent portion and at least one time-independent portion, the dynamic relationship a factor associated with the time-dependent portion. 15. The computer-readable storage medium according to claim 14, wherein the method further comprises:
assigning a first weight to the at least one time-independent portion; and assigning a second weight to the at least one time-dependent portion, the relevance scores calculated based on the assigned first and second weights. 16. The computer-readable storage medium according to claim 12, wherein the dynamic relationship is selected from the group comprising: an online relationship between the publisher and the user; an explicit or inferred interest of the user in the subject; and an amount of online interaction other people in the user's social network have had with the activity item or subject. 17. A system for reporting social networking activity to a user of a client-side electronic device, the system comprising:
a computer-readable storage medium; and a processor responsive to the computer-readable storage medium and to one or more computer programs stored in the computer-readable storage medium, the one or more computer programs, when loaded into the processor, operable to perform a method comprising: identifying a group of online social networking resources, from time to time, receiving from an online server activity items comprising items of social networking content that have been published via online social networking resources within the group of online social networking resources, each activity item having a publisher and a subject, and having been published at a publishing time, at a selected time, forming a set of identified activity items, the set including activity items having different publishers and published via different online social networking resources, for each activity item in the set, identifying a dynamic relationship between a user of the client-side electronic device and either the subject of the activity item or the publisher of the activity item or both, receiving a relevance formula from the online server, the relevance formula including at least one time-dependent portion and at least one time-independent portion, the dynamic relationship a factor associated with the time-dependent portion, for each activity item in the set, calculating a relevance score using the relevance formula, based on the calculated relevance score, determining a presentation order for each activity item in the set, and via the client-side electronic device, presenting each activity item in the set to the user in accordance with the determined presentation order. 18. The system according to claim 17, wherein the method further comprises
storing the set, at a time after the selected time, identifying an updated relevance formula, different from the relevance formula, and for each activity item in the stored set, calculating a new relevance score using the new relevance formula, based on the calculated new relevance scores, determining a new presentation order for each activity item in the stored set, and presenting each activity item in the stored set to the user of the client-side electronic device in accordance with the determined new presentation order. 19. The system according to claim 17, wherein time-independent portion includes a factor based on the subject of the activity item. 20. The system according to claim 17, wherein for each activity item, the dynamic relationship is selected from the group comprising: an online relationship between the publisher and the user; an explicit or inferred interest of the user in the subject; and an amount of online interaction other people have had with the activity item or subject. | 2,100 |
4,988 | 13,474,635 | 2,142 | Customizing menus for a consumer electronics device, including: preparing menu definitions for the menus to be customized on the consumer electronics device, wherein the menu customization is tailored to a consumer; generating menu configuration information using the prepared menu definitions; and transmitting the generated menu configuration information to the consumer electronics device. Keywords include user customization of menus and consumer electronics device. | 1. A method of customizing menus for a consumer electronics device, the method comprising:
preparing menu definitions for the menus to be customized on the consumer electronics device, wherein the menu customization is tailored to a consumer; generating menu configuration information using the prepared menu definitions; and transmitting the generated menu configuration information to the consumer electronics device. 2. The method of claim 1, wherein the device specific information specifies the consumer electronics device, and
wherein the consumer electronics device is customized with menu definitions specified by the consumer. 3. The method of claim 2, wherein the device specific information includes
a unique device identifier to identify the consumer electronics device. 4. The method of claim 3, further comprising:
receiving the unique device identifier from the consumer electronics device; and sending a temporary code to the consumer electronics device and associating the unique device identifier to the temporary code. 5. The method of claim 4, further comprising
using the temporary code to associate the consumer electronics device with the consumer. 6. The method of claim 1, further comprising
using a code displayed on the consumer electronics device to ensure that the consumer configuring the consumer electronics device has physical possession of the device and that the device is properly connected to a network such that the device receives a menu customization. 7. The method of claim 1, further comprising
enabling the consumer to trigger a menu customization request for the consumer electronics device by utilizing an on-device application or web-site. 8. The method of claim 7, wherein enabling the consumer to trigger a menu customization request comprises
duplicating actions of the consumer which are used frequently into a shortcut menu. 9. The method of claim 7, wherein enabling the consumer to trigger a menu customization request comprises
saving a current menu configuration into a preset menu. 10. The method of claim 1, further comprising:
enabling the consumer to customize the menus; and controlling ordering, nesting, and availability of menu items. 11. The method of claim 1, further comprising
enabling the consumer to create named presets for menu customizations to allow switching between sets of customizations. 12. The method of claim 1, further comprising
generating the menu customization that limits at least one of Internet channels and broadcast channels that can be accessed through the menus. 13. The method of claim 1, further comprising
generating the menu customization that limits at least one of Internet channels and broadcast channels that can be accessed using buttons. 14. The method of claim 1, further comprising
setting maximum volume and parental rating limit when the menu customization is applied. 15. The method of claim 1, further comprising
adding menu items to the menu customization to switch to a particular preset of menu customizations. 16. The method of claim 1, wherein the menu customization includes duplicate menu items. 17. The method of claim 1, wherein the menu customization renames menu items. 18. The method of claim 1, wherein the menu customization specifies icons to use for menu items. 19. The method of claim 1, further comprising
enabling the consumer to use an image file for a menu item in the menu customization. 20. The method of claim 1, further comprising
specifying shared customizations in terms of changes so that the shared customization is applied to consumer electronics devices with different base menus. 21. The method of claim 1, further comprising
applying multiple configurations to the consumer electronics device such that effects stack with each other. 22. The method of claim 1, further comprising
applying menu changes to the consumer electronics device through a web site. 23. The method of claim 1, further comprising
setting up a parental control code for the menu customization that is required to switch to another menu customization. 24. The method of claim 23, further comprising
providing different parental control codes that allow access to different sets of menu customizations. 25. The method of claim 1, wherein a password is required for an account used to register for a menu customization. 26. The method of claim 1, further comprising
receiving a menu customization request from the consumer electronics device, wherein the menu customization request includes device specific information to identify the consumer electronics device. 27. A non-transitory storage medium storing a computer program to customize menus for a consumer electronics device, the computer program comprising executable instructions that cause a computer to:
prepare menu definitions for the menus to be customized on the consumer electronics device, wherein the menu customization is tailored to a consumer; generate menu configuration information using the prepared menu definitions; and transmit the generated menu configuration information to the consumer electronics device. | Customizing menus for a consumer electronics device, including: preparing menu definitions for the menus to be customized on the consumer electronics device, wherein the menu customization is tailored to a consumer; generating menu configuration information using the prepared menu definitions; and transmitting the generated menu configuration information to the consumer electronics device. Keywords include user customization of menus and consumer electronics device.1. A method of customizing menus for a consumer electronics device, the method comprising:
preparing menu definitions for the menus to be customized on the consumer electronics device, wherein the menu customization is tailored to a consumer; generating menu configuration information using the prepared menu definitions; and transmitting the generated menu configuration information to the consumer electronics device. 2. The method of claim 1, wherein the device specific information specifies the consumer electronics device, and
wherein the consumer electronics device is customized with menu definitions specified by the consumer. 3. The method of claim 2, wherein the device specific information includes
a unique device identifier to identify the consumer electronics device. 4. The method of claim 3, further comprising:
receiving the unique device identifier from the consumer electronics device; and sending a temporary code to the consumer electronics device and associating the unique device identifier to the temporary code. 5. The method of claim 4, further comprising
using the temporary code to associate the consumer electronics device with the consumer. 6. The method of claim 1, further comprising
using a code displayed on the consumer electronics device to ensure that the consumer configuring the consumer electronics device has physical possession of the device and that the device is properly connected to a network such that the device receives a menu customization. 7. The method of claim 1, further comprising
enabling the consumer to trigger a menu customization request for the consumer electronics device by utilizing an on-device application or web-site. 8. The method of claim 7, wherein enabling the consumer to trigger a menu customization request comprises
duplicating actions of the consumer which are used frequently into a shortcut menu. 9. The method of claim 7, wherein enabling the consumer to trigger a menu customization request comprises
saving a current menu configuration into a preset menu. 10. The method of claim 1, further comprising:
enabling the consumer to customize the menus; and controlling ordering, nesting, and availability of menu items. 11. The method of claim 1, further comprising
enabling the consumer to create named presets for menu customizations to allow switching between sets of customizations. 12. The method of claim 1, further comprising
generating the menu customization that limits at least one of Internet channels and broadcast channels that can be accessed through the menus. 13. The method of claim 1, further comprising
generating the menu customization that limits at least one of Internet channels and broadcast channels that can be accessed using buttons. 14. The method of claim 1, further comprising
setting maximum volume and parental rating limit when the menu customization is applied. 15. The method of claim 1, further comprising
adding menu items to the menu customization to switch to a particular preset of menu customizations. 16. The method of claim 1, wherein the menu customization includes duplicate menu items. 17. The method of claim 1, wherein the menu customization renames menu items. 18. The method of claim 1, wherein the menu customization specifies icons to use for menu items. 19. The method of claim 1, further comprising
enabling the consumer to use an image file for a menu item in the menu customization. 20. The method of claim 1, further comprising
specifying shared customizations in terms of changes so that the shared customization is applied to consumer electronics devices with different base menus. 21. The method of claim 1, further comprising
applying multiple configurations to the consumer electronics device such that effects stack with each other. 22. The method of claim 1, further comprising
applying menu changes to the consumer electronics device through a web site. 23. The method of claim 1, further comprising
setting up a parental control code for the menu customization that is required to switch to another menu customization. 24. The method of claim 23, further comprising
providing different parental control codes that allow access to different sets of menu customizations. 25. The method of claim 1, wherein a password is required for an account used to register for a menu customization. 26. The method of claim 1, further comprising
receiving a menu customization request from the consumer electronics device, wherein the menu customization request includes device specific information to identify the consumer electronics device. 27. A non-transitory storage medium storing a computer program to customize menus for a consumer electronics device, the computer program comprising executable instructions that cause a computer to:
prepare menu definitions for the menus to be customized on the consumer electronics device, wherein the menu customization is tailored to a consumer; generate menu configuration information using the prepared menu definitions; and transmit the generated menu configuration information to the consumer electronics device. | 2,100 |
4,989 | 15,202,123 | 2,111 | A digital system, components and method are configured with nonvolatile memory for storing digital data using codewords. The data is stored in the memory using multiple bits per memory cell of the memory. A code efficiency, for purposes of write operations and read operations relating to the memory, can be changed on a codeword to codeword basis based on input parameters. The code efficiency can change based on changing any one of the input parameters including bit density that is stored by the memory. Storing and reading fractional bit densities is described. | 1. A digital system, comprising:
a host device; a nonvolatile memory including a plurality memory cells; and an encoder/decoder arrangement for interfacing the host device with the nonvolatile memory for transferring read data and write data therebetween in a series of codewords with each codeword having a codeword size such that an encoded data flow from the host device to the nonvolatile memory and a decoded data flow from the nonvolatile memory to the host device are each subject at least to a code efficiency that is based on a convolutional code and the encoder/decoder arrangement is configured for receiving one or more input parameters such that the code efficiency is changeable responsive to a change in the input parameters on a codeword to codeword basis. 2. The digital system of claim 1 wherein each codeword is made up of a plurality of symbols to make up a codeword length with each symbol representing a value to be stored in one of the memory cells and the encoder/decoder arrangement is configured for operating in a first mode to produce a first code efficiency in a first codeword of a given series of codewords and for operating in a second mode to produce a second code efficiency in a second codeword of the given series of codewords. | A digital system, components and method are configured with nonvolatile memory for storing digital data using codewords. The data is stored in the memory using multiple bits per memory cell of the memory. A code efficiency, for purposes of write operations and read operations relating to the memory, can be changed on a codeword to codeword basis based on input parameters. The code efficiency can change based on changing any one of the input parameters including bit density that is stored by the memory. Storing and reading fractional bit densities is described.1. A digital system, comprising:
a host device; a nonvolatile memory including a plurality memory cells; and an encoder/decoder arrangement for interfacing the host device with the nonvolatile memory for transferring read data and write data therebetween in a series of codewords with each codeword having a codeword size such that an encoded data flow from the host device to the nonvolatile memory and a decoded data flow from the nonvolatile memory to the host device are each subject at least to a code efficiency that is based on a convolutional code and the encoder/decoder arrangement is configured for receiving one or more input parameters such that the code efficiency is changeable responsive to a change in the input parameters on a codeword to codeword basis. 2. The digital system of claim 1 wherein each codeword is made up of a plurality of symbols to make up a codeword length with each symbol representing a value to be stored in one of the memory cells and the encoder/decoder arrangement is configured for operating in a first mode to produce a first code efficiency in a first codeword of a given series of codewords and for operating in a second mode to produce a second code efficiency in a second codeword of the given series of codewords. | 2,100 |
4,990 | 14,225,719 | 2,176 | A method and apparatus for controlling a jump/scroll event on a terminal includes receiving a touch signal. The touch signal indicates at least one performed gesture; determining that a jump/scroll event has occurred when the performed gesture is substantially similar to at least one candidate gesture; and orienting a document to at least one jump/scroll position based on the determining. | 1. A method of controlling a jump/scroll event on a terminal, the method comprising:
receiving, by the terminal, a touch signal, the touch signal indicating at least one performed gesture; determining, by the terminal, that a jump/scroll event has occurred when the performed gesture is substantially similar to at least one candidate gesture; and orienting, by the terminal, a document to at least one jump/scroll position based on the determining. 2. The method of claim 1, further comprising:
analyzing the document to detect the at least one jump/scroll position in the document. 3. The method of claim 2, wherein the analyzing comprises:
detecting at least one mark contained in the document; and storing a location value associated with the at least one mark as the at least one jump/scroll position. 4. The method of claim 3, wherein the at least one mark comprises at least one tag provided in one of hypertext markup language (HTML) Extensible Markup Language (XML), and Extensible Hypertext Markup Language (XHTML). 5. The method of claim 2, wherein the analyzing comprises:
inserting at least one mark into the document; and storing a location value associated with the at least one mark as the at least one jump/scroll position. 6. The method of claim 1, wherein the determining comprises:
determining that the jump/scroll event occurs by comparing a value with a threshold, the value being calculated based on the received touch signal. 7. The method of claim 6, further comprising:
determining a touch direction from the received touch signal; and determining that the jump/scroll event occurs when the determined touch direction has a similar direction as a desired scrolling direction. 8. The method of claim 6, wherein the calculated value comprises at least one of a speed of the received touch signal, a distance of the received touch signal, and a pressure of the received touch signal. 9. The method of claim 6, wherein the threshold comprises a plurality of threshold values, each of the plurality of threshold values corresponding to a position within the document. 10. The method of claim 1, wherein the orienting comprises:
determining a location value of a new jump/scroll position by comparing a location value of a current position in the document with a location value of the at least one jump/scroll position in the document; and orienting to the new jump/scroll position in the document. 11. The method of claim 10, wherein the orienting to the jump/scroll position further comprises:
storing the location value of the new jump/scroll position as the location value of the current position after the moving to the new jump/scroll position. 12. The method of claim 9, further comprising:
determining a touch behavior based on the received touch signal; and adjusting the threshold based on the determined touch behavior. 13. The method of claim 12, wherein the adjusting the threshold is based on at least one of,
a first reaction, the first reaction including a first other touch signal that indicates a performed gesture that is not substantially similar to the candidate gesture, the first other touch signal being received in a first touch direction that has an opposite direction than a second touch direction, the first reaction occurring within a first time period after the jump/scroll event occurs in the first touch direction, and a second reaction, the second reaction including a second other touch signal, the second reaction being received in the first touch direction, the second reaction occurring within a second time period after the first other touch signal is received in the first touch direction. 14. The method of claim 1, wherein the received touch signal indicates the at least one performed gesture and at least one gesture related criterion, and the determining further comprises:
determining that the jump/scroll event has occurred when the performed gesture is substantially the same as the at least one candidate gesture and the at least one gesture related criterion is substantially the same as at least one candidate gesture related criterion. 15. An apparatus for controlling a jump/scroll event on a terminal, the apparatus comprising:
an input unit configured to receive a touch signal; a display unit configured to display at least one received document; and a scroll processor configured to orient the at least one received document to at least one jump/scroll position based on the received touch signal, the touch signal indicating at least one performed gesture, the scroll processor including,
a touch signal analysis module configured to determine that a jump/scroll event has occurred when the performed gesture is substantially similar to at least one candidate gesture, and
a document movement module configured to orient the at least one received document to the at least one jump/scroll position based on the determining. 16. The apparatus of claim 15, wherein the scroll processor further comprises:
a document analysis module configured to analyze the at least one received document to detect the at least one jump/scroll position in the document. 17. The apparatus of claim 15, wherein the touch signal analysis module is further configured to determine that the jump scroll event has occurred by comparing a value calculated from the received touch signal with a threshold. 18. The apparatus of claim 15, wherein the scroll processor further comprises:
a behavior analysis module configured to determine a touch behavior based on the received touch signal; and a threshold adjustment module configured to adjust the threshold based on the determined touch behavior. 19. The apparatus of claim 18, wherein the threshold adjustment module is configured to adjust the threshold based on at least one of:
a first reaction, the first reaction including a first other touch signal that indicates a performed gesture that is not substantially similar to the candidate gesture, the first other touch signal being received in a first touch direction opposite to a second touch direction, the first reaction occurring within a first time period after the jump/scroll event occurs in the first touch direction; and a second reaction, the second reaction including a second other touch signal, the second reaction being received in the first touch direction, the second reaction occurring within a second time period after the first other touch signal is received in the first touch direction. 20. A non-transitory computer-readable recording medium having recorded thereon a program that, when executed by a processor, performs a function of:
receiving a touch signal, a touch signal indicating at least one performed gesture; determining that a jump/scroll event has occurred when the performed gesture is substantially similar to at least one candidate gesture; and orienting a document to at least one jump/scroll position based on the determining. | A method and apparatus for controlling a jump/scroll event on a terminal includes receiving a touch signal. The touch signal indicates at least one performed gesture; determining that a jump/scroll event has occurred when the performed gesture is substantially similar to at least one candidate gesture; and orienting a document to at least one jump/scroll position based on the determining.1. A method of controlling a jump/scroll event on a terminal, the method comprising:
receiving, by the terminal, a touch signal, the touch signal indicating at least one performed gesture; determining, by the terminal, that a jump/scroll event has occurred when the performed gesture is substantially similar to at least one candidate gesture; and orienting, by the terminal, a document to at least one jump/scroll position based on the determining. 2. The method of claim 1, further comprising:
analyzing the document to detect the at least one jump/scroll position in the document. 3. The method of claim 2, wherein the analyzing comprises:
detecting at least one mark contained in the document; and storing a location value associated with the at least one mark as the at least one jump/scroll position. 4. The method of claim 3, wherein the at least one mark comprises at least one tag provided in one of hypertext markup language (HTML) Extensible Markup Language (XML), and Extensible Hypertext Markup Language (XHTML). 5. The method of claim 2, wherein the analyzing comprises:
inserting at least one mark into the document; and storing a location value associated with the at least one mark as the at least one jump/scroll position. 6. The method of claim 1, wherein the determining comprises:
determining that the jump/scroll event occurs by comparing a value with a threshold, the value being calculated based on the received touch signal. 7. The method of claim 6, further comprising:
determining a touch direction from the received touch signal; and determining that the jump/scroll event occurs when the determined touch direction has a similar direction as a desired scrolling direction. 8. The method of claim 6, wherein the calculated value comprises at least one of a speed of the received touch signal, a distance of the received touch signal, and a pressure of the received touch signal. 9. The method of claim 6, wherein the threshold comprises a plurality of threshold values, each of the plurality of threshold values corresponding to a position within the document. 10. The method of claim 1, wherein the orienting comprises:
determining a location value of a new jump/scroll position by comparing a location value of a current position in the document with a location value of the at least one jump/scroll position in the document; and orienting to the new jump/scroll position in the document. 11. The method of claim 10, wherein the orienting to the jump/scroll position further comprises:
storing the location value of the new jump/scroll position as the location value of the current position after the moving to the new jump/scroll position. 12. The method of claim 9, further comprising:
determining a touch behavior based on the received touch signal; and adjusting the threshold based on the determined touch behavior. 13. The method of claim 12, wherein the adjusting the threshold is based on at least one of,
a first reaction, the first reaction including a first other touch signal that indicates a performed gesture that is not substantially similar to the candidate gesture, the first other touch signal being received in a first touch direction that has an opposite direction than a second touch direction, the first reaction occurring within a first time period after the jump/scroll event occurs in the first touch direction, and a second reaction, the second reaction including a second other touch signal, the second reaction being received in the first touch direction, the second reaction occurring within a second time period after the first other touch signal is received in the first touch direction. 14. The method of claim 1, wherein the received touch signal indicates the at least one performed gesture and at least one gesture related criterion, and the determining further comprises:
determining that the jump/scroll event has occurred when the performed gesture is substantially the same as the at least one candidate gesture and the at least one gesture related criterion is substantially the same as at least one candidate gesture related criterion. 15. An apparatus for controlling a jump/scroll event on a terminal, the apparatus comprising:
an input unit configured to receive a touch signal; a display unit configured to display at least one received document; and a scroll processor configured to orient the at least one received document to at least one jump/scroll position based on the received touch signal, the touch signal indicating at least one performed gesture, the scroll processor including,
a touch signal analysis module configured to determine that a jump/scroll event has occurred when the performed gesture is substantially similar to at least one candidate gesture, and
a document movement module configured to orient the at least one received document to the at least one jump/scroll position based on the determining. 16. The apparatus of claim 15, wherein the scroll processor further comprises:
a document analysis module configured to analyze the at least one received document to detect the at least one jump/scroll position in the document. 17. The apparatus of claim 15, wherein the touch signal analysis module is further configured to determine that the jump scroll event has occurred by comparing a value calculated from the received touch signal with a threshold. 18. The apparatus of claim 15, wherein the scroll processor further comprises:
a behavior analysis module configured to determine a touch behavior based on the received touch signal; and a threshold adjustment module configured to adjust the threshold based on the determined touch behavior. 19. The apparatus of claim 18, wherein the threshold adjustment module is configured to adjust the threshold based on at least one of:
a first reaction, the first reaction including a first other touch signal that indicates a performed gesture that is not substantially similar to the candidate gesture, the first other touch signal being received in a first touch direction opposite to a second touch direction, the first reaction occurring within a first time period after the jump/scroll event occurs in the first touch direction; and a second reaction, the second reaction including a second other touch signal, the second reaction being received in the first touch direction, the second reaction occurring within a second time period after the first other touch signal is received in the first touch direction. 20. A non-transitory computer-readable recording medium having recorded thereon a program that, when executed by a processor, performs a function of:
receiving a touch signal, a touch signal indicating at least one performed gesture; determining that a jump/scroll event has occurred when the performed gesture is substantially similar to at least one candidate gesture; and orienting a document to at least one jump/scroll position based on the determining. | 2,100 |
4,991 | 14,142,648 | 2,173 | A device displays a plurality of selectable user interface objects that includes one or more folder icons on a display. The device detects a first input requesting to select a folder icon for a folder that includes selectable icons divided between a plurality of distinct separately displayed pages of a folder view. In response to detecting the first input, the device displays a first page of the folder view. While displaying the first page of the folder view, the device detects a second input that corresponds to a request to display a second page of the folder view. In response to detecting the second input, the device ceases to display the first page and displays the second page of the folder view. | 1. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display cause the device to:
concurrently display a plurality of selectable user interface objects that includes one or more folder icons on the display; detect a first input that corresponds to a request to select a respective folder icon for a respective folder, the respective folder including a first number of selectable icons divided between a plurality of distinct separately displayed pages, including a first page and a second page; and in response to detecting the first input, display a folder view for the respective folder, wherein:
the folder view includes room to simultaneously display no more than a second number of selectable icons that is less than the first number of selectable icons; and
the folder view displays the first page that includes a first subset of the selectable icons in the folder;
while displaying the first page of the folder view, detect a second input that corresponds to a request to display the second page of the folder view; and in response to detecting the second input, cease to display the first page of the folder view and display the second page of the folder view for the respective folder, wherein the second page of the folder view includes a second subset of the selectable icons different from the first subset of the selectable icons. 2. The computer readable storage medium of claim 1, wherein:
displaying the folder view includes displaying two or more page indicator icons that provide information about the number of distinct pages of selectable icons between which selectable icons in the folder are divided; after detecting the first input and before detecting the second input, the two or more page indicator icons have a first appearance; and the computer readable storage medium includes instructions, which when executed by the electronic device cause the device to, in response to detecting the second input, update the two or more page indicator icons to have a second appearance, different from the first appearance. 3. The computer readable storage medium of claim 2, wherein the page indicator icons indicate a location of a currently displayed page in the folder view in a sequence of pages of selectable icons in the respective folder. 4. The computer readable storage medium of claim 2, wherein:
the first appearance of the page indicator icons indicates that the first page is currently displayed in the folder view; and the second appearance of the page indicator icons indicates that the second page is currently displayed in the folder view. 5. The computer readable storage medium of claim 1, wherein:
the first subset of the selectable icons is displayed in a first arrangement in the first page of the folder view; and prior to detecting the first input, the respective folder icon includes a plurality of reduced scale representations of the first subset of the selectable icons displayed in the first arrangement. 6. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device cause the device to:
while displaying the second page of the folder view, detect a third input that corresponds to a request to close the folder view; and in response to detecting the third input:
cease to display the folder view; and
display, in the respective folder icon for the respective folder, reduced scale representations of the second subset of the selectable icons. 7. The computer readable storage medium of claim 6, including instructions, which when executed by the electronic device cause the device to, after displaying reduced scale representations of the second subset of the selectable icons in the respective folder icon, display replacement of the reduced scale representations of the second subset of the selectable icons with reduced scale representations of the first subset of the selectable icons in the respective folder icon. 8. The computer readable storage medium of claim 1, wherein:
prior to detecting the first input, the plurality of selectable user interface objects are displayed in a respective arrangement; and displaying the folder view for the respective folder in response to detecting the first input includes:
zooming in on the respective folder icon, wherein zooming in on the respective folder icon includes enlarging the respective arrangement so that the respective folder icon is enlarged and moves toward a center of the display; and
after zooming in on the respective folder icon, displaying replacement of the enlarged respective folder icon with the folder view. 9. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device cause the device to, in response to detecting the first input, cease to display the plurality of selectable user interface objects. 10. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device cause the device to:
while displaying the second page of the folder view, detect a fourth input that corresponds to a request to move a respective icon from the second page of the folder view to a respective location on the display; and in response to detecting the fourth input:
in accordance with a determination that the respective location is within a predetermined page-change region, move the respective icon from the second page to a different page of the folder view; and
in accordance with a determination that the respective location is within a predetermined icon-removal region that is distinct from the page-change region, remove the respective icon from the folder view. 11. The computer readable storage medium of claim 10, wherein the page-change region is at or near a right side of the folder view. 12. The computer readable storage medium of claim 10, wherein the icon-removal region is at or near a bottom of the folder view. 13. The computer readable storage medium of claim 1, wherein:
the plurality of selectable user interface objects is a first page of selectable user interface objects in a plurality of distinct separately displayed pages of selectable user interface objects; and the computer readable storage medium includes instructions, which when executed by the electronic device cause the device to:
receive a fifth input that corresponds to a request to display a different page of selectable user interface objects in the plurality of distinct separately displayed pages of selectable user interface objects; and
in response to receiving the fifth input:
cease to display the first page of selectable user interface objects; and
display a second page of selectable user interface objects different from the first page of selectable user interface objects. 14. The computer readable storage medium of claim 1, wherein:
the first input is a tap gesture on the respective folder icon; and the second input is a swipe gesture within the folder view. 15. An electronic device, comprising:
a display; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
concurrently displaying a plurality of selectable user interface objects that includes one or more folder icons on the display;
detecting a first input that corresponds to a request to select a respective folder icon for a respective folder, the respective folder including a first number of selectable icons divided between a plurality of distinct separately displayed pages, including a first page and a second page; and
in response to detecting the first input, displaying a folder view for the respective folder, wherein:
the folder view includes room to simultaneously display no more than a second number of selectable icons that is less than the first number of selectable icons; and
the folder view displays the first page that includes a first subset of the selectable icons in the folder;
while displaying the first page of the folder view, detecting a second input that corresponds to a request to display the second page of the folder view; and in response to detecting the second input, ceasing to display the first page of the folder view and displaying the second page of the folder view for the respective folder, wherein the second page of the folder view includes a second subset of the selectable icons different from the first subset of the selectable icons. 16. A method comprising:
at an electronic device with a display:
concurrently displaying a plurality of selectable user interface objects that includes one or more folder icons on the display;
detecting a first input that corresponds to a request to select a respective folder icon for a respective folder, the respective folder including a first number of selectable icons divided between a plurality of distinct separately displayed pages, including a first page and a second page; and
in response to detecting the first input, displaying a folder view for the respective folder, wherein:
the folder view includes room to simultaneously display no more than a second number of selectable icons that is less than the first number of selectable icons; and
the folder view displays the first page that includes a first subset of the selectable icons in the folder;
while displaying the first page of the folder view, detecting a second input that corresponds to a request to display the second page of the folder view; and in response to detecting the second input, ceasing to display the first page of the folder view and displaying the second page of the folder view for the respective folder, wherein the second page of the folder view includes a second subset of the selectable icons different from the first subset of the selectable icons. | A device displays a plurality of selectable user interface objects that includes one or more folder icons on a display. The device detects a first input requesting to select a folder icon for a folder that includes selectable icons divided between a plurality of distinct separately displayed pages of a folder view. In response to detecting the first input, the device displays a first page of the folder view. While displaying the first page of the folder view, the device detects a second input that corresponds to a request to display a second page of the folder view. In response to detecting the second input, the device ceases to display the first page and displays the second page of the folder view.1. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display cause the device to:
concurrently display a plurality of selectable user interface objects that includes one or more folder icons on the display; detect a first input that corresponds to a request to select a respective folder icon for a respective folder, the respective folder including a first number of selectable icons divided between a plurality of distinct separately displayed pages, including a first page and a second page; and in response to detecting the first input, display a folder view for the respective folder, wherein:
the folder view includes room to simultaneously display no more than a second number of selectable icons that is less than the first number of selectable icons; and
the folder view displays the first page that includes a first subset of the selectable icons in the folder;
while displaying the first page of the folder view, detect a second input that corresponds to a request to display the second page of the folder view; and in response to detecting the second input, cease to display the first page of the folder view and display the second page of the folder view for the respective folder, wherein the second page of the folder view includes a second subset of the selectable icons different from the first subset of the selectable icons. 2. The computer readable storage medium of claim 1, wherein:
displaying the folder view includes displaying two or more page indicator icons that provide information about the number of distinct pages of selectable icons between which selectable icons in the folder are divided; after detecting the first input and before detecting the second input, the two or more page indicator icons have a first appearance; and the computer readable storage medium includes instructions, which when executed by the electronic device cause the device to, in response to detecting the second input, update the two or more page indicator icons to have a second appearance, different from the first appearance. 3. The computer readable storage medium of claim 2, wherein the page indicator icons indicate a location of a currently displayed page in the folder view in a sequence of pages of selectable icons in the respective folder. 4. The computer readable storage medium of claim 2, wherein:
the first appearance of the page indicator icons indicates that the first page is currently displayed in the folder view; and the second appearance of the page indicator icons indicates that the second page is currently displayed in the folder view. 5. The computer readable storage medium of claim 1, wherein:
the first subset of the selectable icons is displayed in a first arrangement in the first page of the folder view; and prior to detecting the first input, the respective folder icon includes a plurality of reduced scale representations of the first subset of the selectable icons displayed in the first arrangement. 6. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device cause the device to:
while displaying the second page of the folder view, detect a third input that corresponds to a request to close the folder view; and in response to detecting the third input:
cease to display the folder view; and
display, in the respective folder icon for the respective folder, reduced scale representations of the second subset of the selectable icons. 7. The computer readable storage medium of claim 6, including instructions, which when executed by the electronic device cause the device to, after displaying reduced scale representations of the second subset of the selectable icons in the respective folder icon, display replacement of the reduced scale representations of the second subset of the selectable icons with reduced scale representations of the first subset of the selectable icons in the respective folder icon. 8. The computer readable storage medium of claim 1, wherein:
prior to detecting the first input, the plurality of selectable user interface objects are displayed in a respective arrangement; and displaying the folder view for the respective folder in response to detecting the first input includes:
zooming in on the respective folder icon, wherein zooming in on the respective folder icon includes enlarging the respective arrangement so that the respective folder icon is enlarged and moves toward a center of the display; and
after zooming in on the respective folder icon, displaying replacement of the enlarged respective folder icon with the folder view. 9. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device cause the device to, in response to detecting the first input, cease to display the plurality of selectable user interface objects. 10. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device cause the device to:
while displaying the second page of the folder view, detect a fourth input that corresponds to a request to move a respective icon from the second page of the folder view to a respective location on the display; and in response to detecting the fourth input:
in accordance with a determination that the respective location is within a predetermined page-change region, move the respective icon from the second page to a different page of the folder view; and
in accordance with a determination that the respective location is within a predetermined icon-removal region that is distinct from the page-change region, remove the respective icon from the folder view. 11. The computer readable storage medium of claim 10, wherein the page-change region is at or near a right side of the folder view. 12. The computer readable storage medium of claim 10, wherein the icon-removal region is at or near a bottom of the folder view. 13. The computer readable storage medium of claim 1, wherein:
the plurality of selectable user interface objects is a first page of selectable user interface objects in a plurality of distinct separately displayed pages of selectable user interface objects; and the computer readable storage medium includes instructions, which when executed by the electronic device cause the device to:
receive a fifth input that corresponds to a request to display a different page of selectable user interface objects in the plurality of distinct separately displayed pages of selectable user interface objects; and
in response to receiving the fifth input:
cease to display the first page of selectable user interface objects; and
display a second page of selectable user interface objects different from the first page of selectable user interface objects. 14. The computer readable storage medium of claim 1, wherein:
the first input is a tap gesture on the respective folder icon; and the second input is a swipe gesture within the folder view. 15. An electronic device, comprising:
a display; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
concurrently displaying a plurality of selectable user interface objects that includes one or more folder icons on the display;
detecting a first input that corresponds to a request to select a respective folder icon for a respective folder, the respective folder including a first number of selectable icons divided between a plurality of distinct separately displayed pages, including a first page and a second page; and
in response to detecting the first input, displaying a folder view for the respective folder, wherein:
the folder view includes room to simultaneously display no more than a second number of selectable icons that is less than the first number of selectable icons; and
the folder view displays the first page that includes a first subset of the selectable icons in the folder;
while displaying the first page of the folder view, detecting a second input that corresponds to a request to display the second page of the folder view; and in response to detecting the second input, ceasing to display the first page of the folder view and displaying the second page of the folder view for the respective folder, wherein the second page of the folder view includes a second subset of the selectable icons different from the first subset of the selectable icons. 16. A method comprising:
at an electronic device with a display:
concurrently displaying a plurality of selectable user interface objects that includes one or more folder icons on the display;
detecting a first input that corresponds to a request to select a respective folder icon for a respective folder, the respective folder including a first number of selectable icons divided between a plurality of distinct separately displayed pages, including a first page and a second page; and
in response to detecting the first input, displaying a folder view for the respective folder, wherein:
the folder view includes room to simultaneously display no more than a second number of selectable icons that is less than the first number of selectable icons; and
the folder view displays the first page that includes a first subset of the selectable icons in the folder;
while displaying the first page of the folder view, detecting a second input that corresponds to a request to display the second page of the folder view; and in response to detecting the second input, ceasing to display the first page of the folder view and displaying the second page of the folder view for the respective folder, wherein the second page of the folder view includes a second subset of the selectable icons different from the first subset of the selectable icons. | 2,100 |
4,992 | 14,231,644 | 2,143 | Techniques and apparatuses for highlighting media through weighting of people or contexts are described. This document describes techniques that allow a user to quickly and easily highlight media, such as through generating a highlight reel. The techniques also enable selection of context and person weightings by which to tailor highlight reels. | 1. A method comprising:
determining, at a computing device, persons in source media; presenting, at the computing device, a user interface enabling selection to weight the persons determined to be in the source media; receiving, at the computing device, selection weighting the persons; and creating, at the computing device, a highlight reel based on the source media and the selected weightings of the persons. 2. The method as recited in claim 1, further comprising, after creating the highlight reel or a reel preview of the highlight reel:
determining weightings of contexts in the highlight reel or the reel preview; presenting one or more of the weightings of the contexts in a second user interface; enabling selection to alter the one or more weightings; and responsive to receiving selection to alter the one or more weightings, altering the highlight reel or the reel preview based on the alteration to the one or more weightings of the contexts. 3. The method as recited in claim 1, further comprising creating, prior to presenting the user interface enabling selection, a reel preview and wherein creating the highlight reel creates a final highlight reel. 4. The method as recited in claim 1, further comprising, after creating the highlight reel:
presenting the highlight reel; presenting a second user interface enabling selection to weight the persons in the highlight reel; and responsive to a second selection weighting the persons, creating a final highlight reel based on the second selection. 5. The method as recited in claim 4, wherein presenting the second user interface:
presents an image for each of the persons in the highlight reel, each of the images representing each person's face and having a size corresponding to the person's weighting in the highlight reel; and enables the second selection weighting the persons by altering the size of one of the images. 6. The method as recited in claim 1, wherein receiving selection receives selection of a selected one of the persons, the selection increasing or decreasing a weight of the selected person and further comprising adjusting a visual representation of a second weighting of another of the persons to compensate for the selection of the selected person. 7. The method as recited in claim 1, wherein presenting the user interface enabling selection to weight the persons further enables selection to weight contexts determined to be in the source media and further comprising receiving selection weighting the contexts, and wherein creating the highlight reel is further based on the selected weightings of the contexts. 8. The method as recited in claim 1, wherein the selection weighting the persons is received through one or more slider bars. 9. The method as recited in claim 8, wherein each slider bar includes an image of the person on the slider bar, the person movable on the slider bar to select the weighting. 10. The method as recited in claim 1, wherein selection is received through a single gesture, the single gesture selecting weightings of two or more of the persons. 11. A method comprising:
enabling, at a computing device, selection to weight two or more persons in audiovisual media; receiving, at the computing device, selection weighting the persons; determining, at the computing device, source media from the audiovisual media based on the source media having the selected, weighted persons; and creating, at the computing device, a highlight reel based on the determined source media and the selected weightings of the person. 12. The method as recited in claim 11, further comprising, responsive to the selected, weighted persons being selected, requesting, from one or more of the selected, weighted persons, media associated with the one or more of the selected, weighted persons. 13. The method as recited in claim 12, further comprising sharing the highlight reel automatically with one of the one more selected, weighted persons from which the requested media was received. 14. The method as recited in claim 11, further comprising:
creating a reel preview; presenting the reel preview; enabling a second selection to weight the persons; and responsive to a second selection weighting the persons, creating a final highlight reel based on the second selection. 15. The method as recited in claim 11, wherein selection is enabled through a graphical user interface and receiving selection receives a graphical selection of one of the persons that increases or decreases a weight of the one of the persons, and further comprising adjusting a visual representation of a second weighting of another of the persons to compensate for the selection of the one of the persons. 16. The method as recited in claim 11, wherein selection is enabled through slider bars of a graphical user interface, each slider bar associated with a respective one of the persons and including an image of the person movable on the slider bar to weight the person. 17. One or more computer-readable storage media having instructions stored thereon that, responsive to execution by one or more computer processors, perform operations comprising:
determining contextual variety for source media, the contextual variety indicating multiple contexts within the source media; presenting a graphical user interface enabling selection to weight one or more of the multiple contexts; receiving selection weighting one of the multiple contexts; and creating a highlight reel based on the source media and the selected weighting. 18. The media of claim 17, wherein the multiple contexts include having a scene that is indoors, outdoors, at night, during daytime, at particular times, during particular seasons, or associated with particular events or media albums. 19. The media of claim 17, wherein receiving selection receives selection of one of the contexts, the selection increasing or decreasing a weight of the one of the contexts and further comprising adjusting a visual representation of a second weighting of another of the contexts to compensate for the selection of the one of the contexts. 20. The media of claim 17, the operations further comprising, after creating the highlight reel or a reel preview of the highlight reel:
determining weightings of persons in the highlight reel or the reel preview; presenting one or more of the weightings of the persons and the weightings of the context in one or more other user interfaces; enabling selection to alter the weightings of the persons and the contexts; and responsive to receiving selection to alter the weighting of the persons or the contexts, altering the highlight reel or the reel preview based on the selection to alter the weighting. | Techniques and apparatuses for highlighting media through weighting of people or contexts are described. This document describes techniques that allow a user to quickly and easily highlight media, such as through generating a highlight reel. The techniques also enable selection of context and person weightings by which to tailor highlight reels.1. A method comprising:
determining, at a computing device, persons in source media; presenting, at the computing device, a user interface enabling selection to weight the persons determined to be in the source media; receiving, at the computing device, selection weighting the persons; and creating, at the computing device, a highlight reel based on the source media and the selected weightings of the persons. 2. The method as recited in claim 1, further comprising, after creating the highlight reel or a reel preview of the highlight reel:
determining weightings of contexts in the highlight reel or the reel preview; presenting one or more of the weightings of the contexts in a second user interface; enabling selection to alter the one or more weightings; and responsive to receiving selection to alter the one or more weightings, altering the highlight reel or the reel preview based on the alteration to the one or more weightings of the contexts. 3. The method as recited in claim 1, further comprising creating, prior to presenting the user interface enabling selection, a reel preview and wherein creating the highlight reel creates a final highlight reel. 4. The method as recited in claim 1, further comprising, after creating the highlight reel:
presenting the highlight reel; presenting a second user interface enabling selection to weight the persons in the highlight reel; and responsive to a second selection weighting the persons, creating a final highlight reel based on the second selection. 5. The method as recited in claim 4, wherein presenting the second user interface:
presents an image for each of the persons in the highlight reel, each of the images representing each person's face and having a size corresponding to the person's weighting in the highlight reel; and enables the second selection weighting the persons by altering the size of one of the images. 6. The method as recited in claim 1, wherein receiving selection receives selection of a selected one of the persons, the selection increasing or decreasing a weight of the selected person and further comprising adjusting a visual representation of a second weighting of another of the persons to compensate for the selection of the selected person. 7. The method as recited in claim 1, wherein presenting the user interface enabling selection to weight the persons further enables selection to weight contexts determined to be in the source media and further comprising receiving selection weighting the contexts, and wherein creating the highlight reel is further based on the selected weightings of the contexts. 8. The method as recited in claim 1, wherein the selection weighting the persons is received through one or more slider bars. 9. The method as recited in claim 8, wherein each slider bar includes an image of the person on the slider bar, the person movable on the slider bar to select the weighting. 10. The method as recited in claim 1, wherein selection is received through a single gesture, the single gesture selecting weightings of two or more of the persons. 11. A method comprising:
enabling, at a computing device, selection to weight two or more persons in audiovisual media; receiving, at the computing device, selection weighting the persons; determining, at the computing device, source media from the audiovisual media based on the source media having the selected, weighted persons; and creating, at the computing device, a highlight reel based on the determined source media and the selected weightings of the person. 12. The method as recited in claim 11, further comprising, responsive to the selected, weighted persons being selected, requesting, from one or more of the selected, weighted persons, media associated with the one or more of the selected, weighted persons. 13. The method as recited in claim 12, further comprising sharing the highlight reel automatically with one of the one more selected, weighted persons from which the requested media was received. 14. The method as recited in claim 11, further comprising:
creating a reel preview; presenting the reel preview; enabling a second selection to weight the persons; and responsive to a second selection weighting the persons, creating a final highlight reel based on the second selection. 15. The method as recited in claim 11, wherein selection is enabled through a graphical user interface and receiving selection receives a graphical selection of one of the persons that increases or decreases a weight of the one of the persons, and further comprising adjusting a visual representation of a second weighting of another of the persons to compensate for the selection of the one of the persons. 16. The method as recited in claim 11, wherein selection is enabled through slider bars of a graphical user interface, each slider bar associated with a respective one of the persons and including an image of the person movable on the slider bar to weight the person. 17. One or more computer-readable storage media having instructions stored thereon that, responsive to execution by one or more computer processors, perform operations comprising:
determining contextual variety for source media, the contextual variety indicating multiple contexts within the source media; presenting a graphical user interface enabling selection to weight one or more of the multiple contexts; receiving selection weighting one of the multiple contexts; and creating a highlight reel based on the source media and the selected weighting. 18. The media of claim 17, wherein the multiple contexts include having a scene that is indoors, outdoors, at night, during daytime, at particular times, during particular seasons, or associated with particular events or media albums. 19. The media of claim 17, wherein receiving selection receives selection of one of the contexts, the selection increasing or decreasing a weight of the one of the contexts and further comprising adjusting a visual representation of a second weighting of another of the contexts to compensate for the selection of the one of the contexts. 20. The media of claim 17, the operations further comprising, after creating the highlight reel or a reel preview of the highlight reel:
determining weightings of persons in the highlight reel or the reel preview; presenting one or more of the weightings of the persons and the weightings of the context in one or more other user interfaces; enabling selection to alter the weightings of the persons and the contexts; and responsive to receiving selection to alter the weighting of the persons or the contexts, altering the highlight reel or the reel preview based on the selection to alter the weighting. | 2,100 |
4,993 | 15,032,327 | 2,139 | A method for compressing and compacting memory on a memory device is described. The method includes organizing a number of compressed memory pages referenced in a number of compaction table entries based on a size of the number of compressed memory pages and compressing the number of compaction table entries, in which a compaction table entry comprise a number of fields. | 1. A method for compressing and compacting memory on a memory device, comprising:
organizing a number of compressed memory pages referenced in a number of compaction table entries based on a size of the number of compressed memory pages; and compressing the number of compaction table entries, in which a compaction table entry comprises a number of fields. 2. The method of claim 1, in which a compaction table entry includes a number of back-pointer fields, each back-pointer field to indicate formatting information for a compaction table entry. 3. The method of claim 1, in which a compaction table entry includes a number of overflow pointers, each overflow pointer to indicate a location of additional compressed data. 4. The method of claim 1, in which organizing memory pages referenced by a compaction table entry comprises grouping together compressed memory pages of the same size. 5. The method of claim 1, in which organizing memory pages referenced by a compaction table entry comprises selecting a compression size for a number of memory pages. 6. The method of claim 1, further comprising managing data compression and data decompression based on memory device usage. 7. The method of claim 6, in which managing data compression and decompression comprises scheduling when to compress and decompress based on memory device usage. 8. The method of claim 6, in which managing data compression and decompression comprises selecting a compression process based on memory device usage. 9. The method of claim 6, in which managing data compression and decompression comprises speculatively compressing and decompressing data based on memory device usage. 10. The method of claim 1, in which the compaction table is organized based on memory chunk granularities, memory page granularities, or combinations thereof. 11. A system for compressing and compacting memory on a memory device, comprising:
a compression controller to schedule data compression and data decompression based on memory device usage; a memory module to store a compaction table, compressed data, uncompressed data, or combinations thereof; and a compression engine to compress and decompress data stored in memory and organize memory pages represented in a compaction table. 12. The system of claim 11, in which the compression controller further comprises a working set predictor to indicate a current working set. 13. The system of claim 11, in which the compression controller further comprises a compaction table cache to cache portions of the compaction table that correspond to the working set. 14. The system of claim 10, in which the compression controller further comprises controlling logic to managing data compression and data decompression based on a working set predictor and a compaction table cache. 15. A computer program product for compressing and compacting memory on a memory device, the computer program product comprising:
a computer readable storage medium comprising computer usable program code embodied therewith, the computer usable program code to, when executed by a processor:
schedule data compression and decompression based on memory device usage;
group compressed memory pages of the same size together, in which the memory pages are represented in a compaction table;
resize a number of memory pages to the same size; and
compress a number of fields of a compaction table entry. | A method for compressing and compacting memory on a memory device is described. The method includes organizing a number of compressed memory pages referenced in a number of compaction table entries based on a size of the number of compressed memory pages and compressing the number of compaction table entries, in which a compaction table entry comprise a number of fields.1. A method for compressing and compacting memory on a memory device, comprising:
organizing a number of compressed memory pages referenced in a number of compaction table entries based on a size of the number of compressed memory pages; and compressing the number of compaction table entries, in which a compaction table entry comprises a number of fields. 2. The method of claim 1, in which a compaction table entry includes a number of back-pointer fields, each back-pointer field to indicate formatting information for a compaction table entry. 3. The method of claim 1, in which a compaction table entry includes a number of overflow pointers, each overflow pointer to indicate a location of additional compressed data. 4. The method of claim 1, in which organizing memory pages referenced by a compaction table entry comprises grouping together compressed memory pages of the same size. 5. The method of claim 1, in which organizing memory pages referenced by a compaction table entry comprises selecting a compression size for a number of memory pages. 6. The method of claim 1, further comprising managing data compression and data decompression based on memory device usage. 7. The method of claim 6, in which managing data compression and decompression comprises scheduling when to compress and decompress based on memory device usage. 8. The method of claim 6, in which managing data compression and decompression comprises selecting a compression process based on memory device usage. 9. The method of claim 6, in which managing data compression and decompression comprises speculatively compressing and decompressing data based on memory device usage. 10. The method of claim 1, in which the compaction table is organized based on memory chunk granularities, memory page granularities, or combinations thereof. 11. A system for compressing and compacting memory on a memory device, comprising:
a compression controller to schedule data compression and data decompression based on memory device usage; a memory module to store a compaction table, compressed data, uncompressed data, or combinations thereof; and a compression engine to compress and decompress data stored in memory and organize memory pages represented in a compaction table. 12. The system of claim 11, in which the compression controller further comprises a working set predictor to indicate a current working set. 13. The system of claim 11, in which the compression controller further comprises a compaction table cache to cache portions of the compaction table that correspond to the working set. 14. The system of claim 10, in which the compression controller further comprises controlling logic to managing data compression and data decompression based on a working set predictor and a compaction table cache. 15. A computer program product for compressing and compacting memory on a memory device, the computer program product comprising:
a computer readable storage medium comprising computer usable program code embodied therewith, the computer usable program code to, when executed by a processor:
schedule data compression and decompression based on memory device usage;
group compressed memory pages of the same size together, in which the memory pages are represented in a compaction table;
resize a number of memory pages to the same size; and
compress a number of fields of a compaction table entry. | 2,100 |
4,994 | 13,873,930 | 2,141 | A screen sharing session between a participating computer and a presenting computer can be established. A copy of a graphical user interface screen from the presenting computer can be presented within a display on the participating computer. A selection of the sub-portion of the copy of the graphical user interface screen from the participating computer can be received. Boundaries of the sub-portion can be determined and can be transmitted from the participating computer to the presenting computer. Responsive to receiving the boundaries, the remotely located computer can define the sub-portion of the graphical user interface screen of the presenting computer. The defined sub-portion of the graphical user interface screen can be conveyed over a network from the presenting computer to the participating computer without conveying data for other portions of the graphical user interface screen. | 1. For an application session between a participating computer and a presenting computer, a method comprising:
presenting within a display on the participating computer, a copy of a graphical user interface screen from the presenting computer; receiving a selection of at least one sub-portion of the copy of the graphical user interface screen from a user of the participating computer; and determining boundaries of the at least one sub-portion, and transmitting the boundaries from the participating computer to the presenting computer, without conveying data for other portions of the graphical user interface screen. 2. The method of claim 1, further comprising;
receiving over a network from the presenting computer to the participating computer, a defined sub-portion of the graphical user interface screen without conveying data for other portions of the graphical user interface screen, which conserves on bandwidth conveyed over the network. 3. The method of claim 2, wherein the at least one sub-portion is independent of content of the graphical user interface handled by the presenting computer for any device other than the participating computer. 4. The method of claim 1, wherein the presenting computer provides at least a portion of the graphical user interface screen to a plurality of different computers, including the participating computer, wherein the boundaries defined for the participating computer, which affects the at least one sub-portion of the graphical user interface screen sent from the presenting computer to the participating computer, has no effect on other ones of the different computers. 5. The method of claim 1, wherein the boundaries defined for the participating computer, which affects the at least one sub-portion of the graphical user interface screen sent from the presenting computer to the participating computer has no effect on a display of the graphical user interface screen for the presenting computer, which includes content outside the defined boundaries of the at least one sub-portion. 6. The method of claim 1, wherein the at least one sub-portion is redefined during a session by the user. 7. The method of claim 1, wherein the boundaries comprise of at least one of a position and a dimension associated with the graphical user interface. 8. The method of claim 1, wherein the position of the at least one sub-portion within the display of the participating computer is different than the position of the at least one sub-portion on the presenting computer. 9. The method of claim 1, wherein the user defines multiple concurrent sub-portions within a screen sharing session. 10. The method of claim 1, wherein the at least one sub-portion within the display of the participating computer is displayed differently than the sub-portion on the presenting computer, wherein the difference is at least one of an aspect ratio, a resolution, and a color depth. 11. A method for improving application sharing comprising:
executing an application on a first computer, which presents content on a first display of the first computer; a plurality of remotely located computers each receiving a sub-portion of the content on the first display, wherein said plurality of remotely located computers comprise at least a second computer and at least a third computer; defining a second user-specific sub-portion of the content of the first display, wherein only the second user-specific sub-portion of the content of the first display is sent from the first computer to the second computer meaning the a non-selected portion of the content is never conveyed from the first computer to the second computer; the second computer displaying the second user-specific sub-portion of the content on a second display of the second computer; selecting a third user-specific sub-portion of the content of the first display, wherein only the third user-specific sub-portion of the content of the first display is sent from the first computer to the third computer meaning the a non-selected portion of the content is never conveyed from the first computer to the third computer; and the third computer displaying the third user-specific sub-portion of the content on a third display of the third computer. 12. The method of claim 11, wherein the content is content for a live or recorded presentation that is provided from the first computer to the remotely located computers over a network. 13. The method of claim 11, wherein the content is content for a real-time remote desktop session that is provided from the first computer to the remotely located computers over a network. 14. The method of claim 11, wherein each of the remotely located computers is able to specific a different sub-portion of the content for transmission over a network and for remote display that is independent of other ones of the remotely located computer. | A screen sharing session between a participating computer and a presenting computer can be established. A copy of a graphical user interface screen from the presenting computer can be presented within a display on the participating computer. A selection of the sub-portion of the copy of the graphical user interface screen from the participating computer can be received. Boundaries of the sub-portion can be determined and can be transmitted from the participating computer to the presenting computer. Responsive to receiving the boundaries, the remotely located computer can define the sub-portion of the graphical user interface screen of the presenting computer. The defined sub-portion of the graphical user interface screen can be conveyed over a network from the presenting computer to the participating computer without conveying data for other portions of the graphical user interface screen.1. For an application session between a participating computer and a presenting computer, a method comprising:
presenting within a display on the participating computer, a copy of a graphical user interface screen from the presenting computer; receiving a selection of at least one sub-portion of the copy of the graphical user interface screen from a user of the participating computer; and determining boundaries of the at least one sub-portion, and transmitting the boundaries from the participating computer to the presenting computer, without conveying data for other portions of the graphical user interface screen. 2. The method of claim 1, further comprising;
receiving over a network from the presenting computer to the participating computer, a defined sub-portion of the graphical user interface screen without conveying data for other portions of the graphical user interface screen, which conserves on bandwidth conveyed over the network. 3. The method of claim 2, wherein the at least one sub-portion is independent of content of the graphical user interface handled by the presenting computer for any device other than the participating computer. 4. The method of claim 1, wherein the presenting computer provides at least a portion of the graphical user interface screen to a plurality of different computers, including the participating computer, wherein the boundaries defined for the participating computer, which affects the at least one sub-portion of the graphical user interface screen sent from the presenting computer to the participating computer, has no effect on other ones of the different computers. 5. The method of claim 1, wherein the boundaries defined for the participating computer, which affects the at least one sub-portion of the graphical user interface screen sent from the presenting computer to the participating computer has no effect on a display of the graphical user interface screen for the presenting computer, which includes content outside the defined boundaries of the at least one sub-portion. 6. The method of claim 1, wherein the at least one sub-portion is redefined during a session by the user. 7. The method of claim 1, wherein the boundaries comprise of at least one of a position and a dimension associated with the graphical user interface. 8. The method of claim 1, wherein the position of the at least one sub-portion within the display of the participating computer is different than the position of the at least one sub-portion on the presenting computer. 9. The method of claim 1, wherein the user defines multiple concurrent sub-portions within a screen sharing session. 10. The method of claim 1, wherein the at least one sub-portion within the display of the participating computer is displayed differently than the sub-portion on the presenting computer, wherein the difference is at least one of an aspect ratio, a resolution, and a color depth. 11. A method for improving application sharing comprising:
executing an application on a first computer, which presents content on a first display of the first computer; a plurality of remotely located computers each receiving a sub-portion of the content on the first display, wherein said plurality of remotely located computers comprise at least a second computer and at least a third computer; defining a second user-specific sub-portion of the content of the first display, wherein only the second user-specific sub-portion of the content of the first display is sent from the first computer to the second computer meaning the a non-selected portion of the content is never conveyed from the first computer to the second computer; the second computer displaying the second user-specific sub-portion of the content on a second display of the second computer; selecting a third user-specific sub-portion of the content of the first display, wherein only the third user-specific sub-portion of the content of the first display is sent from the first computer to the third computer meaning the a non-selected portion of the content is never conveyed from the first computer to the third computer; and the third computer displaying the third user-specific sub-portion of the content on a third display of the third computer. 12. The method of claim 11, wherein the content is content for a live or recorded presentation that is provided from the first computer to the remotely located computers over a network. 13. The method of claim 11, wherein the content is content for a real-time remote desktop session that is provided from the first computer to the remotely located computers over a network. 14. The method of claim 11, wherein each of the remotely located computers is able to specific a different sub-portion of the content for transmission over a network and for remote display that is independent of other ones of the remotely located computer. | 2,100 |
4,995 | 14,936,730 | 2,117 | A method, computer program product and computer system is provided. A processor retrieves a plurality of pressure readings from a matrix of pressure sensors. A processor identifies a movement within the matrix of pressure sensors based, at least in part, on the plurality of pressure readings. In response to a determination that the movement is characteristic of a movement assisting device, a processor enables a voice recognition system for receiving speech commands to operate a device. | 1. A method comprising:
retrieving, by one or more processors, a plurality of pressure readings from a matrix of pressure sensors; identifying, by the one or more processors, a movement within the matrix of pressure sensors based, at least in part, on the plurality of pressure readings; and in response to a determination that the movement is characteristic of a movement assisting device, enabling, by the one or more processors, a voice recognition system for receiving speech commands to operate a device. 2. The method of claim 1, wherein the matrix of pressure sensors comprises a plurality of adjacent hexagonal pressure sensors. 3. The method of claim 1, wherein the movement assisting device is (i) a wheelchair, (ii) a stroller, (iii) a stretcher, (iv) a walking frame, or (v) a load bearing device. 4. The method of claim 1, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a first set of one or more neighboring pressure sensors being activated. 5. The method of claim 4, wherein a second set of one or more neighboring pressure sensors are deactivated. 6. The method of claim 1, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a distance between a first group of activated pressure sensors and a second group of activated pressure sensors. 7. The method of claim 6, wherein the distance is equal to the width of the movement assisting device. 8. A computer program product comprising:
one or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the program instructions comprising:
program instructions to retrieve a plurality of pressure readings from a matrix of pressure sensors;
program instructions to identify a movement within the matrix of pressure sensors based, at least in part, on the plurality of pressure readings; and
in response to a determination that the movement is characteristic of a movement assisting device, program instructions to enable a voice recognition system for receiving speech commands to operate a device. 9. The computer program product of claim 8, wherein the matrix of pressure sensors comprises a plurality of adjacent hexagonal pressure sensors. 10. The computer program product of claim 8, wherein the movement assisting device is (i) a wheelchair, (ii) a stroller, (iii) a stretcher, (iv) a walking frame, or (v) a load bearing device. 11. The computer program product of claim 8, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a first set of one or more neighboring pressure sensors being activated. 12. The computer program product of claim 11, wherein a second set of one or more neighboring pressure sensors are deactivated. 13. The computer program product of claim 8, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a distance between a first group of activated pressure sensors and a second group of activated pressure sensors. 14. The computer program product of claim 13, wherein the distance is equal to the width of the movement assisting device. 15. A computer system comprising:
one or more computer processors; one or more computer readable storage media; and program instructions stored on the computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising:
program instructions to retrieve a plurality of pressure readings from a matrix of pressure sensors;
program instructions to identify a movement within the matrix of pressure sensors based, at least in part, on the plurality of pressure readings; and
in response to a determination that the movement is characteristic of a movement assisting device, program instructions to enable a voice recognition system for receiving speech commands to operate a device. 16. The computer system of claim 15, wherein the matrix of pressure sensors comprises a plurality of adjacent hexagonal pressure sensors. 17. The computer system of claim 15, wherein the movement assisting device is (i) a wheelchair, (ii) a stroller, (iii) a stretcher, (iv) a walking frame, or (v) a load bearing device. 18. The computer system of claim 15, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a first set of one or more neighboring pressure sensors being activated. 19. The computer system of claim 18, wherein a second set of one or more neighboring pressure sensors are deactivated. 20. The computer system of claim 15, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a distance between a first group of activated pressure sensors and a second group of activated pressure sensors. | A method, computer program product and computer system is provided. A processor retrieves a plurality of pressure readings from a matrix of pressure sensors. A processor identifies a movement within the matrix of pressure sensors based, at least in part, on the plurality of pressure readings. In response to a determination that the movement is characteristic of a movement assisting device, a processor enables a voice recognition system for receiving speech commands to operate a device.1. A method comprising:
retrieving, by one or more processors, a plurality of pressure readings from a matrix of pressure sensors; identifying, by the one or more processors, a movement within the matrix of pressure sensors based, at least in part, on the plurality of pressure readings; and in response to a determination that the movement is characteristic of a movement assisting device, enabling, by the one or more processors, a voice recognition system for receiving speech commands to operate a device. 2. The method of claim 1, wherein the matrix of pressure sensors comprises a plurality of adjacent hexagonal pressure sensors. 3. The method of claim 1, wherein the movement assisting device is (i) a wheelchair, (ii) a stroller, (iii) a stretcher, (iv) a walking frame, or (v) a load bearing device. 4. The method of claim 1, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a first set of one or more neighboring pressure sensors being activated. 5. The method of claim 4, wherein a second set of one or more neighboring pressure sensors are deactivated. 6. The method of claim 1, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a distance between a first group of activated pressure sensors and a second group of activated pressure sensors. 7. The method of claim 6, wherein the distance is equal to the width of the movement assisting device. 8. A computer program product comprising:
one or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the program instructions comprising:
program instructions to retrieve a plurality of pressure readings from a matrix of pressure sensors;
program instructions to identify a movement within the matrix of pressure sensors based, at least in part, on the plurality of pressure readings; and
in response to a determination that the movement is characteristic of a movement assisting device, program instructions to enable a voice recognition system for receiving speech commands to operate a device. 9. The computer program product of claim 8, wherein the matrix of pressure sensors comprises a plurality of adjacent hexagonal pressure sensors. 10. The computer program product of claim 8, wherein the movement assisting device is (i) a wheelchair, (ii) a stroller, (iii) a stretcher, (iv) a walking frame, or (v) a load bearing device. 11. The computer program product of claim 8, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a first set of one or more neighboring pressure sensors being activated. 12. The computer program product of claim 11, wherein a second set of one or more neighboring pressure sensors are deactivated. 13. The computer program product of claim 8, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a distance between a first group of activated pressure sensors and a second group of activated pressure sensors. 14. The computer program product of claim 13, wherein the distance is equal to the width of the movement assisting device. 15. A computer system comprising:
one or more computer processors; one or more computer readable storage media; and program instructions stored on the computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising:
program instructions to retrieve a plurality of pressure readings from a matrix of pressure sensors;
program instructions to identify a movement within the matrix of pressure sensors based, at least in part, on the plurality of pressure readings; and
in response to a determination that the movement is characteristic of a movement assisting device, program instructions to enable a voice recognition system for receiving speech commands to operate a device. 16. The computer system of claim 15, wherein the matrix of pressure sensors comprises a plurality of adjacent hexagonal pressure sensors. 17. The computer system of claim 15, wherein the movement assisting device is (i) a wheelchair, (ii) a stroller, (iii) a stretcher, (iv) a walking frame, or (v) a load bearing device. 18. The computer system of claim 15, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a first set of one or more neighboring pressure sensors being activated. 19. The computer system of claim 18, wherein a second set of one or more neighboring pressure sensors are deactivated. 20. The computer system of claim 15, wherein the determination of the movement is characteristic of the movement assisting device is based, at least in part, on a distance between a first group of activated pressure sensors and a second group of activated pressure sensors. | 2,100 |
4,996 | 14,323,921 | 2,135 | Systems, methods and/or devices are used to enable using history of I/O sizes and I/O sequences to trigger coalesced writes in a non-volatile storage device. In one aspect, the method includes (1) receiving a plurality of input/output (I/O) requests to be performed in a plurality of regions in a logical address space of a host, and (2) performing one or more operations for each region of the plurality of regions in the logical address space of the host, including (a) determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold during a predetermined time period, (b) determining whether the region has a history of sequential write requests during the predetermined time period, and (c) if both determinations are true, coalescing subsequent write requests to the region. | 1. A method, comprising:
receiving, at a storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold during a predetermined time period;
determining whether the region has a history of sequential write requests during the predetermined time period; and
in accordance with a determination that the region has a history of I/O requests to access data of size less than a predefined small-size threshold during the predetermined time period and that the region has a history of sequential write requests during the predetermined time period, coalescing subsequent write requests to the region. 2. The method of claim 1, wherein coalescing subsequent write requests to the region includes:
performing a read ahead operation, to read data from a storage medium of the storage device; storing read data obtained by the read ahead operation to a cache; writing one or more subsequent write requests to the cache; and writing contents of the cache to the storage medium in a merged operation. 3. The method of claim 1, wherein, with respect to a region of the plurality of regions, determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold includes:
tracking a total number of write requests to write data of size less than the predefined small-size threshold; and determining whether the total number of write requests to write data of size less than the predefined small-size threshold is greater than a first threshold. 4. The method of claim 1, wherein, with respect to a region of the plurality of regions, determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold includes:
tracking a total number of write requests to write data of size less than the predefined small-size threshold; tracking a total number of write requests to write data of size greater than a predefined large-size threshold; and determining whether the total number of write requests to write data of size less than the predefined small-size threshold is greater than a first threshold and whether the total number of write requests to write data of size greater than a predefined large-size threshold is less than a second threshold. 5. The method of claim 1, wherein, with respect to a region of the plurality of regions, determining whether the region has a history of sequential write requests during the predetermined time period includes tracking whether a total number of sequential I/O requests to the region has exceeded a sequential request threshold. 6. The method of claim 1, wherein, with respect to a region of the plurality of regions, determining whether the region has a history of sequential write requests during the predetermined time period includes tracking whether a total number of sequential I/O requests to the region has exceeded a sequential request threshold and tracking whether a total number of sequential write requests to the region has exceeded a sequential write threshold. 7. The method of claim 5, further comprising, for each region of the plurality of regions in the logical address space, setting a flag to denote the determination of whether the total number of sequential I/O requests to the region has exceeded the sequential request threshold. 8. The method of claim 1, further comprising, for each region of the plurality of regions in the logical address space, setting a flag to denote the determination of whether the region has a history of sequential write requests during the predetermined time period. 9. The method of claim 1, further comprising, for each region of the plurality of regions in the logical address space, storing information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. 10. The method of claim 1, wherein the predefined small-size threshold is configurable. 11. The method of claim 1, wherein the predetermined time period is configurable. 12. The method of claim 1, wherein the storage device comprises one or more flash memory devices. 13. The method of claim 1, wherein the storage device comprises one or more three-dimensional (3D) memory devices and circuitry associated with operation of memory elements in the one or more 3D memory devices. 14. The method of claim 13, wherein the circuitry and one or more memory elements in a respective 3D memory device, of the one or more 3D memory devices, are on the same substrate. 15. A storage device, comprising:
one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage device to:
receive, at the storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold during a predetermined time period;
determine whether the region has a history of sequential write requests during the predetermined time period; and
coalescing, in accordance with a determination that the region has a history of I/O requests to access data of size less than a predefined small-size threshold during the predetermined time period and that the region has a history of sequential write requests during the predetermined time period, subsequent write requests to the region. 16. The storage device of claim 15, wherein coalescing subsequent write requests to the region includes:
performing a read ahead operation, to read data from a storage medium of the storage device; storing read data obtained by the read ahead operation to a cache; writing one or more subsequent write requests to the cache; and writing contents of the cache to the storage medium in a merged operation. 17. The storage device of claim 15, wherein the one or more programs, which when executed by the one or more processors, further cause the storage device to:
for each region of the plurality of regions in the logical address space, set a flag to denote the determination of whether the region has a history of sequential write requests during the predetermined time period. 18. The storage device of claim 15, wherein the one or more programs, which when executed by the one or more processors, further cause the storage device to:
for each region of the plurality of regions in the logical address space, store information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. 19. A storage system, comprising:
a storage medium; one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage system to:
receive, at a storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold during a predetermined time period;
determine whether the region has a history of sequential write requests during the predetermined time period; and
coalescing, in accordance with a determination that the region has a history of I/O requests to access data of size less than a predefined small-size threshold during the predetermined time period and that the region has a history of sequential write requests during the predetermined time period, subsequent write requests to the region. 20. A non-transitory computer readable storage medium, storing one or more programs configured for execution by one or more processors of a storage device, the one or more programs including instructions for:
receiving, at a storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold during a predetermined time period;
determining whether the region has a history of sequential write requests during the predetermined time period; and
in accordance with a determination that the region has a history of I/O requests to access data of size less than a predefined small-size threshold during the predetermined time period and that the region has a history of sequential write requests during the predetermined time period, coalescing subsequent write requests to the region. 21. The non-transitory computer readable storage medium of claim 20, wherein coalescing subsequent write requests to the region includes:
performing a read ahead operation, to read data from a storage medium of the storage device; storing read data obtained by the read ahead operation to a cache; writing one or more subsequent write requests to the cache; and writing contents of the cache to the storage medium in a merged operation. 22. The non-transitory computer readable storage medium of claim 20, wherein the one or more programs further include instructions for:
for each region of the plurality of regions in the logical address space, setting a flag to denote the determination of whether the region has a history of sequential write requests during the predetermined time period. 23. The non-transitory computer readable storage medium of claim 20, wherein the one or more programs further include instructions for:
for each region of the plurality of regions in the logical address space, storing information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. | Systems, methods and/or devices are used to enable using history of I/O sizes and I/O sequences to trigger coalesced writes in a non-volatile storage device. In one aspect, the method includes (1) receiving a plurality of input/output (I/O) requests to be performed in a plurality of regions in a logical address space of a host, and (2) performing one or more operations for each region of the plurality of regions in the logical address space of the host, including (a) determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold during a predetermined time period, (b) determining whether the region has a history of sequential write requests during the predetermined time period, and (c) if both determinations are true, coalescing subsequent write requests to the region.1. A method, comprising:
receiving, at a storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold during a predetermined time period;
determining whether the region has a history of sequential write requests during the predetermined time period; and
in accordance with a determination that the region has a history of I/O requests to access data of size less than a predefined small-size threshold during the predetermined time period and that the region has a history of sequential write requests during the predetermined time period, coalescing subsequent write requests to the region. 2. The method of claim 1, wherein coalescing subsequent write requests to the region includes:
performing a read ahead operation, to read data from a storage medium of the storage device; storing read data obtained by the read ahead operation to a cache; writing one or more subsequent write requests to the cache; and writing contents of the cache to the storage medium in a merged operation. 3. The method of claim 1, wherein, with respect to a region of the plurality of regions, determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold includes:
tracking a total number of write requests to write data of size less than the predefined small-size threshold; and determining whether the total number of write requests to write data of size less than the predefined small-size threshold is greater than a first threshold. 4. The method of claim 1, wherein, with respect to a region of the plurality of regions, determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold includes:
tracking a total number of write requests to write data of size less than the predefined small-size threshold; tracking a total number of write requests to write data of size greater than a predefined large-size threshold; and determining whether the total number of write requests to write data of size less than the predefined small-size threshold is greater than a first threshold and whether the total number of write requests to write data of size greater than a predefined large-size threshold is less than a second threshold. 5. The method of claim 1, wherein, with respect to a region of the plurality of regions, determining whether the region has a history of sequential write requests during the predetermined time period includes tracking whether a total number of sequential I/O requests to the region has exceeded a sequential request threshold. 6. The method of claim 1, wherein, with respect to a region of the plurality of regions, determining whether the region has a history of sequential write requests during the predetermined time period includes tracking whether a total number of sequential I/O requests to the region has exceeded a sequential request threshold and tracking whether a total number of sequential write requests to the region has exceeded a sequential write threshold. 7. The method of claim 5, further comprising, for each region of the plurality of regions in the logical address space, setting a flag to denote the determination of whether the total number of sequential I/O requests to the region has exceeded the sequential request threshold. 8. The method of claim 1, further comprising, for each region of the plurality of regions in the logical address space, setting a flag to denote the determination of whether the region has a history of sequential write requests during the predetermined time period. 9. The method of claim 1, further comprising, for each region of the plurality of regions in the logical address space, storing information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. 10. The method of claim 1, wherein the predefined small-size threshold is configurable. 11. The method of claim 1, wherein the predetermined time period is configurable. 12. The method of claim 1, wherein the storage device comprises one or more flash memory devices. 13. The method of claim 1, wherein the storage device comprises one or more three-dimensional (3D) memory devices and circuitry associated with operation of memory elements in the one or more 3D memory devices. 14. The method of claim 13, wherein the circuitry and one or more memory elements in a respective 3D memory device, of the one or more 3D memory devices, are on the same substrate. 15. A storage device, comprising:
one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage device to:
receive, at the storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold during a predetermined time period;
determine whether the region has a history of sequential write requests during the predetermined time period; and
coalescing, in accordance with a determination that the region has a history of I/O requests to access data of size less than a predefined small-size threshold during the predetermined time period and that the region has a history of sequential write requests during the predetermined time period, subsequent write requests to the region. 16. The storage device of claim 15, wherein coalescing subsequent write requests to the region includes:
performing a read ahead operation, to read data from a storage medium of the storage device; storing read data obtained by the read ahead operation to a cache; writing one or more subsequent write requests to the cache; and writing contents of the cache to the storage medium in a merged operation. 17. The storage device of claim 15, wherein the one or more programs, which when executed by the one or more processors, further cause the storage device to:
for each region of the plurality of regions in the logical address space, set a flag to denote the determination of whether the region has a history of sequential write requests during the predetermined time period. 18. The storage device of claim 15, wherein the one or more programs, which when executed by the one or more processors, further cause the storage device to:
for each region of the plurality of regions in the logical address space, store information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. 19. A storage system, comprising:
a storage medium; one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage system to:
receive, at a storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold during a predetermined time period;
determine whether the region has a history of sequential write requests during the predetermined time period; and
coalescing, in accordance with a determination that the region has a history of I/O requests to access data of size less than a predefined small-size threshold during the predetermined time period and that the region has a history of sequential write requests during the predetermined time period, subsequent write requests to the region. 20. A non-transitory computer readable storage medium, storing one or more programs configured for execution by one or more processors of a storage device, the one or more programs including instructions for:
receiving, at a storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining whether the region has a history of I/O requests to access data of size less than a predefined small-size threshold during a predetermined time period;
determining whether the region has a history of sequential write requests during the predetermined time period; and
in accordance with a determination that the region has a history of I/O requests to access data of size less than a predefined small-size threshold during the predetermined time period and that the region has a history of sequential write requests during the predetermined time period, coalescing subsequent write requests to the region. 21. The non-transitory computer readable storage medium of claim 20, wherein coalescing subsequent write requests to the region includes:
performing a read ahead operation, to read data from a storage medium of the storage device; storing read data obtained by the read ahead operation to a cache; writing one or more subsequent write requests to the cache; and writing contents of the cache to the storage medium in a merged operation. 22. The non-transitory computer readable storage medium of claim 20, wherein the one or more programs further include instructions for:
for each region of the plurality of regions in the logical address space, setting a flag to denote the determination of whether the region has a history of sequential write requests during the predetermined time period. 23. The non-transitory computer readable storage medium of claim 20, wherein the one or more programs further include instructions for:
for each region of the plurality of regions in the logical address space, storing information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. | 2,100 |
4,997 | 13,849,634 | 2,144 | Information is presented to a user by accessing a library of electronic publications that includes a first publication, generating a representation of the first publication in an electronic bookshelf, determining a state for the first publication and modifying the representation of the first publication to reflect the state of the first publication. | 1. A method of presenting information to a user, the method comprising:
presenting, within an electronic book reader application on an electronic device, a representation of an electronic book that includes an electronic representation of a paper page; enabling a user to interact with the page through a touch screen control to navigate through the electronic book; recording, on the electronic device, physical characteristics of the user interaction with the touch screen control to navigate through the electronic book; identifying, based on the physical characteristics of the user interaction, a modeled impact on the electronic representation of a paper page; and generating an animated transition reflecting a page turning of the electronic representation of a paper page that reflects the modeled impact. 2. The method of claim 1 wherein identifying the modeled impact reflects a location within the electronic representation of the paper page where the user touched the electronic representation of a paper page. 3. The method of claim 1 wherein identifying the modeled impact reflects a velocity at which the user swiped the electronic representation of the paper page to turn the page. 4. The method of claim 1 wherein identifying the modeled impact reflects an acceleration at which the user swiped the electronic representation of the paper page to turn the page. 5. The method of claim 1 wherein identifying the modeled impact reflects a direction at which the user swiped the electronic representation of the paper page to turn the page. 6. The method of claim 1 wherein identifying the modeled impact reflects a user tilting the electronic device to turn the page. 7. The method of claim 6 wherein identifying the modeled impact reflects an acceleration applied in tilting the electronic device to turn the page. 8. The method of claim 6 wherein identifying the modeled impact reflects an angle applied by a user to tilt the electronic device to turn the page. 9. The method of claim 6 wherein identifying the modeled impact reflects differences in an orientation of the electronic device applied by a user to tilt the electronic device to turn the page. 10. The method of claim 9 wherein identifying the modeled impact reflects whether the orientation of the electronic device has been changed by more than a threshold amount. 11. A system, comprising a processor and instructions that when performed on the processor cause the processor to perform operations that include:
presenting, within an electronic book reader application on an electronic device, a representation of an electronic book that includes an electronic representation of a paper page; enabling a user to interact with the page through a touch screen control to navigate through the electronic book; recording, on the electronic device, physical characteristics of the user interaction with the touch screen control to navigate through the electronic book; identifying, based on the physical characteristics of the user interaction, a modeled impact on the electronic representation of a paper page; and generating an animated transition reflecting a page turning of the electronic representation of a paper page that reflects the modeled impact. 12. A non-transitory computer readable medium comprising instructions that when executed on a processor cause the processor to perform operations that include:
presenting, within an electronic book reader application on an electronic device, a representation of an electronic book that includes an electronic representation of a paper page; enabling a user to interact with the page through a touch screen control to navigate through the electronic book; recording, on the electronic device, physical characteristics of the user interaction with the touch screen control to navigate through the electronic book; identifying, based on the physical characteristics of the user interaction, a modeled impact on the electronic representation of a paper page; and generating an animated transition reflecting a page turning of the electronic representation of a paper page that reflects the modeled impact. | Information is presented to a user by accessing a library of electronic publications that includes a first publication, generating a representation of the first publication in an electronic bookshelf, determining a state for the first publication and modifying the representation of the first publication to reflect the state of the first publication.1. A method of presenting information to a user, the method comprising:
presenting, within an electronic book reader application on an electronic device, a representation of an electronic book that includes an electronic representation of a paper page; enabling a user to interact with the page through a touch screen control to navigate through the electronic book; recording, on the electronic device, physical characteristics of the user interaction with the touch screen control to navigate through the electronic book; identifying, based on the physical characteristics of the user interaction, a modeled impact on the electronic representation of a paper page; and generating an animated transition reflecting a page turning of the electronic representation of a paper page that reflects the modeled impact. 2. The method of claim 1 wherein identifying the modeled impact reflects a location within the electronic representation of the paper page where the user touched the electronic representation of a paper page. 3. The method of claim 1 wherein identifying the modeled impact reflects a velocity at which the user swiped the electronic representation of the paper page to turn the page. 4. The method of claim 1 wherein identifying the modeled impact reflects an acceleration at which the user swiped the electronic representation of the paper page to turn the page. 5. The method of claim 1 wherein identifying the modeled impact reflects a direction at which the user swiped the electronic representation of the paper page to turn the page. 6. The method of claim 1 wherein identifying the modeled impact reflects a user tilting the electronic device to turn the page. 7. The method of claim 6 wherein identifying the modeled impact reflects an acceleration applied in tilting the electronic device to turn the page. 8. The method of claim 6 wherein identifying the modeled impact reflects an angle applied by a user to tilt the electronic device to turn the page. 9. The method of claim 6 wherein identifying the modeled impact reflects differences in an orientation of the electronic device applied by a user to tilt the electronic device to turn the page. 10. The method of claim 9 wherein identifying the modeled impact reflects whether the orientation of the electronic device has been changed by more than a threshold amount. 11. A system, comprising a processor and instructions that when performed on the processor cause the processor to perform operations that include:
presenting, within an electronic book reader application on an electronic device, a representation of an electronic book that includes an electronic representation of a paper page; enabling a user to interact with the page through a touch screen control to navigate through the electronic book; recording, on the electronic device, physical characteristics of the user interaction with the touch screen control to navigate through the electronic book; identifying, based on the physical characteristics of the user interaction, a modeled impact on the electronic representation of a paper page; and generating an animated transition reflecting a page turning of the electronic representation of a paper page that reflects the modeled impact. 12. A non-transitory computer readable medium comprising instructions that when executed on a processor cause the processor to perform operations that include:
presenting, within an electronic book reader application on an electronic device, a representation of an electronic book that includes an electronic representation of a paper page; enabling a user to interact with the page through a touch screen control to navigate through the electronic book; recording, on the electronic device, physical characteristics of the user interaction with the touch screen control to navigate through the electronic book; identifying, based on the physical characteristics of the user interaction, a modeled impact on the electronic representation of a paper page; and generating an animated transition reflecting a page turning of the electronic representation of a paper page that reflects the modeled impact. | 2,100 |
4,998 | 13,474,506 | 2,178 | Integrating remote content with local content includes operating an application on a mobile device using local content stored on the mobile device, retrieving remote content with an overlay component of the application, and displaying the local content and the remote content simultaneously in a display of the mobile device. | 1. A method for integrating remote content with local content, comprising:
operating an application on a mobile device using local content stored on said mobile device; retrieving remote content with an overlay component of said application; and displaying said local content and said remote content simultaneously in a display of said mobile device. 2. The method of claim 1, wherein operating an application on a mobile device using local content stored on said mobile device includes operating the local content with a webview. 3. The method of claim 1, wherein said overlay component is a web view component. 4. The method of claim 1, wherein said application comprises machine readable instructions that define at least one parameter of an overlay object for displaying said remote content on said display. 5. The method of claim 3, wherein said at one parameter is selected from a group consisting of a width of said overlay object, a length of said overlay object, a size of said overlay object, a location of said overlay object, or combinations thereof. 6. The method of claim 1, further comprising communicating between said application and said overlay component. 7. The method of claim 5, wherein communicating between said application and said overlay component includes instructing said overlay component to open an overlay object. 8. The method of claim 5, wherein communicating between said application and said overlay component includes instructing said overlay component to close an overlay object. 9. The method of claim 5, wherein communicating between said application and said overlay component includes instructing said overlay component to switch from a first portion of said remote content to a second portion of said remote content. 10. The method of claim 1, furthering comprising navigating between said remote content and said local content with said application. 11. The method of claim 1, wherein said remote content is dynamically changing content. 12. The method of claim 1, further comprising controlling said remote content as though said remote content is local content. 13. A method for integrating remote content with local content, comprising:
operating an application on a mobile device using local content stored on said mobile device; retrieving remote content with an overlay component embedded in said application; and displaying said remote content in a display of said mobile device with local controls of said application. 14. The method of claim 13, wherein displaying said remote content in a display of said mobile device with local controls of said application includes displaying said local content and said remote content simultaneously in said display. 15. The method of claim 13, wherein said application comprises machine readable instructions that define at least one parameter of an overlay object for displaying said remote content on said display. 16. The method of claim 13, further comprising controlling said remote content as though said remote content is local content. 17. The method of claim 13, further comprising communicating between said application and said overlay component. 18. The method of claim 17, wherein communicating between said application and said overlay component includes instructing said overlay component to open an overlay object. 19. The method of claim 17, wherein communicating between said application and said overlay component includes instructing said overlay component to close an overlay object. 20. The method of claim 13, furthering comprising navigating between said remote content and said local content with said application. 21. A method for integrating remote content with local content, comprising:
operating an application on a mobile device using local content stored on said mobile device; retrieving remote content with a web view overlay component controlled with said application; and displaying said remote content in a display of said mobile device with an overlay component controlled with said application while simultaneously displaying local content on said display. 22. The method of claim 21, furthering comprising navigating between said remote content and said local content with said application. 23. The method of claim 21, wherein said application comprises machine readable instructions that define at least one parameter of an overlay object for displaying said remote content on said display. 24. A method for integrating remote content with local content, comprising:
operating an application on a phone using local content stored on said phone and remote content stored at a remote source with an overlay component embedded in said application; displaying said remote content in a display of said phone with an overlay component while simultaneously displaying local content on said display; and controlling said remote content with said application. 25. The method of claim 24, wherein controlling said remote content with said application includes opening said an overlay object in a display of said phone, closing said an overlay object in said display of said phone, navigating between said overlay object in said display and local content, or combinations thereof. | Integrating remote content with local content includes operating an application on a mobile device using local content stored on the mobile device, retrieving remote content with an overlay component of the application, and displaying the local content and the remote content simultaneously in a display of the mobile device.1. A method for integrating remote content with local content, comprising:
operating an application on a mobile device using local content stored on said mobile device; retrieving remote content with an overlay component of said application; and displaying said local content and said remote content simultaneously in a display of said mobile device. 2. The method of claim 1, wherein operating an application on a mobile device using local content stored on said mobile device includes operating the local content with a webview. 3. The method of claim 1, wherein said overlay component is a web view component. 4. The method of claim 1, wherein said application comprises machine readable instructions that define at least one parameter of an overlay object for displaying said remote content on said display. 5. The method of claim 3, wherein said at one parameter is selected from a group consisting of a width of said overlay object, a length of said overlay object, a size of said overlay object, a location of said overlay object, or combinations thereof. 6. The method of claim 1, further comprising communicating between said application and said overlay component. 7. The method of claim 5, wherein communicating between said application and said overlay component includes instructing said overlay component to open an overlay object. 8. The method of claim 5, wherein communicating between said application and said overlay component includes instructing said overlay component to close an overlay object. 9. The method of claim 5, wherein communicating between said application and said overlay component includes instructing said overlay component to switch from a first portion of said remote content to a second portion of said remote content. 10. The method of claim 1, furthering comprising navigating between said remote content and said local content with said application. 11. The method of claim 1, wherein said remote content is dynamically changing content. 12. The method of claim 1, further comprising controlling said remote content as though said remote content is local content. 13. A method for integrating remote content with local content, comprising:
operating an application on a mobile device using local content stored on said mobile device; retrieving remote content with an overlay component embedded in said application; and displaying said remote content in a display of said mobile device with local controls of said application. 14. The method of claim 13, wherein displaying said remote content in a display of said mobile device with local controls of said application includes displaying said local content and said remote content simultaneously in said display. 15. The method of claim 13, wherein said application comprises machine readable instructions that define at least one parameter of an overlay object for displaying said remote content on said display. 16. The method of claim 13, further comprising controlling said remote content as though said remote content is local content. 17. The method of claim 13, further comprising communicating between said application and said overlay component. 18. The method of claim 17, wherein communicating between said application and said overlay component includes instructing said overlay component to open an overlay object. 19. The method of claim 17, wherein communicating between said application and said overlay component includes instructing said overlay component to close an overlay object. 20. The method of claim 13, furthering comprising navigating between said remote content and said local content with said application. 21. A method for integrating remote content with local content, comprising:
operating an application on a mobile device using local content stored on said mobile device; retrieving remote content with a web view overlay component controlled with said application; and displaying said remote content in a display of said mobile device with an overlay component controlled with said application while simultaneously displaying local content on said display. 22. The method of claim 21, furthering comprising navigating between said remote content and said local content with said application. 23. The method of claim 21, wherein said application comprises machine readable instructions that define at least one parameter of an overlay object for displaying said remote content on said display. 24. A method for integrating remote content with local content, comprising:
operating an application on a phone using local content stored on said phone and remote content stored at a remote source with an overlay component embedded in said application; displaying said remote content in a display of said phone with an overlay component while simultaneously displaying local content on said display; and controlling said remote content with said application. 25. The method of claim 24, wherein controlling said remote content with said application includes opening said an overlay object in a display of said phone, closing said an overlay object in said display of said phone, navigating between said overlay object in said display and local content, or combinations thereof. | 2,100 |
4,999 | 14,365,290 | 2,127 | There is provided a method for use in identifying anomalous areas of the lower crust of a region of the earth, comprising providing information relating to the geometry of the Moho for the region, the Moho representing a transition between the upper mantle and the lower crust for the region, determining the geometry of an intra-crustal layer for the region, the intra-crustal layer representing a transition between the lower crust and the middle or upper crust for the region, using observed gravity data to determine a density distribution between the intra-crustal layer and the Moho, and comparing the determined density distribution to a reference density distribution or reference value for the lower crust, the comparison enabling the identification of anomalous areas of the lower crust for the region. | 1. A method for use in identifying anomalous areas of the lower crust of a region of the earth, comprising providing information relating to the geometry of the Moho for the region, the Moho representing a transition between the upper mantle and the lower crust for the region, determining the geometry of an intra-crustal layer for the region, the intra-crustal layer representing a transition between the lower crust and the middle or upper crust for the region, using observed gravity data to determine a density distribution between the intra-crustal layer and the Moho, and comparing the determined density distribution to a reference density distribution or reference value for the lower crust, the comparison enabling the identification of anomalous areas of the lower crust for the region. 2. A method as claimed in claim 1, comprising determining the geometry of the intra-crustal layer from the geometry of the Moho. 3. A method as claimed in claim 2, comprising determining the depth of the intra-crustal layer based on the depth of the Moho, for example as a predetermined fraction of the depth of the Moho. 4. A method as claimed in claim 3, comprising determining the depth of the intra-crustal layer as being between 0.57 and 0.77 of the depth of the Moho, for example two thirds of the depth of the Moho. 5. A method as claimed in claim 1, comprising determining first and second geometries for the intra-crustal layer, and determining the density distribution using the first and second geometries for the intra-crustal layer. 6. A method as claimed in claim 5, comprising determining first and second density distributions between the intra-crustal layer and the Moho relating respectively to the first and second geometries for the intra-crustal layer, combining the first and second density distributions to form a combined density distribution, and using the combined density distribution in the comparing step. 7. A method as claimed in claim 1, comprising determining the geometry of the Moho. 8. A method as claimed in claim 1, wherein the step of using the observed gravity data to determine the density distribution comprises performing a gravity inversion. 9. A method as claimed in claim 1, wherein the reference density distribution or reference value for the lower crust is obtained from a reference earth model. 10. A method as claimed in claim 9, wherein the comparing step comprises comparing the determined density distribution to an average density value for the lower crust obtained from the reference earth model. 11. A method as claimed in claim 10, wherein the step of comparing the determined density distribution to the average density value comprises dividing the determined density distribution by the average density value to obtain a normalised density distribution, and comparing the normalised density distribution with a reference value of 1. 12. A method as claimed in claim 1, comprising identifying an area of the lower crust as anomalous if the determined density distribution is greater than the reference density distribution or reference value for the lower crust, or at least greater than a threshold which is itself higher than the reference density distribution or reference value. 13. A method as claimed in claim 1, comprising determining a degree of anomalousness based on the determined density distribution, for example based on the comparison between the determined density distribution and the reference density distribution or reference value. 14. A method of assessing the likelihood of or potential for oil and/or gas fields, particularly giant oil and/or gas fields, in a region of the earth, comprising using the determined density distribution or the output of the comparing step or the determined degree of anomalousness according to claim 13. 15. A method of performing oil and/or gas field operations as a result of the performance of a method according to claim 1. 16. A method of identifying anomalous areas of the lower crust of a region of the earth, comprising receiving a density distribution determined according to a method as claimed in claim 1, comparing the received density distribution to a reference density distribution or reference value for the lower crust, and identifying anomalous areas of the lower crust for the region based on the comparison. 17. A method for use in identifying anomalous areas of the lower crust of a region of the earth, comprising performing those steps of claim 1 required to determine a density distribution, the density distribution being for subsequent comparison with a reference density distribution or reference value for the lower crust, such that anomalous areas of the lower crust for the region can be identified based on the comparison. 18. An apparatus comprising means for performing a method according to claim 1. 19. An apparatus for use in identifying anomalous areas of the lower crust of a region of the earth, comprising means for providing information relating to the geometry of the Moho for the region, the Moho representing a transition between the upper mantle and the lower crust for the region, means for determining the geometry of an intra-crustal layer for the region, the intra-crustal layer representing a transition between the lower crust and the middle or upper crust for the region, means for using observed gravity data to determine a density distribution between the intra-crustal layer and the Moho, and means for comparing the determined density distribution to a reference density distribution or reference value for the lower crust, the comparison enabling the identification of anomalous areas of the lower crust for the region. 20. A program for controlling an apparatus to perform a method as claimed in claim 1, optionally being carried on a carrier medium such as a storage medium or a transmission medium. 21. A storage medium containing a program as claimed in claim 20. | There is provided a method for use in identifying anomalous areas of the lower crust of a region of the earth, comprising providing information relating to the geometry of the Moho for the region, the Moho representing a transition between the upper mantle and the lower crust for the region, determining the geometry of an intra-crustal layer for the region, the intra-crustal layer representing a transition between the lower crust and the middle or upper crust for the region, using observed gravity data to determine a density distribution between the intra-crustal layer and the Moho, and comparing the determined density distribution to a reference density distribution or reference value for the lower crust, the comparison enabling the identification of anomalous areas of the lower crust for the region.1. A method for use in identifying anomalous areas of the lower crust of a region of the earth, comprising providing information relating to the geometry of the Moho for the region, the Moho representing a transition between the upper mantle and the lower crust for the region, determining the geometry of an intra-crustal layer for the region, the intra-crustal layer representing a transition between the lower crust and the middle or upper crust for the region, using observed gravity data to determine a density distribution between the intra-crustal layer and the Moho, and comparing the determined density distribution to a reference density distribution or reference value for the lower crust, the comparison enabling the identification of anomalous areas of the lower crust for the region. 2. A method as claimed in claim 1, comprising determining the geometry of the intra-crustal layer from the geometry of the Moho. 3. A method as claimed in claim 2, comprising determining the depth of the intra-crustal layer based on the depth of the Moho, for example as a predetermined fraction of the depth of the Moho. 4. A method as claimed in claim 3, comprising determining the depth of the intra-crustal layer as being between 0.57 and 0.77 of the depth of the Moho, for example two thirds of the depth of the Moho. 5. A method as claimed in claim 1, comprising determining first and second geometries for the intra-crustal layer, and determining the density distribution using the first and second geometries for the intra-crustal layer. 6. A method as claimed in claim 5, comprising determining first and second density distributions between the intra-crustal layer and the Moho relating respectively to the first and second geometries for the intra-crustal layer, combining the first and second density distributions to form a combined density distribution, and using the combined density distribution in the comparing step. 7. A method as claimed in claim 1, comprising determining the geometry of the Moho. 8. A method as claimed in claim 1, wherein the step of using the observed gravity data to determine the density distribution comprises performing a gravity inversion. 9. A method as claimed in claim 1, wherein the reference density distribution or reference value for the lower crust is obtained from a reference earth model. 10. A method as claimed in claim 9, wherein the comparing step comprises comparing the determined density distribution to an average density value for the lower crust obtained from the reference earth model. 11. A method as claimed in claim 10, wherein the step of comparing the determined density distribution to the average density value comprises dividing the determined density distribution by the average density value to obtain a normalised density distribution, and comparing the normalised density distribution with a reference value of 1. 12. A method as claimed in claim 1, comprising identifying an area of the lower crust as anomalous if the determined density distribution is greater than the reference density distribution or reference value for the lower crust, or at least greater than a threshold which is itself higher than the reference density distribution or reference value. 13. A method as claimed in claim 1, comprising determining a degree of anomalousness based on the determined density distribution, for example based on the comparison between the determined density distribution and the reference density distribution or reference value. 14. A method of assessing the likelihood of or potential for oil and/or gas fields, particularly giant oil and/or gas fields, in a region of the earth, comprising using the determined density distribution or the output of the comparing step or the determined degree of anomalousness according to claim 13. 15. A method of performing oil and/or gas field operations as a result of the performance of a method according to claim 1. 16. A method of identifying anomalous areas of the lower crust of a region of the earth, comprising receiving a density distribution determined according to a method as claimed in claim 1, comparing the received density distribution to a reference density distribution or reference value for the lower crust, and identifying anomalous areas of the lower crust for the region based on the comparison. 17. A method for use in identifying anomalous areas of the lower crust of a region of the earth, comprising performing those steps of claim 1 required to determine a density distribution, the density distribution being for subsequent comparison with a reference density distribution or reference value for the lower crust, such that anomalous areas of the lower crust for the region can be identified based on the comparison. 18. An apparatus comprising means for performing a method according to claim 1. 19. An apparatus for use in identifying anomalous areas of the lower crust of a region of the earth, comprising means for providing information relating to the geometry of the Moho for the region, the Moho representing a transition between the upper mantle and the lower crust for the region, means for determining the geometry of an intra-crustal layer for the region, the intra-crustal layer representing a transition between the lower crust and the middle or upper crust for the region, means for using observed gravity data to determine a density distribution between the intra-crustal layer and the Moho, and means for comparing the determined density distribution to a reference density distribution or reference value for the lower crust, the comparison enabling the identification of anomalous areas of the lower crust for the region. 20. A program for controlling an apparatus to perform a method as claimed in claim 1, optionally being carried on a carrier medium such as a storage medium or a transmission medium. 21. A storage medium containing a program as claimed in claim 20. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.