Unnamed: 0 int64 0 350k | level_0 int64 0 351k | ApplicationNumber int64 9.75M 96.1M | ArtUnit int64 1.6k 3.99k | Abstract stringlengths 1 8.37k | Claims stringlengths 3 292k | abstract-claims stringlengths 68 293k | TechCenter int64 1.6k 3.9k |
|---|---|---|---|---|---|---|---|
6,100 | 6,100 | 16,781,695 | 2,119 | Holes are provided in distal raking portions of the raking tines of an otherwise prior art leaf rake head for a hand-held leaf rake, to enable a clog-resistant feature in the leaf rake. The clog-resistant feature may be realized by threading a line, such as string trimmer line, through the holes. | 1. A leaf rake head product for enabling a clog-resistant feature in a hand-held leaf rake, the leaf rake head product comprising a plurality of independent raking tines extending froth a common body portion, wherein each raking tine has an entire length over which the raking tine is an elongate member first extending substantially linearly, thence turning through a distinct bent portion, and thence again extending substantially linearly to define an elongate raking portion of the raking tine terminating in a raking tip, the bent portion extending over less than 20% of said length, the product further comprising, in each of the plurality of raking tines, at least one hole extending through and enclosed by the respective raking portion. 2. The product of claim 1, wherein each of the plurality of raking tines extends from the common body portion in a respective plane of extension, and the at least one hole in each of the plurality of raking tines is oriented so that a line may be threaded freely therethrough in a direction parallel to the respective plane of extension. 3. The product of claim 2, including the line threaded through the at least one hole in each of the plurality of raking tines so as to form loops of the line between the respective raking portions. 4. The product of claim 3, wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes, and the line is threaded through the two spaced apart holes in each of the plurality of raking tines. 5. The product of claim 2, wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes. 6-20. (canceled) 21. A process for enabling a clog-resistant feature in a hand-held leaf rake, comprising installing a first mathematical model on a computer, the first mathematical model describing first mathematical equations that define a leaf rake head product comprising a plurality of independent raking tines extending from a common body portion, wherein each raking tine has an entire length over which the raking tine is an elongate member first extending substantially linearly, thence turning through a distinct bent portion, and thence again extending substantially linearly to define an elongate raking portion of the raking tine terminating in a raking tip, the bent portion extending over less than 20% of said length, the product further comprising, in each of the plurality of raking tines, at least one hole extending through and enclosed by the respective raking portion. 22. The process of claim 21, the first mathematical equations further defining the leaf rake product wherein each of the plurality of raking tines extends from the common body portion in a respective plane of extension, and the at least one hole in each of the plurality of raking tines is oriented so that a line may be threaded freely therethrough in a direction parallel to the respective plane of extension. 23. The process of claim 22, further comprising installing a second mathematical model on a computer, the second mathematical model describing second mathematical equations that define a motion path for threading the line through the at least one hole in each of the plurality of raking tines so as to define loops of the line between the respective raking portions. 24. The process of claim 23, the first mathematical equations further defining the leaf rake head product wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes, and the second mathematical equations further defining the motion path for threading the line through the two spaced apart holes in each of the plurality of raking tines. 25. The process of claim 22, the first mathematical equations further defining the leaf rake head product wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes. 26. The process of claim 21, further comprising applying the first mathematical model on a commercially available 3D printer to result in transforming the first mathematical model into a real leaf rake head product as defined by the first mathematical equations. 27. The process of claim 22, further comprising applying the first mathematical model on a commercially available 3D printer to result in transforming the first mathematical model into a real leaf rake head product as defined by the first mathematical equations. 28. The process of claim 23, further comprising applying the first mathematical model on a commercially available 3D printer to result in transforming the first mathematical model into a real leaf rake head product as defined by the first mathematical equations; and applying the second mathematical model on a commercially available robot to result in transforming the second mathematical model into a real motion path as defined by the second mathematical equations, and thereby to result in the real leaf rake head product including a real line threaded through the at least one hole in each of the plurality of raking tines of the real leaf rake head product so as to form loops of the real line between the respective raking portions of the real leaf rake head product. 29. The process of claim 24, further comprising applying the first mathematical model on a commercially available 3D printer to result in transforming the first mathematical model into a real leaf rake head product as defined by the first mathematical equations; and applying the second mathematical model on a commercially available robot to result in transforming the second mathematical model into a real motion path as defined by the second mathematical equations, and thereby to result in the real leaf rake head product including a real line threaded through the two spaced apart holes in each of the plurality of raking tines of the real leaf rake head product so as to form loops of the real line between the respective raking portions of the real leaf rake head product. 30. The process of claim 25, further comprising applying the first mathematical model on a commercially available 3D printer to result in transforming the first mathematical model into a real leaf rake head product as defined by the first mathematical equations. 31. A process for enabling a clog-resistant feature in a hand-held leaf rake, comprising creating a first mathematical model on a computer, the first mathematical model describing first mathematical equations that define a leaf rake head product comprising a plurality of independent raking tines extending from a common body portion, wherein each raking tine has an entire length over which the raking tine is an elongate member first extending substantially linearly, thence turning through a distinct bent portion, and thence again extending substantially linearly to define an elongate raking portion of the raking tine terminating in a raking tip, the bent portion extending over less than 20% of said length, the product further comprising, in each of the plurality of raking tines, at least one hole extending through and enclosed by the respective raking portion. 32. The process of claim 31, the first mathematical equations further defining the leaf rake product wherein each of the plurality of raking tines extends from the common body portion in a respective plane of extension, and the at least one hole in each of the plurality of raking tines is oriented so that a line may be threaded freely therethrough in a direction parallel to the respective plane of extension. 33. The process of claim 32, further comprising creating a second mathematical model on a computer, the second mathematical model describing second mathematical equations that define a motion path for threading the line through the at least one hole in each of the plurality of raking tines so as to define loops of the line between the respective raking portions. 34. The process of claim 33, the first mathematical equations further defining the leaf rake head product wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes, and the second mathematical equations further defining the motion path for threading the line through the two spaced apart holes in each of the plurality of raking tines. 35. The process of claim 32, the first mathematical equations further defining the leaf rake head product wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes. | Holes are provided in distal raking portions of the raking tines of an otherwise prior art leaf rake head for a hand-held leaf rake, to enable a clog-resistant feature in the leaf rake. The clog-resistant feature may be realized by threading a line, such as string trimmer line, through the holes.1. A leaf rake head product for enabling a clog-resistant feature in a hand-held leaf rake, the leaf rake head product comprising a plurality of independent raking tines extending froth a common body portion, wherein each raking tine has an entire length over which the raking tine is an elongate member first extending substantially linearly, thence turning through a distinct bent portion, and thence again extending substantially linearly to define an elongate raking portion of the raking tine terminating in a raking tip, the bent portion extending over less than 20% of said length, the product further comprising, in each of the plurality of raking tines, at least one hole extending through and enclosed by the respective raking portion. 2. The product of claim 1, wherein each of the plurality of raking tines extends from the common body portion in a respective plane of extension, and the at least one hole in each of the plurality of raking tines is oriented so that a line may be threaded freely therethrough in a direction parallel to the respective plane of extension. 3. The product of claim 2, including the line threaded through the at least one hole in each of the plurality of raking tines so as to form loops of the line between the respective raking portions. 4. The product of claim 3, wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes, and the line is threaded through the two spaced apart holes in each of the plurality of raking tines. 5. The product of claim 2, wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes. 6-20. (canceled) 21. A process for enabling a clog-resistant feature in a hand-held leaf rake, comprising installing a first mathematical model on a computer, the first mathematical model describing first mathematical equations that define a leaf rake head product comprising a plurality of independent raking tines extending from a common body portion, wherein each raking tine has an entire length over which the raking tine is an elongate member first extending substantially linearly, thence turning through a distinct bent portion, and thence again extending substantially linearly to define an elongate raking portion of the raking tine terminating in a raking tip, the bent portion extending over less than 20% of said length, the product further comprising, in each of the plurality of raking tines, at least one hole extending through and enclosed by the respective raking portion. 22. The process of claim 21, the first mathematical equations further defining the leaf rake product wherein each of the plurality of raking tines extends from the common body portion in a respective plane of extension, and the at least one hole in each of the plurality of raking tines is oriented so that a line may be threaded freely therethrough in a direction parallel to the respective plane of extension. 23. The process of claim 22, further comprising installing a second mathematical model on a computer, the second mathematical model describing second mathematical equations that define a motion path for threading the line through the at least one hole in each of the plurality of raking tines so as to define loops of the line between the respective raking portions. 24. The process of claim 23, the first mathematical equations further defining the leaf rake head product wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes, and the second mathematical equations further defining the motion path for threading the line through the two spaced apart holes in each of the plurality of raking tines. 25. The process of claim 22, the first mathematical equations further defining the leaf rake head product wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes. 26. The process of claim 21, further comprising applying the first mathematical model on a commercially available 3D printer to result in transforming the first mathematical model into a real leaf rake head product as defined by the first mathematical equations. 27. The process of claim 22, further comprising applying the first mathematical model on a commercially available 3D printer to result in transforming the first mathematical model into a real leaf rake head product as defined by the first mathematical equations. 28. The process of claim 23, further comprising applying the first mathematical model on a commercially available 3D printer to result in transforming the first mathematical model into a real leaf rake head product as defined by the first mathematical equations; and applying the second mathematical model on a commercially available robot to result in transforming the second mathematical model into a real motion path as defined by the second mathematical equations, and thereby to result in the real leaf rake head product including a real line threaded through the at least one hole in each of the plurality of raking tines of the real leaf rake head product so as to form loops of the real line between the respective raking portions of the real leaf rake head product. 29. The process of claim 24, further comprising applying the first mathematical model on a commercially available 3D printer to result in transforming the first mathematical model into a real leaf rake head product as defined by the first mathematical equations; and applying the second mathematical model on a commercially available robot to result in transforming the second mathematical model into a real motion path as defined by the second mathematical equations, and thereby to result in the real leaf rake head product including a real line threaded through the two spaced apart holes in each of the plurality of raking tines of the real leaf rake head product so as to form loops of the real line between the respective raking portions of the real leaf rake head product. 30. The process of claim 25, further comprising applying the first mathematical model on a commercially available 3D printer to result in transforming the first mathematical model into a real leaf rake head product as defined by the first mathematical equations. 31. A process for enabling a clog-resistant feature in a hand-held leaf rake, comprising creating a first mathematical model on a computer, the first mathematical model describing first mathematical equations that define a leaf rake head product comprising a plurality of independent raking tines extending from a common body portion, wherein each raking tine has an entire length over which the raking tine is an elongate member first extending substantially linearly, thence turning through a distinct bent portion, and thence again extending substantially linearly to define an elongate raking portion of the raking tine terminating in a raking tip, the bent portion extending over less than 20% of said length, the product further comprising, in each of the plurality of raking tines, at least one hole extending through and enclosed by the respective raking portion. 32. The process of claim 31, the first mathematical equations further defining the leaf rake product wherein each of the plurality of raking tines extends from the common body portion in a respective plane of extension, and the at least one hole in each of the plurality of raking tines is oriented so that a line may be threaded freely therethrough in a direction parallel to the respective plane of extension. 33. The process of claim 32, further comprising creating a second mathematical model on a computer, the second mathematical model describing second mathematical equations that define a motion path for threading the line through the at least one hole in each of the plurality of raking tines so as to define loops of the line between the respective raking portions. 34. The process of claim 33, the first mathematical equations further defining the leaf rake head product wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes, and the second mathematical equations further defining the motion path for threading the line through the two spaced apart holes in each of the plurality of raking tines. 35. The process of claim 32, the first mathematical equations further defining the leaf rake head product wherein the at least one hole in each of the plurality of raking tines comprises two spaced apart holes. | 2,100 |
6,101 | 6,101 | 15,208,914 | 2,191 | A method includes storing, on immutable memory, a first separately compiled portion of an OS, the first separately compiled portion having a first OS section including a patch hook having a patch lookup table address and associated with a first index value, and a second OS section including the patch hook associated with a second index value, storing, on mutable memory, a second separately compiled portion of the operating system, the second separately compiled portion including a patch lookup table at the patch lookup table address. The first and the second separately compiled portion are linked to form the OS. A determination is made that a change is required in the first OS section of the first separately compiled portion, resulting in updating the second separately compiled portion to include a first patch for the first OS section at a first patch address, and updating the patch lookup table. | 1. A method, comprising:
storing, on immutable memory, a first separately compiled portion of an operating system, the first separately compiled portion comprising:
a first operating system section comprising a patch hook comprising a patch lookup table address and associated with a first index value; and
a second operating system section comprising the patch hook associated with a second index value;
storing, on mutable memory, a second separately compiled portion of the operating system, the second separately compiled portion comprising a patch lookup table at the patch lookup table address, wherein the first separately compiled portion and the second separately compiled portion are linked to form the operating system; making a determination that a change is required in the first operating system section of the first separately compiled portion; updating, based on the determination, the second separately compiled portion to include a first patch for the first operating system section at a first patch address; updating the patch lookup table to include the first patch address at an index location corresponding to the first index value; executing, before executing the first operating system section, the patch hook associated with the first index to determine that the first patch is at the first patch address; and executing the first patch instead of the first operating system section. 2. The method of claim 1, wherein the patch lookup table comprises a plurality of index locations for storing a plurality of patch addresses. 3. The method of claim 2, wherein the plurality of index locations of the patch lookup table are separated to increase the Hamming distance between any two of the plurality of index locations to at least two. 4. The method of claim 1, further comprising encrypting the first separately compiled portion. 5. The method of claim 1, further comprising, before executing the first patch, validating a checksum of the patch lookup table. 6. The method of claim 1, wherein the first patch comprises a callback comprising a first pointer to a third operating system section of the first separately compiled portion. 7. The method of claim 1, wherein the first operating system section comprises a single function of a programming language. 8. A system, comprising:
an immutable memory operatively connected to a processor and comprising a first separately compiled portion of an operating system, the first separately compiled portion comprising:
a first operating system section comprising a patch hook comprising a patch lookup table address and associated with a first index value; and
a second operating system section comprising the patch hook and associated with a second index value;
a mutable memory operatively connected to the processor and comprising a second separately compiled portion of the operating system, the second separately compiled portion comprising:
a patch lookup table at the patch lookup table address, the patch lookup table comprising a first patch address at an index location corresponding to the first index value; and
a first patch at the first patch address,
wherein the first separately compiled portion and the second separately compiled portion are linked to form the operating system; and
the processor, configured to:
execute, before executing the first operating system section, the patch hook associated with the first index value to determine that the first patch is at the first patch address; and
execute the first patch instead of the first operating system section. 9. The system of claim 8, wherein the patch lookup table comprises a plurality of index locations for storing a plurality of patch addresses. 10. The system of claim 9, wherein the plurality of index locations of the patch lookup table are separated to increase the Hamming distance between any two of the plurality of index locations to at least two. 11. The system of claim 8, wherein the processor is further configured to, before executing the first patch, validate a checksum of the patch lookup table. 12. The system of claim 8, wherein the first patch comprises a callback comprising a first pointer to a third operating system section of the first separately compiled portion. 13. The system of claim 8, wherein the first operating system section comprises a single function of a programming language. 14. The system of claim 8, wherein the immutable memory comprises flash memory, and wherein the immutable memory comprises read-only memory. 15. A non-transitory computer readable medium comprising instructions that, when executed by a processor, perform a method comprising:
storing, on immutable memory, a first separately compiled portion of an operating system, the first separately compiled portion comprising:
a first operating system section comprising a patch hook comprising a patch lookup table address and associated with a first index value; and
a second operating system section comprising the patch hook associated with a second index value;
storing, on mutable memory, a second separately compiled portion of the operating system, the second separately compiled portion comprising a patch lookup table at the patch lookup table address, wherein the first separately compiled portion and the second separately compiled portion are linked to form the operating system; making a determination that a change is required in the first operating system section of the first separately compiled portion; updating, based on the determination, the second separately compiled portion to include a first patch for the first operating system section at a first patch address; updating the patch lookup table to include the first patch address at an index location corresponding to the first index value; executing, before executing the first operating system section, the patch hook associated with the first index to determine that the first patch is at the first patch address; and executing the first patch instead of the first operating system section. 16. The non-transitory computer readable medium of claim 15, wherein the patch lookup table comprises a plurality of index locations for storing a plurality of patch addresses. 17. The non-transitory computer readable medium of claim 16, wherein the plurality of index locations of the patch lookup table are separated to increase the Hamming distance between any two of the plurality of index locations to at least two. 18. The non-transitory computer readable medium of claim 15, wherein the method of the instructions further comprises encrypting the first separately compiled portion. 19. The non-transitory computer readable medium of claim 15, wherein the first patch comprises a callback comprising a first pointer to a third operating system section of the first separately compiled portion. 20. The non-transitory computer readable medium of claim 15, wherein the first operating system section comprises a single function of a programming language. | A method includes storing, on immutable memory, a first separately compiled portion of an OS, the first separately compiled portion having a first OS section including a patch hook having a patch lookup table address and associated with a first index value, and a second OS section including the patch hook associated with a second index value, storing, on mutable memory, a second separately compiled portion of the operating system, the second separately compiled portion including a patch lookup table at the patch lookup table address. The first and the second separately compiled portion are linked to form the OS. A determination is made that a change is required in the first OS section of the first separately compiled portion, resulting in updating the second separately compiled portion to include a first patch for the first OS section at a first patch address, and updating the patch lookup table.1. A method, comprising:
storing, on immutable memory, a first separately compiled portion of an operating system, the first separately compiled portion comprising:
a first operating system section comprising a patch hook comprising a patch lookup table address and associated with a first index value; and
a second operating system section comprising the patch hook associated with a second index value;
storing, on mutable memory, a second separately compiled portion of the operating system, the second separately compiled portion comprising a patch lookup table at the patch lookup table address, wherein the first separately compiled portion and the second separately compiled portion are linked to form the operating system; making a determination that a change is required in the first operating system section of the first separately compiled portion; updating, based on the determination, the second separately compiled portion to include a first patch for the first operating system section at a first patch address; updating the patch lookup table to include the first patch address at an index location corresponding to the first index value; executing, before executing the first operating system section, the patch hook associated with the first index to determine that the first patch is at the first patch address; and executing the first patch instead of the first operating system section. 2. The method of claim 1, wherein the patch lookup table comprises a plurality of index locations for storing a plurality of patch addresses. 3. The method of claim 2, wherein the plurality of index locations of the patch lookup table are separated to increase the Hamming distance between any two of the plurality of index locations to at least two. 4. The method of claim 1, further comprising encrypting the first separately compiled portion. 5. The method of claim 1, further comprising, before executing the first patch, validating a checksum of the patch lookup table. 6. The method of claim 1, wherein the first patch comprises a callback comprising a first pointer to a third operating system section of the first separately compiled portion. 7. The method of claim 1, wherein the first operating system section comprises a single function of a programming language. 8. A system, comprising:
an immutable memory operatively connected to a processor and comprising a first separately compiled portion of an operating system, the first separately compiled portion comprising:
a first operating system section comprising a patch hook comprising a patch lookup table address and associated with a first index value; and
a second operating system section comprising the patch hook and associated with a second index value;
a mutable memory operatively connected to the processor and comprising a second separately compiled portion of the operating system, the second separately compiled portion comprising:
a patch lookup table at the patch lookup table address, the patch lookup table comprising a first patch address at an index location corresponding to the first index value; and
a first patch at the first patch address,
wherein the first separately compiled portion and the second separately compiled portion are linked to form the operating system; and
the processor, configured to:
execute, before executing the first operating system section, the patch hook associated with the first index value to determine that the first patch is at the first patch address; and
execute the first patch instead of the first operating system section. 9. The system of claim 8, wherein the patch lookup table comprises a plurality of index locations for storing a plurality of patch addresses. 10. The system of claim 9, wherein the plurality of index locations of the patch lookup table are separated to increase the Hamming distance between any two of the plurality of index locations to at least two. 11. The system of claim 8, wherein the processor is further configured to, before executing the first patch, validate a checksum of the patch lookup table. 12. The system of claim 8, wherein the first patch comprises a callback comprising a first pointer to a third operating system section of the first separately compiled portion. 13. The system of claim 8, wherein the first operating system section comprises a single function of a programming language. 14. The system of claim 8, wherein the immutable memory comprises flash memory, and wherein the immutable memory comprises read-only memory. 15. A non-transitory computer readable medium comprising instructions that, when executed by a processor, perform a method comprising:
storing, on immutable memory, a first separately compiled portion of an operating system, the first separately compiled portion comprising:
a first operating system section comprising a patch hook comprising a patch lookup table address and associated with a first index value; and
a second operating system section comprising the patch hook associated with a second index value;
storing, on mutable memory, a second separately compiled portion of the operating system, the second separately compiled portion comprising a patch lookup table at the patch lookup table address, wherein the first separately compiled portion and the second separately compiled portion are linked to form the operating system; making a determination that a change is required in the first operating system section of the first separately compiled portion; updating, based on the determination, the second separately compiled portion to include a first patch for the first operating system section at a first patch address; updating the patch lookup table to include the first patch address at an index location corresponding to the first index value; executing, before executing the first operating system section, the patch hook associated with the first index to determine that the first patch is at the first patch address; and executing the first patch instead of the first operating system section. 16. The non-transitory computer readable medium of claim 15, wherein the patch lookup table comprises a plurality of index locations for storing a plurality of patch addresses. 17. The non-transitory computer readable medium of claim 16, wherein the plurality of index locations of the patch lookup table are separated to increase the Hamming distance between any two of the plurality of index locations to at least two. 18. The non-transitory computer readable medium of claim 15, wherein the method of the instructions further comprises encrypting the first separately compiled portion. 19. The non-transitory computer readable medium of claim 15, wherein the first patch comprises a callback comprising a first pointer to a third operating system section of the first separately compiled portion. 20. The non-transitory computer readable medium of claim 15, wherein the first operating system section comprises a single function of a programming language. | 2,100 |
6,102 | 6,102 | 14,585,376 | 2,176 | Interactive contact center menu traversal via text stream interaction is disclosed. A user device establishes an interactive session with a server device. The user device receives, from the server device, a first text stream comprising a first contact center prompt. The user device scrolls a plurality of text components of the first text stream on a display over a first text stream presentation period of time, with text components presented earlier in time being replaced on the display with subsequent text components. The user device receives, from a user, a first user input in response to the first text stream and communicates the first user input to the server device. | 1. A method comprising:
establishing, by a user device, an interactive session with a server device; receiving, by the user device from the server device, a first text stream comprising a first contact center prompt; scrolling a plurality of text components of the first text stream on a display over a first text stream presentation period of time, text components presented earlier in time being replaced on the display with subsequent text components; receiving, from a user, a first user input in response to the first text stream; and communicating the first user input to the server device. 2. The method of claim 1, further comprising:
in response to communicating the first user input, receiving, from the server device, a second text stream comprising a second contact center prompt; scrolling a plurality of text components of the second text stream on the display over a second text stream presentation period of time; receiving, from the user, a second user input in response to the second text stream; and communicating the second user input to the server device. 3. The method of claim 2, wherein the second user input comprises a text stream control command comprising a previous text stream control command, and further comprising:
receiving, from the server device, a third text stream that comprises the first contact center prompt; and scrolling a plurality of text components of the third text stream on the display over the first text stream presentation period of time. 4. The method of claim 1, further comprising:
receiving, over a period of time, a plurality of text streams from the server device including the first text stream; initiating scrolling of a plurality of text components of one text stream of the plurality of text streams on the display at a first pace; receiving, from the user, a user input in response to the one text stream, the user input comprising a text stream control command comprising an increase pace text stream control command; and continuing scrolling of the plurality of text components of the one text stream on the display at a second pace that is a greater pace than the first pace. 5. The method of claim 1, further comprising:
receiving the first user input while concurrently scrolling the text components on the display; and communicating the first user input to the server device while concurrently scrolling the text components on the display. 6. The method of claim 1, further comprising:
analyzing, by the user device, an eye system of the user while concurrently scrolling the text components on the display; and wherein receiving the first user input in response to the first text stream comprises detecting, based on analyzing the eye system, the first user input. 7. The method of claim 1, wherein the first text stream has a display length that exceeds a size of the display. 8. The method of claim 1, wherein the display comprises a size insufficient to present the first text stream at a single instant in time. 9. A method, comprising:
establishing, by a server device, an interactive session with a user device; accessing a user profile associated with the user device; providing a first text stream comprising a predetermined contact center prompt to the user device; receiving, from the user device, a first user input; based on the user input and the user profile, dynamically generating a user-specific prompt menu comprising a plurality of user-specific contact center prompts in a defined processing sequence; and providing a second text stream comprising a user-specific contact center prompt to the user device. 10. The method of claim 9, further comprising:
providing a user-specific contact center prompt identifier to the user device in conjunction with the second text stream. 11. The method of claim 10, further comprising:
receiving, from the user device, a second user input and the user-specific contact center prompt identifier; and accessing the user-specific prompt menu based on the user-specific contact center prompt identifier. 12. A user device, comprising:
a display; a communication interface configured to communicate with a network; and a controller coupled to the communication interface and configured to:
establish an interactive session with a server device;
receive, from the server device, a first text stream comprising a first contact center prompt;
scroll a plurality of text components of the first text stream on the display over a first text stream presentation period of time, text components presented earlier in time being replaced on the display with subsequent text components;
receive, from a user, a first user input in response to the first text stream; and
communicate the first user input to the server device. 13. The user device of claim 12, wherein the controller is further configured to:
in response to communicating the first user input, receive, from the server device, a second text stream comprising a second contact center prompt; scroll a plurality of text components of the second text stream on the display over a second text stream presentation period of time; receive, from the user, a second user input in response to the second text stream; and communicate the second user input to the server device. 14. The user device of claim 13, wherein the second user input comprises a text stream control command comprising a previous text stream control command, and wherein the controller is further configured to:
receive, from the server device, a third text stream that comprises the first contact center prompt; and scroll a plurality of text components of the third text stream on the display over the first text stream presentation period of time. 15. The user device of claim 12, wherein the controller is further configured to:
in response to communicating the first user input, receive, from the server device, a second text stream comprising a second contact center prompt; initiate scrolling a plurality of text components of the second text stream on the display at a first pace; receive, from the user, a second user input in response to the second text stream, the second user input comprising a text stream control command comprising an increase pace text stream control command; and continuing scrolling of the plurality of text components of the second text stream on the display at a second pace that is a greater pace than the first pace. 16. The user device of claim 12, wherein the display comprises a size insufficient to present the first text stream at a single instant in time. 17. A server device, comprising:
a communication interface configured to communicate with a network; and a controller coupled to the communication interface and configured to:
establish an interactive session with a user device;
access a user profile associated with the user device;
provide a first text stream comprising a predetermined contact center prompt to the user device;
receive, from the user device, a first user input;
based on the user input and the user profile, dynamically generate a user-specific prompt menu comprising a plurality of user-specific contact center prompts in a defined processing sequence; and
provide a second text stream comprising a user-specific contact center prompt to the user device. 18. The server device of claim 17, wherein the controller is further configured to provide a user-specific contact center prompt identifier to the user device in conjunction with the second text stream. 19. The server device of claim 18, wherein the controller is further configured to:
receive, from the user device, a second user input and the user-specific contact center prompt identifier; and access the user-specific prompt menu based on the user-specific contact center prompt identifier. | Interactive contact center menu traversal via text stream interaction is disclosed. A user device establishes an interactive session with a server device. The user device receives, from the server device, a first text stream comprising a first contact center prompt. The user device scrolls a plurality of text components of the first text stream on a display over a first text stream presentation period of time, with text components presented earlier in time being replaced on the display with subsequent text components. The user device receives, from a user, a first user input in response to the first text stream and communicates the first user input to the server device.1. A method comprising:
establishing, by a user device, an interactive session with a server device; receiving, by the user device from the server device, a first text stream comprising a first contact center prompt; scrolling a plurality of text components of the first text stream on a display over a first text stream presentation period of time, text components presented earlier in time being replaced on the display with subsequent text components; receiving, from a user, a first user input in response to the first text stream; and communicating the first user input to the server device. 2. The method of claim 1, further comprising:
in response to communicating the first user input, receiving, from the server device, a second text stream comprising a second contact center prompt; scrolling a plurality of text components of the second text stream on the display over a second text stream presentation period of time; receiving, from the user, a second user input in response to the second text stream; and communicating the second user input to the server device. 3. The method of claim 2, wherein the second user input comprises a text stream control command comprising a previous text stream control command, and further comprising:
receiving, from the server device, a third text stream that comprises the first contact center prompt; and scrolling a plurality of text components of the third text stream on the display over the first text stream presentation period of time. 4. The method of claim 1, further comprising:
receiving, over a period of time, a plurality of text streams from the server device including the first text stream; initiating scrolling of a plurality of text components of one text stream of the plurality of text streams on the display at a first pace; receiving, from the user, a user input in response to the one text stream, the user input comprising a text stream control command comprising an increase pace text stream control command; and continuing scrolling of the plurality of text components of the one text stream on the display at a second pace that is a greater pace than the first pace. 5. The method of claim 1, further comprising:
receiving the first user input while concurrently scrolling the text components on the display; and communicating the first user input to the server device while concurrently scrolling the text components on the display. 6. The method of claim 1, further comprising:
analyzing, by the user device, an eye system of the user while concurrently scrolling the text components on the display; and wherein receiving the first user input in response to the first text stream comprises detecting, based on analyzing the eye system, the first user input. 7. The method of claim 1, wherein the first text stream has a display length that exceeds a size of the display. 8. The method of claim 1, wherein the display comprises a size insufficient to present the first text stream at a single instant in time. 9. A method, comprising:
establishing, by a server device, an interactive session with a user device; accessing a user profile associated with the user device; providing a first text stream comprising a predetermined contact center prompt to the user device; receiving, from the user device, a first user input; based on the user input and the user profile, dynamically generating a user-specific prompt menu comprising a plurality of user-specific contact center prompts in a defined processing sequence; and providing a second text stream comprising a user-specific contact center prompt to the user device. 10. The method of claim 9, further comprising:
providing a user-specific contact center prompt identifier to the user device in conjunction with the second text stream. 11. The method of claim 10, further comprising:
receiving, from the user device, a second user input and the user-specific contact center prompt identifier; and accessing the user-specific prompt menu based on the user-specific contact center prompt identifier. 12. A user device, comprising:
a display; a communication interface configured to communicate with a network; and a controller coupled to the communication interface and configured to:
establish an interactive session with a server device;
receive, from the server device, a first text stream comprising a first contact center prompt;
scroll a plurality of text components of the first text stream on the display over a first text stream presentation period of time, text components presented earlier in time being replaced on the display with subsequent text components;
receive, from a user, a first user input in response to the first text stream; and
communicate the first user input to the server device. 13. The user device of claim 12, wherein the controller is further configured to:
in response to communicating the first user input, receive, from the server device, a second text stream comprising a second contact center prompt; scroll a plurality of text components of the second text stream on the display over a second text stream presentation period of time; receive, from the user, a second user input in response to the second text stream; and communicate the second user input to the server device. 14. The user device of claim 13, wherein the second user input comprises a text stream control command comprising a previous text stream control command, and wherein the controller is further configured to:
receive, from the server device, a third text stream that comprises the first contact center prompt; and scroll a plurality of text components of the third text stream on the display over the first text stream presentation period of time. 15. The user device of claim 12, wherein the controller is further configured to:
in response to communicating the first user input, receive, from the server device, a second text stream comprising a second contact center prompt; initiate scrolling a plurality of text components of the second text stream on the display at a first pace; receive, from the user, a second user input in response to the second text stream, the second user input comprising a text stream control command comprising an increase pace text stream control command; and continuing scrolling of the plurality of text components of the second text stream on the display at a second pace that is a greater pace than the first pace. 16. The user device of claim 12, wherein the display comprises a size insufficient to present the first text stream at a single instant in time. 17. A server device, comprising:
a communication interface configured to communicate with a network; and a controller coupled to the communication interface and configured to:
establish an interactive session with a user device;
access a user profile associated with the user device;
provide a first text stream comprising a predetermined contact center prompt to the user device;
receive, from the user device, a first user input;
based on the user input and the user profile, dynamically generate a user-specific prompt menu comprising a plurality of user-specific contact center prompts in a defined processing sequence; and
provide a second text stream comprising a user-specific contact center prompt to the user device. 18. The server device of claim 17, wherein the controller is further configured to provide a user-specific contact center prompt identifier to the user device in conjunction with the second text stream. 19. The server device of claim 18, wherein the controller is further configured to:
receive, from the user device, a second user input and the user-specific contact center prompt identifier; and access the user-specific prompt menu based on the user-specific contact center prompt identifier. | 2,100 |
6,103 | 6,103 | 15,529,148 | 2,117 | A switch for switching a function setting of an air conditioner and a memory that stores therein a setting value of the function setting are provided. The setting value stored in the memory is rewritable according to an instruction from a remote controller. The function setting of the air conditioner is defined by the setting value stored in the memory. Regarding functions set in the air conditioner, priority as to whether to give priority to setting with the switch or to validate setting with the remote controller is switched for each function according to setting from the remote controller. | 1. An air conditioner in which a remote controller and an indoor unit are configured to be able to communicate with each other,
wherein the indoor unit comprises:
a switch to switch a function setting of the air conditioner; and
a memory to store therein a setting value of the function setting,
wherein the setting value stored in the memory is rewritable according to an instruction from the remote controller, and the function setting of the air conditioner is defined by the setting value stored in the memory. 2. The air conditioner according to claim 1,
wherein an initial value regarding the function setting is set such that setting with the switch is validated, and wherein regarding switching of the function setting after the initial value is set, priority as to whether to give priority to the setting with the switch or to validate setting with the remote controller is switched according to setting with the remote controller. 3. The air conditioner according to claim 1,
wherein an initial value regarding the function setting is set such that setting with the switch is validated, and wherein regarding the function setting after the initial value is set, a setting change with the remote controller is always validated. 4. The air conditioner according to claim 1,
wherein an initial value regarding the function setting is set such that setting with the switch is validated, and wherein regarding the function setting after the initial value is set, a later one of a setting change with the switch and a setting change with the remote controller is validated. | A switch for switching a function setting of an air conditioner and a memory that stores therein a setting value of the function setting are provided. The setting value stored in the memory is rewritable according to an instruction from a remote controller. The function setting of the air conditioner is defined by the setting value stored in the memory. Regarding functions set in the air conditioner, priority as to whether to give priority to setting with the switch or to validate setting with the remote controller is switched for each function according to setting from the remote controller.1. An air conditioner in which a remote controller and an indoor unit are configured to be able to communicate with each other,
wherein the indoor unit comprises:
a switch to switch a function setting of the air conditioner; and
a memory to store therein a setting value of the function setting,
wherein the setting value stored in the memory is rewritable according to an instruction from the remote controller, and the function setting of the air conditioner is defined by the setting value stored in the memory. 2. The air conditioner according to claim 1,
wherein an initial value regarding the function setting is set such that setting with the switch is validated, and wherein regarding switching of the function setting after the initial value is set, priority as to whether to give priority to the setting with the switch or to validate setting with the remote controller is switched according to setting with the remote controller. 3. The air conditioner according to claim 1,
wherein an initial value regarding the function setting is set such that setting with the switch is validated, and wherein regarding the function setting after the initial value is set, a setting change with the remote controller is always validated. 4. The air conditioner according to claim 1,
wherein an initial value regarding the function setting is set such that setting with the switch is validated, and wherein regarding the function setting after the initial value is set, a later one of a setting change with the switch and a setting change with the remote controller is validated. | 2,100 |
6,104 | 6,104 | 14,786,383 | 2,137 | A technique includes determining, via an analog circuit, where an access rate of a memory row associated with a memory device exceeds a threshold. In various examples, upon a determination that the access rate exceeds the threshold, the technique may further comprise generating an alert to indicate possible corruption of data stored in an adjacent row to the memory row. | 1. A method comprising:
determining, via an analog circuit, whether an access rate of a memory row associated with a memory device exceeds a threshold between refreshes; and generating, via the analog circuit, an alert to indicate possible corruption of data stored in an adjacent row to the memory row in response to a determination that the access rate exceeds the threshold. 2. The method of claim 1, wherein determining whether the access rate exceeds the threshold between refreshes comprises:
determining, via a bandpass filter, whether the access rate of the memory row associated with the memory device exceeds approximately 3.1e6 accesses per approximately 64 milliseconds. 3. The method of claim 1, wherein determining whether the access rate exceeds the threshold comprises:
converting, via the bandpass filter, edges of row access signals to a plurality of pulses; selecting, via the bandpass filter, positive pulses of the plurality of pulses; and monitoring, via the bandpass filter, a frequency of the positive pulses of the plurality of pulses. 4. The method of claim 3, wherein monitoring, via the bandpass filter, the frequency of the positive pulses of the plurality of pulses comprises:
determining, via the bandpass filter, that the frequency of positive pulses indicates an average access rate that exceeds the threshold between refreshes. 5. The method of claim 1, further comprising:
storing, via the analog circuit, an address of the memory row in a memory register. 6. The method of claim 1, wherein the generating comprises:
combining, via the analog circuit, the alert with at least another alert associated with another memory row; and transmitting the combined alerts to a memory controller. 7. The method of claim 1, further comprising:
refreshing the adjacent rows; and resetting the analog circuit. 8. A system comprising:
a memory device comprising a plurality of word lines; and an analog circuit coupled to each of the plurality of word lines wherein each of the analog circuits is to determine whether its respective word lines has been accessed at least at a predetermined rate between refreshes. 9. The memory device of claim 8, further comprising:
a memory register coupled to each of the analog circuits, wherein the memory register is to store the address associated with the word line that the analog circuits determines has been accessed at least at the predetermined rate between refreshes. 10. The system of claim 8, wherein the analog circuit comprises:
a differentiator to convert edges of word line access signals to pulses; a diode coupled to the differentiator to select the pulses associated with positive transitions of the word line access signals; and an integrator coupled to the diode, wherein the integrator to determine whether the pulses associated with the positive transitions of the word line access signals exceeds a predetermined threshold. 11. The system of claim 10, wherein the integrator comprises:
a plurality of components comprising values selected such that an average word line activation rate of greater than approximately 3.1e6 word line access signals in approximately 64 milliseconds. 12. The system of claim 8, further comprising:
a logic gate coupled to the analog circuit of each of the plurality of word lines, wherein the logic gate is to generate an aggregated signal indicating at least one word line has been accessed at least at the predetermined rate between refreshes. 13. The system of claim 8, further comprising:
a memory controller coupled to the memory device, wherein the memory controller is to command the memory device to activate the word lines adjacent to the respective word lines that have been accessed at least at the predetermined rate. 14. An article comprises a non-transitory storage medium to store instructions readable by a processor-based system which when executed by the processor-based system cause the processor-based system to:
receive, from analog circuit, an indication that a word line of a memory device has been accessed at least a predetermined number of times within a refresh period; and refresh an adjacent word line to the word line of the memory device to prevent a memory error. 15. The article of claim 14, wherein the instructions, which when executed by the processor-based system cause the processor-based system to:
reset the analog circuit. | A technique includes determining, via an analog circuit, where an access rate of a memory row associated with a memory device exceeds a threshold. In various examples, upon a determination that the access rate exceeds the threshold, the technique may further comprise generating an alert to indicate possible corruption of data stored in an adjacent row to the memory row.1. A method comprising:
determining, via an analog circuit, whether an access rate of a memory row associated with a memory device exceeds a threshold between refreshes; and generating, via the analog circuit, an alert to indicate possible corruption of data stored in an adjacent row to the memory row in response to a determination that the access rate exceeds the threshold. 2. The method of claim 1, wherein determining whether the access rate exceeds the threshold between refreshes comprises:
determining, via a bandpass filter, whether the access rate of the memory row associated with the memory device exceeds approximately 3.1e6 accesses per approximately 64 milliseconds. 3. The method of claim 1, wherein determining whether the access rate exceeds the threshold comprises:
converting, via the bandpass filter, edges of row access signals to a plurality of pulses; selecting, via the bandpass filter, positive pulses of the plurality of pulses; and monitoring, via the bandpass filter, a frequency of the positive pulses of the plurality of pulses. 4. The method of claim 3, wherein monitoring, via the bandpass filter, the frequency of the positive pulses of the plurality of pulses comprises:
determining, via the bandpass filter, that the frequency of positive pulses indicates an average access rate that exceeds the threshold between refreshes. 5. The method of claim 1, further comprising:
storing, via the analog circuit, an address of the memory row in a memory register. 6. The method of claim 1, wherein the generating comprises:
combining, via the analog circuit, the alert with at least another alert associated with another memory row; and transmitting the combined alerts to a memory controller. 7. The method of claim 1, further comprising:
refreshing the adjacent rows; and resetting the analog circuit. 8. A system comprising:
a memory device comprising a plurality of word lines; and an analog circuit coupled to each of the plurality of word lines wherein each of the analog circuits is to determine whether its respective word lines has been accessed at least at a predetermined rate between refreshes. 9. The memory device of claim 8, further comprising:
a memory register coupled to each of the analog circuits, wherein the memory register is to store the address associated with the word line that the analog circuits determines has been accessed at least at the predetermined rate between refreshes. 10. The system of claim 8, wherein the analog circuit comprises:
a differentiator to convert edges of word line access signals to pulses; a diode coupled to the differentiator to select the pulses associated with positive transitions of the word line access signals; and an integrator coupled to the diode, wherein the integrator to determine whether the pulses associated with the positive transitions of the word line access signals exceeds a predetermined threshold. 11. The system of claim 10, wherein the integrator comprises:
a plurality of components comprising values selected such that an average word line activation rate of greater than approximately 3.1e6 word line access signals in approximately 64 milliseconds. 12. The system of claim 8, further comprising:
a logic gate coupled to the analog circuit of each of the plurality of word lines, wherein the logic gate is to generate an aggregated signal indicating at least one word line has been accessed at least at the predetermined rate between refreshes. 13. The system of claim 8, further comprising:
a memory controller coupled to the memory device, wherein the memory controller is to command the memory device to activate the word lines adjacent to the respective word lines that have been accessed at least at the predetermined rate. 14. An article comprises a non-transitory storage medium to store instructions readable by a processor-based system which when executed by the processor-based system cause the processor-based system to:
receive, from analog circuit, an indication that a word line of a memory device has been accessed at least a predetermined number of times within a refresh period; and refresh an adjacent word line to the word line of the memory device to prevent a memory error. 15. The article of claim 14, wherein the instructions, which when executed by the processor-based system cause the processor-based system to:
reset the analog circuit. | 2,100 |
6,105 | 6,105 | 14,952,807 | 2,183 | Apparatus for data processing and a method of data processing are provided. Data processing operations are performed in response to data processing instructions. An error exception condition is set if a data processing operation has not been successful. It is determined if an error memory barrier condition exists and an error memory barrier procedure is performed in dependence on whether the error memory barrier condition exists. The error memory barrier procedure comprises, if the error exception condition is set and if an error mask condition is set: setting a deferred error exception condition and clearing the error exception condition. | 1. Apparatus for data processing comprising:
processing circuitry to perform data processing operations in response to data processing instructions, to determine if an error memory barrier condition exists and to perform an error memory barrier procedure in dependence on whether the error memory barrier condition exists, wherein the processing circuitry is capable of setting an error exception condition upon detection that a data processing operation has not been successful, and wherein the error memory barrier procedure comprises, if the error exception condition is set and if an error mask condition is set:
setting a deterred error exception condition; and
clearing the error exception condition. 2. The apparatus as claimed in claim 1, wherein the processing circuitry, if error exception condition is set and the error mask condition is not set, is capable of performing an exception handling procedure. 3. The apparatus as claimed in claim 1, wherein the data processing operations comprise memory accesses, and
wherein the processing circuitry is capable of receiving an error response for a memory access, and wherein the processing circuitry is capable of setting the error exception condition if the error response indicates that the memory access has not been successful. 4. The apparatus as claimed in claim 1, wherein the processing circuitry is capable of determining that the error memory barrier condition exists in response to an error memory barrier instruction in the data processing instructions. 5. The apparatus as claimed in claim 2, wherein the processing circuitry is capable of, as part of the exception handling procedure and if the deferred error exception condition is set, initiating a remedial response with respect to at least one data processing instruction, wherein the at least one data processing instruction comprises a data processing instruction executed prior to determining that the error memory barrier condition existed. 6. The apparatus as claimed in claim 2, further comprising error memory barrier mode value storage, wherein when the processing circuitry initiates performance of the exception handling procedure the processing circuitry is capable of determining that the error memory barrier condition exists in dependence on an error memory barrier mode value stored in the error memory barrier mode value storage. 7. The apparatus as claimed in claim 3, wherein the processing circuitry is capable of, when performing the error memory barrier procedure and if the error memory barrier condition exists, waiting for the error response for each memory access which has not yet completed before executing further data processing instructions. 8. The apparatus as claimed in claim 1, further comprising error mask value storage, wherein the processing circuitry is capable of determining if the error mask condition is set in dependence on an error mask value stored in the error mask value storage. 9. The apparatus as claimed in claim 2, wherein the processing circuitry is capable of setting the error mask value when beginning the exception handling procedure. 10. The apparatus as claimed in claim 2, wherein the processing circuitry is capable of clearing the error mask value as part of the exception handling procedure if the deferred error exception condition is not set. 11. The apparatus as claimed in claim 1, wherein the processing circuitry is capable of setting the error mask value and clearing the error mask value after a predetermined set of data processing instructions have been completed if the deferred error exception condition is not set. 12. The apparatus as claimed in claim 2, wherein the processing circuitry is capable of performing the exception handling procedure at a current exception level selected from plural exception levels, wherein the plural exception levels correspond to plural software execution privilege levels. 13. The apparatus as claimed in claim 12, wherein the processing circuitry is capable of setting the error mask condition when initiating the exception handling procedure if the exception handling procedure is to be performed by the processing circuitry at an exception level which is the same as or higher than the exception level at which a further exception handling procedure in response to a further error exception condition is to be performed. 14. The apparatus as claimed in claim 12, wherein the processing circuitry is capable of not setting the error mask condition when initiating the exception handling procedure if the exception handling procedure is to be performed by the processing circuitry at an exception level which is lower than the exception level at which a further exception handling procedure in response to a further error exception condition is to be performed. 15. The apparatus as claimed in claim 1, capable of providing a virtualized operating environment in which at least one virtual machine operates, wherein the virtual machine is capable of performing the data processing operations in response to the data processing instructions by interaction with the processing circuitry. 16. The apparatus as claimed in claim 15, wherein the processing circuitry, if the error exception condition is set and the error mask condition is not set, is capable of performing an exception handling procedure, wherein the apparatus is capable of setting a virtual error exception condition and wherein the processing circuitry, if the virtual error exception condition is set and a virtual error mask condition is not set, is capable of performing the exception handling procedure. 17. The apparatus as claimed in claim 15, wherein the error memory barrier procedure further comprises, if the virtual error exception condition is set and if the virtual error mask condition is set:
setting a virtual deferred error exception condition; and clearing the virtual error exception condition. 18. The apparatus as claimed in claim 17, wherein the apparatus is capable of providing a value of the virtual deferred error exception condition in place of a value of the deferred error exception condition, when the processing circuitry seeks to determine if the deferred error exception condition is set. 19. A method of data processing comprising the steps of:
performing data processing operations in response to data processing instructions; setting an error exception condition upon detection that a data processing operation has not been successful; determining if an error memory barrier condition exists; and performing an error memory harrier procedure in dependence on whether the error memory barrier condition exists, wherein the error memory barrier procedure comprises, if the error exception condition is set and if an error mask condition is set:
setting a deferred error exception condition; and
clearing the error exception condition. 20. Apparatus for data processing comprising:
means for performing data processing operations in response to data processing instructions; means for setting an error exception condition upon detection that a data processing operation has not been successful; means for determining if an error memory barrier condition exists; and means for performing an error memory barrier procedure in dependence on whether the error memory barrier condition exists, wherein the error memory barrier procedure comprises, if the error exception condition is set and if an error mask condition is set:
setting a deferred error exception condition; and
clearing the error exception condition. | Apparatus for data processing and a method of data processing are provided. Data processing operations are performed in response to data processing instructions. An error exception condition is set if a data processing operation has not been successful. It is determined if an error memory barrier condition exists and an error memory barrier procedure is performed in dependence on whether the error memory barrier condition exists. The error memory barrier procedure comprises, if the error exception condition is set and if an error mask condition is set: setting a deferred error exception condition and clearing the error exception condition.1. Apparatus for data processing comprising:
processing circuitry to perform data processing operations in response to data processing instructions, to determine if an error memory barrier condition exists and to perform an error memory barrier procedure in dependence on whether the error memory barrier condition exists, wherein the processing circuitry is capable of setting an error exception condition upon detection that a data processing operation has not been successful, and wherein the error memory barrier procedure comprises, if the error exception condition is set and if an error mask condition is set:
setting a deterred error exception condition; and
clearing the error exception condition. 2. The apparatus as claimed in claim 1, wherein the processing circuitry, if error exception condition is set and the error mask condition is not set, is capable of performing an exception handling procedure. 3. The apparatus as claimed in claim 1, wherein the data processing operations comprise memory accesses, and
wherein the processing circuitry is capable of receiving an error response for a memory access, and wherein the processing circuitry is capable of setting the error exception condition if the error response indicates that the memory access has not been successful. 4. The apparatus as claimed in claim 1, wherein the processing circuitry is capable of determining that the error memory barrier condition exists in response to an error memory barrier instruction in the data processing instructions. 5. The apparatus as claimed in claim 2, wherein the processing circuitry is capable of, as part of the exception handling procedure and if the deferred error exception condition is set, initiating a remedial response with respect to at least one data processing instruction, wherein the at least one data processing instruction comprises a data processing instruction executed prior to determining that the error memory barrier condition existed. 6. The apparatus as claimed in claim 2, further comprising error memory barrier mode value storage, wherein when the processing circuitry initiates performance of the exception handling procedure the processing circuitry is capable of determining that the error memory barrier condition exists in dependence on an error memory barrier mode value stored in the error memory barrier mode value storage. 7. The apparatus as claimed in claim 3, wherein the processing circuitry is capable of, when performing the error memory barrier procedure and if the error memory barrier condition exists, waiting for the error response for each memory access which has not yet completed before executing further data processing instructions. 8. The apparatus as claimed in claim 1, further comprising error mask value storage, wherein the processing circuitry is capable of determining if the error mask condition is set in dependence on an error mask value stored in the error mask value storage. 9. The apparatus as claimed in claim 2, wherein the processing circuitry is capable of setting the error mask value when beginning the exception handling procedure. 10. The apparatus as claimed in claim 2, wherein the processing circuitry is capable of clearing the error mask value as part of the exception handling procedure if the deferred error exception condition is not set. 11. The apparatus as claimed in claim 1, wherein the processing circuitry is capable of setting the error mask value and clearing the error mask value after a predetermined set of data processing instructions have been completed if the deferred error exception condition is not set. 12. The apparatus as claimed in claim 2, wherein the processing circuitry is capable of performing the exception handling procedure at a current exception level selected from plural exception levels, wherein the plural exception levels correspond to plural software execution privilege levels. 13. The apparatus as claimed in claim 12, wherein the processing circuitry is capable of setting the error mask condition when initiating the exception handling procedure if the exception handling procedure is to be performed by the processing circuitry at an exception level which is the same as or higher than the exception level at which a further exception handling procedure in response to a further error exception condition is to be performed. 14. The apparatus as claimed in claim 12, wherein the processing circuitry is capable of not setting the error mask condition when initiating the exception handling procedure if the exception handling procedure is to be performed by the processing circuitry at an exception level which is lower than the exception level at which a further exception handling procedure in response to a further error exception condition is to be performed. 15. The apparatus as claimed in claim 1, capable of providing a virtualized operating environment in which at least one virtual machine operates, wherein the virtual machine is capable of performing the data processing operations in response to the data processing instructions by interaction with the processing circuitry. 16. The apparatus as claimed in claim 15, wherein the processing circuitry, if the error exception condition is set and the error mask condition is not set, is capable of performing an exception handling procedure, wherein the apparatus is capable of setting a virtual error exception condition and wherein the processing circuitry, if the virtual error exception condition is set and a virtual error mask condition is not set, is capable of performing the exception handling procedure. 17. The apparatus as claimed in claim 15, wherein the error memory barrier procedure further comprises, if the virtual error exception condition is set and if the virtual error mask condition is set:
setting a virtual deferred error exception condition; and clearing the virtual error exception condition. 18. The apparatus as claimed in claim 17, wherein the apparatus is capable of providing a value of the virtual deferred error exception condition in place of a value of the deferred error exception condition, when the processing circuitry seeks to determine if the deferred error exception condition is set. 19. A method of data processing comprising the steps of:
performing data processing operations in response to data processing instructions; setting an error exception condition upon detection that a data processing operation has not been successful; determining if an error memory barrier condition exists; and performing an error memory harrier procedure in dependence on whether the error memory barrier condition exists, wherein the error memory barrier procedure comprises, if the error exception condition is set and if an error mask condition is set:
setting a deferred error exception condition; and
clearing the error exception condition. 20. Apparatus for data processing comprising:
means for performing data processing operations in response to data processing instructions; means for setting an error exception condition upon detection that a data processing operation has not been successful; means for determining if an error memory barrier condition exists; and means for performing an error memory barrier procedure in dependence on whether the error memory barrier condition exists, wherein the error memory barrier procedure comprises, if the error exception condition is set and if an error mask condition is set:
setting a deferred error exception condition; and
clearing the error exception condition. | 2,100 |
6,106 | 6,106 | 15,474,746 | 2,116 | A method for registering an HVAC device in a distributed building management system (BMS). The method includes requesting a token. The token is configured to authorize a registration of the HVAC device. The method further includes receiving the token at a registration service, and receiving a unique ID associated with the HVAC device at the registration service. The method also includes registering the device into a document database of the registration service and generating a device shadow associated with the HVAC device. The method also includes storing the device shadow in the distributed BMS. | 1. A method for registering an HVAC device in a distributed building management system (BMS), comprising:
requesting a token, the token configured to authorize a registration of the HVAC device; receiving the token at a registration service; receiving a unique ID associated with the HVAC device at the registration service; registering the device into a document database of the registration service; generating a device shadow associated with the HVAC device; and storing the device shadow in a memory of the distributed BMS. 2. The method of claim 1, wherein generating the device shadow comprises creating a generic device shadow based on a device template, wherein the device template comprises one or more data points associated with the HVAC device. 3. The method of claim 2, wherein the device template is based on a device type of the HVAC device. 4. The method of claim 2, further comprising comparing the data points of the device template against one or more data points of the HVAC device. 5. The method of claim 4, further comprising updating the device shadow with the data points of the device that are different from data points of the device template. 6. The method of claim 1, further comprising claiming the HVAC device, wherein claiming the HVAC device provides secure communications between the HVAC device and the distributed building management system. 7. The method of claim 1, wherein token determines one or more permissions of the HVAC device. 8. The method of claim 1, wherein the unique device ID is one of a media access control address and a serial number of the device. 9. A distributed building management system, the system comprising:
an HVAC device; and a distributed BMS device, comprising a processor, wherein the processor is configured to:
request a token, the token configured to authorize a registration of the HVAC device;
receive the token at a registration service;
receive a unique ID associated with the HVAC device;
register the device into a document database of the registration service; and
generate a device shadow associated with the HVAC device within a data platform of the distributed (BMS). 10. The system of claim 9, wherein generating the device shadow comprises creating a generic device shadow based on a device template, wherein the device template comprises one or more data points associated with the HVAC device. 11. The system of claim 10, wherein the device template is based on a device type of the HVAC device. 12. The system of claim 10, wherein the processor is further configured to compare the data points of the device template against one or more data points of the HVAC device. 13. The system of claim 12, wherein the processor is further configured to update the device shadow, with the data points of the device that are different from data points of the device template. 14. The system of claim 9, wherein the processor is further configured to claim the HVAC device, wherein claiming the HVAC device provides secure communications between the HVAC device and the distributed building management system. 15. The system of claim 9, wherein the token determines one or more permissions of the HVAC device. 16. The system of claim 9, wherein the unique device ID is one of a media access control address and a serial number of the HVAC device. 17. The system of claim 9, wherein the distributed BMS device is one of an HVAC device, a BMS controller, and a cloud-based service. 18. A method for registering an Internet of Things (IoT) HVAC device in a distributed building management system (BMS), comprising:
requesting a token, the token configured to authorize a registration of the IoT HVAC device; receiving the token at a registration service; receiving a unique ID associated with the IoT HVAC device; registering the device into a document database of the registration service; generating a device shadow associated with the IoT HVAC device within a data platform of the distributed BMS; and claiming the IoT HVAC device, wherein claiming the IoT HVAC device provides secure communications between the IoT HVAC device and the distributed building management system. 19. The method of claim 18, wherein generating the device shadow comprises creating a generic device shadow based on a device template, wherein the device template comprises one or more data points associated with the IoT HVAC device and is based on a device type of the IoT HVAC device. 20. The method of claim 19, further comprising:
comparing the data points of the device template against one or more data points of the HVAC device; and updating the device shadow with the data points of the device that are different from data points of the device template. | A method for registering an HVAC device in a distributed building management system (BMS). The method includes requesting a token. The token is configured to authorize a registration of the HVAC device. The method further includes receiving the token at a registration service, and receiving a unique ID associated with the HVAC device at the registration service. The method also includes registering the device into a document database of the registration service and generating a device shadow associated with the HVAC device. The method also includes storing the device shadow in the distributed BMS.1. A method for registering an HVAC device in a distributed building management system (BMS), comprising:
requesting a token, the token configured to authorize a registration of the HVAC device; receiving the token at a registration service; receiving a unique ID associated with the HVAC device at the registration service; registering the device into a document database of the registration service; generating a device shadow associated with the HVAC device; and storing the device shadow in a memory of the distributed BMS. 2. The method of claim 1, wherein generating the device shadow comprises creating a generic device shadow based on a device template, wherein the device template comprises one or more data points associated with the HVAC device. 3. The method of claim 2, wherein the device template is based on a device type of the HVAC device. 4. The method of claim 2, further comprising comparing the data points of the device template against one or more data points of the HVAC device. 5. The method of claim 4, further comprising updating the device shadow with the data points of the device that are different from data points of the device template. 6. The method of claim 1, further comprising claiming the HVAC device, wherein claiming the HVAC device provides secure communications between the HVAC device and the distributed building management system. 7. The method of claim 1, wherein token determines one or more permissions of the HVAC device. 8. The method of claim 1, wherein the unique device ID is one of a media access control address and a serial number of the device. 9. A distributed building management system, the system comprising:
an HVAC device; and a distributed BMS device, comprising a processor, wherein the processor is configured to:
request a token, the token configured to authorize a registration of the HVAC device;
receive the token at a registration service;
receive a unique ID associated with the HVAC device;
register the device into a document database of the registration service; and
generate a device shadow associated with the HVAC device within a data platform of the distributed (BMS). 10. The system of claim 9, wherein generating the device shadow comprises creating a generic device shadow based on a device template, wherein the device template comprises one or more data points associated with the HVAC device. 11. The system of claim 10, wherein the device template is based on a device type of the HVAC device. 12. The system of claim 10, wherein the processor is further configured to compare the data points of the device template against one or more data points of the HVAC device. 13. The system of claim 12, wherein the processor is further configured to update the device shadow, with the data points of the device that are different from data points of the device template. 14. The system of claim 9, wherein the processor is further configured to claim the HVAC device, wherein claiming the HVAC device provides secure communications between the HVAC device and the distributed building management system. 15. The system of claim 9, wherein the token determines one or more permissions of the HVAC device. 16. The system of claim 9, wherein the unique device ID is one of a media access control address and a serial number of the HVAC device. 17. The system of claim 9, wherein the distributed BMS device is one of an HVAC device, a BMS controller, and a cloud-based service. 18. A method for registering an Internet of Things (IoT) HVAC device in a distributed building management system (BMS), comprising:
requesting a token, the token configured to authorize a registration of the IoT HVAC device; receiving the token at a registration service; receiving a unique ID associated with the IoT HVAC device; registering the device into a document database of the registration service; generating a device shadow associated with the IoT HVAC device within a data platform of the distributed BMS; and claiming the IoT HVAC device, wherein claiming the IoT HVAC device provides secure communications between the IoT HVAC device and the distributed building management system. 19. The method of claim 18, wherein generating the device shadow comprises creating a generic device shadow based on a device template, wherein the device template comprises one or more data points associated with the IoT HVAC device and is based on a device type of the IoT HVAC device. 20. The method of claim 19, further comprising:
comparing the data points of the device template against one or more data points of the HVAC device; and updating the device shadow with the data points of the device that are different from data points of the device template. | 2,100 |
6,107 | 6,107 | 15,221,934 | 2,176 | Variable formatting for cells in computer spreadsheets, tables, and other documents is provided. For a selected range of cells, cell formats vary with the value in each cell (or an associated value). Formats can include color-scale backgrounds, in-cell elements (e.g., icons and data bars), and other cell formats that can be varied with a value. | 1-20. (canceled) 21. A method for displaying different graphical icons for different values, comprising:
displaying a graphical user interface (GUI) that presents options used to determine formatting for a range of values, comprising:
displaying a style user interface element that is used to receive a selection of a type of visual indicator to apply to the range of values; and
displaying formatting criteria user interface elements that are used to receive formatting criteria selections to apply to type of visual indicator based on values in the range of values, wherein the formatting criteria include a first format of the type of visual indicator correlated to a first value, and a second format of the type of visual indicator correlated to a second value;
determining varying formats that vary in a spectrum from the first format to the second format; applying the formatting criteria and the varying formats to the selected type of visual indicator and values within the range of values; and displaying the values after applying the selected type of visual indicator and formatting criteria. 22. The method of claim 21, wherein the varying formats that vary in the spectrum is at least one member of a group comprising: a continuous spectrum of varying formats and an incremental spectrum of varying formats. 23. The method of claim 21, wherein the type of visual indicator comprises a color scale style and wherein the formatting criteria include: the first value that is assigned a first color; the second value that is assigned a second color, wherein the spectrum is a color spectrum ranging from the first color to the second color. 24. The method of claim 21, wherein the type of visual indicator comprises a data bar style, wherein the formatting criteria include: the first value being a first length of a data bar; the second value being a second length of a data bar, wherein the spectrum is a spectrum of lengths from the first length to the second length. 25. The method of claim 21, wherein the type of visual indicator comprises a pie chart icon format style, wherein the formatting criteria include: the first value being an empty pie chart; the second value being a full pie chart, wherein the spectrum is a spectrum of fill amounts from the empty pie chart to the full pie chart. 26. The method of claim 21, wherein the type of visual indicator comprises an arrow format style, wherein the formatting criteria include: the first value being a first direction format; the second value being a second direction format, wherein the spectrum is a spectrum of directions from the first direction format to the second direction format. 27. The method of claim 21, wherein the type of visual indicator comprises a flag set format style, wherein the formatting criteria include: the first value being a first flag format; the second value being a second flag format, wherein the spectrum is a spectrum of flags from the first flag format to the second flag format. 28. The method of claim 21, wherein the type of visual indicator comprises a circle set format style, wherein the formatting criteria include: the first value being a first circle format; the second value being a second circle format, wherein the spectrum is a spectrum of circles from the first circle format to the second circle format. 29. The method of claim 21, wherein the first value and the second value are at least one member of a group comprising: numbers, percentages, percentiles, and formulas. 30. A computer-readable memory having computer executable instructions for formatting a range of values according to a spectrum of formats, the instructions comprising:
displaying a graphical user interface; obtaining formatting criteria for a range of values from the graphical user interface, wherein the formatting criteria includes a first value format correlated to a first value, and a second value format correlated to a second value; determining varying formats that vary in a spectrum from the first format to the second format; determining whether a respective value for each value in the range of values is between the first value and the second value; and for each respective value between the first value and the second value, applying, to a display of each value, a respective format determined from a correlation of each respective value to a respective format in the spectrum of varying formats. 31. The computer-readable memory of claim 30, wherein the spectrum of varying formats is at least one member of a group comprising: a continuous spectrum of varying formats and an incremental spectrum of varying formats and wherein the first value and the second value are at least one member of a group comprising: numbers, percentages, percentiles, and formulas. 32. The computer-readable memory of claim 30, wherein the formatting criteria includes a format color style, wherein the first value format is assigned a first color, wherein the second value format is assigned a second color, wherein the spectrum is a color spectrum from the first color to the second color. 33. The computer-readable memory of claim 30, wherein the formatting criteria includes a data bar format style, wherein the first value format is a first length of a data bar, wherein the second value format is a second length of a data bar, wherein the spectrum is a spectrum of lengths from the first length to the second length. 34. The computer-readable memory of claim 30, wherein the formatting criteria includes a pie chart icon format style, wherein the first value format is a first state of a pie chart, wherein the second value format is a second state of a pie chart, wherein the spectrum is a spectrum of fill amounts from the first state of the pie chart to the second state of the pie chart. 35. The computer-readable memory of claim 30, wherein the formatting criteria includes an arrow format style, wherein the first value format is a first arrow, wherein the second value format is a second arrow, wherein the spectrum is a spectrum of arrow formats from the first arrow format to the second arrow format. 36. The computer-readable memory of claim 30, wherein the formatting criteria includes a flag format style, wherein the first value format is a first flag, wherein the second value format is a second flag, wherein the spectrum is a spectrum of flags from the first flag to the second flag. 37. A system for formatting a range of values according to a spectrum of values, comprising:
a processor; and a computer-readable medium having computer executable instructions stored thereon, wherein the computer executable instructions are configured for: displaying a graphical user interface; obtaining formatting criteria for a range of values from the graphical user interface, wherein the formatting criteria includes a first value format correlated to a first value, and a second value format correlated to a second value; determining varying formats that vary in a spectrum from the first format to the second format; determining whether a respective value for each value in the range of values is between the first value and the second value; and for each respective value between the first value and the second value, applying, to a display of each value, a respective format determined from a correlation of each respective value to a respective format in the spectrum of varying formats. 38. The system of claim 37, wherein the spectrum of varying formats is at least one member of a group comprising: a continuous spectrum of varying formats and an incremental spectrum of varying formats and wherein the first value and the second value are at least one member of a group comprising: numbers, percentages, percentiles, and formulas. 39. The system of claim 37, wherein the graphical user interface displays a selection user interface element for selecting a type of style selected comprising three or more of: a format color style, a data bar format style, a pie chart format style, an arrow format style, a flag format style and a circle format style. 40. The system of claim 37, wherein the formatting criteria comprise assigning the first value format is a first state, wherein the second value format is assigned a second state, wherein the spectrum is a spectrum of states between the first state and the second state. | Variable formatting for cells in computer spreadsheets, tables, and other documents is provided. For a selected range of cells, cell formats vary with the value in each cell (or an associated value). Formats can include color-scale backgrounds, in-cell elements (e.g., icons and data bars), and other cell formats that can be varied with a value.1-20. (canceled) 21. A method for displaying different graphical icons for different values, comprising:
displaying a graphical user interface (GUI) that presents options used to determine formatting for a range of values, comprising:
displaying a style user interface element that is used to receive a selection of a type of visual indicator to apply to the range of values; and
displaying formatting criteria user interface elements that are used to receive formatting criteria selections to apply to type of visual indicator based on values in the range of values, wherein the formatting criteria include a first format of the type of visual indicator correlated to a first value, and a second format of the type of visual indicator correlated to a second value;
determining varying formats that vary in a spectrum from the first format to the second format; applying the formatting criteria and the varying formats to the selected type of visual indicator and values within the range of values; and displaying the values after applying the selected type of visual indicator and formatting criteria. 22. The method of claim 21, wherein the varying formats that vary in the spectrum is at least one member of a group comprising: a continuous spectrum of varying formats and an incremental spectrum of varying formats. 23. The method of claim 21, wherein the type of visual indicator comprises a color scale style and wherein the formatting criteria include: the first value that is assigned a first color; the second value that is assigned a second color, wherein the spectrum is a color spectrum ranging from the first color to the second color. 24. The method of claim 21, wherein the type of visual indicator comprises a data bar style, wherein the formatting criteria include: the first value being a first length of a data bar; the second value being a second length of a data bar, wherein the spectrum is a spectrum of lengths from the first length to the second length. 25. The method of claim 21, wherein the type of visual indicator comprises a pie chart icon format style, wherein the formatting criteria include: the first value being an empty pie chart; the second value being a full pie chart, wherein the spectrum is a spectrum of fill amounts from the empty pie chart to the full pie chart. 26. The method of claim 21, wherein the type of visual indicator comprises an arrow format style, wherein the formatting criteria include: the first value being a first direction format; the second value being a second direction format, wherein the spectrum is a spectrum of directions from the first direction format to the second direction format. 27. The method of claim 21, wherein the type of visual indicator comprises a flag set format style, wherein the formatting criteria include: the first value being a first flag format; the second value being a second flag format, wherein the spectrum is a spectrum of flags from the first flag format to the second flag format. 28. The method of claim 21, wherein the type of visual indicator comprises a circle set format style, wherein the formatting criteria include: the first value being a first circle format; the second value being a second circle format, wherein the spectrum is a spectrum of circles from the first circle format to the second circle format. 29. The method of claim 21, wherein the first value and the second value are at least one member of a group comprising: numbers, percentages, percentiles, and formulas. 30. A computer-readable memory having computer executable instructions for formatting a range of values according to a spectrum of formats, the instructions comprising:
displaying a graphical user interface; obtaining formatting criteria for a range of values from the graphical user interface, wherein the formatting criteria includes a first value format correlated to a first value, and a second value format correlated to a second value; determining varying formats that vary in a spectrum from the first format to the second format; determining whether a respective value for each value in the range of values is between the first value and the second value; and for each respective value between the first value and the second value, applying, to a display of each value, a respective format determined from a correlation of each respective value to a respective format in the spectrum of varying formats. 31. The computer-readable memory of claim 30, wherein the spectrum of varying formats is at least one member of a group comprising: a continuous spectrum of varying formats and an incremental spectrum of varying formats and wherein the first value and the second value are at least one member of a group comprising: numbers, percentages, percentiles, and formulas. 32. The computer-readable memory of claim 30, wherein the formatting criteria includes a format color style, wherein the first value format is assigned a first color, wherein the second value format is assigned a second color, wherein the spectrum is a color spectrum from the first color to the second color. 33. The computer-readable memory of claim 30, wherein the formatting criteria includes a data bar format style, wherein the first value format is a first length of a data bar, wherein the second value format is a second length of a data bar, wherein the spectrum is a spectrum of lengths from the first length to the second length. 34. The computer-readable memory of claim 30, wherein the formatting criteria includes a pie chart icon format style, wherein the first value format is a first state of a pie chart, wherein the second value format is a second state of a pie chart, wherein the spectrum is a spectrum of fill amounts from the first state of the pie chart to the second state of the pie chart. 35. The computer-readable memory of claim 30, wherein the formatting criteria includes an arrow format style, wherein the first value format is a first arrow, wherein the second value format is a second arrow, wherein the spectrum is a spectrum of arrow formats from the first arrow format to the second arrow format. 36. The computer-readable memory of claim 30, wherein the formatting criteria includes a flag format style, wherein the first value format is a first flag, wherein the second value format is a second flag, wherein the spectrum is a spectrum of flags from the first flag to the second flag. 37. A system for formatting a range of values according to a spectrum of values, comprising:
a processor; and a computer-readable medium having computer executable instructions stored thereon, wherein the computer executable instructions are configured for: displaying a graphical user interface; obtaining formatting criteria for a range of values from the graphical user interface, wherein the formatting criteria includes a first value format correlated to a first value, and a second value format correlated to a second value; determining varying formats that vary in a spectrum from the first format to the second format; determining whether a respective value for each value in the range of values is between the first value and the second value; and for each respective value between the first value and the second value, applying, to a display of each value, a respective format determined from a correlation of each respective value to a respective format in the spectrum of varying formats. 38. The system of claim 37, wherein the spectrum of varying formats is at least one member of a group comprising: a continuous spectrum of varying formats and an incremental spectrum of varying formats and wherein the first value and the second value are at least one member of a group comprising: numbers, percentages, percentiles, and formulas. 39. The system of claim 37, wherein the graphical user interface displays a selection user interface element for selecting a type of style selected comprising three or more of: a format color style, a data bar format style, a pie chart format style, an arrow format style, a flag format style and a circle format style. 40. The system of claim 37, wherein the formatting criteria comprise assigning the first value format is a first state, wherein the second value format is assigned a second state, wherein the spectrum is a spectrum of states between the first state and the second state. | 2,100 |
6,108 | 6,108 | 15,677,939 | 2,193 | Methods for logging strings during execution of a program running on an embedded system without storing the strings in the memory of the embedded system include, during the build process, receiving source code for a program that comprises one or more log statements that identifies a string to be logged; generating object code based on the source code that comprises a special log section that includes the identified strings, and, for each log statement one or more instructions that cause a reference to the corresponding string to be stored in memory of the embedded system; generating execution code based on the object code wherein the special log section is marked as non-loadable and each reference is a location of the corresponding string in the special log section; and, loading the generated executable code into the memory of the embedded system such that the identified strings are not loaded into the memory of the embedded system. | 1. A computer-implemented method to generate executable code for a program to be run on an embedded system which causes the embedded system to log one or more strings during execution of the executable code, the method comprising:
receiving source code for a program, the source code identifying one or more strings to be logged during execution of the program; causing a compiler to generate object code based on the source code such that the object code comprises:
a separate log section that includes the one or more identified strings; and
one or more instructions to cause the embedded system to write a reference to one of the one or more strings to memory of the embedded system, the reference represented by a symbol associated with the string;
causing a linker to generate executable code based on the object code by causing the linker to mark the separate log section as a non-loadable section, and to replace each symbol associated with a string in the one or more instructions with information indicating the location of the string in the separate log section so as to form one or more executable instructions; and loading the executable code comprising the one or more executable instructions into the memory of the embedded system such that the one or more identified strings are not stored in the memory of the embedded system. 2. The method of claim 1, wherein the received source code comprises one or more logging statements identifying a string to be logged, and the method further comprises, prior to causing the compiler to generate the object code, causing a pre-processor to replace each logging statement in the source code with:
one or more instructions causing the identified string to be stored in the separate log section of the object code; and one or more instructions causing a reference to the string to be stored in memory of the embedded system. 3. The method of claim 2, wherein the logging statement has a predetermined format recognizable by the pre-processor. 4. The method of claim 2, wherein the one or more instructions causing the identified string to be stored in the separate log section of the object code cause the identified string to be stored in the separate log section of the object code in a static constant array. 5. A system to generate executable code for a program to be run on an embedded system which causes the embedded system to log one or more strings during execution of the executable code, the system comprising:
a compiler configured to:
receive source code for a program, the source code identifying one or more strings to be logged during execution of the program; and
generate object code based on the source code such that the object code comprises:
a separate log section that includes the one or more identified strings; and
one or more instructions to cause the embedded system to write a reference to one of the one or more strings to memory (502) of the embedded system, the reference represented by a symbol associated with the string;
a linker configured to generate executable code based on the object code by marking the separate log section as a non-loadable section, and replacing each symbol associated with a string in the one or more instructions with information indicating a location of the string in the separate log section so as to form one or more executable instructions; and a loader configured to load the executable code comprising the one or more executable instructions into the memory of the embedded system such that the one or more identified strings are not stored in the memory of the embedded system. 6. The system of claim 5, further comprising a pre-processor configured to:
receive source code comprising one or more logging statements identifying a string to be logged; and generate the source code received by the complier based on the received source code by replacing each logging statement in the received source code with:
one or more instructions causing the identified string to be stored in the separate log section of the object code; and
one or more instructions causing a reference to the string to be stored in the memory of the embedded system. 7. The system of claim 6, wherein the logging statement has a predetermined format recognizable by the pre-processor. 8. The system of claim 6, wherein the one or more instructions causing the identified string to be stored in the separate log section of the object code causes the identified string to be stored in the separate log section of the object code in a static constant array. 9. The system of claim 5, wherein the information indicating a location of the string in the separate log section is an offset with respect to the separate log section. 10. The system of claim 5, wherein the linker is configured to mark the separate log section as a non-loadable section in response to receiving a linker script that identifies the separate log section as a non-loadable section. 11. The system of claim 5, wherein execution of the executable code by a processor of the embedded system causes the processor to write the information indicating the location of the string in the separate log section into the memory of the embedded system. 12. The system of claim 11, further comprising the embedded system and execution of the executable code loaded into the memory of the embedded system by the processor causes the processor to write the information indicating the location of the string in the separate log section into the memory of the embedded system. 13. The system of claim 12, further comprising a host computing-based device in communication with the embedded system, the host-computing-based device configured to obtain the information indicating the location of the string in the separate log section stored in the memory of the embedded system and generate a complete log of strings based on the obtained information indicating the location of the string in the separate log section stored, and a file comprising the separate log section of the executable code. 14. The system of claim 13, wherein the file comprising the separate log section of the executable code is the executable code. 15. The system of claim 5, wherein the embedded system is a radio processing unit. 16. An embedded system comprising a processor configured to log one or more strings during execution of a program, the embedded system further comprising executable code obtained by the method of claim 1, said executable code representing the program being loaded into a memory of the embedded system without loading the one or more strings into the memory of the embedded system. 17. A host computing-based device configured to generate a complete log of strings representing flow of a program executed by a processor of an embedded system, the host computing-based device comprising:
a processor; and memory comprising computer executable instructions that when executed by the processor cause the processor to:
receive a file comprising a log section of executable code representing the program, the log section comprising one or more strings;
obtain one or more references stored in memory of the embedded system, each reference identifying a location of a string of the one or more strings in the log section of the executable code, the references being stored in the memory of the embedded system during execution of the program; and
generating a complete log that includes one or more strings of the received file identified by the references in the log buffer. 18. The host computing-based device of claim 17, wherein the received file is the executable code. 19. Computer readable code configured to perform the steps of the method of claim 1 when the computer readable code is run on a computer. 20. A computer readable storage medium having encoded thereon the computer readable code of claim 19. | Methods for logging strings during execution of a program running on an embedded system without storing the strings in the memory of the embedded system include, during the build process, receiving source code for a program that comprises one or more log statements that identifies a string to be logged; generating object code based on the source code that comprises a special log section that includes the identified strings, and, for each log statement one or more instructions that cause a reference to the corresponding string to be stored in memory of the embedded system; generating execution code based on the object code wherein the special log section is marked as non-loadable and each reference is a location of the corresponding string in the special log section; and, loading the generated executable code into the memory of the embedded system such that the identified strings are not loaded into the memory of the embedded system.1. A computer-implemented method to generate executable code for a program to be run on an embedded system which causes the embedded system to log one or more strings during execution of the executable code, the method comprising:
receiving source code for a program, the source code identifying one or more strings to be logged during execution of the program; causing a compiler to generate object code based on the source code such that the object code comprises:
a separate log section that includes the one or more identified strings; and
one or more instructions to cause the embedded system to write a reference to one of the one or more strings to memory of the embedded system, the reference represented by a symbol associated with the string;
causing a linker to generate executable code based on the object code by causing the linker to mark the separate log section as a non-loadable section, and to replace each symbol associated with a string in the one or more instructions with information indicating the location of the string in the separate log section so as to form one or more executable instructions; and loading the executable code comprising the one or more executable instructions into the memory of the embedded system such that the one or more identified strings are not stored in the memory of the embedded system. 2. The method of claim 1, wherein the received source code comprises one or more logging statements identifying a string to be logged, and the method further comprises, prior to causing the compiler to generate the object code, causing a pre-processor to replace each logging statement in the source code with:
one or more instructions causing the identified string to be stored in the separate log section of the object code; and one or more instructions causing a reference to the string to be stored in memory of the embedded system. 3. The method of claim 2, wherein the logging statement has a predetermined format recognizable by the pre-processor. 4. The method of claim 2, wherein the one or more instructions causing the identified string to be stored in the separate log section of the object code cause the identified string to be stored in the separate log section of the object code in a static constant array. 5. A system to generate executable code for a program to be run on an embedded system which causes the embedded system to log one or more strings during execution of the executable code, the system comprising:
a compiler configured to:
receive source code for a program, the source code identifying one or more strings to be logged during execution of the program; and
generate object code based on the source code such that the object code comprises:
a separate log section that includes the one or more identified strings; and
one or more instructions to cause the embedded system to write a reference to one of the one or more strings to memory (502) of the embedded system, the reference represented by a symbol associated with the string;
a linker configured to generate executable code based on the object code by marking the separate log section as a non-loadable section, and replacing each symbol associated with a string in the one or more instructions with information indicating a location of the string in the separate log section so as to form one or more executable instructions; and a loader configured to load the executable code comprising the one or more executable instructions into the memory of the embedded system such that the one or more identified strings are not stored in the memory of the embedded system. 6. The system of claim 5, further comprising a pre-processor configured to:
receive source code comprising one or more logging statements identifying a string to be logged; and generate the source code received by the complier based on the received source code by replacing each logging statement in the received source code with:
one or more instructions causing the identified string to be stored in the separate log section of the object code; and
one or more instructions causing a reference to the string to be stored in the memory of the embedded system. 7. The system of claim 6, wherein the logging statement has a predetermined format recognizable by the pre-processor. 8. The system of claim 6, wherein the one or more instructions causing the identified string to be stored in the separate log section of the object code causes the identified string to be stored in the separate log section of the object code in a static constant array. 9. The system of claim 5, wherein the information indicating a location of the string in the separate log section is an offset with respect to the separate log section. 10. The system of claim 5, wherein the linker is configured to mark the separate log section as a non-loadable section in response to receiving a linker script that identifies the separate log section as a non-loadable section. 11. The system of claim 5, wherein execution of the executable code by a processor of the embedded system causes the processor to write the information indicating the location of the string in the separate log section into the memory of the embedded system. 12. The system of claim 11, further comprising the embedded system and execution of the executable code loaded into the memory of the embedded system by the processor causes the processor to write the information indicating the location of the string in the separate log section into the memory of the embedded system. 13. The system of claim 12, further comprising a host computing-based device in communication with the embedded system, the host-computing-based device configured to obtain the information indicating the location of the string in the separate log section stored in the memory of the embedded system and generate a complete log of strings based on the obtained information indicating the location of the string in the separate log section stored, and a file comprising the separate log section of the executable code. 14. The system of claim 13, wherein the file comprising the separate log section of the executable code is the executable code. 15. The system of claim 5, wherein the embedded system is a radio processing unit. 16. An embedded system comprising a processor configured to log one or more strings during execution of a program, the embedded system further comprising executable code obtained by the method of claim 1, said executable code representing the program being loaded into a memory of the embedded system without loading the one or more strings into the memory of the embedded system. 17. A host computing-based device configured to generate a complete log of strings representing flow of a program executed by a processor of an embedded system, the host computing-based device comprising:
a processor; and memory comprising computer executable instructions that when executed by the processor cause the processor to:
receive a file comprising a log section of executable code representing the program, the log section comprising one or more strings;
obtain one or more references stored in memory of the embedded system, each reference identifying a location of a string of the one or more strings in the log section of the executable code, the references being stored in the memory of the embedded system during execution of the program; and
generating a complete log that includes one or more strings of the received file identified by the references in the log buffer. 18. The host computing-based device of claim 17, wherein the received file is the executable code. 19. Computer readable code configured to perform the steps of the method of claim 1 when the computer readable code is run on a computer. 20. A computer readable storage medium having encoded thereon the computer readable code of claim 19. | 2,100 |
6,109 | 6,109 | 15,144,588 | 2,136 | Example embodiments are described for data property-based data placement inside a nonvolatile memory device performed by a storage controller of the nonvolatile memory device. In one aspect, the embodiments include: executing a software component on the computer device that detects at least one of an executing application and a hardware device connecting to the computing device; responsive to detecting the at least one executing application and the hardware device, searching, by the software component, a workflow repository to find a predetermined workflow associated with the at least one executing application and the hardware device, wherein the predetermined workflow associates predefined data property identifiers to different types of data items written to the nonvolatile memory device by the executing application or the hardware device; comparing, by the software component, activities of the at least one executing application and the hardware device to the predetermined workflow; and using the predetermined workflow to automatically assign the data property identifiers to the data items used by the application or the hardware device, such that the data items and assigned data property identifiers are transmitted over a channel to the nonvolatile memory device for storage wherein the nonvolatile memory device reads the data property identifiers and identifies which blocks of the nonvolatile memory device to store the corresponding data items, such that the data items having the same data property identifiers are stored in a same block. | 1. A method for providing an interface for enabling a computer device to utilize data property-based data placement inside a nonvolatile memory device, the method comprising:
executing a software component on the computer device that detects at least one of an executing application and a hardware device connecting to the computing device; responsive to detecting the at least one executing application and the hardware device, searching, by the software component, a workflow repository to find a predetermined workflow associated with the at least one executing application and the hardware device, wherein the predetermined workflow associates predefined data property identifiers to different types of data items written to the nonvolatile memory device by the executing application or the hardware device; comparing, by the software component, activities of the at least one executing application and the hardware device to the predetermined workflow; and using the predetermined workflow to automatically assign the data property identifiers to the data items used by the application or the hardware device, such that the data items and assigned data property identifiers are transmitted over a channel to the nonvolatile memory device for storage, wherein the nonvolatile memory device reads the data property identifiers and identifies which blocks of the nonvolatile memory device to store the corresponding data items, such that the data items having the same data property identifiers are stored in a same block. 2. The method of claim 1, wherein the hardware device comprises at least one of: a camera, a microphone, a thermometer, a GPS, a clock, a sensor, a switch, a router, a RAID system, or a host bus adapter (HBA) system. 3. The method of claim 1, wherein detecting the at least one of the executing application and hardware device comprises detecting new data placement clients, which the software component then provides with data property-based data placement even though the at least one application and hardware device were not designed with such capability. 4. The method of claim 1, wherein the software component comprises a workflow monitor interface for enabling the computer device to utilize data property-based data placement of the nonvolatile memory device. 5. The method of claim 4, further comprising: the workflow monitor interface receiving new and updated workflows for the workflow repository to accommodate new applications and hardware devices. 6. The method of claim 5, wherein comparing activities of the at least one executing application and the hardware device to the predetermined workflow is performed by:
examining one or more current processes or steps performed by the at least one of an application and a hardware device and matching the current processes or steps with a similar sequence of processes or steps in the predetermined workflow. 7. A system, comprising:
a nonvolatile memory device; and a computer device coupled to the nonvolatile memory device, the computer device executing a software component serving as an interface for enabling the computer device to utilize data property-based data placement inside the nonvolatile memory device, the software component configured to:
detect at least one of an executing application and a hardware device connecting to the computing device;
responsive to detecting the at least one executing application and the hardware device, search a workflow repository to find a predetermined workflow associated with the at least one executing application and the hardware device, wherein the predetermined workflow associates predefined data property identifiers to different types of data items written to the nonvolatile memory device by the executing application or the hardware device;
compare activities of the at least one executing application and the hardware device to the predetermined workflow; and
use the predetermined workflow to automatically assign the data property identifiers to the data items used by the application or the hardware device, such that the data items and assigned data property identifiers are transmitted over a channel to the nonvolatile memory device for storage, wherein the nonvolatile memory device reads the data property identifiers and identifies which blocks of the nonvolatile memory device to store the corresponding data items, such that the data items having the same data property identifiers are stored in a same block. 8. The system of claim 7, wherein the hardware device comprises at least one of: a camera, a microphone, a thermometer, a GPS, a clock a sensor, a switch, a router, a RAID system, or a host bus adapter (HBA) system. 9. The system of claim 7, wherein detection of the at least one of the executing application and hardware device comprises detecting new data placement clients, which the software component then provides with data property-based data placement even though the at least one application and hardware device were not designed with such capability. 10. The system of claim 7, wherein the software component comprises a workflow monitor interface for enabling the computer device to utilize data property-based data placement of the nonvolatile memory device. 11. The system of claim 10, wherein the workflow monitor interface receives new and updated workflows for the workflow repository to accommodate new applications and hardware devices. 12. The system of claim 11, wherein the workflow monitor compares activities of the at least one executing application and the hardware device to the predetermined workflow by:
examining one or more current processes or steps performed by the at least one of an application and a hardware device and matching the current processes or steps with a similar sequence of processes or steps in the predetermined workflow. 13. A nonvolatile memory device, comprising:
a memory array; and a storage controller coupled to the memory array and to a channel, the storage controller configured to:
receive over the memory channel from at least one of an operating system and an executing application, a first series of data items to be stored, wherein each of the data items includes a first data property identifier that is associated with the data items based on the one or more data properties indicating data similarity;
receive over the memory channel from a hardware device controller a second series of data items to be stored, wherein each of the second series of data items includes a second data property identifier that is associated with the second series of data items based on one or more data properties indicating data similarity;
read the data property identifiers and identifying which blocks of the nonvolatile memory to store the corresponding first and second series of data items, such that the data items having the same data property identifiers are stored in a same block; and
storing the data items into the identified blocks. 14. The nonvolatile memory device of claim 13, wherein the hardware device comprises at least one of: camera, a microphone, a thermometer, a GPS, a clock, a sensor, a switch, a router, a RAID system, or a host bus adapter (HBA) system. 15. The nonvolatile memory device of claim 13, wherein the at least one of an operating system and executing application or the hardware device controller are part of a computer device. 16. The nonvolatile memory device of claim 13, wherein the computer device includes a workflow monitor interface for enabling the computer device to utilize data property-based data placement of the nonvolatile memory device. 17. The method of claim 16, wherein the workflow monitor interface executes at an operating system level in the computer device and is configured to:
detect at least one of the executing application and the hardware controller connecting to the computing device; responsive to detecting the at least one executing application and the hardware controller, search a workflow repository to find a predetermined workflow associated with the at least one executing application and the hardware controller, wherein the predetermined workflow associates predefined data property identifiers to different types of data items written to the nonvolatile memory device by the executing application or the hardware controller; compare activities of the at least one executing application or the hardware device to the predetermined workflow; and use the predetermined workflow to automatically assign the data property identifiers to the data items used by the application or the hardware device, such that the data items and assigned data property identifiers are transmitted over a channel to the nonvolatile memory device for storage. 18. A method for data property-based data placement inside a nonvolatile memory device performed by a storage controller of the nonvolatile memory device, the program instructions for:
receiving over a memory channel from at least one of an operating system and an executing application, a first series of data items to be stored, wherein each of the data items includes a first data property identifier that is associated with the data items based on the one or more data properties indicating data similarity; receiving over the memory channel from a hardware device controller a second series of data items to be stored, wherein each of the second series of data items includes a second data property identifier that is associated with the second series of data items based on one or more data properties indicating data similarity; reading the data property identifiers and identifying which blocks of the nonvolatile memory device to store the corresponding first and second series of data items, such that the data items having the same data property identifiers are stored in a same block; and storing the data items into the identified blocks. 19. The method of claim 18, wherein the hardware device comprises at least one of: camera, a microphone, a thermometer, a GPS, a clock, a sensor, a switch, a router, a RAID system, or a host bus adapter (HBA) system. 20. The method of claim 18, wherein the at least one of an operating system and executing application or the hardware device controller are part of a computer device. 21. The method of claim 18, wherein the computer device includes a workflow monitor interface for enabling the computer device to utilize data property-based data placement of the nonvolatile memory device. 22. The method of claim 21, wherein the workflow monitor interface executes at an operating system level in the computer device and is configured to:
detect at least one of the executing application and the hardware controller connecting to the computing device; responsive to detecting the at least one executing application and the hardware controller, search a workflow repository to find a predetermined workflow associated with the at least one executing application and the hardware controller, wherein the predetermined workflow associates predefined data property identifiers to different types of data items written to the nonvolatile memory device by the executing application or the hardware controller; compare activities of the at least one executing application or the hardware device to the predetermined workflow; and use the predetermined workflow to automatically assign the data property identifiers to the data items used by the application or the hardware device, such that the data items and assigned data property identifiers are transmitted over a channel to the nonvolatile memory device for storage. 23. A method for providing an interface for enabling a computer device to utilize data property-based data placement inside a nonvolatile memory device, the method comprising:
executing a software component on the computer; querying, by the software component, a workflow repository to find a predetermined workflow associated with the software component, wherein the predetermined workflow associates predefined data property identifiers to different classes of data items to be written to the nonvolatile memory device; during operation of the software component, sending one or more requests to the predetermined workflow for one or more data property identifiers to associate with data items used by the software component; and responsive to the software component receiving the one or more data property identifiers from the predetermined workflow, automatically assigning the data property identifiers to the data items used by the software component and transmitting the data items and assigned data property identifiers to the nonvolatile memory device for storage, wherein the nonvolatile memory device reads the data property identifiers and identifies which blocks of the nonvolatile memory device to store the corresponding data items, such that the data items having the same data property identifiers are stored in a same block. | Example embodiments are described for data property-based data placement inside a nonvolatile memory device performed by a storage controller of the nonvolatile memory device. In one aspect, the embodiments include: executing a software component on the computer device that detects at least one of an executing application and a hardware device connecting to the computing device; responsive to detecting the at least one executing application and the hardware device, searching, by the software component, a workflow repository to find a predetermined workflow associated with the at least one executing application and the hardware device, wherein the predetermined workflow associates predefined data property identifiers to different types of data items written to the nonvolatile memory device by the executing application or the hardware device; comparing, by the software component, activities of the at least one executing application and the hardware device to the predetermined workflow; and using the predetermined workflow to automatically assign the data property identifiers to the data items used by the application or the hardware device, such that the data items and assigned data property identifiers are transmitted over a channel to the nonvolatile memory device for storage wherein the nonvolatile memory device reads the data property identifiers and identifies which blocks of the nonvolatile memory device to store the corresponding data items, such that the data items having the same data property identifiers are stored in a same block.1. A method for providing an interface for enabling a computer device to utilize data property-based data placement inside a nonvolatile memory device, the method comprising:
executing a software component on the computer device that detects at least one of an executing application and a hardware device connecting to the computing device; responsive to detecting the at least one executing application and the hardware device, searching, by the software component, a workflow repository to find a predetermined workflow associated with the at least one executing application and the hardware device, wherein the predetermined workflow associates predefined data property identifiers to different types of data items written to the nonvolatile memory device by the executing application or the hardware device; comparing, by the software component, activities of the at least one executing application and the hardware device to the predetermined workflow; and using the predetermined workflow to automatically assign the data property identifiers to the data items used by the application or the hardware device, such that the data items and assigned data property identifiers are transmitted over a channel to the nonvolatile memory device for storage, wherein the nonvolatile memory device reads the data property identifiers and identifies which blocks of the nonvolatile memory device to store the corresponding data items, such that the data items having the same data property identifiers are stored in a same block. 2. The method of claim 1, wherein the hardware device comprises at least one of: a camera, a microphone, a thermometer, a GPS, a clock, a sensor, a switch, a router, a RAID system, or a host bus adapter (HBA) system. 3. The method of claim 1, wherein detecting the at least one of the executing application and hardware device comprises detecting new data placement clients, which the software component then provides with data property-based data placement even though the at least one application and hardware device were not designed with such capability. 4. The method of claim 1, wherein the software component comprises a workflow monitor interface for enabling the computer device to utilize data property-based data placement of the nonvolatile memory device. 5. The method of claim 4, further comprising: the workflow monitor interface receiving new and updated workflows for the workflow repository to accommodate new applications and hardware devices. 6. The method of claim 5, wherein comparing activities of the at least one executing application and the hardware device to the predetermined workflow is performed by:
examining one or more current processes or steps performed by the at least one of an application and a hardware device and matching the current processes or steps with a similar sequence of processes or steps in the predetermined workflow. 7. A system, comprising:
a nonvolatile memory device; and a computer device coupled to the nonvolatile memory device, the computer device executing a software component serving as an interface for enabling the computer device to utilize data property-based data placement inside the nonvolatile memory device, the software component configured to:
detect at least one of an executing application and a hardware device connecting to the computing device;
responsive to detecting the at least one executing application and the hardware device, search a workflow repository to find a predetermined workflow associated with the at least one executing application and the hardware device, wherein the predetermined workflow associates predefined data property identifiers to different types of data items written to the nonvolatile memory device by the executing application or the hardware device;
compare activities of the at least one executing application and the hardware device to the predetermined workflow; and
use the predetermined workflow to automatically assign the data property identifiers to the data items used by the application or the hardware device, such that the data items and assigned data property identifiers are transmitted over a channel to the nonvolatile memory device for storage, wherein the nonvolatile memory device reads the data property identifiers and identifies which blocks of the nonvolatile memory device to store the corresponding data items, such that the data items having the same data property identifiers are stored in a same block. 8. The system of claim 7, wherein the hardware device comprises at least one of: a camera, a microphone, a thermometer, a GPS, a clock a sensor, a switch, a router, a RAID system, or a host bus adapter (HBA) system. 9. The system of claim 7, wherein detection of the at least one of the executing application and hardware device comprises detecting new data placement clients, which the software component then provides with data property-based data placement even though the at least one application and hardware device were not designed with such capability. 10. The system of claim 7, wherein the software component comprises a workflow monitor interface for enabling the computer device to utilize data property-based data placement of the nonvolatile memory device. 11. The system of claim 10, wherein the workflow monitor interface receives new and updated workflows for the workflow repository to accommodate new applications and hardware devices. 12. The system of claim 11, wherein the workflow monitor compares activities of the at least one executing application and the hardware device to the predetermined workflow by:
examining one or more current processes or steps performed by the at least one of an application and a hardware device and matching the current processes or steps with a similar sequence of processes or steps in the predetermined workflow. 13. A nonvolatile memory device, comprising:
a memory array; and a storage controller coupled to the memory array and to a channel, the storage controller configured to:
receive over the memory channel from at least one of an operating system and an executing application, a first series of data items to be stored, wherein each of the data items includes a first data property identifier that is associated with the data items based on the one or more data properties indicating data similarity;
receive over the memory channel from a hardware device controller a second series of data items to be stored, wherein each of the second series of data items includes a second data property identifier that is associated with the second series of data items based on one or more data properties indicating data similarity;
read the data property identifiers and identifying which blocks of the nonvolatile memory to store the corresponding first and second series of data items, such that the data items having the same data property identifiers are stored in a same block; and
storing the data items into the identified blocks. 14. The nonvolatile memory device of claim 13, wherein the hardware device comprises at least one of: camera, a microphone, a thermometer, a GPS, a clock, a sensor, a switch, a router, a RAID system, or a host bus adapter (HBA) system. 15. The nonvolatile memory device of claim 13, wherein the at least one of an operating system and executing application or the hardware device controller are part of a computer device. 16. The nonvolatile memory device of claim 13, wherein the computer device includes a workflow monitor interface for enabling the computer device to utilize data property-based data placement of the nonvolatile memory device. 17. The method of claim 16, wherein the workflow monitor interface executes at an operating system level in the computer device and is configured to:
detect at least one of the executing application and the hardware controller connecting to the computing device; responsive to detecting the at least one executing application and the hardware controller, search a workflow repository to find a predetermined workflow associated with the at least one executing application and the hardware controller, wherein the predetermined workflow associates predefined data property identifiers to different types of data items written to the nonvolatile memory device by the executing application or the hardware controller; compare activities of the at least one executing application or the hardware device to the predetermined workflow; and use the predetermined workflow to automatically assign the data property identifiers to the data items used by the application or the hardware device, such that the data items and assigned data property identifiers are transmitted over a channel to the nonvolatile memory device for storage. 18. A method for data property-based data placement inside a nonvolatile memory device performed by a storage controller of the nonvolatile memory device, the program instructions for:
receiving over a memory channel from at least one of an operating system and an executing application, a first series of data items to be stored, wherein each of the data items includes a first data property identifier that is associated with the data items based on the one or more data properties indicating data similarity; receiving over the memory channel from a hardware device controller a second series of data items to be stored, wherein each of the second series of data items includes a second data property identifier that is associated with the second series of data items based on one or more data properties indicating data similarity; reading the data property identifiers and identifying which blocks of the nonvolatile memory device to store the corresponding first and second series of data items, such that the data items having the same data property identifiers are stored in a same block; and storing the data items into the identified blocks. 19. The method of claim 18, wherein the hardware device comprises at least one of: camera, a microphone, a thermometer, a GPS, a clock, a sensor, a switch, a router, a RAID system, or a host bus adapter (HBA) system. 20. The method of claim 18, wherein the at least one of an operating system and executing application or the hardware device controller are part of a computer device. 21. The method of claim 18, wherein the computer device includes a workflow monitor interface for enabling the computer device to utilize data property-based data placement of the nonvolatile memory device. 22. The method of claim 21, wherein the workflow monitor interface executes at an operating system level in the computer device and is configured to:
detect at least one of the executing application and the hardware controller connecting to the computing device; responsive to detecting the at least one executing application and the hardware controller, search a workflow repository to find a predetermined workflow associated with the at least one executing application and the hardware controller, wherein the predetermined workflow associates predefined data property identifiers to different types of data items written to the nonvolatile memory device by the executing application or the hardware controller; compare activities of the at least one executing application or the hardware device to the predetermined workflow; and use the predetermined workflow to automatically assign the data property identifiers to the data items used by the application or the hardware device, such that the data items and assigned data property identifiers are transmitted over a channel to the nonvolatile memory device for storage. 23. A method for providing an interface for enabling a computer device to utilize data property-based data placement inside a nonvolatile memory device, the method comprising:
executing a software component on the computer; querying, by the software component, a workflow repository to find a predetermined workflow associated with the software component, wherein the predetermined workflow associates predefined data property identifiers to different classes of data items to be written to the nonvolatile memory device; during operation of the software component, sending one or more requests to the predetermined workflow for one or more data property identifiers to associate with data items used by the software component; and responsive to the software component receiving the one or more data property identifiers from the predetermined workflow, automatically assigning the data property identifiers to the data items used by the software component and transmitting the data items and assigned data property identifiers to the nonvolatile memory device for storage, wherein the nonvolatile memory device reads the data property identifiers and identifies which blocks of the nonvolatile memory device to store the corresponding data items, such that the data items having the same data property identifiers are stored in a same block. | 2,100 |
6,110 | 6,110 | 14,996,346 | 2,173 | A dual-screen client device includes a user interface for providing content and application tools to a user in an easy to use manner Different inputs of the user interface are presented to the user on one or both of the screens depending on a current state of the device and in response to user operation. Content such as an item of interest in a particular application is presented on one screen while tools or other inputs for that application are provided on the other screen. Through user operation of the interface or physical manipulation of the client device, the content and tools are swapped between the dual screens. For instance, buttons and menus can be brought up front to a closer screen for quick input, while active content (e.g., video chat, full image, drawings) is presented on the farther screen. | 1. A computer-implemented content presentation method for use in a multi-display computer system, the method comprising:
generating, by one or more processors, a first set of content items for presentation on a first display device of the multi-display computer system; generating, by the one or more processors, a second set of content items for presentation on a second display device of the multi-display computer system; upon receiving input information, the one or more processing devices modifying at least one of the first and second sets of content items; and presenting the modified content items on at least one of the first and second display devices, wherein presentation of the modified content includes swapping selected content between the first and second display devices. 2. The method of claim 1, wherein modifying at least one of the first and second sets of content items is performed in response to an input received from a user of the multi-display computer system. 3. The method of claim 2, wherein the received input indicates either:
a change in state for a currently running application; or a change in relative physical position of one or both of the first and second display devices. 4. The method of claim 1, wherein the swapping the selected content includes interchanging one or more user interface elements between the first and second display devices. 5. The method of claim 1, wherein the swapping the selected content includes either (i) linearly scrolling the selected content between the first and second display devices or (ii) rotating the selected content in a clockwise or counterclockwise direction between the first and second display devices. 6. The method of claim 1, wherein at least one of the first and second sets of content items corresponds to one selected from the group consisting of:
(i) a log-in interface; (ii) one or more applications; (iii) one or more widgets; (iv) thumbnail images; (v) audio content; and (vi) video content. 7. The method of claim 1, wherein the received input information identifies that:
an input device of the multi-display computer system has been pressed; an icon presented on either the first or the second display device has been selected; or an orientation of the multi-display computer system has changed from a first orientation to a second orientation. 8. The method of claim 7, wherein the orientation change indicates a physical rotation of the first and second display screens. 9. The method of claim 1, wherein the first set of content items are presented on the first display device and the second set of content items are presented on the second display device when the first display device is closer to the user than the second display device. 10. The method of claim 1, wherein the first set of content items includes one or more interactive elements configured to receive input from a user, and the second set of content items includes active content being presented to the user. 11. A multi-display client computing device, comprising:
a first display housing including a first display device therein; a second display housing including a second display device therein; one or more position and orientation sensors operatively coupled to at least one of the first and second display housings; one or more processors operatively coupled to the first and second display devices and to the one or more position and orientation sensors, the one or more processors being configured to:
generate a first set of content items for presentation on the first display device;
generate a second set of content items for presentation on the second display device;
upon receiving input information from an input source, modify at least one of the first and second sets of content items; and
cause the modified content items to be presented on at least one of the first and second display devices, wherein presentation of the modified content includes swapping selected content between the first and second display devices. 12. The multi-display client computing device of claim 11, wherein:
each of the first and second display devices includes a touch sensitive input; and the input source is the touch sensitive input of one of the first and second display devices. 13. The multi-display client computing device of claim 11, wherein the swapping the selected content includes either (i) linearly scrolling the selected content between the first and second display devices or (ii) rotating the selected content in a clockwise or counterclockwise direction between the first and second display devices. 14. The multi-display client computing device of claim 11, wherein the received input information identifies that an orientation of one or both of the first and second display housings has changed from a first orientation to a second orientation as detected by the one or more position and orientation sensors. 15. The multi-display client computing device of claim 11, wherein the orientation change indicates a physical rotation of at least one of the first and second display housings. 16. The multi-display client computing device of claim 15, wherein upon detection of the physical rotation, the modified content is rotated in at least one of the first and second display screens. 17. A computer-implemented content presentation method for use in a multi-display computer system, the method comprising:
preparing, by one or more processors, selected content for presentation on a first display device of the multi-display computer system; generating, by the one or more processors, one or more control elements for presentation on a second display device of the multi-display computer system, the control elements being operatively associated with the selected content to enable manipulation or modification of the selected content in response to an input signal; and performing, by the one or more processors, a screen swapping operation to move the selected content from the first display device to the second display device, and to concurrently move the one or more control elements from the second display device to the first display device. 18. The method of claim 17, wherein the screen swapping operation is performed in response to either:
a received instruction or signal provided to the multi-display computer system; or physical rotation of one or both of the first and second display devices. 19. The method of claim 18, wherein upon detection of the physical rotation, an orientation of one or both of the selected content and the one or more control elements is rotated in a corresponding one of the first and second display devices. 20. The method of claim 17, wherein performing the screen swapping operation includes providing an appearance of either (i) linearly exchanging the selected content and the one or more control elements or (ii) rotating the selected content and the one or more control elements in a clockwise or counterclockwise direction. | A dual-screen client device includes a user interface for providing content and application tools to a user in an easy to use manner Different inputs of the user interface are presented to the user on one or both of the screens depending on a current state of the device and in response to user operation. Content such as an item of interest in a particular application is presented on one screen while tools or other inputs for that application are provided on the other screen. Through user operation of the interface or physical manipulation of the client device, the content and tools are swapped between the dual screens. For instance, buttons and menus can be brought up front to a closer screen for quick input, while active content (e.g., video chat, full image, drawings) is presented on the farther screen.1. A computer-implemented content presentation method for use in a multi-display computer system, the method comprising:
generating, by one or more processors, a first set of content items for presentation on a first display device of the multi-display computer system; generating, by the one or more processors, a second set of content items for presentation on a second display device of the multi-display computer system; upon receiving input information, the one or more processing devices modifying at least one of the first and second sets of content items; and presenting the modified content items on at least one of the first and second display devices, wherein presentation of the modified content includes swapping selected content between the first and second display devices. 2. The method of claim 1, wherein modifying at least one of the first and second sets of content items is performed in response to an input received from a user of the multi-display computer system. 3. The method of claim 2, wherein the received input indicates either:
a change in state for a currently running application; or a change in relative physical position of one or both of the first and second display devices. 4. The method of claim 1, wherein the swapping the selected content includes interchanging one or more user interface elements between the first and second display devices. 5. The method of claim 1, wherein the swapping the selected content includes either (i) linearly scrolling the selected content between the first and second display devices or (ii) rotating the selected content in a clockwise or counterclockwise direction between the first and second display devices. 6. The method of claim 1, wherein at least one of the first and second sets of content items corresponds to one selected from the group consisting of:
(i) a log-in interface; (ii) one or more applications; (iii) one or more widgets; (iv) thumbnail images; (v) audio content; and (vi) video content. 7. The method of claim 1, wherein the received input information identifies that:
an input device of the multi-display computer system has been pressed; an icon presented on either the first or the second display device has been selected; or an orientation of the multi-display computer system has changed from a first orientation to a second orientation. 8. The method of claim 7, wherein the orientation change indicates a physical rotation of the first and second display screens. 9. The method of claim 1, wherein the first set of content items are presented on the first display device and the second set of content items are presented on the second display device when the first display device is closer to the user than the second display device. 10. The method of claim 1, wherein the first set of content items includes one or more interactive elements configured to receive input from a user, and the second set of content items includes active content being presented to the user. 11. A multi-display client computing device, comprising:
a first display housing including a first display device therein; a second display housing including a second display device therein; one or more position and orientation sensors operatively coupled to at least one of the first and second display housings; one or more processors operatively coupled to the first and second display devices and to the one or more position and orientation sensors, the one or more processors being configured to:
generate a first set of content items for presentation on the first display device;
generate a second set of content items for presentation on the second display device;
upon receiving input information from an input source, modify at least one of the first and second sets of content items; and
cause the modified content items to be presented on at least one of the first and second display devices, wherein presentation of the modified content includes swapping selected content between the first and second display devices. 12. The multi-display client computing device of claim 11, wherein:
each of the first and second display devices includes a touch sensitive input; and the input source is the touch sensitive input of one of the first and second display devices. 13. The multi-display client computing device of claim 11, wherein the swapping the selected content includes either (i) linearly scrolling the selected content between the first and second display devices or (ii) rotating the selected content in a clockwise or counterclockwise direction between the first and second display devices. 14. The multi-display client computing device of claim 11, wherein the received input information identifies that an orientation of one or both of the first and second display housings has changed from a first orientation to a second orientation as detected by the one or more position and orientation sensors. 15. The multi-display client computing device of claim 11, wherein the orientation change indicates a physical rotation of at least one of the first and second display housings. 16. The multi-display client computing device of claim 15, wherein upon detection of the physical rotation, the modified content is rotated in at least one of the first and second display screens. 17. A computer-implemented content presentation method for use in a multi-display computer system, the method comprising:
preparing, by one or more processors, selected content for presentation on a first display device of the multi-display computer system; generating, by the one or more processors, one or more control elements for presentation on a second display device of the multi-display computer system, the control elements being operatively associated with the selected content to enable manipulation or modification of the selected content in response to an input signal; and performing, by the one or more processors, a screen swapping operation to move the selected content from the first display device to the second display device, and to concurrently move the one or more control elements from the second display device to the first display device. 18. The method of claim 17, wherein the screen swapping operation is performed in response to either:
a received instruction or signal provided to the multi-display computer system; or physical rotation of one or both of the first and second display devices. 19. The method of claim 18, wherein upon detection of the physical rotation, an orientation of one or both of the selected content and the one or more control elements is rotated in a corresponding one of the first and second display devices. 20. The method of claim 17, wherein performing the screen swapping operation includes providing an appearance of either (i) linearly exchanging the selected content and the one or more control elements or (ii) rotating the selected content and the one or more control elements in a clockwise or counterclockwise direction. | 2,100 |
6,111 | 6,111 | 15,410,798 | 2,191 | The current document is directed to automated application-release-management facilities that, in a described implementation, coordinate continuous development and release of cloud-computing applications. The application-release-management process is specified, in the described implementation, by application-release-management pipelines, each pipeline comprising one or more stages, with each stage comprising one or more tasks. The currently described methods and systems employ configuration files to specify configuration of the execution environment for application-release-management pipelines, application-release-management-pipeline stages, and application-release-management-pipeline-stage tasks and apply policies to configuration files to further specify the execution environments for application-release-management pipelines. | 1. An automated-application-release-management subsystem within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, the automated-application-release-management subsystem comprising:
a dashboard user interface; an automated-application-release-management controller; an interface to a workflow-execution engine within the cloud-computing facility; an artifact-storage-and-management subsystem; and a policy module, accessed by the automated-application-release-management controller, to apply policies to an application-release-management-pipeline configuration prior to configuration of an execution environment for the application-release-management-pipeline. 2. The automated-application-release-management subsystem of claim 1 that is further incorporated in a workflow-based cloud-management system that additionally includes an infrastructure-management-and-administration subsystem and the workflow-execution engine. 3. The automated-application-release-management subsystem of claim 1 wherein the policy module stores policies that specify modifications to application-release-management-pipeline configuration files in a policy storage subsystem. 4. The automated-application-release-management subsystem of claim 3 wherein the policy storage subsystem stores a hierarchically organized set of policies for the application-release-management-pipeline that includes:
policies pertaining to the application-release-management pipeline, as a whole;
policies pertaining to one or more application-release-management-pipeline stages; and
policies pertaining to one or more application-release-management-pipeline-stage tasks. 5. The automated-application-release-management subsystem of claim 4 wherein each policy is a rule constructed from a policy parameterized template and specific parameter values. 6. The automated-application-release-management subsystem of claim 5 wherein a policy further includes clauses and operators. 7. The automated-application-release-management subsystem of claim 4 wherein the automated-application-release-management controller, prior to execution of an automated-application-release-management-pipeline element associated with a configuration file, such as the entire pipeline, a pipeline stage, of a pipeline-stage task, applies the policies in a set of stored policies pertaining to the element to the configuration file to modify the configuration file in accordance with the policies. 8. The automated-application-release-management subsystem of claim 7 wherein modifications to configuration files may include:
changing parameter values for allocation and initialization of computational resources; and
changing the types of allocated and initialized computational resources. 9. The automated-application-release-management subsystem of claim 4 wherein a policy is created by one or more of:
manual editing using a word-processing system; and
input to a policy-construction interface provided by the dashboard user interface. 10. A method carried out in an automated-application-release-management subsystem within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, the method comprising:
providing a dashboard user interface, an automated-application-release-management controller, an interface to a workflow-execution engine within the cloud-computing facility, an artifact-storage-and-management subsystem; providing a policy module that is accessed by the automated-application-release-management controller; and applying policies, by the automated-application-release-management controller, to an application-release-management-pipeline configuration prior to configuration of an execution environment for the application-release-management-pipeline. 11. The method of claim 10 wherein the automated-application-release-management subsystem is further incorporated in a workflow-based cloud-management system that additionally includes an infrastructure-management-and-administration subsystem and the workflow-execution engine. 12. The method of claim 10 wherein the policy module stores policies that specify modifications to application-release-management-pipeline configuration files in a policy storage subsystem. 13. The method of claim 12 wherein the policy storage subsystem stores a hierarchically organized set of policies for the application-release-management-pipeline that includes:
policies pertaining to the application-release-management pipeline, as a whole;
policies pertaining to one or more application-release-management-pipeline stages; and
policies pertaining to one or more application-release-management-pipeline-stage tasks. 14. The method of claim 13 wherein each policy is a rule constructed from a policy parameterized template and specific parameter values. 15. The method of claim 14 wherein a policy further includes clauses and operators. 16. The method of claim 13 wherein the automated-application-release-management controller, prior to execution of an automated-application-release-management-pipeline element associated with a configuration file, such as the entire pipeline, a pipeline stage, of a pipeline-stage task, applies the policies in a set of stored policies pertaining to the element to the configuration file to modify the configuration file in accordance with the policies. 17. The method of claim 16 wherein modifications to configuration files may include:
changing parameter values for allocation and initialization of computational resources; and
changing the types of allocated and initialized computational resources. 18. The method of claim 13 wherein a policy is created by one or more of:
manual editing using a word-processing system; and
input to a policy-construction interface provided by the dashboard user interface. 19. A physical data-storage device that stores a sequence of computer instructions that, when executed by one or more processors within an automated-application-release-management subsystem within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, control the automated-application-release-management subsystem to:
provide a dashboard user interface, an automated-application-release-management controller, an interface to a workflow-execution engine within the cloud-computing facility, an artifact-storage-and-management subsystem; provide a policy module that is accessed by the automated-application-release-management controller; and apply policies, by the automated-application-release-management controller, to an application-release-management-pipeline configuration prior to configuration of an execution environment for the application-release-management-pipeline. | The current document is directed to automated application-release-management facilities that, in a described implementation, coordinate continuous development and release of cloud-computing applications. The application-release-management process is specified, in the described implementation, by application-release-management pipelines, each pipeline comprising one or more stages, with each stage comprising one or more tasks. The currently described methods and systems employ configuration files to specify configuration of the execution environment for application-release-management pipelines, application-release-management-pipeline stages, and application-release-management-pipeline-stage tasks and apply policies to configuration files to further specify the execution environments for application-release-management pipelines.1. An automated-application-release-management subsystem within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, the automated-application-release-management subsystem comprising:
a dashboard user interface; an automated-application-release-management controller; an interface to a workflow-execution engine within the cloud-computing facility; an artifact-storage-and-management subsystem; and a policy module, accessed by the automated-application-release-management controller, to apply policies to an application-release-management-pipeline configuration prior to configuration of an execution environment for the application-release-management-pipeline. 2. The automated-application-release-management subsystem of claim 1 that is further incorporated in a workflow-based cloud-management system that additionally includes an infrastructure-management-and-administration subsystem and the workflow-execution engine. 3. The automated-application-release-management subsystem of claim 1 wherein the policy module stores policies that specify modifications to application-release-management-pipeline configuration files in a policy storage subsystem. 4. The automated-application-release-management subsystem of claim 3 wherein the policy storage subsystem stores a hierarchically organized set of policies for the application-release-management-pipeline that includes:
policies pertaining to the application-release-management pipeline, as a whole;
policies pertaining to one or more application-release-management-pipeline stages; and
policies pertaining to one or more application-release-management-pipeline-stage tasks. 5. The automated-application-release-management subsystem of claim 4 wherein each policy is a rule constructed from a policy parameterized template and specific parameter values. 6. The automated-application-release-management subsystem of claim 5 wherein a policy further includes clauses and operators. 7. The automated-application-release-management subsystem of claim 4 wherein the automated-application-release-management controller, prior to execution of an automated-application-release-management-pipeline element associated with a configuration file, such as the entire pipeline, a pipeline stage, of a pipeline-stage task, applies the policies in a set of stored policies pertaining to the element to the configuration file to modify the configuration file in accordance with the policies. 8. The automated-application-release-management subsystem of claim 7 wherein modifications to configuration files may include:
changing parameter values for allocation and initialization of computational resources; and
changing the types of allocated and initialized computational resources. 9. The automated-application-release-management subsystem of claim 4 wherein a policy is created by one or more of:
manual editing using a word-processing system; and
input to a policy-construction interface provided by the dashboard user interface. 10. A method carried out in an automated-application-release-management subsystem within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, the method comprising:
providing a dashboard user interface, an automated-application-release-management controller, an interface to a workflow-execution engine within the cloud-computing facility, an artifact-storage-and-management subsystem; providing a policy module that is accessed by the automated-application-release-management controller; and applying policies, by the automated-application-release-management controller, to an application-release-management-pipeline configuration prior to configuration of an execution environment for the application-release-management-pipeline. 11. The method of claim 10 wherein the automated-application-release-management subsystem is further incorporated in a workflow-based cloud-management system that additionally includes an infrastructure-management-and-administration subsystem and the workflow-execution engine. 12. The method of claim 10 wherein the policy module stores policies that specify modifications to application-release-management-pipeline configuration files in a policy storage subsystem. 13. The method of claim 12 wherein the policy storage subsystem stores a hierarchically organized set of policies for the application-release-management-pipeline that includes:
policies pertaining to the application-release-management pipeline, as a whole;
policies pertaining to one or more application-release-management-pipeline stages; and
policies pertaining to one or more application-release-management-pipeline-stage tasks. 14. The method of claim 13 wherein each policy is a rule constructed from a policy parameterized template and specific parameter values. 15. The method of claim 14 wherein a policy further includes clauses and operators. 16. The method of claim 13 wherein the automated-application-release-management controller, prior to execution of an automated-application-release-management-pipeline element associated with a configuration file, such as the entire pipeline, a pipeline stage, of a pipeline-stage task, applies the policies in a set of stored policies pertaining to the element to the configuration file to modify the configuration file in accordance with the policies. 17. The method of claim 16 wherein modifications to configuration files may include:
changing parameter values for allocation and initialization of computational resources; and
changing the types of allocated and initialized computational resources. 18. The method of claim 13 wherein a policy is created by one or more of:
manual editing using a word-processing system; and
input to a policy-construction interface provided by the dashboard user interface. 19. A physical data-storage device that stores a sequence of computer instructions that, when executed by one or more processors within an automated-application-release-management subsystem within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, control the automated-application-release-management subsystem to:
provide a dashboard user interface, an automated-application-release-management controller, an interface to a workflow-execution engine within the cloud-computing facility, an artifact-storage-and-management subsystem; provide a policy module that is accessed by the automated-application-release-management controller; and apply policies, by the automated-application-release-management controller, to an application-release-management-pipeline configuration prior to configuration of an execution environment for the application-release-management-pipeline. | 2,100 |
6,112 | 6,112 | 15,715,898 | 2,179 | The invention relates to systems and methods for manipulating non-linearly connected transmedia content, in particular for creating, processing and/or managing non-linearly connected transmedia content and for tracking content creation and attributing transmedia content to one or more creators. Specifically, the invention involves creating a transmedia content data item by a first user and storing the transmedia content data item in a data store, along with a record indicating an association between the first user and the transmedia content data item; creating an ordered group of transmedia content data items by a second user, the ordered group comprising a pointer to the transmedia content data item of the first user; and storing the ordered group and a record associating both the first user and the second user with the ordered group in the data store. | 1. A computer-implemented method for generating non-linear transmedia content data items, the method comprising:
creating a transmedia content data item by a first user and storing the transmedia content data item in a data store, along with a record indicating an association between the first user and the transmedia content data item; creating an ordered group of transmedia content data items by a second user, the ordered group comprising a pointer to the transmedia content data item of the first user; and storing the ordered group and a record associating both the first user and the second user with the ordered group in the data store. 2. The computer-implemented method of claim 1, where the step of creating a transmedia content data item further comprises creating a unique identifier associated with the transmedia content data item and storing the unique identifier in the data store. 3. The computer-implemented method of claim 1, wherein the step of creating an ordered group comprises creating linking-data defining time-ordered links between the transmedia content data items in the ordered group. 4. The computer-implemented method of claim 1, wherein the method further comprises
adding a pointer to a second transmedia content data item created by a third user to the ordered group and updating the ordered group stored in the data store. 5. The computer-implemented method of claim 4, wherein the method further comprises
updating the record stored in the data store to associate the third user with the ordered group. 6. The computer-implemented method of claim 1, wherein the first user and the second user are the same user. 7. The computer-implemented method of claim 1, wherein the first user and the second user are different users. 8. The computer-implemented method of claim 7, wherein only the second user can modify the ordered group. 9. The computer-implemented method of claim 8, wherein only the first user can modify the transmedia content data item. 10. The computer-implemented method of claim 9, further comprising:
receiving instructions from a fourth user to modify the ordered group; creating a copy of the ordered group and storing the ordered group in the data store along with a record associating the first user and the fourth user with the copy of the ordered group in the data store; and modifying the copy of the ordered group in accordance with the received instructions. 11. The computer-implemented method of claim 10, wherein the instructions to modify the ordered group comprise instructions to include a fourth transmedia content data item created by a fifth user in the ordered group. 12. The computer-implemented method of claim 11, wherein the step of creating an ordered group comprises creating linking-data defining a time-ordered link originated from the first transmedia content data and terminating at the second transmedia content data item, and wherein the instructions to modify the ordered group further comprises instructions to create a time-ordered link originating from the first transmedia content data item and terminating and the fourth transmedia content data item such that the ordered group defines alternative time-ordered links originating at the first transmedia content data item. 13. The computer-implemented method of claim 1, wherein the method further comprises tracking the number of user interactions with each transmedia content data item and storing the number of interactions in the data store. 14. The computer-implemented method of claim 13, wherein the method further comprises calculating a contribution value for each transmedia content data item based on the stored number of user interactions and the size of the transmedia content data item. 15. The computer-implemented method of claim 1, wherein the method further comprises tracking the number of user interactions with the ordered group of transmedia content data items and storing the number of user interactions in the data store. 16. The computer-implemented method of claim 13, wherein the method further comprises calculating a contribution value for the ordered group based on the stored number of user interactions and the number of transmedia content data items and time-ordered content links in the ordered group. 17. A non-transitory computer-readable medium containing computer readable instructions which, when executed by processing circuitry, cause the processing circuitry to:
create a transmedia content data item by a first user and storing the transmedia content data item in a data store, along with a record indicating an association between the first user and the transmedia content data item; create an ordered group of transmedia content data items by a second user, the ordered group comprising a pointer to the transmedia content data item of the first user; and store the ordered group and a record associating both the first user and the second user with the ordered group in the data store. 18. An electronic device comprising:
processing circuitry; and a memory coupled with and readable by the processing circuitry and storing therein a set of instructions which, when executed by the one or more processors, cause the processor to: create a transmedia content data item by a first user and storing the transmedia content data item in a data store, along with a record indicating an association between the first user and the transmedia content data item; create an ordered group of transmedia content data items by a second user, the ordered group comprising a pointer to the transmedia content data item of the first user; and store the ordered group and a record associating both the first user and the second user with the ordered group in the data store. | The invention relates to systems and methods for manipulating non-linearly connected transmedia content, in particular for creating, processing and/or managing non-linearly connected transmedia content and for tracking content creation and attributing transmedia content to one or more creators. Specifically, the invention involves creating a transmedia content data item by a first user and storing the transmedia content data item in a data store, along with a record indicating an association between the first user and the transmedia content data item; creating an ordered group of transmedia content data items by a second user, the ordered group comprising a pointer to the transmedia content data item of the first user; and storing the ordered group and a record associating both the first user and the second user with the ordered group in the data store.1. A computer-implemented method for generating non-linear transmedia content data items, the method comprising:
creating a transmedia content data item by a first user and storing the transmedia content data item in a data store, along with a record indicating an association between the first user and the transmedia content data item; creating an ordered group of transmedia content data items by a second user, the ordered group comprising a pointer to the transmedia content data item of the first user; and storing the ordered group and a record associating both the first user and the second user with the ordered group in the data store. 2. The computer-implemented method of claim 1, where the step of creating a transmedia content data item further comprises creating a unique identifier associated with the transmedia content data item and storing the unique identifier in the data store. 3. The computer-implemented method of claim 1, wherein the step of creating an ordered group comprises creating linking-data defining time-ordered links between the transmedia content data items in the ordered group. 4. The computer-implemented method of claim 1, wherein the method further comprises
adding a pointer to a second transmedia content data item created by a third user to the ordered group and updating the ordered group stored in the data store. 5. The computer-implemented method of claim 4, wherein the method further comprises
updating the record stored in the data store to associate the third user with the ordered group. 6. The computer-implemented method of claim 1, wherein the first user and the second user are the same user. 7. The computer-implemented method of claim 1, wherein the first user and the second user are different users. 8. The computer-implemented method of claim 7, wherein only the second user can modify the ordered group. 9. The computer-implemented method of claim 8, wherein only the first user can modify the transmedia content data item. 10. The computer-implemented method of claim 9, further comprising:
receiving instructions from a fourth user to modify the ordered group; creating a copy of the ordered group and storing the ordered group in the data store along with a record associating the first user and the fourth user with the copy of the ordered group in the data store; and modifying the copy of the ordered group in accordance with the received instructions. 11. The computer-implemented method of claim 10, wherein the instructions to modify the ordered group comprise instructions to include a fourth transmedia content data item created by a fifth user in the ordered group. 12. The computer-implemented method of claim 11, wherein the step of creating an ordered group comprises creating linking-data defining a time-ordered link originated from the first transmedia content data and terminating at the second transmedia content data item, and wherein the instructions to modify the ordered group further comprises instructions to create a time-ordered link originating from the first transmedia content data item and terminating and the fourth transmedia content data item such that the ordered group defines alternative time-ordered links originating at the first transmedia content data item. 13. The computer-implemented method of claim 1, wherein the method further comprises tracking the number of user interactions with each transmedia content data item and storing the number of interactions in the data store. 14. The computer-implemented method of claim 13, wherein the method further comprises calculating a contribution value for each transmedia content data item based on the stored number of user interactions and the size of the transmedia content data item. 15. The computer-implemented method of claim 1, wherein the method further comprises tracking the number of user interactions with the ordered group of transmedia content data items and storing the number of user interactions in the data store. 16. The computer-implemented method of claim 13, wherein the method further comprises calculating a contribution value for the ordered group based on the stored number of user interactions and the number of transmedia content data items and time-ordered content links in the ordered group. 17. A non-transitory computer-readable medium containing computer readable instructions which, when executed by processing circuitry, cause the processing circuitry to:
create a transmedia content data item by a first user and storing the transmedia content data item in a data store, along with a record indicating an association between the first user and the transmedia content data item; create an ordered group of transmedia content data items by a second user, the ordered group comprising a pointer to the transmedia content data item of the first user; and store the ordered group and a record associating both the first user and the second user with the ordered group in the data store. 18. An electronic device comprising:
processing circuitry; and a memory coupled with and readable by the processing circuitry and storing therein a set of instructions which, when executed by the one or more processors, cause the processor to: create a transmedia content data item by a first user and storing the transmedia content data item in a data store, along with a record indicating an association between the first user and the transmedia content data item; create an ordered group of transmedia content data items by a second user, the ordered group comprising a pointer to the transmedia content data item of the first user; and store the ordered group and a record associating both the first user and the second user with the ordered group in the data store. | 2,100 |
6,113 | 6,113 | 14,226,794 | 2,173 | A radial based user interface (UI) is provided for entering data into a computer device. The radial based UI has a central region with a plurality of radial regions. A location for the central region is defined on a touch sensitive display screen of the device and a value is assigned to each radial region. When a first touch is detected in the central region of the radial UI, an indication of a radial position responsive to a second touch on the touch sensitive screen may be determined. A value corresponding to the radial position of the second touch may then be input to an application being executed on the device. The first and second touches may be two separate finger taps, or may be sequential portions of a continuous stroke that occurs along one of the plurality of radial regions. | 1. A method for entering data to a device, the method comprising:
defining a location of a central region of a radial based user interface (UI) with a plurality of radial regions on a touch sensitive display screen of the device and assigning a value to each radial region; detecting a first touch in the central region of the radial UI; determining an indication of a radial position responsive to a second touch on the touch sensitive screen; and inputting a value to the device corresponding to the radial position of the second touch. 2. The method of claim 1, wherein the central region of the radial UI is positioned in a central location of the touch sensitive screen. 3. The method of claim 1, wherein the first touch and the second touch are two approximately simultaneous taps on the touch sensitive display screen, such that the first one of the taps occurs in the central region of the radial UI, and the second one of the taps occurs within one of the plurality of radial regions. 4. The method of claim 3, further comprising dynamically redefining the location of central region to correspond approximately to a location of a most central one of the two taps. 5. The method of claim 1, wherein the first touch and the second touch are sequential portions of a continuous stroke on the touch sensitive display screen, such that a first portion of the stroke occurs in the central region of the radial UI, and a second portion of the continuous stroke occurs along one of the plurality of radial regions. 6. The method of claim 1, wherein the first touch and the second touch are sequential portions of a continuous stroke on the touch sensitive display screen, such that a first portion of the stroke occurs in the central region of the radial UI, and a second portion of the continuous stroke occurs along one of the plurality of radial regions and then returns to the central region of the display screen. 7. The method of claim 1, wherein there are twelve radial regions corresponding to twelve hour positions of a clock face, and wherein hour positions for hours one-ten are assigned data values of one-nine and zero, respectively. 8. The method of claim 1, further comprising superimposing a template of the radial UI on the display screen. 9. The method of claim 8, wherein the template is positioned such that the central region of the template is located outside a central region of the display screen. 10. The method of claim 8, wherein the template is displayed in response to receiving a user input to the mobile device. 11. The method of claim 8, wherein the template is momentarily displayed in response to detecting the first touch. 12. The method of claim 1, wherein one or more of the radial regions is assigned a control function. 13. The method of claim 1, wherein one of the radial regions is assigned a control function that when selected causes a different value to be assigned to a portion of the radial regions. 14. A computer device, the device comprising:
a touch sensitive display screen and storage memory coupled to a processor operable to execute software instructions stored in the memory; a touch sensing mechanism for touch detection on the display screen coupled to the processor; and wherein by executing the software instructions, the processor is operable to perform a method comprising: defining a location of a central region of a radial based user interface (UI) with a plurality of radial regions on the touch sensitive display screen and assigning a value to each radial region; detecting a first touch in the central region of the radial UI; determining an indication of a radial position responsive to a second touch on the touch sensitive screen; and inputting a value to the processor corresponding to the radial position of the second touch. 15. The computer device of claim 14, wherein the central region of the radial UI is positioned in a central location of the touch sensitive screen. 16. The computer device of claim 14, wherein the first touch and the second touch are two approximately simultaneous taps on the touch sensitive display screen, such that the first one of the taps occurs in the central region of the radial UI, and the second one of the taps occurs within one of the plurality of radial regions. 17. The computer device of claim 16, further comprising dynamically redefining the location of central region to correspond approximately to a location of a most central one of the two taps. 18. The computer device of claim 14, wherein the first touch and the second touch are sequential portions of a continuous stroke on the touch sensitive display screen, such that a first portion of the stroke occurs in the central region of the radial UI, and a second portion of the continuous stroke occurs along one of the plurality of radial regions. 19. The computer device of claim 14, wherein the first touch and the second touch are sequential portions of a continuous stroke on the touch sensitive display screen, such that a first portion of the stroke occurs in the central region of the radial UI, and a second portion of the continuous stroke occurs along one of the plurality of radial regions and then returns to the central region of the display screen. 20. A non-transitory computer-readable medium storing software instructions that, when executed by a processor, perform a method for operating a computer device, the method comprising:
defining a location of a central region of a radial based user interface (UI) with a plurality of radial regions on a touch sensitive display screen of the computer device and assigning a value to each radial region; detecting a first touch in the central region of the radial UI; determining an indication of a radial position responsive to a second touch on the touch sensitive screen; and inputting a value to the computer device corresponding to the radial position of the second touch. | A radial based user interface (UI) is provided for entering data into a computer device. The radial based UI has a central region with a plurality of radial regions. A location for the central region is defined on a touch sensitive display screen of the device and a value is assigned to each radial region. When a first touch is detected in the central region of the radial UI, an indication of a radial position responsive to a second touch on the touch sensitive screen may be determined. A value corresponding to the radial position of the second touch may then be input to an application being executed on the device. The first and second touches may be two separate finger taps, or may be sequential portions of a continuous stroke that occurs along one of the plurality of radial regions.1. A method for entering data to a device, the method comprising:
defining a location of a central region of a radial based user interface (UI) with a plurality of radial regions on a touch sensitive display screen of the device and assigning a value to each radial region; detecting a first touch in the central region of the radial UI; determining an indication of a radial position responsive to a second touch on the touch sensitive screen; and inputting a value to the device corresponding to the radial position of the second touch. 2. The method of claim 1, wherein the central region of the radial UI is positioned in a central location of the touch sensitive screen. 3. The method of claim 1, wherein the first touch and the second touch are two approximately simultaneous taps on the touch sensitive display screen, such that the first one of the taps occurs in the central region of the radial UI, and the second one of the taps occurs within one of the plurality of radial regions. 4. The method of claim 3, further comprising dynamically redefining the location of central region to correspond approximately to a location of a most central one of the two taps. 5. The method of claim 1, wherein the first touch and the second touch are sequential portions of a continuous stroke on the touch sensitive display screen, such that a first portion of the stroke occurs in the central region of the radial UI, and a second portion of the continuous stroke occurs along one of the plurality of radial regions. 6. The method of claim 1, wherein the first touch and the second touch are sequential portions of a continuous stroke on the touch sensitive display screen, such that a first portion of the stroke occurs in the central region of the radial UI, and a second portion of the continuous stroke occurs along one of the plurality of radial regions and then returns to the central region of the display screen. 7. The method of claim 1, wherein there are twelve radial regions corresponding to twelve hour positions of a clock face, and wherein hour positions for hours one-ten are assigned data values of one-nine and zero, respectively. 8. The method of claim 1, further comprising superimposing a template of the radial UI on the display screen. 9. The method of claim 8, wherein the template is positioned such that the central region of the template is located outside a central region of the display screen. 10. The method of claim 8, wherein the template is displayed in response to receiving a user input to the mobile device. 11. The method of claim 8, wherein the template is momentarily displayed in response to detecting the first touch. 12. The method of claim 1, wherein one or more of the radial regions is assigned a control function. 13. The method of claim 1, wherein one of the radial regions is assigned a control function that when selected causes a different value to be assigned to a portion of the radial regions. 14. A computer device, the device comprising:
a touch sensitive display screen and storage memory coupled to a processor operable to execute software instructions stored in the memory; a touch sensing mechanism for touch detection on the display screen coupled to the processor; and wherein by executing the software instructions, the processor is operable to perform a method comprising: defining a location of a central region of a radial based user interface (UI) with a plurality of radial regions on the touch sensitive display screen and assigning a value to each radial region; detecting a first touch in the central region of the radial UI; determining an indication of a radial position responsive to a second touch on the touch sensitive screen; and inputting a value to the processor corresponding to the radial position of the second touch. 15. The computer device of claim 14, wherein the central region of the radial UI is positioned in a central location of the touch sensitive screen. 16. The computer device of claim 14, wherein the first touch and the second touch are two approximately simultaneous taps on the touch sensitive display screen, such that the first one of the taps occurs in the central region of the radial UI, and the second one of the taps occurs within one of the plurality of radial regions. 17. The computer device of claim 16, further comprising dynamically redefining the location of central region to correspond approximately to a location of a most central one of the two taps. 18. The computer device of claim 14, wherein the first touch and the second touch are sequential portions of a continuous stroke on the touch sensitive display screen, such that a first portion of the stroke occurs in the central region of the radial UI, and a second portion of the continuous stroke occurs along one of the plurality of radial regions. 19. The computer device of claim 14, wherein the first touch and the second touch are sequential portions of a continuous stroke on the touch sensitive display screen, such that a first portion of the stroke occurs in the central region of the radial UI, and a second portion of the continuous stroke occurs along one of the plurality of radial regions and then returns to the central region of the display screen. 20. A non-transitory computer-readable medium storing software instructions that, when executed by a processor, perform a method for operating a computer device, the method comprising:
defining a location of a central region of a radial based user interface (UI) with a plurality of radial regions on a touch sensitive display screen of the computer device and assigning a value to each radial region; detecting a first touch in the central region of the radial UI; determining an indication of a radial position responsive to a second touch on the touch sensitive screen; and inputting a value to the computer device corresponding to the radial position of the second touch. | 2,100 |
6,114 | 6,114 | 16,654,275 | 2,145 | Various embodiments of the present disclosure are directed to field device maintenance request management associated with one or more faulty field devices. Non-limiting example systems in which embodiments function include control system in communication with a plurality of field devices and associated sensors, and at least one client device. Embodiments include apparatuses, computer program products, and methods for retrieving monitoring data, identifying faults, retrieving request handling information, generating a corresponding field device maintenance request, and transmitting the maintenance request to one or more client devices, as well as optionally setting one or more operational modes for field devices, and/or processing a response from the client device. Other embodiments receive a field device maintenance request, extract request handling information, various particular interfaces for efficient analysis, and optionally include interface elements for providing and causing storage of a response to the request. | 1. An apparatus for field device maintenance request management, the apparatus comprising at least one processor and at least one memory, the at least one memory having computer-coded instructions thereon, the computer-coded instructions configured to, in execution with the at least one processor, configure the system to:
receive, from a control system in response to a determination by the control system that field device monitoring data associated with a field device indicates deficient operations of the field device, a field device maintenance request associated with the field device that comprises an environmental condition data object indicating a hazardous environment condition associated with the field device; extract request handling information from the field device maintenance request; render, to a display, a request analysis interface comprising a request selection interface element associated with the field device maintenance request, the request selection interface element visually configured based on at least a request priority identifier associated with the field device maintenance request, and the request selection interface element rendered based on at least the environmental condition data object indicating the hazardous environment condition associated with the field device; receive user interaction data associated with the request analysis interface; parse the user interaction data to determine the user interaction data indicates selection of the request selection interface element associated with the field device maintenance request; determine a user location; generate a device navigation path from the user location to a field device location data object associated with the field device maintenance request; and render, to the display, a navigation interface comprising the device navigation path. 2. The apparatus of claim 1, wherein the field device maintenance request is one of a plurality of field device maintenance requests, and wherein the apparatus is configured to render, to the display, the request analysis interface comprising an additional request interface element for each additional field device maintenance request in the plurality of field device maintenance requests. 3. The apparatus of claim 1, wherein the request handling information additionally comprises one or more of (1) a request priority identifier, (2) a request type identifier, (3) a request description data, (4) device identification data, (5) a device expert data object, (6) a device service history data object, or (7) the field device location data object. 4. The apparatus of claim 3, wherein the request selection interface element is rendered comprising a request information interface element set, each request information interface element in the request information interface element set associated with a portion of the request handling information. 5. The apparatus of claim 3, wherein the request selection interface element comprises at least one interface element comprising at least one visual property configured based on a portion of the request handling information. 6. The apparatus of claim 1, further configured to:
render, to the display, in response to the determination the user interaction data indicates selection of the request selection interface element, a selected request detail interface associated with the navigation interface, wherein the selected request detail interface comprises at least one interface element representing at least a portion of the request handling information. 7. The apparatus of claim 1, further configured to:
render a request completion interface comprising a completion interface element set configured to receive request completion information in response to user interaction with the interface elements of the completion interface element set; receive completion user interaction data associated with the request completion interface; parse the completion user interaction data to determine the completion user interaction data indicates submission of the request completion information; and transmit, to the control system, a request completion response associated with the field device maintenance request, the request completion response comprising the request completion information, wherein the request completion response is configured to cause the control system to include the request completion information in a device service history data object associated with the field device. 8. A computer-implemented method for field device maintenance request management, the method comprising:
receiving, from a control system in response to a determination by the control system that field device monitoring data associated with a field device indicates deficient operations of the field device, a field device maintenance request associated with the field device that comprises an environmental condition data object indicating a hazardous environment condition associated with the field device; extracting request handling information from the field device maintenance request; rendering, to a display, a request analysis interface comprising a request selection interface element associated with the field device maintenance request, the request selection interface element visually configured based on at least a request priority identifier associated with the field device maintenance request, and the request selection interface element rendered based on at least the environmental condition data object indicating the hazardous environment condition associated with the field device; receiving user interaction data associated with the request analysis interface; parsing the user interaction data to determine the user interaction data indicates selection of the request selection interface element associated with the field device maintenance request; determining a user location; generating a device navigation path from the user location to a field device location data object associated with the field device maintenance request; and rendering, to the display, a navigation interface comprising the device navigation path. 9. The computer-implemented method of claim 8, wherein the field device maintenance request is one of a plurality of field device maintenance requests, and wherein rendering the request analysis interface further comprises rendering, to the display, the request analysis interface comprising an additional request interface element for each additional field device maintenance request in the plurality of field device maintenance requests. 10. The computer-implemented method of claim 8, wherein the request handling information additionally comprises one or more of (1) a request priority identifier, (2) a request type identifier, (3) a request description data, (4) device identification data, (5) a device expert data object, (6) a device service history data object, or (7) the field device location data object. 11. The computer-implemented method of claim 10, wherein the request selection interface element is rendered comprising a request information interface element set, each request information interface element in the request information interface element set associated with a portion of the request handling information. 12. The computer-implemented method of claim 10, wherein the request selection interface element comprises at least one interface element comprising at least one visual property configured based on a portion of the request handling information. 13. The computer-implemented method of claim 8, further comprising:
rendering, to the display, in response to the determination the user interaction data indicates selection of the request selection interface element, a selected request detail interface associated with the navigation interface, wherein the selected request detail interface comprises at least one interface element representing at least a portion of the request handling information. 14. The computer-implemented method of claim 8, further comprising:
rendering a request completion interface comprising a completion interface element set configured to receive request completion information in response to user interaction with the interface elements of the completion interface element set; receiving completion user interaction data associated with the request completion interface; parsing the completion user interaction data to determine the completion user interaction data indicates submission of the request completion information; and transmitting, to the control system, a request completion response associated with the field device maintenance request, the request completion response comprising the request completion information, wherein the request completion response is configured for causing the control system to include the request completion information in a device service history data object associated with the field device. 15. A computer program product for field device maintenance request management, the computer program product comprising at least one non-transitory computer-readable computer storage medium having computer program instructions thereon, the computer program instructions, in execution with at least one processor, configured to:
receive, from a control system in response to a determination by the control system that field device monitoring data associated with a field device indicates deficient operations of the field device, a field device maintenance request associated with the field device that comprises an environmental condition data object indicating a hazardous environment condition associated with the field device; extract request handling information from the field device maintenance request; render, to a display, a request analysis interface comprising a request selection interface element associated with the field device maintenance request, the request selection interface element visually configured based on at least a request priority identifier associated with the field device maintenance request, and the request selection interface element rendered based on at least the environmental condition data object indicating the hazardous environment condition associated with the field device receive user interaction data associated with the request analysis interface; parse the user interaction data to determine the user interaction data indicates selection of the request selection interface element associated with the field device maintenance request; determine a user location; generate a device navigation path from the user location to a field device location data object associated with the field device maintenance request; and render, to the display, a navigation interface comprising the device navigation path. 16. (canceled) 17. The computer program product of claim 15, wherein the request handling information additionally comprises one or more of (1) a request priority identifier, (2) a request type identifier, (3) a request description data, (4) device identification data, (5) a device expert data object, (6) a device service history data object, or (7) the field device location data object. 18. The computer program product of claim 17, wherein the request selection interface element is rendered comprising a request information interface element set, each request information interface element in the request information interface element set associated with a portion of the request handling information. 19. The computer program product of claim 17, wherein the request selection interface element comprises at least one interface element comprising at least one visual property configured based on a portion of the request handling information. 20. The computer program product of claim 17, further configured to:
render, to the display, in response to the determination the user interaction data indicates selection of the request selection interface element, a selected request detail interface associated with the navigation interface, wherein the selected request detail interface comprises at least one interface element representing at least a portion of the request handling information. 21. The computer program product of claim 17, further configured to:
render a request completion interface comprising a completion interface element set configured to receive request completion information in response to user interaction with the interface elements of the completion interface element set; receive completion user interaction data associated with the request completion interface; parse the completion user interaction data to determine the completion user interaction data indicates submission of the request completion information; and transmit, to the control system, a request completion response associated with the field device maintenance request, the request completion response comprising the request completion information, wherein the request completion response is configured to cause the control system to include the request completion information in a device service history data object associated with the field device. 22-54. (canceled) | Various embodiments of the present disclosure are directed to field device maintenance request management associated with one or more faulty field devices. Non-limiting example systems in which embodiments function include control system in communication with a plurality of field devices and associated sensors, and at least one client device. Embodiments include apparatuses, computer program products, and methods for retrieving monitoring data, identifying faults, retrieving request handling information, generating a corresponding field device maintenance request, and transmitting the maintenance request to one or more client devices, as well as optionally setting one or more operational modes for field devices, and/or processing a response from the client device. Other embodiments receive a field device maintenance request, extract request handling information, various particular interfaces for efficient analysis, and optionally include interface elements for providing and causing storage of a response to the request.1. An apparatus for field device maintenance request management, the apparatus comprising at least one processor and at least one memory, the at least one memory having computer-coded instructions thereon, the computer-coded instructions configured to, in execution with the at least one processor, configure the system to:
receive, from a control system in response to a determination by the control system that field device monitoring data associated with a field device indicates deficient operations of the field device, a field device maintenance request associated with the field device that comprises an environmental condition data object indicating a hazardous environment condition associated with the field device; extract request handling information from the field device maintenance request; render, to a display, a request analysis interface comprising a request selection interface element associated with the field device maintenance request, the request selection interface element visually configured based on at least a request priority identifier associated with the field device maintenance request, and the request selection interface element rendered based on at least the environmental condition data object indicating the hazardous environment condition associated with the field device; receive user interaction data associated with the request analysis interface; parse the user interaction data to determine the user interaction data indicates selection of the request selection interface element associated with the field device maintenance request; determine a user location; generate a device navigation path from the user location to a field device location data object associated with the field device maintenance request; and render, to the display, a navigation interface comprising the device navigation path. 2. The apparatus of claim 1, wherein the field device maintenance request is one of a plurality of field device maintenance requests, and wherein the apparatus is configured to render, to the display, the request analysis interface comprising an additional request interface element for each additional field device maintenance request in the plurality of field device maintenance requests. 3. The apparatus of claim 1, wherein the request handling information additionally comprises one or more of (1) a request priority identifier, (2) a request type identifier, (3) a request description data, (4) device identification data, (5) a device expert data object, (6) a device service history data object, or (7) the field device location data object. 4. The apparatus of claim 3, wherein the request selection interface element is rendered comprising a request information interface element set, each request information interface element in the request information interface element set associated with a portion of the request handling information. 5. The apparatus of claim 3, wherein the request selection interface element comprises at least one interface element comprising at least one visual property configured based on a portion of the request handling information. 6. The apparatus of claim 1, further configured to:
render, to the display, in response to the determination the user interaction data indicates selection of the request selection interface element, a selected request detail interface associated with the navigation interface, wherein the selected request detail interface comprises at least one interface element representing at least a portion of the request handling information. 7. The apparatus of claim 1, further configured to:
render a request completion interface comprising a completion interface element set configured to receive request completion information in response to user interaction with the interface elements of the completion interface element set; receive completion user interaction data associated with the request completion interface; parse the completion user interaction data to determine the completion user interaction data indicates submission of the request completion information; and transmit, to the control system, a request completion response associated with the field device maintenance request, the request completion response comprising the request completion information, wherein the request completion response is configured to cause the control system to include the request completion information in a device service history data object associated with the field device. 8. A computer-implemented method for field device maintenance request management, the method comprising:
receiving, from a control system in response to a determination by the control system that field device monitoring data associated with a field device indicates deficient operations of the field device, a field device maintenance request associated with the field device that comprises an environmental condition data object indicating a hazardous environment condition associated with the field device; extracting request handling information from the field device maintenance request; rendering, to a display, a request analysis interface comprising a request selection interface element associated with the field device maintenance request, the request selection interface element visually configured based on at least a request priority identifier associated with the field device maintenance request, and the request selection interface element rendered based on at least the environmental condition data object indicating the hazardous environment condition associated with the field device; receiving user interaction data associated with the request analysis interface; parsing the user interaction data to determine the user interaction data indicates selection of the request selection interface element associated with the field device maintenance request; determining a user location; generating a device navigation path from the user location to a field device location data object associated with the field device maintenance request; and rendering, to the display, a navigation interface comprising the device navigation path. 9. The computer-implemented method of claim 8, wherein the field device maintenance request is one of a plurality of field device maintenance requests, and wherein rendering the request analysis interface further comprises rendering, to the display, the request analysis interface comprising an additional request interface element for each additional field device maintenance request in the plurality of field device maintenance requests. 10. The computer-implemented method of claim 8, wherein the request handling information additionally comprises one or more of (1) a request priority identifier, (2) a request type identifier, (3) a request description data, (4) device identification data, (5) a device expert data object, (6) a device service history data object, or (7) the field device location data object. 11. The computer-implemented method of claim 10, wherein the request selection interface element is rendered comprising a request information interface element set, each request information interface element in the request information interface element set associated with a portion of the request handling information. 12. The computer-implemented method of claim 10, wherein the request selection interface element comprises at least one interface element comprising at least one visual property configured based on a portion of the request handling information. 13. The computer-implemented method of claim 8, further comprising:
rendering, to the display, in response to the determination the user interaction data indicates selection of the request selection interface element, a selected request detail interface associated with the navigation interface, wherein the selected request detail interface comprises at least one interface element representing at least a portion of the request handling information. 14. The computer-implemented method of claim 8, further comprising:
rendering a request completion interface comprising a completion interface element set configured to receive request completion information in response to user interaction with the interface elements of the completion interface element set; receiving completion user interaction data associated with the request completion interface; parsing the completion user interaction data to determine the completion user interaction data indicates submission of the request completion information; and transmitting, to the control system, a request completion response associated with the field device maintenance request, the request completion response comprising the request completion information, wherein the request completion response is configured for causing the control system to include the request completion information in a device service history data object associated with the field device. 15. A computer program product for field device maintenance request management, the computer program product comprising at least one non-transitory computer-readable computer storage medium having computer program instructions thereon, the computer program instructions, in execution with at least one processor, configured to:
receive, from a control system in response to a determination by the control system that field device monitoring data associated with a field device indicates deficient operations of the field device, a field device maintenance request associated with the field device that comprises an environmental condition data object indicating a hazardous environment condition associated with the field device; extract request handling information from the field device maintenance request; render, to a display, a request analysis interface comprising a request selection interface element associated with the field device maintenance request, the request selection interface element visually configured based on at least a request priority identifier associated with the field device maintenance request, and the request selection interface element rendered based on at least the environmental condition data object indicating the hazardous environment condition associated with the field device receive user interaction data associated with the request analysis interface; parse the user interaction data to determine the user interaction data indicates selection of the request selection interface element associated with the field device maintenance request; determine a user location; generate a device navigation path from the user location to a field device location data object associated with the field device maintenance request; and render, to the display, a navigation interface comprising the device navigation path. 16. (canceled) 17. The computer program product of claim 15, wherein the request handling information additionally comprises one or more of (1) a request priority identifier, (2) a request type identifier, (3) a request description data, (4) device identification data, (5) a device expert data object, (6) a device service history data object, or (7) the field device location data object. 18. The computer program product of claim 17, wherein the request selection interface element is rendered comprising a request information interface element set, each request information interface element in the request information interface element set associated with a portion of the request handling information. 19. The computer program product of claim 17, wherein the request selection interface element comprises at least one interface element comprising at least one visual property configured based on a portion of the request handling information. 20. The computer program product of claim 17, further configured to:
render, to the display, in response to the determination the user interaction data indicates selection of the request selection interface element, a selected request detail interface associated with the navigation interface, wherein the selected request detail interface comprises at least one interface element representing at least a portion of the request handling information. 21. The computer program product of claim 17, further configured to:
render a request completion interface comprising a completion interface element set configured to receive request completion information in response to user interaction with the interface elements of the completion interface element set; receive completion user interaction data associated with the request completion interface; parse the completion user interaction data to determine the completion user interaction data indicates submission of the request completion information; and transmit, to the control system, a request completion response associated with the field device maintenance request, the request completion response comprising the request completion information, wherein the request completion response is configured to cause the control system to include the request completion information in a device service history data object associated with the field device. 22-54. (canceled) | 2,100 |
6,115 | 6,115 | 14,396,019 | 2,163 | Various systems and methods are disclosed for making and using an anonymized database for an industrial enterprise, such as oilfield operations. Providing statistical performance indicators for groupings of an activity in the oilfield allow for the information in confidential data sets to be shared without compromising the confidentiality of any one data entry. Comparisons may be made between or among oilfields with differing technologies, differing rig configurations, or even different crews when sufficient data are available. | 1. A method of creating an anonymized database of oilfield operations, the method comprising:
defining a set of performance operations to be run against raw activity data to form performance indicators for each activity in an oilfield represented in the set; aggregating a plurality of performance indicators to generate statistical indictors for each activity in the oilfield in the set; storing the statistical indicators for each activity in the oilfield in the set on an accessible information storage medium. 2. The method of claim 1, wherein the raw activity data include time-based data of oilfield operations. 3. The method of claim 1, further comprising:
generating a performance index for each activity by comparing a respective performance indicator to a benchmark value. 4. The method of claim 3, further comprising:
generating a weighted performance index average by weighting each activity for a project and combining together the performance index for each activity in the project. 5. The method of claim 4, further comprising:
assigning a weight for each activity. 6. The method of claim 4, wherein the weighted performance index average includes the activities of time to make up and lay down bottom hole assembly, total connection time, rate of installing drill pipe singles, rate of installing casing stands, rate of casing joints, time to test blow out preventer, time to run riser and blow out preventer, and time to pull riser and blow out preventer. 7. The method of claim 4, wherein the performance index average includes a user-defined activity. 8. The method of claim 1, wherein said each activity in the set includes one or more activities taken from the group consisting of in-slips time, off bottom to in-slips time, on bottom to on bottom time, drill pipe trip time inside casing, drill pipe trip to in-slips time, drill pipe singles trip time inside casing, and drill pipe trip rate. 9. A database of anonymized data for a plurality of activities for oilfield operations, the database comprising:
a plurality of entries organized about statistical indicators for each activity for the oilfield operations, wherein the plurality of entries are subdivided with sets of indices used to compare related entries; and a plurality of benchmark values, one for each activity for each of the indices. 10. The database of claim 9, wherein the statistical indicators are one or more from the group consisting of median, top quartile, bottom quartile, minimum and maximum indices. 11. The database of claim 9, wherein the indices are a plurality from the group consisting of geo-location, equipment, technology, physical parameters, equipment configuration, crew configuration, and shift. 12. A method of using a database of anonymized data of a plurality of activities for oilfield operations, the method comprising:
selecting at least an indication of one or more indices within the database; selecting at least an indication of one or more activities of the oilfield operations within the database; receiving a plurality of statistical indicators associated with the one or more indices and the one or more activities of the oilfield operations. 13. The method of claim 12, the method further comprising:
selecting one or more indices for comparison based on said selecting at least the indication of the one or more indices within the database and based on said selecting at least the indication of the one or more activities within the database; and receiving a ranking of the entries associated with the one or more indices selected for the comparison based on the associated statistical indicators. 14. A method of generating custom entries in an anonymized database of activity data for oilfield operations, where each activity is defined from a start time to an end time of actions associated with the each activity, the method comprising:
defining a custom activity of the oilfield operations as a constrained version of a base activity in the anonymized database, with a starting time at or after the start time of the base activity and ending after the starting time and ending before or at the end time of the base activity; selecting at least an indication of one or more indices within the database; storing the statistical indicators for the custom activity of the oilfield operations on an accessible storage medium; and receiving the statistical indicators for the custom activity of the oilfield operations. 15. The method of claim 14, further comprising:
selecting one or more indices for comparison based on said selecting at least the indication of the one or more indices within the database and based on the custom activity of the oilfield operations; and receiving a ranking of the entries associated with the one or more indices selected for the comparison based on the associated statistical indicators. 16. The method of claim 14, wherein the raw activity data include time-based data of drilling operations. 17. The method of claim 14, further comprising:
generating a performance index for each activity of the oilfield operations by comparing a respective performance indicator to a benchmark value. 18. The method of claim 17, further comprising:
generating a weighted performance index average by weighting each activity for a project and combining together the performance index for each activity in the project. 19. The method of claim 18, further comprising:
assigning a weight for each activity. 20. The method of claim 18, wherein the weighted performance index average includes the activities of time to make up and lay down bottom hole assembly, total connection time, rate of installing drill pipe singles, rate of installing casing stands, rate of casing joints, time to test blow out preventer, time to run riser and blow out preventer, and time to pull riser and blow out preventer. 21. The method of claim 14, wherein said each activity includes one or more activities taken from the group consisting of in-slips time, off bottom to in-slips time, on bottom to on bottom time, drill pipe trip time inside casing, drill pipe trip to in-slips time, drill pipe singles trip time inside casing, and drill pipe trip in stands rate. | Various systems and methods are disclosed for making and using an anonymized database for an industrial enterprise, such as oilfield operations. Providing statistical performance indicators for groupings of an activity in the oilfield allow for the information in confidential data sets to be shared without compromising the confidentiality of any one data entry. Comparisons may be made between or among oilfields with differing technologies, differing rig configurations, or even different crews when sufficient data are available.1. A method of creating an anonymized database of oilfield operations, the method comprising:
defining a set of performance operations to be run against raw activity data to form performance indicators for each activity in an oilfield represented in the set; aggregating a plurality of performance indicators to generate statistical indictors for each activity in the oilfield in the set; storing the statistical indicators for each activity in the oilfield in the set on an accessible information storage medium. 2. The method of claim 1, wherein the raw activity data include time-based data of oilfield operations. 3. The method of claim 1, further comprising:
generating a performance index for each activity by comparing a respective performance indicator to a benchmark value. 4. The method of claim 3, further comprising:
generating a weighted performance index average by weighting each activity for a project and combining together the performance index for each activity in the project. 5. The method of claim 4, further comprising:
assigning a weight for each activity. 6. The method of claim 4, wherein the weighted performance index average includes the activities of time to make up and lay down bottom hole assembly, total connection time, rate of installing drill pipe singles, rate of installing casing stands, rate of casing joints, time to test blow out preventer, time to run riser and blow out preventer, and time to pull riser and blow out preventer. 7. The method of claim 4, wherein the performance index average includes a user-defined activity. 8. The method of claim 1, wherein said each activity in the set includes one or more activities taken from the group consisting of in-slips time, off bottom to in-slips time, on bottom to on bottom time, drill pipe trip time inside casing, drill pipe trip to in-slips time, drill pipe singles trip time inside casing, and drill pipe trip rate. 9. A database of anonymized data for a plurality of activities for oilfield operations, the database comprising:
a plurality of entries organized about statistical indicators for each activity for the oilfield operations, wherein the plurality of entries are subdivided with sets of indices used to compare related entries; and a plurality of benchmark values, one for each activity for each of the indices. 10. The database of claim 9, wherein the statistical indicators are one or more from the group consisting of median, top quartile, bottom quartile, minimum and maximum indices. 11. The database of claim 9, wherein the indices are a plurality from the group consisting of geo-location, equipment, technology, physical parameters, equipment configuration, crew configuration, and shift. 12. A method of using a database of anonymized data of a plurality of activities for oilfield operations, the method comprising:
selecting at least an indication of one or more indices within the database; selecting at least an indication of one or more activities of the oilfield operations within the database; receiving a plurality of statistical indicators associated with the one or more indices and the one or more activities of the oilfield operations. 13. The method of claim 12, the method further comprising:
selecting one or more indices for comparison based on said selecting at least the indication of the one or more indices within the database and based on said selecting at least the indication of the one or more activities within the database; and receiving a ranking of the entries associated with the one or more indices selected for the comparison based on the associated statistical indicators. 14. A method of generating custom entries in an anonymized database of activity data for oilfield operations, where each activity is defined from a start time to an end time of actions associated with the each activity, the method comprising:
defining a custom activity of the oilfield operations as a constrained version of a base activity in the anonymized database, with a starting time at or after the start time of the base activity and ending after the starting time and ending before or at the end time of the base activity; selecting at least an indication of one or more indices within the database; storing the statistical indicators for the custom activity of the oilfield operations on an accessible storage medium; and receiving the statistical indicators for the custom activity of the oilfield operations. 15. The method of claim 14, further comprising:
selecting one or more indices for comparison based on said selecting at least the indication of the one or more indices within the database and based on the custom activity of the oilfield operations; and receiving a ranking of the entries associated with the one or more indices selected for the comparison based on the associated statistical indicators. 16. The method of claim 14, wherein the raw activity data include time-based data of drilling operations. 17. The method of claim 14, further comprising:
generating a performance index for each activity of the oilfield operations by comparing a respective performance indicator to a benchmark value. 18. The method of claim 17, further comprising:
generating a weighted performance index average by weighting each activity for a project and combining together the performance index for each activity in the project. 19. The method of claim 18, further comprising:
assigning a weight for each activity. 20. The method of claim 18, wherein the weighted performance index average includes the activities of time to make up and lay down bottom hole assembly, total connection time, rate of installing drill pipe singles, rate of installing casing stands, rate of casing joints, time to test blow out preventer, time to run riser and blow out preventer, and time to pull riser and blow out preventer. 21. The method of claim 14, wherein said each activity includes one or more activities taken from the group consisting of in-slips time, off bottom to in-slips time, on bottom to on bottom time, drill pipe trip time inside casing, drill pipe trip to in-slips time, drill pipe singles trip time inside casing, and drill pipe trip in stands rate. | 2,100 |
6,116 | 6,116 | 14,189,863 | 2,147 | Systems and methods for continuous processing of unstructured data streams are provided. Information may be stored in memory regarding a query, including associated search results and statistics derived at an identified time. After the identified time, unstructured data may be received from a plurality of streams over a communication network. A full-text search may be conducted on the received unstructured data based on the query to yield one or more matches. The stored statistics associated with the query may be retrieved from memory and updated based on the search results of the unstructured data received at the subsequent time. The updated statistics may then be stored in memory for retrieval at a subsequent time. | 1. A method for continuous processing of unstructured data streams, the method comprising:
storing information in memory regarding a query, wherein the query is associated with search results and associated statistics derived at an identified time; receiving unstructured data from a plurality of streams over a communication network, wherein the unstructured data is received after the identified time; executing instructions stored in memory, wherein execution of the instructions by a processor:
conducts a full-text search of the received unstructured data based on the query, wherein the conducted search yields one or more matches,
retrieves the statistics that were derived at the identified time, and
updates the associated statistics based on search results of the unstructured data received at the subsequent time,
wherein the updated statistics are stored in memory for retrieval at a subsequent time. 2. The method of claim 1, wherein the query identifies a sentiment or context of interest. 3. The method of claim 1, wherein the query identifies one or more keywords of interest. 4. The method of claim 3, further comprising indexing the received unstructured data based on the keywords of interest. 5. The method of claim 1, wherein the plurality of streams continuously provide unstructured data, and wherein the query is continuously applied to the unstructured data in real-time. 6. The method of claim 1, wherein the query identifies a period of time of interest to a user. 7. The method of claim 1, wherein the query is associated with a predetermined period of interest. 8. The method of claim 1, wherein the query further specifies a metric of interest. 9. A system for continuous processing of unstructured data streams, the system comprising:
memory for storing information regarding a query, wherein the query is associated with search results and associated statistics derived at an identified time; a communication interface for receiving unstructured data from a plurality of streams over a communication network, wherein the unstructured data is received after the identified time; and a processor for executing instructions stored in memory, wherein execution of the instructions by a processor:
conducts a full-text search of the received unstructured data based on the query, wherein the conducted search yields one or more matches,
retrieves the statistics that were derived at the identified time,
updates the associated statistics based on search results of the unstructured data received at the subsequent time,
wherein the updated statistics are stored in memory for retrieval at a subsequent time. 10. The system of claim 9, wherein the query identifies a sentiment or context of interest. 11. The system of claim 9, wherein the query identifies one or more keywords of interest. 12. The system of claim 11, further comprising indexing the received unstructured data based on the keywords of interest. 13. The system of claim 9, wherein the plurality of streams continuously provide unstructured data, and wherein the query is continuously applied to the unstructured data in real-time. 14. The system of claim 9, wherein the query identifies a period of time of interest to a user. 15. The system of claim 9, wherein the query is associated with a predetermined period of interest. 16. The system of claim 9, wherein the query further specifies a metric of interest. 17. A non-transitory computer-readable storage medium, having embodied thereon a program executable by a processor to perform a method for continuous processing of unstructured data streams, the method comprising:
storing information in memory regarding a query, wherein the query is associated with search results and associated statistics derived at an identified time; receiving unstructured data from a plurality of streams over a communication network, wherein the unstructured data is received after the identified time; executing instructions stored in memory, wherein execution of the instructions by a processor:
conducts a full-text search of the received unstructured data based on the query, wherein the conducted search yields one or more matches,
retrieves the statistics that were derived at the identified time, and
updates the associated statistics based on search results of the unstructured data received at the subsequent time,
wherein the updated statistics are stored in memory for retrieval at a subsequent time. | Systems and methods for continuous processing of unstructured data streams are provided. Information may be stored in memory regarding a query, including associated search results and statistics derived at an identified time. After the identified time, unstructured data may be received from a plurality of streams over a communication network. A full-text search may be conducted on the received unstructured data based on the query to yield one or more matches. The stored statistics associated with the query may be retrieved from memory and updated based on the search results of the unstructured data received at the subsequent time. The updated statistics may then be stored in memory for retrieval at a subsequent time.1. A method for continuous processing of unstructured data streams, the method comprising:
storing information in memory regarding a query, wherein the query is associated with search results and associated statistics derived at an identified time; receiving unstructured data from a plurality of streams over a communication network, wherein the unstructured data is received after the identified time; executing instructions stored in memory, wherein execution of the instructions by a processor:
conducts a full-text search of the received unstructured data based on the query, wherein the conducted search yields one or more matches,
retrieves the statistics that were derived at the identified time, and
updates the associated statistics based on search results of the unstructured data received at the subsequent time,
wherein the updated statistics are stored in memory for retrieval at a subsequent time. 2. The method of claim 1, wherein the query identifies a sentiment or context of interest. 3. The method of claim 1, wherein the query identifies one or more keywords of interest. 4. The method of claim 3, further comprising indexing the received unstructured data based on the keywords of interest. 5. The method of claim 1, wherein the plurality of streams continuously provide unstructured data, and wherein the query is continuously applied to the unstructured data in real-time. 6. The method of claim 1, wherein the query identifies a period of time of interest to a user. 7. The method of claim 1, wherein the query is associated with a predetermined period of interest. 8. The method of claim 1, wherein the query further specifies a metric of interest. 9. A system for continuous processing of unstructured data streams, the system comprising:
memory for storing information regarding a query, wherein the query is associated with search results and associated statistics derived at an identified time; a communication interface for receiving unstructured data from a plurality of streams over a communication network, wherein the unstructured data is received after the identified time; and a processor for executing instructions stored in memory, wherein execution of the instructions by a processor:
conducts a full-text search of the received unstructured data based on the query, wherein the conducted search yields one or more matches,
retrieves the statistics that were derived at the identified time,
updates the associated statistics based on search results of the unstructured data received at the subsequent time,
wherein the updated statistics are stored in memory for retrieval at a subsequent time. 10. The system of claim 9, wherein the query identifies a sentiment or context of interest. 11. The system of claim 9, wherein the query identifies one or more keywords of interest. 12. The system of claim 11, further comprising indexing the received unstructured data based on the keywords of interest. 13. The system of claim 9, wherein the plurality of streams continuously provide unstructured data, and wherein the query is continuously applied to the unstructured data in real-time. 14. The system of claim 9, wherein the query identifies a period of time of interest to a user. 15. The system of claim 9, wherein the query is associated with a predetermined period of interest. 16. The system of claim 9, wherein the query further specifies a metric of interest. 17. A non-transitory computer-readable storage medium, having embodied thereon a program executable by a processor to perform a method for continuous processing of unstructured data streams, the method comprising:
storing information in memory regarding a query, wherein the query is associated with search results and associated statistics derived at an identified time; receiving unstructured data from a plurality of streams over a communication network, wherein the unstructured data is received after the identified time; executing instructions stored in memory, wherein execution of the instructions by a processor:
conducts a full-text search of the received unstructured data based on the query, wherein the conducted search yields one or more matches,
retrieves the statistics that were derived at the identified time, and
updates the associated statistics based on search results of the unstructured data received at the subsequent time,
wherein the updated statistics are stored in memory for retrieval at a subsequent time. | 2,100 |
6,117 | 6,117 | 12,806,119 | 2,164 | The present invention provides a method and system and software that allow users to readily access online legal research tools, while using other applications, such as word processors. One exemplary computer-implemented system provide an add-on software framework that integrates into a host word-processing application on a client access device. The add-on software framework allows users to select from an expandable listing of one or more web applications on a web server, with each of the web application capable of controlling operation of the host word processing application. The web applications facilitate extraction and access to information from the information-retrieval services as well as secondary source reference texts and incorporation of the information in the document or in metadata associated with the document. The present invention allows seamless user experience across host application, such as traditional word processing applications, and Information Service Providers (ISP), such as legal research database and searching tools, and Secondary sources, such as reference texts related to primary source documents, e.g., case law and statues, associated with the ISP service. | 1. A computer useable medium having a set of executable code for enabling electronic communications between a word processing program of a client access device and an information services provider system (ISP), the set of executable code comprising:
(a) a first set of computer program code for operatively connecting to the word processing program; (b) a second set of computer program code for operatively connecting to the information services provider system; (c) a third set of computer program code for accepting a user search request initiated by a user of the word processing program; (d) a fourth set of computer program code for transmitting the user search request to the information services provider system; (e) a fifth set of computer program code for receiving a set of search results, the set of search results comprising a set of referencing text results; and (f) a sixth set of computer program code for displaying within the word processing program at least a portion of the set of referencing text results. 2. The computer useable medium of claim 1 wherein the third set of computer program code comprises code for identifying a highlighted portion of text within the word processing program. 3. The computer useable medium of claim 1 wherein the word processing program is one of Microsoft Word, and Corel WordPerfect. 4. The computer useable medium of claim 1 wherein the set of referencing text results comprises case law. 5. The computer useable medium of claim 1 wherein the set of search results comprises a primary set of case law results derived from an ISP case law database. 6. The computer useable medium of claim 5 wherein sixth set of computer program code further comprises computer program code for combining the set of referencing text results and the primary set of case law results. 7. The computer useable medium of claim 1 wherein the computer useable medium comprises a memory within the information services provider system and further comprises:
(g) a seventh set of computer program code for receiving from the ISP the first set of computer program code, the second set of computer program code, the third set of computer program code, the fourth set of computer program code, the fifth set of computer program code, and the sixth set of computer program code at the client access device; and
(h) a eighth set of computer program code for installing at the client access device the first set of computer program code, the second set of computer program code, the third set of computer program code, the fourth set of computer program code, the fifth set of computer program code, and the sixth set of computer program code on the client access device. 8. A computer-implemented method for enabling electronic communications between a word processing program operating on a client access device and a computer-based information services provider system (ISP), the method comprising:
(a) operatively connecting to a word processing program operating on a client access device; (b) operatively connecting to an ISP; (c) accepting a user search request initiated by a user of the word processing program; (d) transmitting the user search request to the ISP; (e) receiving a set of search results, the set of search results comprising a set of referencing text results; and (f) receiving for display within a user interface of the word processing program at least a portion of the set of referencing text results. 9. The method of claim 10 wherein accepting a user search request comprises identifying a highlighted portion of text within a document associated with the word processing program. 10. The method of claim 10 wherein the word processing program is one of Microsoft Word, and Corel WordPerfect. 11. The method of claim 10 wherein the set of referencing text results comprises case law. 12. The method of claim 10 wherein the set of search results further comprises a primary set of case law results derived from an ISP case law database. 13. The method of claim 12 further comprising combining the set of referencing text results and the primary set of case law results. 14. The method of claim 10 further comprising:
(g) receiving from the ISP a set of computer program code at the client access device, the set of computer program code adapted to execute on the client access device to perform in whole or in part the steps of (a)-(f); and
(h) installing the set of computer program code on the client access device. 15. A client access device comprising:
a processor adapted to execute code; a memory for storing executable code; a word processing program executed by the processor; means for establishing electronic communications with an information services provider system (ISP) having a first database having a primary set of documents; a first set of computer program code for operatively connecting to the word processing program; a second set of computer program code for operatively connecting to the information services provider system; a third set of computer program code for accepting a user search request initiated by a user of the word processing program; a fourth set of computer program code for transmitting data derived from the user search request to the information services provider system; a fifth set of computer program code for receiving a set of search results, the set of search results comprising a set of referencing text results; and a sixth set of computer program code for receiving for display within a user interface of the word processing program at least a portion of the set of referencing text results. 16. The device of claim 15 wherein the third set of computer program code comprises code for identifying a highlighted portion of text within a document associated with the word processing program. 17. The device of claim 15 wherein the word processing program is one of Microsoft Word, and Corel WordPerfect. 18. The device of claim 15 wherein the set of referencing text results comprises case law. 19. The device of claim 15 wherein the set of search results further comprises a primary set of case law results obtained from the ISP first database. 20. The device of claim 19 wherein the sixth set of computer program code further comprises computer program code for combining the set of referencing text results and the primary set of case law results. 21. The device of claim 15 further comprising:
a seventh set of computer program code for receiving from the ISP the first set of computer program code, the second set of computer program code, the third set of computer program code, the fourth set of computer program code, the fifth set of computer program code, and the sixth set of computer program code at the client access device; and
a eighth set of computer program code for installing the first set of computer program code, the second set of computer program code, the third set of computer program code, the fourth set of computer program code, the fifth set of computer program code, and the sixth set of computer program code on the client access device. 22. The device of claim 15 wherein the sixth set of computer program code includes computer program code for receiving for display within a user interface of the word processing program at least a subset of the primary set of documents and at least a portion of the set of referencing text results. 23. The device of claim 22 wherein the subset of the primary set of documents and at least a portion of the set of referencing text results is ranked with respect to relevancy to data associated with the user search request. 24. The device of claim 24 wherein the sixth set of computer program code includes computer program code for receiving for display within a user interface of the word processing program ranked subsets of each of the primary set of documents and the set of referencing text results. 25. The device of claim 15 wherein the referencing text results comprise case law derived from case citations contained in non-case law referencing text documents identified in a database other than the first database. 26. A network-based, computer-implemented information services provider system (ISP) having a set of executable code for enabling data exchange with a word processing program remotely operating on a client access device, the system comprising:
a processor adapted to execute code; a memory for storing executable code; a first database accessible by the processor and having stored therein a primary set of documents; a first set of computer program code adapted to operatively connect to the word processing program; a second set of computer program code adapted to receive search data associated with a user search request initiated by a user of the word processing program; a third set of computer program code adapted to generate a set of search results, the set of search results comprising a set of primary search results from the first database and a set of referencing text results derived from a database other than the first database; and a fourth set of computer program code adapted to transmit for display within a user interface of the word processing program at least a portion of the set of search results including at least a portion of the set of referencing text results. 27. The system of claim 28 wherein the word processing program is one of Microsoft Word, and Corel WordPerfect. 28. The system of claim 28 further comprising a fifth set of computer program code adapted to combine the set of referencing text results and the set of primary search results. 29. The system of claim 28 further comprising:
a sixth set of computer program code adapted to transmit the first set of computer program code, the second set of computer program code, the third set of computer program code, and the fourth set of computer program code to the client access device. 30. The system of claim 28 further comprising:
a seventh set of computer program code adapted to rank with respect to relevancy to data associated with the user search request at least a portion of one or both of the primary set of search results and the set of referencing text results. 31. The system of claim 32 wherein the seventh set of computer program code includes computer program code for transmitting for display within a user interface of the word processing program ranked subsets of each of the primary set of search results and the set of referencing text results. 32. The system of claim 28 further comprising:
an eight set of computer program code adapted to enable electronic communications with a secondary source of documents comprising referencing text documents;
a ninth set of computer program code adapted to cause a search of the secondary source of referencing text documents based on the user search request; and
a tenth set of computer program code adapted to receive from the secondary source a set of referencing text documents from which the set of referencing text results are derived. 33. The system of claim 32 wherein the referencing text documents consist of documents other than case law and the referencing text results comprises case law derived from citations included in one or more of the set of referencing text documents. | The present invention provides a method and system and software that allow users to readily access online legal research tools, while using other applications, such as word processors. One exemplary computer-implemented system provide an add-on software framework that integrates into a host word-processing application on a client access device. The add-on software framework allows users to select from an expandable listing of one or more web applications on a web server, with each of the web application capable of controlling operation of the host word processing application. The web applications facilitate extraction and access to information from the information-retrieval services as well as secondary source reference texts and incorporation of the information in the document or in metadata associated with the document. The present invention allows seamless user experience across host application, such as traditional word processing applications, and Information Service Providers (ISP), such as legal research database and searching tools, and Secondary sources, such as reference texts related to primary source documents, e.g., case law and statues, associated with the ISP service.1. A computer useable medium having a set of executable code for enabling electronic communications between a word processing program of a client access device and an information services provider system (ISP), the set of executable code comprising:
(a) a first set of computer program code for operatively connecting to the word processing program; (b) a second set of computer program code for operatively connecting to the information services provider system; (c) a third set of computer program code for accepting a user search request initiated by a user of the word processing program; (d) a fourth set of computer program code for transmitting the user search request to the information services provider system; (e) a fifth set of computer program code for receiving a set of search results, the set of search results comprising a set of referencing text results; and (f) a sixth set of computer program code for displaying within the word processing program at least a portion of the set of referencing text results. 2. The computer useable medium of claim 1 wherein the third set of computer program code comprises code for identifying a highlighted portion of text within the word processing program. 3. The computer useable medium of claim 1 wherein the word processing program is one of Microsoft Word, and Corel WordPerfect. 4. The computer useable medium of claim 1 wherein the set of referencing text results comprises case law. 5. The computer useable medium of claim 1 wherein the set of search results comprises a primary set of case law results derived from an ISP case law database. 6. The computer useable medium of claim 5 wherein sixth set of computer program code further comprises computer program code for combining the set of referencing text results and the primary set of case law results. 7. The computer useable medium of claim 1 wherein the computer useable medium comprises a memory within the information services provider system and further comprises:
(g) a seventh set of computer program code for receiving from the ISP the first set of computer program code, the second set of computer program code, the third set of computer program code, the fourth set of computer program code, the fifth set of computer program code, and the sixth set of computer program code at the client access device; and
(h) a eighth set of computer program code for installing at the client access device the first set of computer program code, the second set of computer program code, the third set of computer program code, the fourth set of computer program code, the fifth set of computer program code, and the sixth set of computer program code on the client access device. 8. A computer-implemented method for enabling electronic communications between a word processing program operating on a client access device and a computer-based information services provider system (ISP), the method comprising:
(a) operatively connecting to a word processing program operating on a client access device; (b) operatively connecting to an ISP; (c) accepting a user search request initiated by a user of the word processing program; (d) transmitting the user search request to the ISP; (e) receiving a set of search results, the set of search results comprising a set of referencing text results; and (f) receiving for display within a user interface of the word processing program at least a portion of the set of referencing text results. 9. The method of claim 10 wherein accepting a user search request comprises identifying a highlighted portion of text within a document associated with the word processing program. 10. The method of claim 10 wherein the word processing program is one of Microsoft Word, and Corel WordPerfect. 11. The method of claim 10 wherein the set of referencing text results comprises case law. 12. The method of claim 10 wherein the set of search results further comprises a primary set of case law results derived from an ISP case law database. 13. The method of claim 12 further comprising combining the set of referencing text results and the primary set of case law results. 14. The method of claim 10 further comprising:
(g) receiving from the ISP a set of computer program code at the client access device, the set of computer program code adapted to execute on the client access device to perform in whole or in part the steps of (a)-(f); and
(h) installing the set of computer program code on the client access device. 15. A client access device comprising:
a processor adapted to execute code; a memory for storing executable code; a word processing program executed by the processor; means for establishing electronic communications with an information services provider system (ISP) having a first database having a primary set of documents; a first set of computer program code for operatively connecting to the word processing program; a second set of computer program code for operatively connecting to the information services provider system; a third set of computer program code for accepting a user search request initiated by a user of the word processing program; a fourth set of computer program code for transmitting data derived from the user search request to the information services provider system; a fifth set of computer program code for receiving a set of search results, the set of search results comprising a set of referencing text results; and a sixth set of computer program code for receiving for display within a user interface of the word processing program at least a portion of the set of referencing text results. 16. The device of claim 15 wherein the third set of computer program code comprises code for identifying a highlighted portion of text within a document associated with the word processing program. 17. The device of claim 15 wherein the word processing program is one of Microsoft Word, and Corel WordPerfect. 18. The device of claim 15 wherein the set of referencing text results comprises case law. 19. The device of claim 15 wherein the set of search results further comprises a primary set of case law results obtained from the ISP first database. 20. The device of claim 19 wherein the sixth set of computer program code further comprises computer program code for combining the set of referencing text results and the primary set of case law results. 21. The device of claim 15 further comprising:
a seventh set of computer program code for receiving from the ISP the first set of computer program code, the second set of computer program code, the third set of computer program code, the fourth set of computer program code, the fifth set of computer program code, and the sixth set of computer program code at the client access device; and
a eighth set of computer program code for installing the first set of computer program code, the second set of computer program code, the third set of computer program code, the fourth set of computer program code, the fifth set of computer program code, and the sixth set of computer program code on the client access device. 22. The device of claim 15 wherein the sixth set of computer program code includes computer program code for receiving for display within a user interface of the word processing program at least a subset of the primary set of documents and at least a portion of the set of referencing text results. 23. The device of claim 22 wherein the subset of the primary set of documents and at least a portion of the set of referencing text results is ranked with respect to relevancy to data associated with the user search request. 24. The device of claim 24 wherein the sixth set of computer program code includes computer program code for receiving for display within a user interface of the word processing program ranked subsets of each of the primary set of documents and the set of referencing text results. 25. The device of claim 15 wherein the referencing text results comprise case law derived from case citations contained in non-case law referencing text documents identified in a database other than the first database. 26. A network-based, computer-implemented information services provider system (ISP) having a set of executable code for enabling data exchange with a word processing program remotely operating on a client access device, the system comprising:
a processor adapted to execute code; a memory for storing executable code; a first database accessible by the processor and having stored therein a primary set of documents; a first set of computer program code adapted to operatively connect to the word processing program; a second set of computer program code adapted to receive search data associated with a user search request initiated by a user of the word processing program; a third set of computer program code adapted to generate a set of search results, the set of search results comprising a set of primary search results from the first database and a set of referencing text results derived from a database other than the first database; and a fourth set of computer program code adapted to transmit for display within a user interface of the word processing program at least a portion of the set of search results including at least a portion of the set of referencing text results. 27. The system of claim 28 wherein the word processing program is one of Microsoft Word, and Corel WordPerfect. 28. The system of claim 28 further comprising a fifth set of computer program code adapted to combine the set of referencing text results and the set of primary search results. 29. The system of claim 28 further comprising:
a sixth set of computer program code adapted to transmit the first set of computer program code, the second set of computer program code, the third set of computer program code, and the fourth set of computer program code to the client access device. 30. The system of claim 28 further comprising:
a seventh set of computer program code adapted to rank with respect to relevancy to data associated with the user search request at least a portion of one or both of the primary set of search results and the set of referencing text results. 31. The system of claim 32 wherein the seventh set of computer program code includes computer program code for transmitting for display within a user interface of the word processing program ranked subsets of each of the primary set of search results and the set of referencing text results. 32. The system of claim 28 further comprising:
an eight set of computer program code adapted to enable electronic communications with a secondary source of documents comprising referencing text documents;
a ninth set of computer program code adapted to cause a search of the secondary source of referencing text documents based on the user search request; and
a tenth set of computer program code adapted to receive from the secondary source a set of referencing text documents from which the set of referencing text results are derived. 33. The system of claim 32 wherein the referencing text documents consist of documents other than case law and the referencing text results comprises case law derived from citations included in one or more of the set of referencing text documents. | 2,100 |
6,118 | 6,118 | 15,336,063 | 2,156 | A system and method for loading data into column-partitioned database tables. The system and method incorporate a mechanism for buffering data extracted from the rows of a source table in column-oriented fashion within an in-buffer memory, enabling an efficient bulk-write of large arrays of values from the buffer into column-partitioned database tables. The system and method may also include optimizations for grouping columns according to data types and altering the order in which columns are inserted into the database tables. | 1. In a database system including a processor and data storage devices, said database system employing a column-oriented storage model whereby data is saved within column-partitioned database tables, a method of loading data into a column-partitioned database table, the method comprising:
reading, by a processor, rows from a row-oriented source table, extracting, by said processor, individual column data values from said rows, writing, by said processor, said column data values in a column-first order to a buffer memory; allocating, by said processor, said column data values contained within said buffer memory to column containers, and writing, by said processor, said column containers to said column-partitioned database table. 2. The method of claim 1, further comprising the step of:
determining, by said processor, prior to writing said column containers to said column-partitioned database table, an optimized sequence in which said column containers are written to said column-partitioned database table. 3. The method of claim 2, wherein said optimized sequence in which said column containers are written to said column-partitioned database table is determined by evaluating column types associated with said column data values written to said buffer memory. 4. The method of claim 3, wherein said column types include fixed-length columns and variable-length columns. 5. The method of claim 3, wherein said column types include compressed data columns and uncompressed data columns. 6. The method of claim 1, wherein said column containers are written to said column-partitioned database table when said buffer memory attains a full state. 7. In a database system including a processor and data storage devices, said database system employing a column-oriented storage model whereby data is saved within column-partitioned database tables, a method of loading data into a column-partitioned database table, the method comprising:
reading, by a processor, rows from a row-oriented source table; identifying, by said processor, individual column data values from said rows; writing, by said processor, references to said column data values to a buffer memory, said references written to said buffer memory in a column-first order; using said references to said column data values, obtaining, by said processor, said column data values from said row-oriented source table; allocating, by said processor, said column data values to column containers; and writing said column containers to said column partitioned database table within a data storage device. 8. The method of claim 7, further comprising the step of:
determining, by said processor, prior to said writing said column containers to said column-partitioned database table, an optimized sequence in which said column containers are written to said column-partitioned database table. 9. The method of claim 8, wherein said optimized sequence in which said column containers are written to said column-partitioned database table is determined by evaluating column types associated with said references to column data values written to said buffer memory. 10. The method of claim 7, wherein:
said step of identifying individual column data values from said rows includes identifying column data values which are short values; and said step of writing references to said column data values to a buffer memory includes, for said short values, writing the column data values associated with the short values to said buffer memory. 11. A database system including:
a storage device configured to store a plurality of database tables, wherein at least a portion of the database tables are column-partitioned database tables; a processor in communication with the storage device; a data loading module executable by said processor to: read rows from a row-oriented source table, extracting individual column data values from said rows, writing said column data values in a column-first order to a buffer memory; allocating said column data values contained within said buffer memory to column containers, and writing said column containers to said column-partitioned database table. 12. The database system of claim 11, wherein said processor determines, prior to writing said column containers to said column-partitioned database table, an optimized sequence in which said column containers are written to said column-partitioned database table. 13. The database system of claim 12, wherein said optimized sequence in which said column containers are written to said column-partitioned database table is determined by evaluating column types associated with said column data values written to said buffer memory. 14. The database system of claim 13, wherein said column types include fixed-length columns and variable-length columns. 15. The database system of claim 13, wherein said column types include compressed data columns and uncompressed data columns. 16. The database system of claim 11, wherein said column containers are written to said column-partitioned database table when said buffer memory attains a full state. 17. A database system including:
a storage device configured to store a plurality of database tables, wherein at least a portion of the database tables are column-partitioned database tables; a processor in communication with the storage device; a data loading module executable by said processor to: read rows from a row-oriented source table; identify individual column data values from said rows; write references to said column data values to a buffer memory, said references written to said buffer memory in a column-first order; using said references to said column data values, obtain said column data values from said row-oriented source table; allocate said column data values to column containers; write said column containers to said column partitioned database table within a data storage device. 18. The database system of claim 17, wherein said processor determines, prior to writing said column containers to said column-partitioned database table, an optimized sequence in which said column containers are written to said column-partitioned database table. 19. The database system of claim 18, wherein said optimized sequence in which said column containers are written to said column-partitioned database table is determined by evaluating column types associated with said references to column data values written to said buffer memory. 20. The database system of claim 17, wherein:
said identifying individual column data values from said rows includes identifying column data values which are short values; and writing references to said column data values to a buffer memory includes, for said short values, writing the column data values associated with the short values to said buffer memory. | A system and method for loading data into column-partitioned database tables. The system and method incorporate a mechanism for buffering data extracted from the rows of a source table in column-oriented fashion within an in-buffer memory, enabling an efficient bulk-write of large arrays of values from the buffer into column-partitioned database tables. The system and method may also include optimizations for grouping columns according to data types and altering the order in which columns are inserted into the database tables.1. In a database system including a processor and data storage devices, said database system employing a column-oriented storage model whereby data is saved within column-partitioned database tables, a method of loading data into a column-partitioned database table, the method comprising:
reading, by a processor, rows from a row-oriented source table, extracting, by said processor, individual column data values from said rows, writing, by said processor, said column data values in a column-first order to a buffer memory; allocating, by said processor, said column data values contained within said buffer memory to column containers, and writing, by said processor, said column containers to said column-partitioned database table. 2. The method of claim 1, further comprising the step of:
determining, by said processor, prior to writing said column containers to said column-partitioned database table, an optimized sequence in which said column containers are written to said column-partitioned database table. 3. The method of claim 2, wherein said optimized sequence in which said column containers are written to said column-partitioned database table is determined by evaluating column types associated with said column data values written to said buffer memory. 4. The method of claim 3, wherein said column types include fixed-length columns and variable-length columns. 5. The method of claim 3, wherein said column types include compressed data columns and uncompressed data columns. 6. The method of claim 1, wherein said column containers are written to said column-partitioned database table when said buffer memory attains a full state. 7. In a database system including a processor and data storage devices, said database system employing a column-oriented storage model whereby data is saved within column-partitioned database tables, a method of loading data into a column-partitioned database table, the method comprising:
reading, by a processor, rows from a row-oriented source table; identifying, by said processor, individual column data values from said rows; writing, by said processor, references to said column data values to a buffer memory, said references written to said buffer memory in a column-first order; using said references to said column data values, obtaining, by said processor, said column data values from said row-oriented source table; allocating, by said processor, said column data values to column containers; and writing said column containers to said column partitioned database table within a data storage device. 8. The method of claim 7, further comprising the step of:
determining, by said processor, prior to said writing said column containers to said column-partitioned database table, an optimized sequence in which said column containers are written to said column-partitioned database table. 9. The method of claim 8, wherein said optimized sequence in which said column containers are written to said column-partitioned database table is determined by evaluating column types associated with said references to column data values written to said buffer memory. 10. The method of claim 7, wherein:
said step of identifying individual column data values from said rows includes identifying column data values which are short values; and said step of writing references to said column data values to a buffer memory includes, for said short values, writing the column data values associated with the short values to said buffer memory. 11. A database system including:
a storage device configured to store a plurality of database tables, wherein at least a portion of the database tables are column-partitioned database tables; a processor in communication with the storage device; a data loading module executable by said processor to: read rows from a row-oriented source table, extracting individual column data values from said rows, writing said column data values in a column-first order to a buffer memory; allocating said column data values contained within said buffer memory to column containers, and writing said column containers to said column-partitioned database table. 12. The database system of claim 11, wherein said processor determines, prior to writing said column containers to said column-partitioned database table, an optimized sequence in which said column containers are written to said column-partitioned database table. 13. The database system of claim 12, wherein said optimized sequence in which said column containers are written to said column-partitioned database table is determined by evaluating column types associated with said column data values written to said buffer memory. 14. The database system of claim 13, wherein said column types include fixed-length columns and variable-length columns. 15. The database system of claim 13, wherein said column types include compressed data columns and uncompressed data columns. 16. The database system of claim 11, wherein said column containers are written to said column-partitioned database table when said buffer memory attains a full state. 17. A database system including:
a storage device configured to store a plurality of database tables, wherein at least a portion of the database tables are column-partitioned database tables; a processor in communication with the storage device; a data loading module executable by said processor to: read rows from a row-oriented source table; identify individual column data values from said rows; write references to said column data values to a buffer memory, said references written to said buffer memory in a column-first order; using said references to said column data values, obtain said column data values from said row-oriented source table; allocate said column data values to column containers; write said column containers to said column partitioned database table within a data storage device. 18. The database system of claim 17, wherein said processor determines, prior to writing said column containers to said column-partitioned database table, an optimized sequence in which said column containers are written to said column-partitioned database table. 19. The database system of claim 18, wherein said optimized sequence in which said column containers are written to said column-partitioned database table is determined by evaluating column types associated with said references to column data values written to said buffer memory. 20. The database system of claim 17, wherein:
said identifying individual column data values from said rows includes identifying column data values which are short values; and writing references to said column data values to a buffer memory includes, for said short values, writing the column data values associated with the short values to said buffer memory. | 2,100 |
6,119 | 6,119 | 15,114,282 | 2,199 | The disclosure relates to a machine tool device, in particular a handheld machine tool device, comprising at least one control and/or regulating unit and at least one drive unit sensor unit for detecting at least one drive unit parameter that can be processed at least in order to control and/or regulate a drive unit of a machine tool and/or in order to output information to an operator of the control and/or regulating unit. According to the disclosure, the machine tool device comprises at least one operator sensor unit in order to detect at least one operator-specific parameter that can be processed at least in order to control and/or regulate the drive unit and/or in order to output information to an operator of the control and/or regulating unit. | 1. A power tool device comprising:
at least one control unit, the at least one control unit being at least one of a closed-loop control unit and an open-loop control unit; at least one drive unit sensor unit configured to record at least one drive unit characteristic variable, the at least one control unit being configured to process the at least one drive unit characteristic variable to at least one of: (i) control a drive unit of a power tool and (ii) provide an output of information to an operator of the power tool; and at least one operator sensor unit configured to record at least one operator-specific characteristic variable, the at least one control unit being configured to process the at least one operator-specific characteristic variable to at least one of: (i) control the drive unit of the power tool and (ii) provide an output of information to the operator of the power tool. 2. The power tool device as claimed in claim 1, further comprising:
at least one communication unit configured to communicate with at least one external unit and exchange electronic data with the at least one external unit to provide control of the drive unit. 3. The power tool device as claimed in claim 2, wherein the control unit is configured to access a central database using the communication unit, the central database being configured to store at least one of (i) a safety rule and (ii) an operating area rule, the control unit being configured to process the at least one of the safety rule and the operating rule to control the drive unit. 4. The power tool device as claimed in claim 1, wherein the control unit is configured to detect at least in dependence on the at least one operator-specific characteristic variable, an operation of the power tool that cannot be controlled by the operator. 5. The power tool device at least as claimed in claim 2, wherein the control unit is configured to output at least one emergency signal using the communication unit at least in dependence on the at least one operator-specific characteristic variable. 6. The power tool device as claimed in claim 1, wherein the control unit is configured to at least one of (i) control the drive unit and (ii) output an item of information at least in dependence on the operator-specific characteristic variable formed as operator exposure to stress. 7. The power tool device as claimed in claim 1, wherein the control unit is configured to process an output of at least one ambient sensor unit to record at least one ambient characteristic variable, the at least one control unit being configured to process the at least one ambient characteristic variable to at least one of: (i) control a drive unit of the power tool and (ii) provide an output of information to the operator of the power tool. 8. The power tool device as claimed in claim 6, wherein the control unit is configured to adapt at least one parameter stored in a memory unit of the control unit to control the drive unit at least in dependence on at least one ambient characteristic variable recorded with of an ambient sensor unit and formed as a global position. 9. The power tool device as claimed in claim 1, further comprising:
at least one power tool accessory sensor unit configured to record at least one power tool accessory characteristic variable, the at least one control unit being configured to process the at least one power tool accessory characteristic variable to at least one of: (i) control a drive unit of the power tool and (ii) provide an output of information to the operator of the power tool. 10. The power tool device as claimed in claim 1, further comprising:
at least one machining tool sensor unit configured to record at least one machining tool characteristic variable, the at least one control unit being configured to process the at least one machining tool characteristic variable to at least one of: (i) control a drive unit of the power tool and (ii) provide an output of information to the operator of the power tool. 11. The power tool device as claimed in claim 1, further comprising:
at least one workpiece sensor unit configured to record at least one workpiece characteristic variable, the at least one control unit being configured to process the at least one workpiece characteristic variable to at least one of: (i) control a drive unit of the power tool and (ii) provide an output of information to the operator of the power tool. 12. The power tool device as claimed in claim 10, wherein, in at least one operating mode, the control unit is configured to control the drive unit in dependence on at least one workpiece characteristic variable that is recorded with of the workpiece sensor unit and defines an object that is located in a workpiece. 13. The power tool device as claimed in claim 1, wherein the drive unit sensor unit is configured to record the at least one drive unit characteristic variable formed as at least one of a ventilation characteristic variable and an operator risk characteristic variable. 14. The power tool device as claimed in claim 1, wherein the power tool device is included in a portable power tool. 15. A power tool system comprising:
a power tool having a power tool device, the power tool device comprising:
at least one control unit, the at least one control unit being at least one of a closed-loop control unit and an open-loop control unit;
at least one drive unit sensor unit configured to record at least one drive unit characteristic variable, the at least one control unit being configured to process the at least one drive unit characteristic variable to at least one of: (i) control a drive unit of the power tool and (ii) provide an output of information to an operator of the power tool; and
at least one operator sensor unit configured to record at least one operator-specific characteristic variable, the at least one control unit being configured to process the at least one operator-specific characteristic variable to at least one of: (i) control the drive unit of the power tool and (ii) provide an output of information to the operator of a power tool; and
an external sensor unit. 16. A method for controlling at least one power tool in at least one of an open-loop manner and a closed-loop manner, the at least one power tool having a power tool device comprising (i) at least one control unit, the at least one control unit being at least one of a closed-loop control unit and an open-loop control unit, (ii) at least one drive unit sensor unit configured to record at least one drive unit characteristic variable, the at least one control unit being configured to process the at least one drive unit characteristic variable to at least one of control a drive unit of the power tool and provide an output of information to an operator of the power too, and (iii) at least one operator sensor unit configured to record at least one operator-specific characteristic variable, the at least one control unit being configured to process the at least one operator-specific characteristic variable to at least one of control the drive unit of the power tool and provide an output of information to the operator of a power tool, the method comprising:
determining, with the control unit at least one operator state; and
at least one of:
outputting the operator state using of an information output unit;
providing at least one of open-loop and closed-loop control of the drive unit; and
providing at least one safety function of the power tool. 17. The method as claimed in claim 16, further comprising:
accessing, in at least one operating mode, with the control unit at least partially automatically using of a communication unit a central database, the central database being configured to store at least one of (i) a safety rule and (ii) an operating area rule, the control unit being configured to process the at least one of the safety rule and the operating rule to control the drive unit. 18. The method as claimed in claim 16, further comprising:
using, with the control unit, at least one of data recorded by a power tool sensor and data transmitted by a communication unit to provide the at least one of open-loop and closed-loop control of the drive unit. 19. The method as claimed in claim 16, further comprising:
outputting, with the control unit, at least one item of information using of an information output unit in dependence on at least one of data recorded by a power tool sensor and data transmitted by a communication unit. 20. The method as claimed in claim 16, further comprising:
controlling, with the control unit, at least one operating mode setting of the power tool in dependence on at least one of data recorded by a power tool sensor and data transmitted by a communication unit. | The disclosure relates to a machine tool device, in particular a handheld machine tool device, comprising at least one control and/or regulating unit and at least one drive unit sensor unit for detecting at least one drive unit parameter that can be processed at least in order to control and/or regulate a drive unit of a machine tool and/or in order to output information to an operator of the control and/or regulating unit. According to the disclosure, the machine tool device comprises at least one operator sensor unit in order to detect at least one operator-specific parameter that can be processed at least in order to control and/or regulate the drive unit and/or in order to output information to an operator of the control and/or regulating unit.1. A power tool device comprising:
at least one control unit, the at least one control unit being at least one of a closed-loop control unit and an open-loop control unit; at least one drive unit sensor unit configured to record at least one drive unit characteristic variable, the at least one control unit being configured to process the at least one drive unit characteristic variable to at least one of: (i) control a drive unit of a power tool and (ii) provide an output of information to an operator of the power tool; and at least one operator sensor unit configured to record at least one operator-specific characteristic variable, the at least one control unit being configured to process the at least one operator-specific characteristic variable to at least one of: (i) control the drive unit of the power tool and (ii) provide an output of information to the operator of the power tool. 2. The power tool device as claimed in claim 1, further comprising:
at least one communication unit configured to communicate with at least one external unit and exchange electronic data with the at least one external unit to provide control of the drive unit. 3. The power tool device as claimed in claim 2, wherein the control unit is configured to access a central database using the communication unit, the central database being configured to store at least one of (i) a safety rule and (ii) an operating area rule, the control unit being configured to process the at least one of the safety rule and the operating rule to control the drive unit. 4. The power tool device as claimed in claim 1, wherein the control unit is configured to detect at least in dependence on the at least one operator-specific characteristic variable, an operation of the power tool that cannot be controlled by the operator. 5. The power tool device at least as claimed in claim 2, wherein the control unit is configured to output at least one emergency signal using the communication unit at least in dependence on the at least one operator-specific characteristic variable. 6. The power tool device as claimed in claim 1, wherein the control unit is configured to at least one of (i) control the drive unit and (ii) output an item of information at least in dependence on the operator-specific characteristic variable formed as operator exposure to stress. 7. The power tool device as claimed in claim 1, wherein the control unit is configured to process an output of at least one ambient sensor unit to record at least one ambient characteristic variable, the at least one control unit being configured to process the at least one ambient characteristic variable to at least one of: (i) control a drive unit of the power tool and (ii) provide an output of information to the operator of the power tool. 8. The power tool device as claimed in claim 6, wherein the control unit is configured to adapt at least one parameter stored in a memory unit of the control unit to control the drive unit at least in dependence on at least one ambient characteristic variable recorded with of an ambient sensor unit and formed as a global position. 9. The power tool device as claimed in claim 1, further comprising:
at least one power tool accessory sensor unit configured to record at least one power tool accessory characteristic variable, the at least one control unit being configured to process the at least one power tool accessory characteristic variable to at least one of: (i) control a drive unit of the power tool and (ii) provide an output of information to the operator of the power tool. 10. The power tool device as claimed in claim 1, further comprising:
at least one machining tool sensor unit configured to record at least one machining tool characteristic variable, the at least one control unit being configured to process the at least one machining tool characteristic variable to at least one of: (i) control a drive unit of the power tool and (ii) provide an output of information to the operator of the power tool. 11. The power tool device as claimed in claim 1, further comprising:
at least one workpiece sensor unit configured to record at least one workpiece characteristic variable, the at least one control unit being configured to process the at least one workpiece characteristic variable to at least one of: (i) control a drive unit of the power tool and (ii) provide an output of information to the operator of the power tool. 12. The power tool device as claimed in claim 10, wherein, in at least one operating mode, the control unit is configured to control the drive unit in dependence on at least one workpiece characteristic variable that is recorded with of the workpiece sensor unit and defines an object that is located in a workpiece. 13. The power tool device as claimed in claim 1, wherein the drive unit sensor unit is configured to record the at least one drive unit characteristic variable formed as at least one of a ventilation characteristic variable and an operator risk characteristic variable. 14. The power tool device as claimed in claim 1, wherein the power tool device is included in a portable power tool. 15. A power tool system comprising:
a power tool having a power tool device, the power tool device comprising:
at least one control unit, the at least one control unit being at least one of a closed-loop control unit and an open-loop control unit;
at least one drive unit sensor unit configured to record at least one drive unit characteristic variable, the at least one control unit being configured to process the at least one drive unit characteristic variable to at least one of: (i) control a drive unit of the power tool and (ii) provide an output of information to an operator of the power tool; and
at least one operator sensor unit configured to record at least one operator-specific characteristic variable, the at least one control unit being configured to process the at least one operator-specific characteristic variable to at least one of: (i) control the drive unit of the power tool and (ii) provide an output of information to the operator of a power tool; and
an external sensor unit. 16. A method for controlling at least one power tool in at least one of an open-loop manner and a closed-loop manner, the at least one power tool having a power tool device comprising (i) at least one control unit, the at least one control unit being at least one of a closed-loop control unit and an open-loop control unit, (ii) at least one drive unit sensor unit configured to record at least one drive unit characteristic variable, the at least one control unit being configured to process the at least one drive unit characteristic variable to at least one of control a drive unit of the power tool and provide an output of information to an operator of the power too, and (iii) at least one operator sensor unit configured to record at least one operator-specific characteristic variable, the at least one control unit being configured to process the at least one operator-specific characteristic variable to at least one of control the drive unit of the power tool and provide an output of information to the operator of a power tool, the method comprising:
determining, with the control unit at least one operator state; and
at least one of:
outputting the operator state using of an information output unit;
providing at least one of open-loop and closed-loop control of the drive unit; and
providing at least one safety function of the power tool. 17. The method as claimed in claim 16, further comprising:
accessing, in at least one operating mode, with the control unit at least partially automatically using of a communication unit a central database, the central database being configured to store at least one of (i) a safety rule and (ii) an operating area rule, the control unit being configured to process the at least one of the safety rule and the operating rule to control the drive unit. 18. The method as claimed in claim 16, further comprising:
using, with the control unit, at least one of data recorded by a power tool sensor and data transmitted by a communication unit to provide the at least one of open-loop and closed-loop control of the drive unit. 19. The method as claimed in claim 16, further comprising:
outputting, with the control unit, at least one item of information using of an information output unit in dependence on at least one of data recorded by a power tool sensor and data transmitted by a communication unit. 20. The method as claimed in claim 16, further comprising:
controlling, with the control unit, at least one operating mode setting of the power tool in dependence on at least one of data recorded by a power tool sensor and data transmitted by a communication unit. | 2,100 |
6,120 | 6,120 | 14,884,920 | 2,164 | A mechanism is provide for preparing a high-quality data repository. Data and related metadata from a set of data sources are ingested thereby forming a set of unprepared data. The set of unprepared data is transformed based on a set of functions into a set of transformed data. A set of semantic text descriptions that detail the transformation of the set of unprepared data to the set of transformed data is generated using a first set of semantic associations, a second set of semantic associations, and a set of semantic transformation associations. The set of transformed data is tested against one or more governance policies that tracks data lineage to ultimately show that prepared data is in compliance. Responsive to the set of transformed data adhering to the one or more governance policies, a high-quality data repository is automatically built using the transformed data. | 1-8. (canceled) 9. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
ingest data and related metadata from a set of data sources thereby forming a set of unprepared data; transform the set of unprepared data based on a set of functions into a set of transformed data; generate a set of semantic text descriptions that detail the transformation of the set of unprepared data to the set of transformed data using a first set of semantic associations, a second set of semantic associations, and a set of semantic transformation associations; test the set of transformed data against one or more governance policies that tracks data lineage to ultimately show that prepared data is in compliance; and responsive to the set of transformed data adhering to the one or more governance policies, automatically build a high-quality data repository using the transformed data. 10. The computer program product of claim 9, wherein the first set of semantic associations are generated between concepts in the set of unprepared data, wherein the second set of semantic associations are generated between concepts in the set of transformed data, and wherein the set of semantic transformation associations are generated between concepts in the set of unprepared data one or more concepts in the set of transformed data. 11. The computer program product of claim 9, wherein each function in the set of functions each have an associated text description that detail how the function acts on the unprepared data as the data is transformed to the transformed data. 12. The computer program product of claim 9, wherein the computer program product further causes the computing device to:
responsive to the set of transformed data failing to adhere to the one or more governance policies, present the transformed data to an operator for data preparation parameter changes or manual updates to the transformation, wherein, in presenting the transformed data to the operator, the set of semantic text descriptions associated with the transformed data are presented for operator validation. 13. The computer program product of claim 9, wherein transforming the set of unprepared data based on the set of functions utilizes one or more predefined functions. 14. The computer program product of claim 9, wherein transforming the set of unprepared data based on the set of functions utilizes one or more trained functions and wherein the one or more trained functions are generated by the computer program product further causing the computing device to:
for each field in a set of new data that differs from any previously analyzed data, identify one or more existing functions for transforming the new data using a set of text descriptions associated with the new data and previously transformed data; rank the one or more identified existing functions: determine whether a top ranked function is above a predetermined threshold; and responsive to the top ranked function being above the predetermined threshold, utilize the top ranked function to transform the set of unprepared, data. 15. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: ingest data and related metadata from a set of data sources thereby forming a set of unprepared data; transform the set of unprepared data based on a set of functions into a set of transformed data; generate a set of semantic text descriptions that detail the transformation of the set of unprepared data to the set of transformed data using a first set of semantic associations, a second set of semantic associations, and a set of semantic transformation associations; test the set of transformed data against one or more governance policies that tracks data lineage to ultimately show that prepared data is in compliance; and responsive to the set of transformed data adhering to the one or more governance policies, automatically build a high-quality data repository using the transformed data. 16. The apparatus of claim 15, wherein the first set of semantic associations are generated between concepts in the set of unprepared data, wherein the second set of semantic associations are generated between concepts in the set of transformed data, and wherein the set of semantic transformation associations are generated between concepts in the set of unprepared data one or more concepts in the set of transformed data. 17. The apparatus of claim 15, wherein each function in the set of functions each have an associated text description that detail how the function acts on the unprepared data as the data is transformed to the transformed data. 18. The apparatus of claim 15, wherein the instructions further cause the processor to:
responsive to the set of transformed data failing to adhere to the one or more governance policies, present the transformed data to an operator for data preparation parameter changes or manual updates to the transformation, wherein, in presenting the transformed data to the operator, the set of semantic text descriptions associated with the transformed data are presented for operator validation. 19. The apparatus of claim 15, wherein transforming the set of unprepared data based on the set of functions utilizes one or more predefined functions. 20. The apparatus of claim 15, wherein transforming the set of unprepared data based on the set of functions utilizes one or more trained functions and wherein the one or more trained functions are generated by the instructions further causing the processor to:
for each field in a set of new data that differs from any previously analyzed data, identify one or more existing functions for transforming the new data using a set of text descriptions associated with the new data and previously transformed data; rank the one or more identified existing functions; determine whether a top ranked function is above a predetermined threshold; and responsive to the top ranked function being above the predetermined threshold, utilize the top ranked function to transform the set of unprepared data. 21. The apparatus of claim 20, wherein the instructions further cause the processor to:
responsive to no function being above the predetermined threshold, present the identified functions as ranked to an operator; and responsive to receiving a selection of one of the identified functions from the operator, utilize the selected function to transform the set of unprepared data 22. The apparatus of claim 15, wherein the instructions further cause the processor to:
present the transformed data to an operator for validation to ensure accuracy and usefulness. 23. The computer program product of claim 14, wherein the computer program product further causes the computing device to:
responsive to no function being above the predetermined threshold, present the identified functions as ranked to an operator; and responsive to receiving a selection of one of the identified functions from the operator, utilize the selected function to transform the set of unprepared data 24. The computer program product of claim 9, wherein the computer program product further causes the computing device to:
present the transformed data to an operator for validation to ensure accuracy and usefulness. | A mechanism is provide for preparing a high-quality data repository. Data and related metadata from a set of data sources are ingested thereby forming a set of unprepared data. The set of unprepared data is transformed based on a set of functions into a set of transformed data. A set of semantic text descriptions that detail the transformation of the set of unprepared data to the set of transformed data is generated using a first set of semantic associations, a second set of semantic associations, and a set of semantic transformation associations. The set of transformed data is tested against one or more governance policies that tracks data lineage to ultimately show that prepared data is in compliance. Responsive to the set of transformed data adhering to the one or more governance policies, a high-quality data repository is automatically built using the transformed data.1-8. (canceled) 9. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
ingest data and related metadata from a set of data sources thereby forming a set of unprepared data; transform the set of unprepared data based on a set of functions into a set of transformed data; generate a set of semantic text descriptions that detail the transformation of the set of unprepared data to the set of transformed data using a first set of semantic associations, a second set of semantic associations, and a set of semantic transformation associations; test the set of transformed data against one or more governance policies that tracks data lineage to ultimately show that prepared data is in compliance; and responsive to the set of transformed data adhering to the one or more governance policies, automatically build a high-quality data repository using the transformed data. 10. The computer program product of claim 9, wherein the first set of semantic associations are generated between concepts in the set of unprepared data, wherein the second set of semantic associations are generated between concepts in the set of transformed data, and wherein the set of semantic transformation associations are generated between concepts in the set of unprepared data one or more concepts in the set of transformed data. 11. The computer program product of claim 9, wherein each function in the set of functions each have an associated text description that detail how the function acts on the unprepared data as the data is transformed to the transformed data. 12. The computer program product of claim 9, wherein the computer program product further causes the computing device to:
responsive to the set of transformed data failing to adhere to the one or more governance policies, present the transformed data to an operator for data preparation parameter changes or manual updates to the transformation, wherein, in presenting the transformed data to the operator, the set of semantic text descriptions associated with the transformed data are presented for operator validation. 13. The computer program product of claim 9, wherein transforming the set of unprepared data based on the set of functions utilizes one or more predefined functions. 14. The computer program product of claim 9, wherein transforming the set of unprepared data based on the set of functions utilizes one or more trained functions and wherein the one or more trained functions are generated by the computer program product further causing the computing device to:
for each field in a set of new data that differs from any previously analyzed data, identify one or more existing functions for transforming the new data using a set of text descriptions associated with the new data and previously transformed data; rank the one or more identified existing functions: determine whether a top ranked function is above a predetermined threshold; and responsive to the top ranked function being above the predetermined threshold, utilize the top ranked function to transform the set of unprepared, data. 15. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: ingest data and related metadata from a set of data sources thereby forming a set of unprepared data; transform the set of unprepared data based on a set of functions into a set of transformed data; generate a set of semantic text descriptions that detail the transformation of the set of unprepared data to the set of transformed data using a first set of semantic associations, a second set of semantic associations, and a set of semantic transformation associations; test the set of transformed data against one or more governance policies that tracks data lineage to ultimately show that prepared data is in compliance; and responsive to the set of transformed data adhering to the one or more governance policies, automatically build a high-quality data repository using the transformed data. 16. The apparatus of claim 15, wherein the first set of semantic associations are generated between concepts in the set of unprepared data, wherein the second set of semantic associations are generated between concepts in the set of transformed data, and wherein the set of semantic transformation associations are generated between concepts in the set of unprepared data one or more concepts in the set of transformed data. 17. The apparatus of claim 15, wherein each function in the set of functions each have an associated text description that detail how the function acts on the unprepared data as the data is transformed to the transformed data. 18. The apparatus of claim 15, wherein the instructions further cause the processor to:
responsive to the set of transformed data failing to adhere to the one or more governance policies, present the transformed data to an operator for data preparation parameter changes or manual updates to the transformation, wherein, in presenting the transformed data to the operator, the set of semantic text descriptions associated with the transformed data are presented for operator validation. 19. The apparatus of claim 15, wherein transforming the set of unprepared data based on the set of functions utilizes one or more predefined functions. 20. The apparatus of claim 15, wherein transforming the set of unprepared data based on the set of functions utilizes one or more trained functions and wherein the one or more trained functions are generated by the instructions further causing the processor to:
for each field in a set of new data that differs from any previously analyzed data, identify one or more existing functions for transforming the new data using a set of text descriptions associated with the new data and previously transformed data; rank the one or more identified existing functions; determine whether a top ranked function is above a predetermined threshold; and responsive to the top ranked function being above the predetermined threshold, utilize the top ranked function to transform the set of unprepared data. 21. The apparatus of claim 20, wherein the instructions further cause the processor to:
responsive to no function being above the predetermined threshold, present the identified functions as ranked to an operator; and responsive to receiving a selection of one of the identified functions from the operator, utilize the selected function to transform the set of unprepared data 22. The apparatus of claim 15, wherein the instructions further cause the processor to:
present the transformed data to an operator for validation to ensure accuracy and usefulness. 23. The computer program product of claim 14, wherein the computer program product further causes the computing device to:
responsive to no function being above the predetermined threshold, present the identified functions as ranked to an operator; and responsive to receiving a selection of one of the identified functions from the operator, utilize the selected function to transform the set of unprepared data 24. The computer program product of claim 9, wherein the computer program product further causes the computing device to:
present the transformed data to an operator for validation to ensure accuracy and usefulness. | 2,100 |
6,121 | 6,121 | 15,496,813 | 2,191 | Methods and systems for updating a file using heuristics. One system includes an electronic processor configured to identify a code file stored on a storage device and determine a signature of the code file. The electronic processor is also configured to compare the signature of the code file to each of a plurality of signatures to determine a degree of similarity between the signature of the code file and each of the plurality of signatures, wherein each of the plurality of signatures is associated with a code update, and, in response to the degree of similarity between the signature of the code file and one of the plurality of signatures satisfying a predetermined threshold, apply the code update associated with the one of the plurality of signatures to the code file. | 1. A system for updating a code file, the system comprising:
an electronic processor configured to identify the code file stored on a storage device,
parse the code file into a plurality of subsections,
determine a signature for each of the plurality of subsections,
compare the signature for each of the plurality of subsections to each of a plurality of predetermined signatures to determine a degree of similarity between the signature for each of the plurality of subsections and each of the plurality of predetermined signatures, each of the plurality of predetermined signatures associated with a code update fixing a known issue with an associated code file, and
in response to the degree of similarity between the signature for one of the plurality of subsections and one of the plurality of known signatures satisfying a predetermined threshold, apply the code update associated with the one of the plurality of known signatures to the one of the plurality of subsections included in the code file, wherein applying the code update includes updating one or more instructions included in the one of the plurality of subsections. 2. The system of claim 1, wherein the electronic processor is configured to identify the code file stored on the storage device in response to use of the code file. 3. The system of claim 1, wherein the electronic processor is configured to identify the code file stored on the storage device as part of a scan of the storage device on a predetermined frequency. 4. The system of claim 1, wherein the electronic processor is further configured to store a record of the code file, the record including the signature of the code file and a storage location of the code file. 5. (canceled) 6. The system of claim 1, wherein the electronic processor is configured to apply the code update associated with the one of the plurality of signatures to the code file by automatically editing at least one instruction included in the code file based on the code update. 7. The system of claim 1, wherein the electronic processor is configured to apply the code update associated with the one of the plurality of signatures to the code file by automatically adding a comment to the code file, the comment including at least one edited instruction based on the code update. 8. The system of claim 1, wherein the electronic processor is configured to apply the code update associated with the one of the plurality of signatures to the code file by prompting a user to approve application of the code update to the code file and automatically applying the code update to the code file in response to receiving approval from the user. 9. A method of updating a file, the method comprising:
receiving a plurality of file updates and a plurality of signatures from at least one user device, each of the plurality of file updates associated with at least one of the plurality of signatures; identifying a file stored on a storage device; determining a signature of the file; comparing the signature of the file to each of the plurality of signatures to determine a degree of similarity between the signature of the file and each of the plurality of signatures; in response to the degree of similarity between the signature of the file and one of the plurality of signatures satisfying a first predetermined threshold, determining a confidence score of one of the plurality of updates associated with the one of the plurality of signatures, wherein the confidence score indicates a likelihood that the one of the plurality of updates will be successful; and in response to the confidence score satisfying a second predetermined threshold, automatically, with an electronic processor, applying the one of the plurality of updates associated with the one of the plurality of signatures to the file, wherein applying the one of the plurality of updates includes updating one or more instructions included in the file. 10. The method of claim 9, further comprising receiving feedback after applying the one of the plurality of code updates to the file and automatically updating the confidence score based on the feedback. 11. The method of claim 10, wherein receiving the feedback includes receiving telemetry data tracking a manual edit to the file. 12. The method of claim 10, wherein receiving the feedback includes receiving an error log for the file. 13. The method of claim 9, further comprising verifying the one of the plurality of updates applied to the file by executing an original version of the file before applying the one of the plurality of updates to the file to generate an original set of results, executing an updated version of the file after applying the one of the plurality of updates to the file to generate an updated set of results, and comparing the original set of results and the updated set of results and automatically updating the confidence score based on the comparing of the original set of results and the updated set of results. 14. The method of claim 9, wherein receiving the plurality of file updates from at least one user device includes receiving a first subset of the plurality of file updates from a first set of user devices associated with an organization and receiving a second subset of the plurality of files updates from a second set of user devices outside of the organization. 15. The method of claim 9, wherein comparing the signature of the file to each of the plurality of signatures to determine a degree of similarity between the signature of the file and each of the plurality of signatures includes assigning a weight to each of the plurality of signatures, wherein the weight represents a degree of similarity between the signature of the file and each of the plurality of signatures, and further comprising identifying a subset of the plurality of signatures having a weight satisfying the first predetermined threshold. 16. A non-transitory, computer-readable medium including instructions that, when executed by an electronic processor, cause the electronic processor to execute a set of functions, the set of functions comprising:
scanning at least one storage device to identify a plurality of code files; determining a type of update for each of the plurality of code files based on a signature of each of the plurality of code files, the type of update including at least one selected from a group consisting of an automatic update, an automatic update with manual review, and a manual update; determining a confidence score for each of the plurality of code files where the type of the update includes an automatic update, wherein the confidence score indicates a likelihood that the type of update will be successful; generating a user interface, the user interface listing the plurality of code files, the type of update for each of the plurality of code files, the confidence score for each of the plurality of code files where the type of the update includes an automatic update, and at least one selection mechanism for deploying a software product update; displaying the user interface on a user device; and in response to receiving input from a user through the at least one selection mechanism, deploying the software product update, wherein deploying the software product update includes updating one or more instructions included in each of the plurality of code files. 17. The non-transitory, computer-readable medium of claim 16, wherein the user interface further includes at least one readiness score for the plurality of code files, the readiness score specifying a percentage of the plurality of code files needing updating prior to deployment of a software product update. 18. (canceled) 19. The non-transitory, computer-readable medium of claim 16, wherein the set of functions further includes receiving input from a user through the user interface, wherein the input includes at least one selected from a group consisting of approval of an automatic update of one of the plurality of code files and selection of one of the plurality of code files for manual updating. 20. The non-transitory, computer-readable medium of claim 16, wherein the set of functions further includes receiving input from a user through the user interface, wherein the input includes adjustment of the confidence score for at least one of the plurality of code files. | Methods and systems for updating a file using heuristics. One system includes an electronic processor configured to identify a code file stored on a storage device and determine a signature of the code file. The electronic processor is also configured to compare the signature of the code file to each of a plurality of signatures to determine a degree of similarity between the signature of the code file and each of the plurality of signatures, wherein each of the plurality of signatures is associated with a code update, and, in response to the degree of similarity between the signature of the code file and one of the plurality of signatures satisfying a predetermined threshold, apply the code update associated with the one of the plurality of signatures to the code file.1. A system for updating a code file, the system comprising:
an electronic processor configured to identify the code file stored on a storage device,
parse the code file into a plurality of subsections,
determine a signature for each of the plurality of subsections,
compare the signature for each of the plurality of subsections to each of a plurality of predetermined signatures to determine a degree of similarity between the signature for each of the plurality of subsections and each of the plurality of predetermined signatures, each of the plurality of predetermined signatures associated with a code update fixing a known issue with an associated code file, and
in response to the degree of similarity between the signature for one of the plurality of subsections and one of the plurality of known signatures satisfying a predetermined threshold, apply the code update associated with the one of the plurality of known signatures to the one of the plurality of subsections included in the code file, wherein applying the code update includes updating one or more instructions included in the one of the plurality of subsections. 2. The system of claim 1, wherein the electronic processor is configured to identify the code file stored on the storage device in response to use of the code file. 3. The system of claim 1, wherein the electronic processor is configured to identify the code file stored on the storage device as part of a scan of the storage device on a predetermined frequency. 4. The system of claim 1, wherein the electronic processor is further configured to store a record of the code file, the record including the signature of the code file and a storage location of the code file. 5. (canceled) 6. The system of claim 1, wherein the electronic processor is configured to apply the code update associated with the one of the plurality of signatures to the code file by automatically editing at least one instruction included in the code file based on the code update. 7. The system of claim 1, wherein the electronic processor is configured to apply the code update associated with the one of the plurality of signatures to the code file by automatically adding a comment to the code file, the comment including at least one edited instruction based on the code update. 8. The system of claim 1, wherein the electronic processor is configured to apply the code update associated with the one of the plurality of signatures to the code file by prompting a user to approve application of the code update to the code file and automatically applying the code update to the code file in response to receiving approval from the user. 9. A method of updating a file, the method comprising:
receiving a plurality of file updates and a plurality of signatures from at least one user device, each of the plurality of file updates associated with at least one of the plurality of signatures; identifying a file stored on a storage device; determining a signature of the file; comparing the signature of the file to each of the plurality of signatures to determine a degree of similarity between the signature of the file and each of the plurality of signatures; in response to the degree of similarity between the signature of the file and one of the plurality of signatures satisfying a first predetermined threshold, determining a confidence score of one of the plurality of updates associated with the one of the plurality of signatures, wherein the confidence score indicates a likelihood that the one of the plurality of updates will be successful; and in response to the confidence score satisfying a second predetermined threshold, automatically, with an electronic processor, applying the one of the plurality of updates associated with the one of the plurality of signatures to the file, wherein applying the one of the plurality of updates includes updating one or more instructions included in the file. 10. The method of claim 9, further comprising receiving feedback after applying the one of the plurality of code updates to the file and automatically updating the confidence score based on the feedback. 11. The method of claim 10, wherein receiving the feedback includes receiving telemetry data tracking a manual edit to the file. 12. The method of claim 10, wherein receiving the feedback includes receiving an error log for the file. 13. The method of claim 9, further comprising verifying the one of the plurality of updates applied to the file by executing an original version of the file before applying the one of the plurality of updates to the file to generate an original set of results, executing an updated version of the file after applying the one of the plurality of updates to the file to generate an updated set of results, and comparing the original set of results and the updated set of results and automatically updating the confidence score based on the comparing of the original set of results and the updated set of results. 14. The method of claim 9, wherein receiving the plurality of file updates from at least one user device includes receiving a first subset of the plurality of file updates from a first set of user devices associated with an organization and receiving a second subset of the plurality of files updates from a second set of user devices outside of the organization. 15. The method of claim 9, wherein comparing the signature of the file to each of the plurality of signatures to determine a degree of similarity between the signature of the file and each of the plurality of signatures includes assigning a weight to each of the plurality of signatures, wherein the weight represents a degree of similarity between the signature of the file and each of the plurality of signatures, and further comprising identifying a subset of the plurality of signatures having a weight satisfying the first predetermined threshold. 16. A non-transitory, computer-readable medium including instructions that, when executed by an electronic processor, cause the electronic processor to execute a set of functions, the set of functions comprising:
scanning at least one storage device to identify a plurality of code files; determining a type of update for each of the plurality of code files based on a signature of each of the plurality of code files, the type of update including at least one selected from a group consisting of an automatic update, an automatic update with manual review, and a manual update; determining a confidence score for each of the plurality of code files where the type of the update includes an automatic update, wherein the confidence score indicates a likelihood that the type of update will be successful; generating a user interface, the user interface listing the plurality of code files, the type of update for each of the plurality of code files, the confidence score for each of the plurality of code files where the type of the update includes an automatic update, and at least one selection mechanism for deploying a software product update; displaying the user interface on a user device; and in response to receiving input from a user through the at least one selection mechanism, deploying the software product update, wherein deploying the software product update includes updating one or more instructions included in each of the plurality of code files. 17. The non-transitory, computer-readable medium of claim 16, wherein the user interface further includes at least one readiness score for the plurality of code files, the readiness score specifying a percentage of the plurality of code files needing updating prior to deployment of a software product update. 18. (canceled) 19. The non-transitory, computer-readable medium of claim 16, wherein the set of functions further includes receiving input from a user through the user interface, wherein the input includes at least one selected from a group consisting of approval of an automatic update of one of the plurality of code files and selection of one of the plurality of code files for manual updating. 20. The non-transitory, computer-readable medium of claim 16, wherein the set of functions further includes receiving input from a user through the user interface, wherein the input includes adjustment of the confidence score for at least one of the plurality of code files. | 2,100 |
6,122 | 6,122 | 14,981,052 | 2,156 | A method for generating a multimedia file is presented, where the method includes selecting a multimedia clip according to at least one received input instruction in a process of multimedia recording; and parsing the selected multimedia clip to obtain corresponding text information, generating a multimedia file according to the at least one received input instruction, and generating a file name of the multimedia file according to the text information. Using the foregoing technical solution, a multimedia file is generated using text information that is obtained by parsing a multimedia clip, so that a file name of the multimedia file can accurately reflect key information of the multimedia file, and efficiency of searching for a target multimedia file is improved. | 1. A method for generating a multimedia file, the method comprising:
selecting a multimedia clip according to at least one received input instruction in a process of multimedia recording; parsing the selected multimedia clip to obtain corresponding text information; generating a multimedia file according to the at least one received input instruction; and generating a file name of the multimedia file according to the text information. 2. The method according to claim 1, wherein the received input instruction comprises at least one of long pressing a screen, pressing a key, rotating a terminal, holding a terminal tightly, sliding on a screen, and shaking a terminal. 3. The method according to claim 1, wherein selecting the multimedia clip according to the at least one received input instruction comprises:
receiving an input instruction, and determining a start time and an end time in the input instruction; and selecting the multimedia clip according to the start time and the end time in the input instruction, wherein generating the multimedia file according to the at least one received input instruction comprises generating the multimedia file according to a multimedia clip that is between the start time in the input instruction and an end time at which the multimedia recording ends. 4. The method according to claim 1, wherein selecting the multimedia clip according to the at least one received input instruction comprises:
receiving a first input instruction, and determining a start time and an end time in the first input instruction; and selecting the multimedia clip according to the start time and the end time in the first input instruction, wherein generating a multimedia file according to the at least one received input instruction comprises: receiving a second input instruction, and determining a start time in the second input instruction; and generating the multimedia file according to a multimedia clip that is between the start time in the first input instruction and the start time in the second input instruction. 5. The method according to claim 1, wherein generating the file name of the multimedia file according to the text information comprises:
using the text information as a multimedia file name or as partial information of a multimedia file name; naming the multimedia file in a stipulated naming format; and saving the multimedia file. 6. The method according to claim 1, further comprising:
presetting a target language of the text information; and identifying, before the parsing the selected multimedia clip to obtain corresponding text information, the selected multimedia clip using a local device or a network-side server to obtain corresponding text information in the preset target language. 7. The method according to claim 1, further comprising setting an information tag for the selected multimedia clip, wherein the information tag comprises a start time and an end time of the selected multimedia clip, and wherein the text information corresponding to the selected multimedia clip. 8. The method according to claim 7, wherein setting the information tag for the selected multimedia clip comprises setting the information tag at the end time of the selected multimedia clip. 9. An apparatus for generating a multimedia file, comprising:
a receiving unit; a multimedia clip generating unit; a parsing unit; and a multimedia file generating unit, wherein the receiving unit is configured to receive at least one input instruction in a process of multimedia recording, wherein the multimedia clip generating unit is configured to select a multimedia clip according to the at least one received input instruction, wherein the parsing unit is configured to parse the selected multimedia clip to obtain corresponding text information, and wherein the multimedia file generating unit is configured to generate a multimedia file according to the at least one received input instruction, and generate a file name of the multimedia file according to the text information. 10. The apparatus according to claim 9, further comprising a determining unit configured to determine a start time and an end time in the input instruction, wherein the multimedia clip generating unit is configured to select the multimedia clip according to the start time and the end time in the input instruction, and wherein the multimedia file generating unit is configured to generate the multimedia file according to a multimedia clip that is between the start time in the input instruction and an end time at which the multimedia recording ends. 11. The apparatus according to claim 9, further comprising a determining unit, wherein the receiving unit is configured to receive a first input instruction and a second input instruction, wherein the determining unit is configured to determine a start time and an end time in the first input instruction, wherein the multimedia clip generating unit is configured to select the multimedia clip according to the start time and the end time in the first input instruction, wherein the determining unit is further configured to determine a start time in the second input instruction, and wherein the multimedia file generating unit is configured to generate the multimedia file according to a multimedia clip that is between the start time in the first input instruction and the start time in the second input instruction. 12. The apparatus according to claim 9, further comprising a processing unit configured to use the text information as a multimedia file name or as partial information of a multimedia file name, name the multimedia file in a stipulated naming format, and save the multimedia file. 13. The apparatus according to claim 12, wherein the processing unit is further configured to preset a target language of the text information before the selected multimedia clip is parsed to obtain the corresponding text information. 14. The apparatus according to claim 12, wherein the processing unit is further configured to set an information tag for the selected multimedia clip, wherein the information tag comprises a start time and an end time of the selected multimedia clip, and wherein the text information corresponding to the selected multimedia clip. | A method for generating a multimedia file is presented, where the method includes selecting a multimedia clip according to at least one received input instruction in a process of multimedia recording; and parsing the selected multimedia clip to obtain corresponding text information, generating a multimedia file according to the at least one received input instruction, and generating a file name of the multimedia file according to the text information. Using the foregoing technical solution, a multimedia file is generated using text information that is obtained by parsing a multimedia clip, so that a file name of the multimedia file can accurately reflect key information of the multimedia file, and efficiency of searching for a target multimedia file is improved.1. A method for generating a multimedia file, the method comprising:
selecting a multimedia clip according to at least one received input instruction in a process of multimedia recording; parsing the selected multimedia clip to obtain corresponding text information; generating a multimedia file according to the at least one received input instruction; and generating a file name of the multimedia file according to the text information. 2. The method according to claim 1, wherein the received input instruction comprises at least one of long pressing a screen, pressing a key, rotating a terminal, holding a terminal tightly, sliding on a screen, and shaking a terminal. 3. The method according to claim 1, wherein selecting the multimedia clip according to the at least one received input instruction comprises:
receiving an input instruction, and determining a start time and an end time in the input instruction; and selecting the multimedia clip according to the start time and the end time in the input instruction, wherein generating the multimedia file according to the at least one received input instruction comprises generating the multimedia file according to a multimedia clip that is between the start time in the input instruction and an end time at which the multimedia recording ends. 4. The method according to claim 1, wherein selecting the multimedia clip according to the at least one received input instruction comprises:
receiving a first input instruction, and determining a start time and an end time in the first input instruction; and selecting the multimedia clip according to the start time and the end time in the first input instruction, wherein generating a multimedia file according to the at least one received input instruction comprises: receiving a second input instruction, and determining a start time in the second input instruction; and generating the multimedia file according to a multimedia clip that is between the start time in the first input instruction and the start time in the second input instruction. 5. The method according to claim 1, wherein generating the file name of the multimedia file according to the text information comprises:
using the text information as a multimedia file name or as partial information of a multimedia file name; naming the multimedia file in a stipulated naming format; and saving the multimedia file. 6. The method according to claim 1, further comprising:
presetting a target language of the text information; and identifying, before the parsing the selected multimedia clip to obtain corresponding text information, the selected multimedia clip using a local device or a network-side server to obtain corresponding text information in the preset target language. 7. The method according to claim 1, further comprising setting an information tag for the selected multimedia clip, wherein the information tag comprises a start time and an end time of the selected multimedia clip, and wherein the text information corresponding to the selected multimedia clip. 8. The method according to claim 7, wherein setting the information tag for the selected multimedia clip comprises setting the information tag at the end time of the selected multimedia clip. 9. An apparatus for generating a multimedia file, comprising:
a receiving unit; a multimedia clip generating unit; a parsing unit; and a multimedia file generating unit, wherein the receiving unit is configured to receive at least one input instruction in a process of multimedia recording, wherein the multimedia clip generating unit is configured to select a multimedia clip according to the at least one received input instruction, wherein the parsing unit is configured to parse the selected multimedia clip to obtain corresponding text information, and wherein the multimedia file generating unit is configured to generate a multimedia file according to the at least one received input instruction, and generate a file name of the multimedia file according to the text information. 10. The apparatus according to claim 9, further comprising a determining unit configured to determine a start time and an end time in the input instruction, wherein the multimedia clip generating unit is configured to select the multimedia clip according to the start time and the end time in the input instruction, and wherein the multimedia file generating unit is configured to generate the multimedia file according to a multimedia clip that is between the start time in the input instruction and an end time at which the multimedia recording ends. 11. The apparatus according to claim 9, further comprising a determining unit, wherein the receiving unit is configured to receive a first input instruction and a second input instruction, wherein the determining unit is configured to determine a start time and an end time in the first input instruction, wherein the multimedia clip generating unit is configured to select the multimedia clip according to the start time and the end time in the first input instruction, wherein the determining unit is further configured to determine a start time in the second input instruction, and wherein the multimedia file generating unit is configured to generate the multimedia file according to a multimedia clip that is between the start time in the first input instruction and the start time in the second input instruction. 12. The apparatus according to claim 9, further comprising a processing unit configured to use the text information as a multimedia file name or as partial information of a multimedia file name, name the multimedia file in a stipulated naming format, and save the multimedia file. 13. The apparatus according to claim 12, wherein the processing unit is further configured to preset a target language of the text information before the selected multimedia clip is parsed to obtain the corresponding text information. 14. The apparatus according to claim 12, wherein the processing unit is further configured to set an information tag for the selected multimedia clip, wherein the information tag comprises a start time and an end time of the selected multimedia clip, and wherein the text information corresponding to the selected multimedia clip. | 2,100 |
6,123 | 6,123 | 14,744,820 | 2,198 | One embodiment provides a method, including: receiving, at a virtual assistant running on an electronic device, a user input; processing, using the virtual assistant, the user input; processing, using a module running in parallel to the virtual assistant, the user input; combining, using a processor, a response to the user input issued by the virtual assistant and a response to the user input issued by the module; and providing an integrated response to the user input. Other aspects are described and claimed. | 1. A method, comprising:
receiving, at a virtual assistant running on an electronic device, a user input; processing, using the virtual assistant, the user input; processing, using a module running in parallel to the virtual assistant, the user input; combining, using a processor, a response to the user input issued by the virtual assistant and a response to the user input issued by the module; and providing an integrated response to the user input. 2. The method of claim 1, further comprising offering one or more of download of the module and an activation of the module. 3. The method of claim 2, wherein the offering comprises offering a plurality of module versions. 4. The method of claim 3, wherein the plurality of module versions comprise custom modules built to use different knowledge sources. 5. The method of claim 4, wherein the different knowledge sources comprise custom data feeds for different topical categories. 6. The method of claim 1, wherein the module accesses a custom knowledge source not available to the virtual assistant. 7. The method of claim 6, wherein the custom knowledge source is associated with the module. 8. The method of claim 7, wherein the knowledge source comprises a topical knowledge source. 9. The method of claim 7, wherein the knowledge source comprises a topical data feed. 10. The method of claim 1, further comprising downloading the module over a network after the virtual assistant is added to the device. 11. An electronic device, comprising:
an input device; an output device; a processor operatively coupled to the input device and the output device; and a memory that stores instructions executable by the processor to: receive, at the input device, a user input to a virtual assistant; process, using the virtual assistant, the user input; process, using a module running in parallel to the virtual assistant, the user input; combine a response to the user input issued by the virtual assistant and a response to the user input issued by the module; and provide, using the output device, an integrated response to the user input. 12. The electronic device of claim 11, wherein the instructions are executable by the processor to offer one or more of a download of the module and an activation of the module. 13. The electronic device of claim 12, wherein to offer comprises offering a plurality of module versions. 14. The electronic device of claim 13, wherein the plurality of module versions comprise custom modules built to use different knowledge sources. 15. The electronic device of claim 14, wherein the different knowledge sources comprise custom data feeds for different topical categories. 16. The electronic device of claim 11, wherein the module accesses a custom knowledge source not available to the virtual assistant. 17. The electronic device of claim 16, wherein the custom knowledge source is associated with the module. 18. The electronic device of claim 17, wherein the knowledge source comprises a topical knowledge source. 19. The electronic device of claim 17, wherein the knowledge source comprises a topical data feed. 20. A method, comprising:
presenting an opportunity to download a module; the module running in parallel with a virtual assistant; the module processing user input provided to a virtual assistant; and the module producing a response to the user input for integration with a response provided by a virtual assistant. 21. The method of claim 20, further comprising presenting an opportunity to download a virtual assistant that runs in parallel to the module. 22. An apparatus comprising:
a first processor; a network adapter; and storage bearing instructions executable by a second processor for: storing a module that runs in parallel with a virtual assistant; the module processing user input provided to a virtual assistant; and the module producing a response to the user input for integration with a response provided by a virtual assistant; wherein the first processor transfers the instructions over a network via the network adapter. | One embodiment provides a method, including: receiving, at a virtual assistant running on an electronic device, a user input; processing, using the virtual assistant, the user input; processing, using a module running in parallel to the virtual assistant, the user input; combining, using a processor, a response to the user input issued by the virtual assistant and a response to the user input issued by the module; and providing an integrated response to the user input. Other aspects are described and claimed.1. A method, comprising:
receiving, at a virtual assistant running on an electronic device, a user input; processing, using the virtual assistant, the user input; processing, using a module running in parallel to the virtual assistant, the user input; combining, using a processor, a response to the user input issued by the virtual assistant and a response to the user input issued by the module; and providing an integrated response to the user input. 2. The method of claim 1, further comprising offering one or more of download of the module and an activation of the module. 3. The method of claim 2, wherein the offering comprises offering a plurality of module versions. 4. The method of claim 3, wherein the plurality of module versions comprise custom modules built to use different knowledge sources. 5. The method of claim 4, wherein the different knowledge sources comprise custom data feeds for different topical categories. 6. The method of claim 1, wherein the module accesses a custom knowledge source not available to the virtual assistant. 7. The method of claim 6, wherein the custom knowledge source is associated with the module. 8. The method of claim 7, wherein the knowledge source comprises a topical knowledge source. 9. The method of claim 7, wherein the knowledge source comprises a topical data feed. 10. The method of claim 1, further comprising downloading the module over a network after the virtual assistant is added to the device. 11. An electronic device, comprising:
an input device; an output device; a processor operatively coupled to the input device and the output device; and a memory that stores instructions executable by the processor to: receive, at the input device, a user input to a virtual assistant; process, using the virtual assistant, the user input; process, using a module running in parallel to the virtual assistant, the user input; combine a response to the user input issued by the virtual assistant and a response to the user input issued by the module; and provide, using the output device, an integrated response to the user input. 12. The electronic device of claim 11, wherein the instructions are executable by the processor to offer one or more of a download of the module and an activation of the module. 13. The electronic device of claim 12, wherein to offer comprises offering a plurality of module versions. 14. The electronic device of claim 13, wherein the plurality of module versions comprise custom modules built to use different knowledge sources. 15. The electronic device of claim 14, wherein the different knowledge sources comprise custom data feeds for different topical categories. 16. The electronic device of claim 11, wherein the module accesses a custom knowledge source not available to the virtual assistant. 17. The electronic device of claim 16, wherein the custom knowledge source is associated with the module. 18. The electronic device of claim 17, wherein the knowledge source comprises a topical knowledge source. 19. The electronic device of claim 17, wherein the knowledge source comprises a topical data feed. 20. A method, comprising:
presenting an opportunity to download a module; the module running in parallel with a virtual assistant; the module processing user input provided to a virtual assistant; and the module producing a response to the user input for integration with a response provided by a virtual assistant. 21. The method of claim 20, further comprising presenting an opportunity to download a virtual assistant that runs in parallel to the module. 22. An apparatus comprising:
a first processor; a network adapter; and storage bearing instructions executable by a second processor for: storing a module that runs in parallel with a virtual assistant; the module processing user input provided to a virtual assistant; and the module producing a response to the user input for integration with a response provided by a virtual assistant; wherein the first processor transfers the instructions over a network via the network adapter. | 2,100 |
6,124 | 6,124 | 14,159,739 | 2,114 | A server-based environment for reporting a status of a security, monitoring and automation controller is provided. Detecting cessation of an always-on persistent network connection between the SMA controller and the server is also provided. Reporting the cessation of the network connection to an end user and defined others is further provided. A further aspect provides for automatically reporting an alarm event to a central station, the end user, and others, in the event the cessation of the network connection occurs while the SMA controller is aimed and after a zone fault event, and not receiving a disarm notification prior to expiration of a preset entry delay. | 1-20. (canceled) 21. A system comprising:
a controller coupled to a server by a first network connection and configured to exchange with the server signals of a persistent communication protocol, wherein the controller is at a location remote from the server; a remote device coupled to the server by a second network connection; wherein the server is configured to determine a state of the controller using data of at least one of the signals and an absence of the signals, and transmit a message to the remote device, wherein content of the message corresponds to the state of the controller. 22. An apparatus comprising:
a first communication interface configured to receive signals of a controller via a first channel, wherein the controller is at a location remote from the first communication interface, wherein the signals are signals of persistent communication between the controller and the first communication interface; a second communication interface configured to communicate with a remote device via a second channel; a processor coupled to the first and second communication interfaces and configured to determine a state of the controller using data of at least one of the signals and an absence of the signals, and transmit a message to the remote device, wherein content of the message corresponds to the state of the controller. 23. A method comprising:
receiving signals of a controller at a first remote server via a first coupling, wherein the signals are signals of persistent communication between the controller and the first remote server; determining a state of the controller using data of at least one of the signals and an absence of the signals; and transmitting a message to a second server over a second coupling, wherein content of the message corresponds to the state of the controller. 24. A remote system comprising:
communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, the at least one component being located at the premises and the remote system being located at a remote location separate from the premises; and at least one server configured to perform operations comprising:
establishing, through the communication equipment, persistent communications with the at least one component of the SMA system;
analyzing signals of the persistent communications; and
handling destruction detection for the SMA system based on the analysis,
wherein the communication equipment comprises a first communication module configured to communication over the Internet with a first component of the SMA system and a second communication module configured to communication over a cellular network with a second component of the SMA system; and wherein the persistent communications with the at least one component of the SMA system comprise exchanging, through the first communication device, signals with the first component of the SMA system. 25. A method comprising:
establishing, through communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, persistent communications with the at least one component of the SMA system, the at least one component being located at the premises and the communication equipment being located at a remote location separate from the premises; analyzing, by at least one server, signals of the persistent communications; and handling, by at least one server, destruction detection for the SMA system based on the analysis, wherein the communication equipment comprises a first communication module configured to communication over the Internet with a first component of the SMA system and a second communication module configured to communication over a cellular network with a second component of the SMA system; and wherein the persistent communications with the at least one component of the SMA system comprise exchanging, through the first communication device, signals with the first component of the SMA system. 26. A remote system comprising:
communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, the at least one component being located at the premises and the remote system being located at a remote location separate from the premises; and at least one server configured to perform operations comprising:
establishing, through the communication equipment, persistent communications with the at least one component of the SMA system;
analyzing signals of the persistent communications; and
handling destruction detection for the SMA system based on the analysis,
wherein the analyzing comprises monitoring for communications expected to have been received from the at least one component of the SMA system and tracking a time of a most recent communication received from the at least one component of the SMA system; and wherein the handling comprises detecting an SMA system destruction event based on the tracked time of the most recent communication received from the at least one component of the SMA system meeting a threshold. 27. A method comprising:
establishing, through communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, persistent communications with the at least one component of the SMA system, the at least one component being located at the premises and the communication equipment being located at a remote location separate from the premises; analyzing, by at least one server, signals of the persistent communications; and handling, by the at least one server, destruction detection for the SMA system based on the analysis, wherein the analyzing comprises monitoring for communications expected to have been received from the at least one component of the SMA system and tracking a time of a most recent communication received from the at least one component of the SMA system; and wherein the handling comprises detecting an SMA system destruction event based on the tracked time of the most recent communication received from the at least one component of the SMA system meeting a threshold. 28. An offsite system comprising:
communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, the at least one component being located at the premises and the offsite system being located at a remote location separate from the premises; and at least one server configured to perform operations comprising:
establishing, through the communication equipment, persistent communications with the at least one component of the SMA system;
analyzing signals of the persistent communications; and
handling destruction detection for the SMA system based on the analysis, wherein the handling comprises resetting a start of an escrow period each time a communication is properly exchanged and detecting a destruction event when the escrow period expires. 29. A method comprising:
establishing, through communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, persistent communications with the at least one component of the SMA system, the at least one component being located within the premises and the communication equipment being located at a remote location separate from the premises; analyzing, by at least one server, signals of the persistent communications; and handling, by at least one server, destruction detection for the SMA system based on the analysis, wherein the handling comprises resetting a start of an escrow period each time a communication is properly exchanged and detecting a destruction event when the escrow period expires. | A server-based environment for reporting a status of a security, monitoring and automation controller is provided. Detecting cessation of an always-on persistent network connection between the SMA controller and the server is also provided. Reporting the cessation of the network connection to an end user and defined others is further provided. A further aspect provides for automatically reporting an alarm event to a central station, the end user, and others, in the event the cessation of the network connection occurs while the SMA controller is aimed and after a zone fault event, and not receiving a disarm notification prior to expiration of a preset entry delay.1-20. (canceled) 21. A system comprising:
a controller coupled to a server by a first network connection and configured to exchange with the server signals of a persistent communication protocol, wherein the controller is at a location remote from the server; a remote device coupled to the server by a second network connection; wherein the server is configured to determine a state of the controller using data of at least one of the signals and an absence of the signals, and transmit a message to the remote device, wherein content of the message corresponds to the state of the controller. 22. An apparatus comprising:
a first communication interface configured to receive signals of a controller via a first channel, wherein the controller is at a location remote from the first communication interface, wherein the signals are signals of persistent communication between the controller and the first communication interface; a second communication interface configured to communicate with a remote device via a second channel; a processor coupled to the first and second communication interfaces and configured to determine a state of the controller using data of at least one of the signals and an absence of the signals, and transmit a message to the remote device, wherein content of the message corresponds to the state of the controller. 23. A method comprising:
receiving signals of a controller at a first remote server via a first coupling, wherein the signals are signals of persistent communication between the controller and the first remote server; determining a state of the controller using data of at least one of the signals and an absence of the signals; and transmitting a message to a second server over a second coupling, wherein content of the message corresponds to the state of the controller. 24. A remote system comprising:
communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, the at least one component being located at the premises and the remote system being located at a remote location separate from the premises; and at least one server configured to perform operations comprising:
establishing, through the communication equipment, persistent communications with the at least one component of the SMA system;
analyzing signals of the persistent communications; and
handling destruction detection for the SMA system based on the analysis,
wherein the communication equipment comprises a first communication module configured to communication over the Internet with a first component of the SMA system and a second communication module configured to communication over a cellular network with a second component of the SMA system; and wherein the persistent communications with the at least one component of the SMA system comprise exchanging, through the first communication device, signals with the first component of the SMA system. 25. A method comprising:
establishing, through communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, persistent communications with the at least one component of the SMA system, the at least one component being located at the premises and the communication equipment being located at a remote location separate from the premises; analyzing, by at least one server, signals of the persistent communications; and handling, by at least one server, destruction detection for the SMA system based on the analysis, wherein the communication equipment comprises a first communication module configured to communication over the Internet with a first component of the SMA system and a second communication module configured to communication over a cellular network with a second component of the SMA system; and wherein the persistent communications with the at least one component of the SMA system comprise exchanging, through the first communication device, signals with the first component of the SMA system. 26. A remote system comprising:
communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, the at least one component being located at the premises and the remote system being located at a remote location separate from the premises; and at least one server configured to perform operations comprising:
establishing, through the communication equipment, persistent communications with the at least one component of the SMA system;
analyzing signals of the persistent communications; and
handling destruction detection for the SMA system based on the analysis,
wherein the analyzing comprises monitoring for communications expected to have been received from the at least one component of the SMA system and tracking a time of a most recent communication received from the at least one component of the SMA system; and wherein the handling comprises detecting an SMA system destruction event based on the tracked time of the most recent communication received from the at least one component of the SMA system meeting a threshold. 27. A method comprising:
establishing, through communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, persistent communications with the at least one component of the SMA system, the at least one component being located at the premises and the communication equipment being located at a remote location separate from the premises; analyzing, by at least one server, signals of the persistent communications; and handling, by the at least one server, destruction detection for the SMA system based on the analysis, wherein the analyzing comprises monitoring for communications expected to have been received from the at least one component of the SMA system and tracking a time of a most recent communication received from the at least one component of the SMA system; and wherein the handling comprises detecting an SMA system destruction event based on the tracked time of the most recent communication received from the at least one component of the SMA system meeting a threshold. 28. An offsite system comprising:
communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, the at least one component being located at the premises and the offsite system being located at a remote location separate from the premises; and at least one server configured to perform operations comprising:
establishing, through the communication equipment, persistent communications with the at least one component of the SMA system;
analyzing signals of the persistent communications; and
handling destruction detection for the SMA system based on the analysis, wherein the handling comprises resetting a start of an escrow period each time a communication is properly exchanged and detecting a destruction event when the escrow period expires. 29. A method comprising:
establishing, through communication equipment configured to exchange signals with at least one component of a security, monitoring and automation (SMA) system that is configured to monitor a premises, persistent communications with the at least one component of the SMA system, the at least one component being located within the premises and the communication equipment being located at a remote location separate from the premises; analyzing, by at least one server, signals of the persistent communications; and handling, by at least one server, destruction detection for the SMA system based on the analysis, wherein the handling comprises resetting a start of an escrow period each time a communication is properly exchanged and detecting a destruction event when the escrow period expires. | 2,100 |
6,125 | 6,125 | 15,116,394 | 2,193 | In order to capture production data capture process or machine data of a cyclically operating production machine in a simple manner, it is provided that a measurement signal (S 1 , S 2 , S 3 , . . . , S n ) is used in order to determine the working cycle of the consumer unit ( 2 1 , 2 2 , 2 3 , . . . , 2 n ) and the measurement signal (S 1 , S 2 , S 3 , . . . , S n ) is simultaneously mathematically analyzed in order to determine a working cycle of the consumer ( 2 1 , 2 2 , 2 3 , . . . , 2 n ) and with the determined cycle duration of the working cycle to determine at least one variable of the production data capture process or machine data capture process. | 1. A method for determining variables of a production data capture process or machine data capture process of a cyclically operating consumer unit (2 1, 2 2, 2 3, . . . , 2 n) of a production process, wherein at least one measurement signal (S1, S2, S3, . . . , Sn) of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) which characterizes the energy consumption is captured and the energy consumption of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) is determined therefrom, characterized in that the at least one measurement signal (S1, S2, S3, . . . , Sn) is simultaneously mathematically analyzed in order to determine a working cycle of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) and to determine at least one variable of the production data capture process or machine data capture process out of the determined cycle duration of the working cycle. 2. The method according to claim 1, characterized in that the working cycle is determined by an autocorrelation analysis of the measurement signal (S1, S2, S3, . . . , Sn). 3. The method according to claim 1, characterized in that the working cycle is determined by searching of a recurring dominant frequency in the frequency spectrum of the measurement signal (S1, S2, S3, . . . , Sn). 4. The method according to claim 1, characterized in that the working cycle is determined by searching for a characteristic recurring signal pattern in the measurement signal (S1, S2, S3, . . . , Sn). 5. The method according to claim 1, characterized in that the clock pulse of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) is determined from the determined working cycle, and from this the number of produced parts and/or the production speed of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) can be determined as variable of the production data capture process and machine data capture process. 6. The method according to claim 1, characterized in that the signal pattern of the measurement signal (S1, S2, S3, . . . , Sn) is integrated over the working cycle, from which a break, malfunction or switching off of the consumer unit (2 1, 2 2, 2 3, . . . 2 n) is determined as variable of the production data capture process and machine data capture process. 7. The method according to claim 1, characterized in that the signal pattern of the measurement signal (S1, S2, S3, . . . , Sn) is integrated over the working cycle, from which changes in the production process or of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) can be determined from a comparison of the integrals over successive working cycles or with a predetermined threshold value. 8. The method according to claim 1, characterized in that the signal pattern of the measurement signal (S1, S2, S3, . . . , Sn) is integrated over the working cycle, and the process consistency or the production quality are determined from the variance of the integral of the measurement signal (S1, S2, S3, . . . , Sn) of successive working cycles as a variable of the production data capture process and machine data capture process. 9. The method according to claim 1, characterized in that a specific production process is determined by comparison or autocorrelation of the measurement signal (S1, S2, S3, . . . , Sn) of a working cycle with a stored sample signal pattern. 10. The method according to claim 1, characterized in that the energy consumption of a plurality of consumer units (2 1, 2 2, 2 3, . . . , 2 n) is determined and from this a total energy consumption over time is determined, and the total energy consumption is optimized in order to smooth energy consumption peaks. | In order to capture production data capture process or machine data of a cyclically operating production machine in a simple manner, it is provided that a measurement signal (S 1 , S 2 , S 3 , . . . , S n ) is used in order to determine the working cycle of the consumer unit ( 2 1 , 2 2 , 2 3 , . . . , 2 n ) and the measurement signal (S 1 , S 2 , S 3 , . . . , S n ) is simultaneously mathematically analyzed in order to determine a working cycle of the consumer ( 2 1 , 2 2 , 2 3 , . . . , 2 n ) and with the determined cycle duration of the working cycle to determine at least one variable of the production data capture process or machine data capture process.1. A method for determining variables of a production data capture process or machine data capture process of a cyclically operating consumer unit (2 1, 2 2, 2 3, . . . , 2 n) of a production process, wherein at least one measurement signal (S1, S2, S3, . . . , Sn) of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) which characterizes the energy consumption is captured and the energy consumption of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) is determined therefrom, characterized in that the at least one measurement signal (S1, S2, S3, . . . , Sn) is simultaneously mathematically analyzed in order to determine a working cycle of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) and to determine at least one variable of the production data capture process or machine data capture process out of the determined cycle duration of the working cycle. 2. The method according to claim 1, characterized in that the working cycle is determined by an autocorrelation analysis of the measurement signal (S1, S2, S3, . . . , Sn). 3. The method according to claim 1, characterized in that the working cycle is determined by searching of a recurring dominant frequency in the frequency spectrum of the measurement signal (S1, S2, S3, . . . , Sn). 4. The method according to claim 1, characterized in that the working cycle is determined by searching for a characteristic recurring signal pattern in the measurement signal (S1, S2, S3, . . . , Sn). 5. The method according to claim 1, characterized in that the clock pulse of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) is determined from the determined working cycle, and from this the number of produced parts and/or the production speed of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) can be determined as variable of the production data capture process and machine data capture process. 6. The method according to claim 1, characterized in that the signal pattern of the measurement signal (S1, S2, S3, . . . , Sn) is integrated over the working cycle, from which a break, malfunction or switching off of the consumer unit (2 1, 2 2, 2 3, . . . 2 n) is determined as variable of the production data capture process and machine data capture process. 7. The method according to claim 1, characterized in that the signal pattern of the measurement signal (S1, S2, S3, . . . , Sn) is integrated over the working cycle, from which changes in the production process or of the consumer unit (2 1, 2 2, 2 3, . . . , 2 n) can be determined from a comparison of the integrals over successive working cycles or with a predetermined threshold value. 8. The method according to claim 1, characterized in that the signal pattern of the measurement signal (S1, S2, S3, . . . , Sn) is integrated over the working cycle, and the process consistency or the production quality are determined from the variance of the integral of the measurement signal (S1, S2, S3, . . . , Sn) of successive working cycles as a variable of the production data capture process and machine data capture process. 9. The method according to claim 1, characterized in that a specific production process is determined by comparison or autocorrelation of the measurement signal (S1, S2, S3, . . . , Sn) of a working cycle with a stored sample signal pattern. 10. The method according to claim 1, characterized in that the energy consumption of a plurality of consumer units (2 1, 2 2, 2 3, . . . , 2 n) is determined and from this a total energy consumption over time is determined, and the total energy consumption is optimized in order to smooth energy consumption peaks. | 2,100 |
6,126 | 6,126 | 14,779,240 | 2,123 | A computing system includes technologies for providing trusted predictive analytics services. The computing system provides a common description language for predictive analytics services, and uses cryptographic techniques and digital rights management techniques to protect input data and/or portions of the predictive analytics services. | 1-20. (canceled) 21. A computing system comprising one or more computing devices, the computing system to provide a trusted predictive analytics service, the computing system comprising:
a trusted predictive analytics middleware subsystem to, in response to a user-level application request for a predictive analytics service, in a trust execution environment of the computing system, cause the computing system to: determine a model description for a predictive analytics model, the model description created with a predictive analytics model description language, wherein the predictive analytics model description language is to describe a plurality of different predictive analytics models using a common language; compare data associated with the user-level application request with data indicative of digital rights permissions associated with the model description; and if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted, instantiate an executable associated with the model description. 22. The computing system of claim 21, wherein the predictive analytics model description language comprises data indicative of a predictive analytics model structure, one or more model parameters, and meta information about a predictive analytics model. 23. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem is launched, by a user computing device of the computing system, in the trust execution environment. 24. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem is obtain input data associated with the user-level application request for a predictive analytics service, and store the input data in a trusted memory region of the trust execution environment. 25. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem is to decrypt the model description if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted. 26. The computing system of claim 25, wherein the trusted predictive analytics middleware subsystem is to store the decrypted model description in a trusted memory region of the trust execution environment. 27. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem is to create the executable based on a predictive analytics execution primitive and the model description. 28. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem comprises a digital rights management (DRM) subsystem to verify digital rights associated with the predictive analytics service. 29. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem comprises a model description assembler module to interpret the model description using the model description language, create a model structure for the predictive analytics service based on the model description, and convert the model structure to an executable based on a predictive analytics execution primitive. 30. A method for providing a trusted predictive analytics service, the method comprising, with a computing system:
describing a plurality of different predictive analytics models using a common model description language; and in response to a user-level application request for a predictive analytics service, in a trust execution environment of the computing system:
determining a model description for a predictive analytics model, the model description created with the predictive analytics model description language;
comparing data associated with the user-level application request with data indicative of digital rights permissions associated with the model description; and
if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted, instantiating an executable associated with the model description. 31. The method of claim 30, comprising launching the trusted predictive analytics middleware subsystem in the trust execution environment. 32. The method of claim 30, comprising obtaining input data associated with the user-level application request for a predictive analytics service, and storing the input data in a trusted memory region of the trust execution environment. 33. The method of claim 30, comprising decrypting the model description if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted. 34. The method of claim 30, comprising storing the decrypted model description in a trusted memory region of the trust execution environment. 35. The method of claim 30, comprising creating the executable based on a predictive analytics execution primitive and the model description. 36. The method of claim 30, comprising, by a digital rights management (DRM) subsystem, verifying digital rights associated with the predictive analytics service. 37. The method of claim 30, comprising interpreting the model description using the model description language, creating a model structure for the predictive analytics service based on the model description, and converting the model structure to an executable based on a predictive analytics execution primitive. 38. The method of claim 30, comprising describing the predictive analytics models using a description language that includes data indicative of a predictive analytics model structure, one or more model parameters, and meta information about a predictive analytics model. 39. One or more non-transitory machine readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a computing system to:
describe a plurality of different predictive analytics models using a common model description language; and in response to a user-level application request for a predictive analytics service, in a trust execution environment of the computing system:
determine a model description for a predictive analytics model, the model description created with the predictive analytics model description language;
compare data associated with the user-level application request with data indicative of digital rights permissions associated with the model description; and
if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted, instantiate an executable associated with the model description. 40. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to launch the trusted predictive analytics middleware subsystem in the trust execution environment. 41. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to obtain input data associated with the user-level application request for a predictive analytics service, and store the input data in a trusted memory region of the trust execution environment. 42. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to decrypt the model description if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted, and store the decrypted model description in a trusted memory region of the trust execution environment. 43. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to create the executable based on a predictive analytics execution primitive and the model description. 44. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to interpret the model description using the model description language, create a model structure for the predictive analytics service based on the model description, and convert the model structure to an executable based on a predictive analytics execution primitive. 45. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to describe the predictive analytics models using a description language that includes data indicative of a predictive analytics model structure, one or more model parameters, and meta information about a predictive analytics model. | A computing system includes technologies for providing trusted predictive analytics services. The computing system provides a common description language for predictive analytics services, and uses cryptographic techniques and digital rights management techniques to protect input data and/or portions of the predictive analytics services.1-20. (canceled) 21. A computing system comprising one or more computing devices, the computing system to provide a trusted predictive analytics service, the computing system comprising:
a trusted predictive analytics middleware subsystem to, in response to a user-level application request for a predictive analytics service, in a trust execution environment of the computing system, cause the computing system to: determine a model description for a predictive analytics model, the model description created with a predictive analytics model description language, wherein the predictive analytics model description language is to describe a plurality of different predictive analytics models using a common language; compare data associated with the user-level application request with data indicative of digital rights permissions associated with the model description; and if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted, instantiate an executable associated with the model description. 22. The computing system of claim 21, wherein the predictive analytics model description language comprises data indicative of a predictive analytics model structure, one or more model parameters, and meta information about a predictive analytics model. 23. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem is launched, by a user computing device of the computing system, in the trust execution environment. 24. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem is obtain input data associated with the user-level application request for a predictive analytics service, and store the input data in a trusted memory region of the trust execution environment. 25. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem is to decrypt the model description if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted. 26. The computing system of claim 25, wherein the trusted predictive analytics middleware subsystem is to store the decrypted model description in a trusted memory region of the trust execution environment. 27. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem is to create the executable based on a predictive analytics execution primitive and the model description. 28. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem comprises a digital rights management (DRM) subsystem to verify digital rights associated with the predictive analytics service. 29. The computing system of claim 21, wherein the trusted predictive analytics middleware subsystem comprises a model description assembler module to interpret the model description using the model description language, create a model structure for the predictive analytics service based on the model description, and convert the model structure to an executable based on a predictive analytics execution primitive. 30. A method for providing a trusted predictive analytics service, the method comprising, with a computing system:
describing a plurality of different predictive analytics models using a common model description language; and in response to a user-level application request for a predictive analytics service, in a trust execution environment of the computing system:
determining a model description for a predictive analytics model, the model description created with the predictive analytics model description language;
comparing data associated with the user-level application request with data indicative of digital rights permissions associated with the model description; and
if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted, instantiating an executable associated with the model description. 31. The method of claim 30, comprising launching the trusted predictive analytics middleware subsystem in the trust execution environment. 32. The method of claim 30, comprising obtaining input data associated with the user-level application request for a predictive analytics service, and storing the input data in a trusted memory region of the trust execution environment. 33. The method of claim 30, comprising decrypting the model description if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted. 34. The method of claim 30, comprising storing the decrypted model description in a trusted memory region of the trust execution environment. 35. The method of claim 30, comprising creating the executable based on a predictive analytics execution primitive and the model description. 36. The method of claim 30, comprising, by a digital rights management (DRM) subsystem, verifying digital rights associated with the predictive analytics service. 37. The method of claim 30, comprising interpreting the model description using the model description language, creating a model structure for the predictive analytics service based on the model description, and converting the model structure to an executable based on a predictive analytics execution primitive. 38. The method of claim 30, comprising describing the predictive analytics models using a description language that includes data indicative of a predictive analytics model structure, one or more model parameters, and meta information about a predictive analytics model. 39. One or more non-transitory machine readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a computing system to:
describe a plurality of different predictive analytics models using a common model description language; and in response to a user-level application request for a predictive analytics service, in a trust execution environment of the computing system:
determine a model description for a predictive analytics model, the model description created with the predictive analytics model description language;
compare data associated with the user-level application request with data indicative of digital rights permissions associated with the model description; and
if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted, instantiate an executable associated with the model description. 40. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to launch the trusted predictive analytics middleware subsystem in the trust execution environment. 41. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to obtain input data associated with the user-level application request for a predictive analytics service, and store the input data in a trusted memory region of the trust execution environment. 42. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to decrypt the model description if, based on the comparison of the data associated with the user-level application request with data indicative of digital rights permissions associated with the model description, the user-level application request is permitted, and store the decrypted model description in a trusted memory region of the trust execution environment. 43. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to create the executable based on a predictive analytics execution primitive and the model description. 44. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to interpret the model description using the model description language, create a model structure for the predictive analytics service based on the model description, and convert the model structure to an executable based on a predictive analytics execution primitive. 45. The one or more non-transitory machine readable storage media of claim 39, wherein the instructions cause the computing system to describe the predictive analytics models using a description language that includes data indicative of a predictive analytics model structure, one or more model parameters, and meta information about a predictive analytics model. | 2,100 |
6,127 | 6,127 | 16,098,498 | 2,184 | In a method for the emergency shutdown of a bus system, and a bus system, having a master module and bus subscribers disposed in series, the master module and the bus subscribers sending data packets to one another with the aid of a data line, the method has the temporally consecutive method steps: in a first method step, a bus subscriber and/or the master module detect(s) an error status, in a second method step, the bus subscriber and/or the master module send(s) an emergency signal to all bus subscribers and to the master module, in a third method step, a further bus subscriber receives the emergency signal, immediately forwards it to an adjacent bus subscriber and simultaneously evaluates it, and in a fourth method step, the further bus subscriber shuts itself down automatically. | 1-14. (canceled) 15. A method for emergency shutdown of a bus system, having a master module and serially-arranged bus subscribers adapted to send data packets to each other via a data line, comprising:
detecting an error status by a bus subscriber and/or the master module; after the detecting, transmitting, by the bus subscriber and/or the master module, an emergency signal to all bus subscribers and to the master module; after the transmitting, receiving the emergency signal by a further bus subscriber and immediately forwarding, by the further bus subscriber, the emergency signal to an adjacent bus subscriber, the further bus subscriber evaluating the emergency signal simultaneously with the forwarding; and after the receiving, automatically shutting down the further bus subscriber. 16. The method according to claim 15, further comprising interrupting a data packet by the emergency signal. 17. The method according to claim 16, further comprising discontinuing transmission of the interrupted data packet and discarding the interrupted data packet. 18. The method according to claim 15, wherein all data packets have an identical length and/or signal length, a length and/or signal length of the emergency signal being shorter than the length and/or signal length of the data packets. 19. The method according to claim 15, wherein two successive data packets are temporally spaced by a transmission pause, the emergency signal interrupting a transmission pause. 20. The method according to claim 15, wherein the bus system has two data lines, the bus subscriber and/or the master module transmitting the emergency signal simultaneously via the two data lines. 21. A bus system, comprising:
a master module and bus subscribers arranged in series; and at least one data line connecting the master module and the bus subscribers; wherein the bus system is adapted to perform the method recited in claim 15. 22. The bus system according to claim 21, wherein the data line includes at least one first data line and at least one second data line. 23. The bus system according to claim 22, wherein the master module is adapted to transmit a data packet to the bus subscribers via the first data line and/or at least one bus subscriber is adapted to transmit a data packet to the master module via the second data line. 24. The bus system according to claim 21, wherein each data line includes at least one data cable, each bus subscriber being connected by a respective data cable to an upstream and/or downstream bus subscriber and/or to the master module. 25. The bus system according to claim 24, wherein each data cable includes two mating plug connector parts, each bus subscriber having a first plug connector part adapted to connect to a respective upstream bus subscriber and a second plug connector part adapted to connect to a respective downstream bus subscriber. 26. The bus system according to claim 24, wherein an individual data cable of the first data line and an individual data cable of the second data line are arranged between two adjacent bus subscribers in a cable sheath surrounding and/or enveloping the data cables in a circumferential direction. 27. The bus system according to claim 26, wherein a supply line and/or a ground lead for the bus subscribers are arranged in the cable sheath. 28. The bus system according to claim 21, wherein each bus subscriber includes a switch connected to a respective data line and adapted to interrupt data transmission along the respective data line. 29. The bus system according to claim 21, wherein each bus subscriber includes a time-measurement device. 30. The bus system according to claim 21, wherein each bus subscriber includes a logic circuit adapted to evaluate data packets of the master module and/or the bus subscribers. 31. The bus system according to claim 30, wherein the logic circuit is adapted to identify the emergency signal and, simultaneously with further evaluation of the emergency signal, to forward the emergency signal to an adjacent bus subscriber. 32. The bus system according to claim 21, wherein each bus subscriber includes an electronic circuit having: (a) a switch connected to a respective data line and adapted to interrupt data transmission along the respective data line, (b) a time-measurement device, and/or (c) a logic circuit adapted to evaluate data packets of the master module and/or the bus subscribers. 33. The bus system according to claim 32, wherein the switch, the time-measurement device, and/or the logic circuit are integrated into the electronic circuit. | In a method for the emergency shutdown of a bus system, and a bus system, having a master module and bus subscribers disposed in series, the master module and the bus subscribers sending data packets to one another with the aid of a data line, the method has the temporally consecutive method steps: in a first method step, a bus subscriber and/or the master module detect(s) an error status, in a second method step, the bus subscriber and/or the master module send(s) an emergency signal to all bus subscribers and to the master module, in a third method step, a further bus subscriber receives the emergency signal, immediately forwards it to an adjacent bus subscriber and simultaneously evaluates it, and in a fourth method step, the further bus subscriber shuts itself down automatically.1-14. (canceled) 15. A method for emergency shutdown of a bus system, having a master module and serially-arranged bus subscribers adapted to send data packets to each other via a data line, comprising:
detecting an error status by a bus subscriber and/or the master module; after the detecting, transmitting, by the bus subscriber and/or the master module, an emergency signal to all bus subscribers and to the master module; after the transmitting, receiving the emergency signal by a further bus subscriber and immediately forwarding, by the further bus subscriber, the emergency signal to an adjacent bus subscriber, the further bus subscriber evaluating the emergency signal simultaneously with the forwarding; and after the receiving, automatically shutting down the further bus subscriber. 16. The method according to claim 15, further comprising interrupting a data packet by the emergency signal. 17. The method according to claim 16, further comprising discontinuing transmission of the interrupted data packet and discarding the interrupted data packet. 18. The method according to claim 15, wherein all data packets have an identical length and/or signal length, a length and/or signal length of the emergency signal being shorter than the length and/or signal length of the data packets. 19. The method according to claim 15, wherein two successive data packets are temporally spaced by a transmission pause, the emergency signal interrupting a transmission pause. 20. The method according to claim 15, wherein the bus system has two data lines, the bus subscriber and/or the master module transmitting the emergency signal simultaneously via the two data lines. 21. A bus system, comprising:
a master module and bus subscribers arranged in series; and at least one data line connecting the master module and the bus subscribers; wherein the bus system is adapted to perform the method recited in claim 15. 22. The bus system according to claim 21, wherein the data line includes at least one first data line and at least one second data line. 23. The bus system according to claim 22, wherein the master module is adapted to transmit a data packet to the bus subscribers via the first data line and/or at least one bus subscriber is adapted to transmit a data packet to the master module via the second data line. 24. The bus system according to claim 21, wherein each data line includes at least one data cable, each bus subscriber being connected by a respective data cable to an upstream and/or downstream bus subscriber and/or to the master module. 25. The bus system according to claim 24, wherein each data cable includes two mating plug connector parts, each bus subscriber having a first plug connector part adapted to connect to a respective upstream bus subscriber and a second plug connector part adapted to connect to a respective downstream bus subscriber. 26. The bus system according to claim 24, wherein an individual data cable of the first data line and an individual data cable of the second data line are arranged between two adjacent bus subscribers in a cable sheath surrounding and/or enveloping the data cables in a circumferential direction. 27. The bus system according to claim 26, wherein a supply line and/or a ground lead for the bus subscribers are arranged in the cable sheath. 28. The bus system according to claim 21, wherein each bus subscriber includes a switch connected to a respective data line and adapted to interrupt data transmission along the respective data line. 29. The bus system according to claim 21, wherein each bus subscriber includes a time-measurement device. 30. The bus system according to claim 21, wherein each bus subscriber includes a logic circuit adapted to evaluate data packets of the master module and/or the bus subscribers. 31. The bus system according to claim 30, wherein the logic circuit is adapted to identify the emergency signal and, simultaneously with further evaluation of the emergency signal, to forward the emergency signal to an adjacent bus subscriber. 32. The bus system according to claim 21, wherein each bus subscriber includes an electronic circuit having: (a) a switch connected to a respective data line and adapted to interrupt data transmission along the respective data line, (b) a time-measurement device, and/or (c) a logic circuit adapted to evaluate data packets of the master module and/or the bus subscribers. 33. The bus system according to claim 32, wherein the switch, the time-measurement device, and/or the logic circuit are integrated into the electronic circuit. | 2,100 |
6,128 | 6,128 | 15,034,241 | 2,162 | Processing a hybrid flow containing a continuous flow can include connecting a continuous flow to a finite flow of a hybrid flow using a continuous connector operator, and processing the data flow graph of the hybrid flow. | 1. A system for processing hybrid flows containing a continuous flow, comprising:
a conversion engine to:
convert a hybrid flow to a data flow graph, wherein the hybrid flow includes a continuous flow and a finite flow; and
connect an output of the continuous flow to an input of the finite in the data flow graph using a continuous connector operator; and
a hybrid flow engine to process the data flow graph of the hybrid flow. 2. The system of claim 1, wherein the hybrid flow engine optimize the data flow graph of the hybrid flow. 3. The system of claim 1, wherein the conversion engine adds the continuous connector operator to the data flow graph of the hybrid flow. 4. The system of claim 1, wherein the hybrid flow engine adds a new flow to the data flow graph of the hybrid flow. 5. The system of claim 1, including a continuous connector operator engine to:
aggregate input data from the continuous flow; and send the aggregate input data to the finite flow as a data block. 6. The system of claim 5, further including a finite flow engine to analyze data from the continuous flow that is aggregated. 7. The system of claim 1, further including a continuous flow engine to:
execute an operation on continuously collected data; and send the data to the continuous connector operator. 8. A non-transitory computer readable medium storing instructions executable by a processing resource to cause a computer to:
subscribe a continuous connector, operator to a continuous flow of a hybrid flow to connect the continuous flow to a finite flow of the hybrid flow; aggregate data from the continuous flow using the continuous connector operator; send the aggregated data to the finite flow of the hybrid flow; and terminate the subscription of the continuous connector operator to the continuous flow based on a termination condition. 9. The non-transistory computer-readable medium of claim 8, wherein the instructions executable by the processing resource to subscribe to the continuous flow include instructions executable to subscribe in response to identification of an output of the continuous flow as an input to the finite flow. 10. The non-transitory computer-readable medium of claim 8, including instructions executable by the processing resource to:
convert a plurality of task flows of the hybrid flow, including the continuous flow and the finite flow, to a data flow graph that contains control and data flow characteristics of the hybrid flow. 11. The non-transitory computer-readable medium of claim 10, including instructions executable by the processing resource to process the data flow graph including instructions executable to optimize the data flow graph including the continuous connector operator. 12. A method for processing a hybrid flow containing a continuous flow comprising:
annotating a continuous flow as continuous and a finite flow as finite in a data flow graph of a hybrid flow; adding a continuous connector operator to the data flow graph of the hybrid flow to connect an output of the continuous flow to an input of the finite flow in response to identifying the annotated finite flow is a consumer of the annotated continuous flow; aggregating data from the continuous flow using the continuous connector operator; analyzing the aggregated data along the finite flow; revising the data flow graph of the hybrid flow to include a new flow and a new continuous connector operator based on the analysis of the aggregated data; and processing the revised data flow graph of the hybrid flow. 13. The method of claim 12, wherein revising the data flow graph to include the new flow and the new continuous connector operator includes creating the new flow in the data flow graph of the hybrid flow. 14. The method of claim 12, wherein revising the data flow graph to include the new flow and the new continuous connector operator includes creating the new continuous connector operator to replicate input data to the continuous data flow. 15. The method of claim 12, wherein processing the revised data flow graph of the hybrid flow includes outputting an alternative data flow graph of the hybrid flow with the lowest relative cost of a set of alternative data flow graphs based on an optimization objective. | Processing a hybrid flow containing a continuous flow can include connecting a continuous flow to a finite flow of a hybrid flow using a continuous connector operator, and processing the data flow graph of the hybrid flow.1. A system for processing hybrid flows containing a continuous flow, comprising:
a conversion engine to:
convert a hybrid flow to a data flow graph, wherein the hybrid flow includes a continuous flow and a finite flow; and
connect an output of the continuous flow to an input of the finite in the data flow graph using a continuous connector operator; and
a hybrid flow engine to process the data flow graph of the hybrid flow. 2. The system of claim 1, wherein the hybrid flow engine optimize the data flow graph of the hybrid flow. 3. The system of claim 1, wherein the conversion engine adds the continuous connector operator to the data flow graph of the hybrid flow. 4. The system of claim 1, wherein the hybrid flow engine adds a new flow to the data flow graph of the hybrid flow. 5. The system of claim 1, including a continuous connector operator engine to:
aggregate input data from the continuous flow; and send the aggregate input data to the finite flow as a data block. 6. The system of claim 5, further including a finite flow engine to analyze data from the continuous flow that is aggregated. 7. The system of claim 1, further including a continuous flow engine to:
execute an operation on continuously collected data; and send the data to the continuous connector operator. 8. A non-transitory computer readable medium storing instructions executable by a processing resource to cause a computer to:
subscribe a continuous connector, operator to a continuous flow of a hybrid flow to connect the continuous flow to a finite flow of the hybrid flow; aggregate data from the continuous flow using the continuous connector operator; send the aggregated data to the finite flow of the hybrid flow; and terminate the subscription of the continuous connector operator to the continuous flow based on a termination condition. 9. The non-transistory computer-readable medium of claim 8, wherein the instructions executable by the processing resource to subscribe to the continuous flow include instructions executable to subscribe in response to identification of an output of the continuous flow as an input to the finite flow. 10. The non-transitory computer-readable medium of claim 8, including instructions executable by the processing resource to:
convert a plurality of task flows of the hybrid flow, including the continuous flow and the finite flow, to a data flow graph that contains control and data flow characteristics of the hybrid flow. 11. The non-transitory computer-readable medium of claim 10, including instructions executable by the processing resource to process the data flow graph including instructions executable to optimize the data flow graph including the continuous connector operator. 12. A method for processing a hybrid flow containing a continuous flow comprising:
annotating a continuous flow as continuous and a finite flow as finite in a data flow graph of a hybrid flow; adding a continuous connector operator to the data flow graph of the hybrid flow to connect an output of the continuous flow to an input of the finite flow in response to identifying the annotated finite flow is a consumer of the annotated continuous flow; aggregating data from the continuous flow using the continuous connector operator; analyzing the aggregated data along the finite flow; revising the data flow graph of the hybrid flow to include a new flow and a new continuous connector operator based on the analysis of the aggregated data; and processing the revised data flow graph of the hybrid flow. 13. The method of claim 12, wherein revising the data flow graph to include the new flow and the new continuous connector operator includes creating the new flow in the data flow graph of the hybrid flow. 14. The method of claim 12, wherein revising the data flow graph to include the new flow and the new continuous connector operator includes creating the new continuous connector operator to replicate input data to the continuous data flow. 15. The method of claim 12, wherein processing the revised data flow graph of the hybrid flow includes outputting an alternative data flow graph of the hybrid flow with the lowest relative cost of a set of alternative data flow graphs based on an optimization objective. | 2,100 |
6,129 | 6,129 | 15,464,729 | 2,157 | A hierarchy is a multi-level linked structure of nodes, wherein the hierarchy represents data relating to a set of one or more items to be processed. Where there are multiple input hierarchies, it may improve the efficiency of the processing of the items to merge the input hierarchies to form a merged hierarchy. The hierarchies are merged by identifying two or more sub-hierarchies within the input hierarchies which are to be merged, and determining one or more nodes of the merged hierarchy which reference nodes of the identified sub-hierarchies. The determined nodes of the merged hierarchy are stored and indications of the references between the determined nodes of the merged hierarchy and the referenced nodes of the identified sub-hierarchies are also stored. In this way, the merged hierarchy is formed for use in processing the items. | 1. A method of merging a plurality of input hierarchies to form a merged hierarchy, wherein each of the input hierarchies is a multi-level linked structure of nodes, and wherein each of the input hierarchies represents data relating to a respective set of one or more items to be processed, the method comprising:
identifying two or more sub-hierarchies within the input hierarchies which are to be merged; determining one or more nodes of the merged hierarchy which reference nodes of the identified sub-hierarchies, wherein at least one of the referenced nodes within at least one of the identified sub-hierarchies references one or more lower-level nodes within said at least one of the identified sub-hierarchies; and storing said one or more determined nodes of the merged hierarchy and storing indications of the references between the determined nodes of the merged hierarchy and the referenced nodes of the identified sub-hierarchies, thereby forming the merged hierarchy for use in processing the items. 2. The method of claim 1 further comprising building one or more levels of nodes of the merged hierarchy above said determined nodes of the merged hierarchy, based on said determined nodes of the merged hierarchy. 3. The method of claim 2 wherein the one or more levels of the merged hierarchy above said determined nodes are built in a bottom-up manner. 4. The method of claim 1 wherein the top level of the merged hierarchy has a single node. 5. The method of claim 1 wherein said two or more sub-hierarchies within the input hierarchies which are to be merged are identified based on the amount of spatial overlap of said two or more sub-hierarchies. 6. The method of claim 1 wherein said identifying two or more sub-hierarchies within the input hierarchies which are to be merged comprises identifying nodes at a merging level within the input hierarchies, wherein the sub-hierarchies descend from the identified nodes at the merging level. 7. The method of claim 6 further comprising determining the merging level within the input hierarchies. 8. The method of claim 7 wherein the merging level is determined based on the amount of spatial overlap of nodes from the input hierarchies at different levels. 9. The method of claim 8 wherein the merging level is determined to be the lowest level at which the amount of spatial overlap of nodes from the input hierarchies is above a threshold. 10. The method of claim 7 wherein the merging level is determined to be:
a predetermined number of levels from the top level of the input hierarchies;
a predetermined proportion of the total number of levels in the input hierarchies from the top level of the input hierarchies; or
a user-specified level. 11. The method of claim 6 further comprising:
parsing the input hierarchies between the top level and the merging level to identify leaf nodes existing in those levels of the input hierarchies; and
including the identified leaf nodes in the merged hierarchy. 12. The method of claim 11 wherein said including the identified leaf nodes in the merged hierarchy comprises applying a translation to the leaf nodes of an input hierarchy. 13. The method of claim 1 wherein the merged hierarchy is for use in rendering a scene, and wherein each of the input hierarchies represents spatial positions of a respective set of one or more objects to be rendered in the scene. 14. The method of claim 13 wherein the scene is a current frame of a sequence of frames, wherein at least one of the input hierarchies is a static hierarchy which represents spatial positions of a set of one or more static objects and which is reused from a previous frame, and wherein at least another one of the input hierarchies is a dynamic hierarchy which represents spatial positions of a set of one or more dynamic objects and which is built for rendering the current frame. 15. The method of claim 13 further comprising applying a translation to one or more of the nodes of the input hierarchies. 16. The method of claim 13 wherein ray tracing is performed using the merged hierarchy to render the scene, wherein the ray tracing comprises performing intersection testing of rays against nodes of the merged hierarchy. 17. A hierarchy merging module configured to merge a plurality of input hierarchies to form a merged hierarchy, wherein each of the input hierarchies is a multi-level linked structure of nodes, and wherein each of the input hierarchies represents data relating to a respective set of one or more items to be processed, the hierarchy merging module comprising:
a merging determination unit configured to:
identify two or more sub-hierarchies within the input hierarchies which are to be merged; and
determine one or more nodes of the merged hierarchy which reference nodes of the identified sub-hierarchies, wherein at least one of the referenced nodes within at least one of the identified sub-hierarchies references one or more lower-level nodes within said at least one of the identified sub-hierarchies;
wherein the hierarchy merging module is configured to cause the storage of said one or more determined nodes of the merged hierarchy and indications of the references between the determined nodes of the merged hierarchy and the referenced nodes of the identified sub-hierarchies. 18. The hierarchy merging module of claim 17 wherein the merging determination unit is configured to identify said two or more sub-hierarchies within the input hierarchies which are to be merged based on the amount of spatial overlap of said two or more sub-hierarchies. 19. The hierarchy merging module of claim 17 wherein the merged hierarchy is for use in rendering a scene, and wherein each of the input hierarchies represents spatial positions of a respective set of one or more objects to be rendered in the scene, wherein said rendering a scene comprises performing ray tracing. 20. A non-transitory computer readable storage medium having stored thereon a computer readable description of an integrated circuit that, when processed in an integrated circuit manufacturing system, causes the integrated circuit manufacturing system to manufacture a hierarchy merging module which is configured to merge a plurality of input hierarchies to form a merged hierarchy, wherein each of the input hierarchies is a multi-level linked structure of nodes, and wherein each of the input hierarchies represents data relating to a respective set of one or more items to be processed, the hierarchy merging module comprising:
a merging determination unit configured to:
identify two or more sub-hierarchies within the input hierarchies which are to be merged; and
determine one or more nodes of the merged hierarchy which reference nodes of the identified sub-hierarchies, wherein at least one of the referenced nodes within at least one of the identified sub-hierarchies references one or more lower-level nodes within said at least one of the identified sub-hierarchies;
wherein the hierarchy merging module is configured to cause the storage of said one or more determined nodes of the merged hierarchy and indications of the references between the determined nodes of the merged hierarchy and the referenced nodes of the identified sub-hierarchies. | A hierarchy is a multi-level linked structure of nodes, wherein the hierarchy represents data relating to a set of one or more items to be processed. Where there are multiple input hierarchies, it may improve the efficiency of the processing of the items to merge the input hierarchies to form a merged hierarchy. The hierarchies are merged by identifying two or more sub-hierarchies within the input hierarchies which are to be merged, and determining one or more nodes of the merged hierarchy which reference nodes of the identified sub-hierarchies. The determined nodes of the merged hierarchy are stored and indications of the references between the determined nodes of the merged hierarchy and the referenced nodes of the identified sub-hierarchies are also stored. In this way, the merged hierarchy is formed for use in processing the items.1. A method of merging a plurality of input hierarchies to form a merged hierarchy, wherein each of the input hierarchies is a multi-level linked structure of nodes, and wherein each of the input hierarchies represents data relating to a respective set of one or more items to be processed, the method comprising:
identifying two or more sub-hierarchies within the input hierarchies which are to be merged; determining one or more nodes of the merged hierarchy which reference nodes of the identified sub-hierarchies, wherein at least one of the referenced nodes within at least one of the identified sub-hierarchies references one or more lower-level nodes within said at least one of the identified sub-hierarchies; and storing said one or more determined nodes of the merged hierarchy and storing indications of the references between the determined nodes of the merged hierarchy and the referenced nodes of the identified sub-hierarchies, thereby forming the merged hierarchy for use in processing the items. 2. The method of claim 1 further comprising building one or more levels of nodes of the merged hierarchy above said determined nodes of the merged hierarchy, based on said determined nodes of the merged hierarchy. 3. The method of claim 2 wherein the one or more levels of the merged hierarchy above said determined nodes are built in a bottom-up manner. 4. The method of claim 1 wherein the top level of the merged hierarchy has a single node. 5. The method of claim 1 wherein said two or more sub-hierarchies within the input hierarchies which are to be merged are identified based on the amount of spatial overlap of said two or more sub-hierarchies. 6. The method of claim 1 wherein said identifying two or more sub-hierarchies within the input hierarchies which are to be merged comprises identifying nodes at a merging level within the input hierarchies, wherein the sub-hierarchies descend from the identified nodes at the merging level. 7. The method of claim 6 further comprising determining the merging level within the input hierarchies. 8. The method of claim 7 wherein the merging level is determined based on the amount of spatial overlap of nodes from the input hierarchies at different levels. 9. The method of claim 8 wherein the merging level is determined to be the lowest level at which the amount of spatial overlap of nodes from the input hierarchies is above a threshold. 10. The method of claim 7 wherein the merging level is determined to be:
a predetermined number of levels from the top level of the input hierarchies;
a predetermined proportion of the total number of levels in the input hierarchies from the top level of the input hierarchies; or
a user-specified level. 11. The method of claim 6 further comprising:
parsing the input hierarchies between the top level and the merging level to identify leaf nodes existing in those levels of the input hierarchies; and
including the identified leaf nodes in the merged hierarchy. 12. The method of claim 11 wherein said including the identified leaf nodes in the merged hierarchy comprises applying a translation to the leaf nodes of an input hierarchy. 13. The method of claim 1 wherein the merged hierarchy is for use in rendering a scene, and wherein each of the input hierarchies represents spatial positions of a respective set of one or more objects to be rendered in the scene. 14. The method of claim 13 wherein the scene is a current frame of a sequence of frames, wherein at least one of the input hierarchies is a static hierarchy which represents spatial positions of a set of one or more static objects and which is reused from a previous frame, and wherein at least another one of the input hierarchies is a dynamic hierarchy which represents spatial positions of a set of one or more dynamic objects and which is built for rendering the current frame. 15. The method of claim 13 further comprising applying a translation to one or more of the nodes of the input hierarchies. 16. The method of claim 13 wherein ray tracing is performed using the merged hierarchy to render the scene, wherein the ray tracing comprises performing intersection testing of rays against nodes of the merged hierarchy. 17. A hierarchy merging module configured to merge a plurality of input hierarchies to form a merged hierarchy, wherein each of the input hierarchies is a multi-level linked structure of nodes, and wherein each of the input hierarchies represents data relating to a respective set of one or more items to be processed, the hierarchy merging module comprising:
a merging determination unit configured to:
identify two or more sub-hierarchies within the input hierarchies which are to be merged; and
determine one or more nodes of the merged hierarchy which reference nodes of the identified sub-hierarchies, wherein at least one of the referenced nodes within at least one of the identified sub-hierarchies references one or more lower-level nodes within said at least one of the identified sub-hierarchies;
wherein the hierarchy merging module is configured to cause the storage of said one or more determined nodes of the merged hierarchy and indications of the references between the determined nodes of the merged hierarchy and the referenced nodes of the identified sub-hierarchies. 18. The hierarchy merging module of claim 17 wherein the merging determination unit is configured to identify said two or more sub-hierarchies within the input hierarchies which are to be merged based on the amount of spatial overlap of said two or more sub-hierarchies. 19. The hierarchy merging module of claim 17 wherein the merged hierarchy is for use in rendering a scene, and wherein each of the input hierarchies represents spatial positions of a respective set of one or more objects to be rendered in the scene, wherein said rendering a scene comprises performing ray tracing. 20. A non-transitory computer readable storage medium having stored thereon a computer readable description of an integrated circuit that, when processed in an integrated circuit manufacturing system, causes the integrated circuit manufacturing system to manufacture a hierarchy merging module which is configured to merge a plurality of input hierarchies to form a merged hierarchy, wherein each of the input hierarchies is a multi-level linked structure of nodes, and wherein each of the input hierarchies represents data relating to a respective set of one or more items to be processed, the hierarchy merging module comprising:
a merging determination unit configured to:
identify two or more sub-hierarchies within the input hierarchies which are to be merged; and
determine one or more nodes of the merged hierarchy which reference nodes of the identified sub-hierarchies, wherein at least one of the referenced nodes within at least one of the identified sub-hierarchies references one or more lower-level nodes within said at least one of the identified sub-hierarchies;
wherein the hierarchy merging module is configured to cause the storage of said one or more determined nodes of the merged hierarchy and indications of the references between the determined nodes of the merged hierarchy and the referenced nodes of the identified sub-hierarchies. | 2,100 |
6,130 | 6,130 | 14,923,703 | 2,169 | Embodiments of the invention provide a novel method, system and computer program product for linked data driven semantic data storage and access utilizing horizontal reification. In an embodiment of the invention, the method includes creating data for linked data access in a data store and computing meta-data regarding the created data. The method additionally includes encapsulating the created data and the meta-data into a set of multiple different triples. Finally, the method includes reducing the set of multiple different triples pertaining to the created data into a single multi-column record specifying the created data combined with additional columns referencing reification data. | 1. A method for linked data driven semantic data storage and access utilizing horizontal reification, comprising:
creating data for linked data access in a data store; computing meta-data regarding the created data; encapsulating the created data and the meta-data into a set of multiple different triples in a triple store; and, reducing the set of multiple different triples in the triple store pertaining to the created data into a single multi-column record specifying the created data combined with additional columns referencing reification data. 2. The method of claim 1, further comprising:
receiving from a requestor from over a computer communications network, a linked data request to retrieve the created data; identifying the multi-column record in the triple store storing the created data; expanding the multi-column record into a set of multiple different triples using the reification data referenced in the additional columns; and, returning the set of triples to the requestor over the computer communications network. 3. The method of claim 2, wherein the triples are reduced by removing redundantly present data in the meta-data of the data triples, and wherein the multi-column record is expanded by adding the removed redundantly present data. 4. The method of claim 1, wherein the reification data includes a reification uniform resource identifier (URI) and an identity of an end user creating the created data. 5. A data processing system configured for linked data driven semantic data storage and access utilizing horizontal reification, the system comprising:
a host computing system comprising at least one computer with memory and at least one processor, the host computing system being communicatively coupled to other computers over a computer communications network; a database coupled to the host computing system and storing linked data; and, a linked data driven semantic data storage and access module executing in the memory of the host computing system, the module comprising program code enabled to create data for linked data access in a data store, to compute meta-data regarding the created data, to encapsulate the created data and the meta-data into a set of multiple different triples in a set of triples, and to reduce the set of multiple different triples pertaining to the created data into a single multi-column record specifying the created data combined with additional columns referencing reification data. 6. The system of claim 5, wherein the program code of the module is further enabled to receive from a requestor from over a computer communications network, a linked data request to retrieve the created data, to identify the multi-column record storing the created data, to expand the multi-column record into a set of multiple different using the reification data referenced in the additional columns, and to return the resulting set of triples to the requestor over the computer communications network. 7. The system of claim 6, wherein the triples are reduced by removing redundantly present data in the meta-data, and wherein the multi-column record is expanded by adding the removed redundantly present data. 8. The system of claim 6, wherein the reification data includes a reification uniform resource identifier (URI) and an identity of an end user creating the created data. 9. A computer program product for linked data driven semantic data storage and access utilizing horizontal reification, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to perform a method comprising:
creating data for linked data access in a data store; computing meta-data regarding the created data; encapsulating the created data and the meta-data into a set of multiple different triples; and, reducing the set of multiple different triples pertaining to the created data into a single multi-column record specifying the created data combined with the meta-data. 10. The computer program product of claim 9, wherein the method further comprises:
receiving from a requestor from over a computer communications network, a linked data request to retrieve the created data; identifying the multi-column record storing the created data; expanding the multi-column record into a set of multiple different triples using the reification data referenced in the additional columns; and, returning the resulting set of triples to the requestor over the computer communications network. 11. The computer program product of claim 10, wherein the triples are reduced by removing redundantly present data in the meta-data, and wherein the multi-column record is expanded by adding the removed redundantly present data. 12. The computer program product of claim 9, wherein the reification data includes a reification uniform resource identifier (URI) and an identity of an end user creating the created data. | Embodiments of the invention provide a novel method, system and computer program product for linked data driven semantic data storage and access utilizing horizontal reification. In an embodiment of the invention, the method includes creating data for linked data access in a data store and computing meta-data regarding the created data. The method additionally includes encapsulating the created data and the meta-data into a set of multiple different triples. Finally, the method includes reducing the set of multiple different triples pertaining to the created data into a single multi-column record specifying the created data combined with additional columns referencing reification data.1. A method for linked data driven semantic data storage and access utilizing horizontal reification, comprising:
creating data for linked data access in a data store; computing meta-data regarding the created data; encapsulating the created data and the meta-data into a set of multiple different triples in a triple store; and, reducing the set of multiple different triples in the triple store pertaining to the created data into a single multi-column record specifying the created data combined with additional columns referencing reification data. 2. The method of claim 1, further comprising:
receiving from a requestor from over a computer communications network, a linked data request to retrieve the created data; identifying the multi-column record in the triple store storing the created data; expanding the multi-column record into a set of multiple different triples using the reification data referenced in the additional columns; and, returning the set of triples to the requestor over the computer communications network. 3. The method of claim 2, wherein the triples are reduced by removing redundantly present data in the meta-data of the data triples, and wherein the multi-column record is expanded by adding the removed redundantly present data. 4. The method of claim 1, wherein the reification data includes a reification uniform resource identifier (URI) and an identity of an end user creating the created data. 5. A data processing system configured for linked data driven semantic data storage and access utilizing horizontal reification, the system comprising:
a host computing system comprising at least one computer with memory and at least one processor, the host computing system being communicatively coupled to other computers over a computer communications network; a database coupled to the host computing system and storing linked data; and, a linked data driven semantic data storage and access module executing in the memory of the host computing system, the module comprising program code enabled to create data for linked data access in a data store, to compute meta-data regarding the created data, to encapsulate the created data and the meta-data into a set of multiple different triples in a set of triples, and to reduce the set of multiple different triples pertaining to the created data into a single multi-column record specifying the created data combined with additional columns referencing reification data. 6. The system of claim 5, wherein the program code of the module is further enabled to receive from a requestor from over a computer communications network, a linked data request to retrieve the created data, to identify the multi-column record storing the created data, to expand the multi-column record into a set of multiple different using the reification data referenced in the additional columns, and to return the resulting set of triples to the requestor over the computer communications network. 7. The system of claim 6, wherein the triples are reduced by removing redundantly present data in the meta-data, and wherein the multi-column record is expanded by adding the removed redundantly present data. 8. The system of claim 6, wherein the reification data includes a reification uniform resource identifier (URI) and an identity of an end user creating the created data. 9. A computer program product for linked data driven semantic data storage and access utilizing horizontal reification, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to perform a method comprising:
creating data for linked data access in a data store; computing meta-data regarding the created data; encapsulating the created data and the meta-data into a set of multiple different triples; and, reducing the set of multiple different triples pertaining to the created data into a single multi-column record specifying the created data combined with the meta-data. 10. The computer program product of claim 9, wherein the method further comprises:
receiving from a requestor from over a computer communications network, a linked data request to retrieve the created data; identifying the multi-column record storing the created data; expanding the multi-column record into a set of multiple different triples using the reification data referenced in the additional columns; and, returning the resulting set of triples to the requestor over the computer communications network. 11. The computer program product of claim 10, wherein the triples are reduced by removing redundantly present data in the meta-data, and wherein the multi-column record is expanded by adding the removed redundantly present data. 12. The computer program product of claim 9, wherein the reification data includes a reification uniform resource identifier (URI) and an identity of an end user creating the created data. | 2,100 |
6,131 | 6,131 | 12,697,013 | 2,156 | Computer-implemented systems and methods are provided that include receiving data or metadata for first content or data or metadata related to the first content. A first alternative for the first content is generated, where the first alternative is based upon the data or metadata for the first content or data or metadata for content related to the first content. A selection of the first alternative is received, where the selection of the first alternative generates first additional data or metadata for the first content or first additional data or metadata for content related to the first content. One or more second alternatives corresponding to the first content are dynamically generated, where a second alternative in the one or more second alternatives is based upon the generated first additional data or metadata for the first content or first additional data or metadata for content related to the first content. | 1. A method, comprising:
receiving, using one or more processors, (i) data or metadata for first content, or (ii) data or metadata related to the first content; generating a first alternative for the first content, wherein the first alternative is based upon the (i) data or metadata for the first content, or (ii) data or metadata for content related to the first content; receiving a selection of the first alternative, wherein the selection of the first alternative generates (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content; and dynamically generating one or more second alternatives corresponding to the first content, wherein a second alternative in the one or more second alternatives is based upon the generated (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content. 2. The method of claim 1, wherein the (i) data or metadata for the first content, or (ii) data or metadata content related to the first content includes one or more individually weighted content attributes. 3. The method of claim 2, wherein the one or more individually weighted content attributes comprises one or more of a genre, a country of origin, a spoken language, a subtitle, a release date, a professional or government certification or rating, a selection by one or more industry festivals or events, a nomination or grant of one or more awards, or a list of participants in the first content. 4. The method of claim 2, wherein the one or more individually weighted content attributes comprises a grouping or subgrouping of a plurality of user interactions with the first content as measured against a plurality of user interactions with second media content of a different content than the first content. 5. The method of claim 1, wherein the data or metadata for the first content or the data or metadata for content related to the first content further includes data or metadata corresponding to one or more attributes of the first alternative. 6. The method of claim 5, wherein the data or metadata corresponding to one or more attributes of the first alternative comprises one or more of the terms, validity or access rights of the first alternative. 7. The method of claim 1, wherein the data or metadata for the first content or the data or metadata for content related to the first content further includes data or metadata corresponding to the context of the selection of the first alternative. 8. The method of claim 7, wherein the data or metadata corresponding to the context of the selection of the first alternative comprises a demographic of a selector of the first alternative. 9. The method of claim 7, wherein the data or metadata corresponding to the context of the selection of the first alternative comprises a grouping or subgrouping of a plurality of selectors of the first alternative based on a history of a plurality of selections of the first alternative as measured against a plurality of selections of alternatives corresponding to the first content other than the first alternative. 10. The method of claim 1, wherein a second alternative in the one or more second alternatives is generated concurrently with the first alternative. 11. The method of claim 1, wherein a second alternative in the one of more of second alternatives is generated at a different time than the first alternative. 12. The method of claim 1, further comprising receiving a selection of a second alternative in the one or more second alternatives, wherein the selection of the second alternative generates (i) second additional data or metadata for the first content, or (ii) second additional data or metadata for content related to the first content. 13. The method of claim 12, further comprising dynamically generating one or more third alternatives corresponding to the first content, wherein the one or more third alternatives are based upon the generated (i) second additional data or metadata for the first content, or (ii) second additional data or metadata for content related to the first content. 14. The method of claim 1, wherein a second alternative in the one or more of the second alternatives is dynamically generated after receiving the selection of the first alternative. 15. The method of claim 14, wherein the dynamically generating comprises:
informing a content provider that the first alternative or one of the one or more second alternatives has been selected; receiving instructions to construct one or more third alternatives in real-time; constructing one or more third alternatives in real-time; and communicating the one or more third alternatives. 16. The method of claim 15, wherein the informing further comprises:
processing the (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content to generate statistics, wherein the generated statistics are used to generate one or more reports; and communicating the one or more reports to the content provider. 17. The method of claim 16, wherein the processing further comprises comparing the statistics to a predetermined threshold. 18. The method of claim 1, wherein the first alternative and any combination of the one or more second alternatives can each be independently activated or deactivated. 19. The method of claim 1, the method further comprising running the first alternative and any combination of the one or more second alternatives concurrently. 20. The method of claim 1, the method further comprising:
suspending a first selected alternative in a set comprising the first alternative and the one or more second alternatives when a second selected alternative is selected from the set, and automatically reinstating the first selected alternative upon completion of the second selected alternative. 21. The method of claim 1, the method further comprising terminating an alternative in the set comprising the first alternative and the one or more second alternatives when another alternative in the set is selected. 22. The method of claim 1, wherein the first alternative is an offer to use the first content for a first predetermined amount of time, and wherein a second alternative in the one or more of the second alternatives comprises an offer to use the first content for a second predetermined amount of time, wherein the first predetermined amount of time is different from the second predetermined amount of time. 23. The method of claim 1, wherein the first alternative is generated for the first content, and wherein each second alternative in the one or more of the second alternatives is respectively generated for a different second content, wherein each said different second content is uniquely different than, but related to, the first content. 24. The method of claim 1, wherein the first alternative is a first format of the first content and each of the one or more second alternatives is respectively a second format of the first content, wherein each said different second format is uniquely different from the first format. 25. A computer-implemented, comprising:
a data processor; a computer-readable memory encoded with instructions for commanding the data processor to perform steps, including:
receiving (i) data or metadata for first content, or (ii) data or metadata related to the first content;
generating a first alternative for the first content, wherein the first alternative is based upon the (i) data or metadata for the first content, or (ii) data or metadata for content related to the first content;
receiving a selection of the first alternative, wherein the selection of the first alternative generates (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content; and
dynamically generating one or more second alternatives corresponding to the first content, wherein a second alternative in the one or more second alternatives is based upon the generated (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content. 26. The system of claim 25, wherein the (i) data or metadata for the first content, or (ii) data or metadata content related to the first content includes one or more individually weighted content attributes. 27. The system of claim 26, wherein the one or more individually weighted content attributes comprises one or more of a genre, a country of origin, a spoken language, a subtitle, a release date, a professional or government certification or rating, a selection by one or more industry festivals or events, a nomination or grant of one or more awards, or a list of participants in the first content. 28. The system of claim 26, wherein the one or more individually weighted content attributes comprises a grouping or subgrouping of a plurality of user interactions with the first content as measured against a plurality of user interactions with second media content of a different content than the first content. 29. The system of claim 25, wherein the data or metadata for the first content or the data or metadata for content related to the first content further includes data or metadata corresponding to one or more attributes of the first alternative. 30. The system of claim 29, wherein the data or metadata corresponding to one or more attributes of the first alternative comprises one or more of the terms, validity or access rights of the first alternative. 31. The system of claim 25, wherein the data or metadata for the first content or the data or metadata for content related to the first content further includes data or metadata corresponding to the context of the selection of the first alternative. 32. The system of claim 31, wherein the data or metadata corresponding to the context of the selection of the first alternative comprises a demographic of a selector of the first alternative. 33. The system of claim 31, wherein the data or metadata corresponding to the context of the selection of the first alternative comprises a grouping or subgrouping of a plurality of selectors of the first alternative based on a history of a plurality of selections of the first alternative as measured against a plurality of selections of alternatives corresponding to the first content other than the first alternative. 34. The system of claim 25, wherein a second alternative in the one or more second alternatives is generated concurrently with the first alternative. 35. The system of claim 25, wherein a second alternative in the one of more of second alternatives is generated at a different time than the first alternative. 36. The system of claim 25, wherein the steps further include receiving a selection of a second alternative in the one or more second alternatives, wherein the selection of the second alternative generates (i) second additional data or metadata for the first content, or (ii) second additional data or metadata for content related to the first content. 37. The system of claim 36, wherein the steps further include dynamically generating one or more third alternatives corresponding to the first content, wherein the one or more third alternatives are based upon the generated (i) second additional data or metadata for the first content, or (ii) second additional data or metadata for content related to the first content. 38. The system of claim 25, wherein a second alternative in the one or more of the second alternatives is dynamically generated after receiving the selection of the first alternative. 39. The system of claim 38, wherein the dynamically generating comprises:
informing a content provider that the first alternative or one of the one or more second alternatives has been selected; receiving instructions to construct one or more third alternatives in real-time; constructing one or more third alternatives in real-time; and communicating the one or more third alternatives. 40. The system of claim 39, wherein the informing further comprises:
processing the (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content to generate statistics, wherein the generated statistics are used to generate one or more reports; and communicating the one or more reports to the content provider. 41. The system of claim 40, wherein the processing further comprises comparing the statistics to a predetermined threshold. 42. The system of claim 25, wherein the first alternative and any combination of the one or more second alternatives can each be independently activated or deactivated. 43. The system of claim 25, wherein the steps further include running the first alternative and any combination of the one or more second alternatives concurrently. 44. The system of claim 25, wherein the steps further include:
suspending a first selected alternative in a set comprising the first alternative and the one or more second alternatives when a second selected alternative is selected from the set, and automatically reinstating the first selected alternative upon completion of the second selected alternative. 45. The system of claim 25, wherein the steps further include terminating an alternative in the set comprising the first alternative and the one or more second alternatives when another alternative in the set is selected. 46. The system of claim 25, wherein the first alternative is an offer to use the first content for a first predetermined amount of time, and wherein a second alternative in the one or more of the second alternatives comprises an offer to use the first content for a second predetermined amount of time, wherein the first predetermined amount of time is different from the second predetermined amount of time. 47. The system of claim 25, wherein the first alternative is generated for the first content, and wherein each second alternative in the one or more of the second alternatives is respectively generated for a different second content, wherein each said different second content is uniquely different than, but related to, the first content. 48. The system of claim 25, wherein the first alternative is a first format of the first content and each of the one or more second alternatives is respectively a second format of the first content, wherein each said different second format is uniquely different from the first format. | Computer-implemented systems and methods are provided that include receiving data or metadata for first content or data or metadata related to the first content. A first alternative for the first content is generated, where the first alternative is based upon the data or metadata for the first content or data or metadata for content related to the first content. A selection of the first alternative is received, where the selection of the first alternative generates first additional data or metadata for the first content or first additional data or metadata for content related to the first content. One or more second alternatives corresponding to the first content are dynamically generated, where a second alternative in the one or more second alternatives is based upon the generated first additional data or metadata for the first content or first additional data or metadata for content related to the first content.1. A method, comprising:
receiving, using one or more processors, (i) data or metadata for first content, or (ii) data or metadata related to the first content; generating a first alternative for the first content, wherein the first alternative is based upon the (i) data or metadata for the first content, or (ii) data or metadata for content related to the first content; receiving a selection of the first alternative, wherein the selection of the first alternative generates (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content; and dynamically generating one or more second alternatives corresponding to the first content, wherein a second alternative in the one or more second alternatives is based upon the generated (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content. 2. The method of claim 1, wherein the (i) data or metadata for the first content, or (ii) data or metadata content related to the first content includes one or more individually weighted content attributes. 3. The method of claim 2, wherein the one or more individually weighted content attributes comprises one or more of a genre, a country of origin, a spoken language, a subtitle, a release date, a professional or government certification or rating, a selection by one or more industry festivals or events, a nomination or grant of one or more awards, or a list of participants in the first content. 4. The method of claim 2, wherein the one or more individually weighted content attributes comprises a grouping or subgrouping of a plurality of user interactions with the first content as measured against a plurality of user interactions with second media content of a different content than the first content. 5. The method of claim 1, wherein the data or metadata for the first content or the data or metadata for content related to the first content further includes data or metadata corresponding to one or more attributes of the first alternative. 6. The method of claim 5, wherein the data or metadata corresponding to one or more attributes of the first alternative comprises one or more of the terms, validity or access rights of the first alternative. 7. The method of claim 1, wherein the data or metadata for the first content or the data or metadata for content related to the first content further includes data or metadata corresponding to the context of the selection of the first alternative. 8. The method of claim 7, wherein the data or metadata corresponding to the context of the selection of the first alternative comprises a demographic of a selector of the first alternative. 9. The method of claim 7, wherein the data or metadata corresponding to the context of the selection of the first alternative comprises a grouping or subgrouping of a plurality of selectors of the first alternative based on a history of a plurality of selections of the first alternative as measured against a plurality of selections of alternatives corresponding to the first content other than the first alternative. 10. The method of claim 1, wherein a second alternative in the one or more second alternatives is generated concurrently with the first alternative. 11. The method of claim 1, wherein a second alternative in the one of more of second alternatives is generated at a different time than the first alternative. 12. The method of claim 1, further comprising receiving a selection of a second alternative in the one or more second alternatives, wherein the selection of the second alternative generates (i) second additional data or metadata for the first content, or (ii) second additional data or metadata for content related to the first content. 13. The method of claim 12, further comprising dynamically generating one or more third alternatives corresponding to the first content, wherein the one or more third alternatives are based upon the generated (i) second additional data or metadata for the first content, or (ii) second additional data or metadata for content related to the first content. 14. The method of claim 1, wherein a second alternative in the one or more of the second alternatives is dynamically generated after receiving the selection of the first alternative. 15. The method of claim 14, wherein the dynamically generating comprises:
informing a content provider that the first alternative or one of the one or more second alternatives has been selected; receiving instructions to construct one or more third alternatives in real-time; constructing one or more third alternatives in real-time; and communicating the one or more third alternatives. 16. The method of claim 15, wherein the informing further comprises:
processing the (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content to generate statistics, wherein the generated statistics are used to generate one or more reports; and communicating the one or more reports to the content provider. 17. The method of claim 16, wherein the processing further comprises comparing the statistics to a predetermined threshold. 18. The method of claim 1, wherein the first alternative and any combination of the one or more second alternatives can each be independently activated or deactivated. 19. The method of claim 1, the method further comprising running the first alternative and any combination of the one or more second alternatives concurrently. 20. The method of claim 1, the method further comprising:
suspending a first selected alternative in a set comprising the first alternative and the one or more second alternatives when a second selected alternative is selected from the set, and automatically reinstating the first selected alternative upon completion of the second selected alternative. 21. The method of claim 1, the method further comprising terminating an alternative in the set comprising the first alternative and the one or more second alternatives when another alternative in the set is selected. 22. The method of claim 1, wherein the first alternative is an offer to use the first content for a first predetermined amount of time, and wherein a second alternative in the one or more of the second alternatives comprises an offer to use the first content for a second predetermined amount of time, wherein the first predetermined amount of time is different from the second predetermined amount of time. 23. The method of claim 1, wherein the first alternative is generated for the first content, and wherein each second alternative in the one or more of the second alternatives is respectively generated for a different second content, wherein each said different second content is uniquely different than, but related to, the first content. 24. The method of claim 1, wherein the first alternative is a first format of the first content and each of the one or more second alternatives is respectively a second format of the first content, wherein each said different second format is uniquely different from the first format. 25. A computer-implemented, comprising:
a data processor; a computer-readable memory encoded with instructions for commanding the data processor to perform steps, including:
receiving (i) data or metadata for first content, or (ii) data or metadata related to the first content;
generating a first alternative for the first content, wherein the first alternative is based upon the (i) data or metadata for the first content, or (ii) data or metadata for content related to the first content;
receiving a selection of the first alternative, wherein the selection of the first alternative generates (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content; and
dynamically generating one or more second alternatives corresponding to the first content, wherein a second alternative in the one or more second alternatives is based upon the generated (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content. 26. The system of claim 25, wherein the (i) data or metadata for the first content, or (ii) data or metadata content related to the first content includes one or more individually weighted content attributes. 27. The system of claim 26, wherein the one or more individually weighted content attributes comprises one or more of a genre, a country of origin, a spoken language, a subtitle, a release date, a professional or government certification or rating, a selection by one or more industry festivals or events, a nomination or grant of one or more awards, or a list of participants in the first content. 28. The system of claim 26, wherein the one or more individually weighted content attributes comprises a grouping or subgrouping of a plurality of user interactions with the first content as measured against a plurality of user interactions with second media content of a different content than the first content. 29. The system of claim 25, wherein the data or metadata for the first content or the data or metadata for content related to the first content further includes data or metadata corresponding to one or more attributes of the first alternative. 30. The system of claim 29, wherein the data or metadata corresponding to one or more attributes of the first alternative comprises one or more of the terms, validity or access rights of the first alternative. 31. The system of claim 25, wherein the data or metadata for the first content or the data or metadata for content related to the first content further includes data or metadata corresponding to the context of the selection of the first alternative. 32. The system of claim 31, wherein the data or metadata corresponding to the context of the selection of the first alternative comprises a demographic of a selector of the first alternative. 33. The system of claim 31, wherein the data or metadata corresponding to the context of the selection of the first alternative comprises a grouping or subgrouping of a plurality of selectors of the first alternative based on a history of a plurality of selections of the first alternative as measured against a plurality of selections of alternatives corresponding to the first content other than the first alternative. 34. The system of claim 25, wherein a second alternative in the one or more second alternatives is generated concurrently with the first alternative. 35. The system of claim 25, wherein a second alternative in the one of more of second alternatives is generated at a different time than the first alternative. 36. The system of claim 25, wherein the steps further include receiving a selection of a second alternative in the one or more second alternatives, wherein the selection of the second alternative generates (i) second additional data or metadata for the first content, or (ii) second additional data or metadata for content related to the first content. 37. The system of claim 36, wherein the steps further include dynamically generating one or more third alternatives corresponding to the first content, wherein the one or more third alternatives are based upon the generated (i) second additional data or metadata for the first content, or (ii) second additional data or metadata for content related to the first content. 38. The system of claim 25, wherein a second alternative in the one or more of the second alternatives is dynamically generated after receiving the selection of the first alternative. 39. The system of claim 38, wherein the dynamically generating comprises:
informing a content provider that the first alternative or one of the one or more second alternatives has been selected; receiving instructions to construct one or more third alternatives in real-time; constructing one or more third alternatives in real-time; and communicating the one or more third alternatives. 40. The system of claim 39, wherein the informing further comprises:
processing the (i) first additional data or metadata for the first content, or (ii) first additional data or metadata for content related to the first content to generate statistics, wherein the generated statistics are used to generate one or more reports; and communicating the one or more reports to the content provider. 41. The system of claim 40, wherein the processing further comprises comparing the statistics to a predetermined threshold. 42. The system of claim 25, wherein the first alternative and any combination of the one or more second alternatives can each be independently activated or deactivated. 43. The system of claim 25, wherein the steps further include running the first alternative and any combination of the one or more second alternatives concurrently. 44. The system of claim 25, wherein the steps further include:
suspending a first selected alternative in a set comprising the first alternative and the one or more second alternatives when a second selected alternative is selected from the set, and automatically reinstating the first selected alternative upon completion of the second selected alternative. 45. The system of claim 25, wherein the steps further include terminating an alternative in the set comprising the first alternative and the one or more second alternatives when another alternative in the set is selected. 46. The system of claim 25, wherein the first alternative is an offer to use the first content for a first predetermined amount of time, and wherein a second alternative in the one or more of the second alternatives comprises an offer to use the first content for a second predetermined amount of time, wherein the first predetermined amount of time is different from the second predetermined amount of time. 47. The system of claim 25, wherein the first alternative is generated for the first content, and wherein each second alternative in the one or more of the second alternatives is respectively generated for a different second content, wherein each said different second content is uniquely different than, but related to, the first content. 48. The system of claim 25, wherein the first alternative is a first format of the first content and each of the one or more second alternatives is respectively a second format of the first content, wherein each said different second format is uniquely different from the first format. | 2,100 |
6,132 | 6,132 | 14,208,866 | 2,169 | A system and method may aggregate into a data structure property information from multiple databases, e.g., from all records included in those databases, and upon selection of any subject property or a characteristic thereof curates the often imperfect and discrepant property information to create suggested values. Similarly, the system and method may perform an on-the-fly evaluation of any characteristic of a selected record, when the property information for that characteristic includes an unlikely value, by triggering from the data structure a dynamic extraction of property information corresponding to a subject property of the selected record, where the dynamic extraction further generates and compares a suggested value to the unlikely value. | 1. A method for providing a set of collapsed values for a subject property, the method comprising:
aggregating records from a plurality of databases into a first data structure; accumulating on a characteristic basis from the first data structure property information of the records particular to the subject property; and curating on the characteristic basis the property information to generate the set of collapsed values. 2. The method of claim 1, wherein accumulating the property information includes:
creating second data structures, each of the second data structures corresponding to a characteristic of the subject property; and sorting each instance of the property information from the first data structure to a respective second data structure based on a characteristic of that instance. 3. The method of claim 2, wherein the first data structure is a comprehensive stack and each second data structure is a sub-stack. 4. The method of claim 1, wherein curating the property information includes:
utilizing a heuristic to calculate each collapsed value on the characteristic basis for the accumulated property information. 5. The method of claim 1, wherein each collapsed value is a most recent property descriptor for a related characteristic of the subject property 6. The method of claim 1, further comprising:
receiving an identifier indicating the subject property; accumulating on a characteristic basis from the first data structure the property information upon receiving the identifier. 7. The method of claim 1, further comprising:
receiving an identifier indicating the plurality of databases has been updated with additional records; and aggregating into the first data structure the additional records from the plurality of databases. 8. The method of claim 1, further comprising:
presenting via selectable fields of a first interface the set of collapsed values. 9. The method of claim 8, further comprising:
receiving an input indicating a first selectable field of the selectable fields; and presenting via a second interface the property information underlying a collapsed value of the one of the first selectable field. 10. The method of claim 9, further comprising:
filtering based on privileges the property information underlying the collapsed value of the one of the first selectable field. 11. A computer-readable medium tangibly embodying computer-executable instructions for providing a set of collapsed values for a subject property, that are executable by a processor to cause operations comprising:
aggregating records from a plurality of databases into a first data structure; accumulating from the first data structure property information of the records particular to the subject property on a characteristic basis; and curating on the characteristic basis the property information to generate the set of collapsed values. 12. The medium of claim 11, wherein accumulating the property information includes:
creating second data structures, each of the second data structures corresponding to a characteristic of the subject property; and sorting each instance of the property information from the first data structure to a respective second data structure based on a characteristic of that instance. 13. The medium of claim 12, wherein the first data structure is a comprehensive stack and each second data structure is a sub-stack. 14. The medium of claim 11, wherein curating the property information includes:
utilizing a heuristic to calculate each collapsed value on the characteristic basis for the accumulated property information. 15. The medium of claim 11, wherein each collapsed value is a most recent property descriptor for a related characteristic of the subject property 16. The medium of claim 11, further comprising:
receiving an identifier indicating the subject property; accumulating on a characteristic basis from the first data structure the property information upon receiving the identifier. 17. The medium of claim 11, further comprising:
receiving an identifier indicating the plurality of databases has been updated with additional records; and aggregating into the first data structure the additional records from the plurality of databases. 18. The medium of claim 11, further comprising:
presenting via selectable fields of a first interface the set of collapsed values. 19. The medium of claim 18, further comprising:
receiving an input indicating a first selectable field of the selectable fields; and presenting via a second interface the property information underlying a collapsed value of the one of the first selectable field. 20. The medium of claim 19, further comprising:
filtering based on privileges the property information underlying the collapsed value of the one of the first selectable field. | A system and method may aggregate into a data structure property information from multiple databases, e.g., from all records included in those databases, and upon selection of any subject property or a characteristic thereof curates the often imperfect and discrepant property information to create suggested values. Similarly, the system and method may perform an on-the-fly evaluation of any characteristic of a selected record, when the property information for that characteristic includes an unlikely value, by triggering from the data structure a dynamic extraction of property information corresponding to a subject property of the selected record, where the dynamic extraction further generates and compares a suggested value to the unlikely value.1. A method for providing a set of collapsed values for a subject property, the method comprising:
aggregating records from a plurality of databases into a first data structure; accumulating on a characteristic basis from the first data structure property information of the records particular to the subject property; and curating on the characteristic basis the property information to generate the set of collapsed values. 2. The method of claim 1, wherein accumulating the property information includes:
creating second data structures, each of the second data structures corresponding to a characteristic of the subject property; and sorting each instance of the property information from the first data structure to a respective second data structure based on a characteristic of that instance. 3. The method of claim 2, wherein the first data structure is a comprehensive stack and each second data structure is a sub-stack. 4. The method of claim 1, wherein curating the property information includes:
utilizing a heuristic to calculate each collapsed value on the characteristic basis for the accumulated property information. 5. The method of claim 1, wherein each collapsed value is a most recent property descriptor for a related characteristic of the subject property 6. The method of claim 1, further comprising:
receiving an identifier indicating the subject property; accumulating on a characteristic basis from the first data structure the property information upon receiving the identifier. 7. The method of claim 1, further comprising:
receiving an identifier indicating the plurality of databases has been updated with additional records; and aggregating into the first data structure the additional records from the plurality of databases. 8. The method of claim 1, further comprising:
presenting via selectable fields of a first interface the set of collapsed values. 9. The method of claim 8, further comprising:
receiving an input indicating a first selectable field of the selectable fields; and presenting via a second interface the property information underlying a collapsed value of the one of the first selectable field. 10. The method of claim 9, further comprising:
filtering based on privileges the property information underlying the collapsed value of the one of the first selectable field. 11. A computer-readable medium tangibly embodying computer-executable instructions for providing a set of collapsed values for a subject property, that are executable by a processor to cause operations comprising:
aggregating records from a plurality of databases into a first data structure; accumulating from the first data structure property information of the records particular to the subject property on a characteristic basis; and curating on the characteristic basis the property information to generate the set of collapsed values. 12. The medium of claim 11, wherein accumulating the property information includes:
creating second data structures, each of the second data structures corresponding to a characteristic of the subject property; and sorting each instance of the property information from the first data structure to a respective second data structure based on a characteristic of that instance. 13. The medium of claim 12, wherein the first data structure is a comprehensive stack and each second data structure is a sub-stack. 14. The medium of claim 11, wherein curating the property information includes:
utilizing a heuristic to calculate each collapsed value on the characteristic basis for the accumulated property information. 15. The medium of claim 11, wherein each collapsed value is a most recent property descriptor for a related characteristic of the subject property 16. The medium of claim 11, further comprising:
receiving an identifier indicating the subject property; accumulating on a characteristic basis from the first data structure the property information upon receiving the identifier. 17. The medium of claim 11, further comprising:
receiving an identifier indicating the plurality of databases has been updated with additional records; and aggregating into the first data structure the additional records from the plurality of databases. 18. The medium of claim 11, further comprising:
presenting via selectable fields of a first interface the set of collapsed values. 19. The medium of claim 18, further comprising:
receiving an input indicating a first selectable field of the selectable fields; and presenting via a second interface the property information underlying a collapsed value of the one of the first selectable field. 20. The medium of claim 19, further comprising:
filtering based on privileges the property information underlying the collapsed value of the one of the first selectable field. | 2,100 |
6,133 | 6,133 | 14,317,691 | 2,100 | Embodiments of an apparatus are disclosed for performing arithmetic operations on provided operands. The apparatus may include a fetch unit, and an arithmetic logic unit (ALU). The fetch unit may be configured to retrieve two operands responsive to receiving an instruction, wherein the operands include binary-coded decimal values. The ALU may be configured to scale a value of each of the operands, and then compress the scaled values of the operands. The compressed values of the operands may include fewer data bits than the corresponding scaled values. The ALU may be further configured to estimate a portion of a result of the operation dependent upon the compressed values of the operands. | 1. An apparatus, comprising:
a fetch unit configured to retrieve a first operand and a second operand responsive to receiving an instruction, wherein a value of the first operand and a value of the second operand each include respective binary-coded decimal (BCD) values; an arithmetic logic unit (ALU) configured to:
scale the value of the first operand and the value of the second operand to generate a first scaled value and a second scaled value, respectively;
compress the first scaled value and the second scaled value to generate a first compressed value and a second compressed value, respectively;
wherein a number of data bits included in the first compressed value is less than a number of data bits included in the first scaled value, and a number of data bits included in the second compressed value is less than a number of data bits included in the second sclaed value; and
estimate a portion of a result of the operation dependent upon the first compressed value and the second compressed value. 2. The apparatus of claim 1, further comprising a lookup table, wherein the lookup table includes a plurality of entries, and wherein to estimate the portion of the result of the operation, the ALU is further configured to select a given one of the plurality of entries dependent upon the first compressed value and the second compressed value. 3. The apparatus of claim 2, wherein to estimate the portion of the result of the operation, the ALU is further configured to determine a minimum possible value for the portion of the result and a maximum possible value for the portion of the result dependent upon the given one of the plurality of entries. 4. The apparatus of claim 3, wherein the ALU is further configured to determine the portion of the result of the operation dependent upon the minimum possible value for the portion of the result and the maximum possible value for the portion of the result. 5. The apparatus of claim 1, wherein the first scaled value and the second scaled value are each greater than or equal to one and less than ten. 6. The apparatus of claim 2, wherein each entry of the plurality of entries includes a plurality of data bits, wherein each one of the plurality of data bits occupies a respective one of a plurality of ordered data bit positions, wherein a data bit position of an active data bit corresponds to the portion of the result of the operation. 7. The apparatus of claim 1, wherein to compress the second scaled value to generate the second compressed value, the ALU is further configured to compress a fractional portion of the second scaled value to generate a compressed fractional portion, wherein a number of data bits included in the compressed fractional portion is less than or equal to three. 8. A method, comprising:
receiving a first operand, a second operand, and an operation, wherein a value of the first operand and a value of the second operand each include respective binary-coded decimal values; scaling the value of the first operand and the value of the second operand to generate a first scaled value and a second scaled value, respectively; compressing the first scaled value and the second scaled value to generate a first compressed value and a second compressed value, respectively; wherein a number of data bits included in the first compressed value is less than a number of data bits included in the first scaled value, and a number of data bits included in the second compressed value is less than a number of data bits included in the second scaled value; and estimating a portion of a result of the operation dependent upon the first compressed value and the second compressed value. 9. The method of claim 8, wherein estimating the portion of the result of the operation comprises selecting, from a lookup table, a given one of a plurality of entries dependent upon the first compressed value and the second compressed value. 10. The method of claim 9, wherein to estimate the portion of the result of the operation comprises determining a minimum possible value for the portion of the result and a maximum possible value for the portion of the result dependent upon the given one of the plurality of entries. 11. The method of claim 10, further comprising determining the portion of the result of the operation dependent upon the minimum possible value for the portion of the result and the maximum possible value for the portion of the result. 12. The method of claim 8, wherein the first scaled value and the second scaled value are each greater than or equal to one and less than ten. 13. The method of claim 9, wherein each entry of the plurlaity of entries includes a plurality of data bits, wherein each one of the plurality of data bits occupies a respective one of a plurality of ordered data bit positions, wherein a data bit position of an active data bit corresponds to the portion of the result of the operation. 14. The method of claim 8, wherein compressing the second scaled value to generate the second compressed value further comprises compressing a fractional portion of the second scaled value to generate a compressed fractional portion, wherein a number of data bits included in the compressed fractional portion is less than or equal to three. 15. A system, comprising:
a processor; a memory configured to store one or more program instructions; and an interface configured to couple the processor and the memory; wherein the processor is configured to:
retrieve a first operand, a second operand, and an operation dependent upon at least one of the one or more program instructions;
scale the value of the first operand and the value of the second operand to generate a first scaled value and a second scaled value, respectively;
compress the first scaled value and the second scaled value to generate a first compressed value and a second compressed value, respectively;
wherein a number of data bits included in the first compressed value is less than a number of data bits included in the first scaled value, and a number of data bits included in the second compressed value is less than a number of data bits included in the second scaled value; and
estimate a portion of a result of the operation dependent upon the first compressed value and the second compressed value. 16. The system of claim 15, wherein to estimate the portion of the result of the operation, the processor is further configured to select, from a lookup table, a given one of a plurality of entries dependent upon the first compressed value and the second compressed value. 17. The system of claim 16, wherein to estimate the portion of the result of the operation, the processor is further configured to determine a minimum possible value for the portion of the result and a maximum possible value for the portion of the result dependent upon the given one of the plurality of entries. 18. The system of claim 17, wherein the processor is further configured to determine the portion of the result of the operation dependent upon the minimum possible value for the portion of the result and the maximum possible value for the portion of the result. 19. The system of claim 15, wherein to retrieve the first operand and the second operand, the processor is further configured to convert the value of the first operand and the value of the second operand from a first number format to a second number format. 20. The system of claim 19, wherein the processor is further configured to convert a value of the result of the operation from the second number format to the first number format. | Embodiments of an apparatus are disclosed for performing arithmetic operations on provided operands. The apparatus may include a fetch unit, and an arithmetic logic unit (ALU). The fetch unit may be configured to retrieve two operands responsive to receiving an instruction, wherein the operands include binary-coded decimal values. The ALU may be configured to scale a value of each of the operands, and then compress the scaled values of the operands. The compressed values of the operands may include fewer data bits than the corresponding scaled values. The ALU may be further configured to estimate a portion of a result of the operation dependent upon the compressed values of the operands.1. An apparatus, comprising:
a fetch unit configured to retrieve a first operand and a second operand responsive to receiving an instruction, wherein a value of the first operand and a value of the second operand each include respective binary-coded decimal (BCD) values; an arithmetic logic unit (ALU) configured to:
scale the value of the first operand and the value of the second operand to generate a first scaled value and a second scaled value, respectively;
compress the first scaled value and the second scaled value to generate a first compressed value and a second compressed value, respectively;
wherein a number of data bits included in the first compressed value is less than a number of data bits included in the first scaled value, and a number of data bits included in the second compressed value is less than a number of data bits included in the second sclaed value; and
estimate a portion of a result of the operation dependent upon the first compressed value and the second compressed value. 2. The apparatus of claim 1, further comprising a lookup table, wherein the lookup table includes a plurality of entries, and wherein to estimate the portion of the result of the operation, the ALU is further configured to select a given one of the plurality of entries dependent upon the first compressed value and the second compressed value. 3. The apparatus of claim 2, wherein to estimate the portion of the result of the operation, the ALU is further configured to determine a minimum possible value for the portion of the result and a maximum possible value for the portion of the result dependent upon the given one of the plurality of entries. 4. The apparatus of claim 3, wherein the ALU is further configured to determine the portion of the result of the operation dependent upon the minimum possible value for the portion of the result and the maximum possible value for the portion of the result. 5. The apparatus of claim 1, wherein the first scaled value and the second scaled value are each greater than or equal to one and less than ten. 6. The apparatus of claim 2, wherein each entry of the plurality of entries includes a plurality of data bits, wherein each one of the plurality of data bits occupies a respective one of a plurality of ordered data bit positions, wherein a data bit position of an active data bit corresponds to the portion of the result of the operation. 7. The apparatus of claim 1, wherein to compress the second scaled value to generate the second compressed value, the ALU is further configured to compress a fractional portion of the second scaled value to generate a compressed fractional portion, wherein a number of data bits included in the compressed fractional portion is less than or equal to three. 8. A method, comprising:
receiving a first operand, a second operand, and an operation, wherein a value of the first operand and a value of the second operand each include respective binary-coded decimal values; scaling the value of the first operand and the value of the second operand to generate a first scaled value and a second scaled value, respectively; compressing the first scaled value and the second scaled value to generate a first compressed value and a second compressed value, respectively; wherein a number of data bits included in the first compressed value is less than a number of data bits included in the first scaled value, and a number of data bits included in the second compressed value is less than a number of data bits included in the second scaled value; and estimating a portion of a result of the operation dependent upon the first compressed value and the second compressed value. 9. The method of claim 8, wherein estimating the portion of the result of the operation comprises selecting, from a lookup table, a given one of a plurality of entries dependent upon the first compressed value and the second compressed value. 10. The method of claim 9, wherein to estimate the portion of the result of the operation comprises determining a minimum possible value for the portion of the result and a maximum possible value for the portion of the result dependent upon the given one of the plurality of entries. 11. The method of claim 10, further comprising determining the portion of the result of the operation dependent upon the minimum possible value for the portion of the result and the maximum possible value for the portion of the result. 12. The method of claim 8, wherein the first scaled value and the second scaled value are each greater than or equal to one and less than ten. 13. The method of claim 9, wherein each entry of the plurlaity of entries includes a plurality of data bits, wherein each one of the plurality of data bits occupies a respective one of a plurality of ordered data bit positions, wherein a data bit position of an active data bit corresponds to the portion of the result of the operation. 14. The method of claim 8, wherein compressing the second scaled value to generate the second compressed value further comprises compressing a fractional portion of the second scaled value to generate a compressed fractional portion, wherein a number of data bits included in the compressed fractional portion is less than or equal to three. 15. A system, comprising:
a processor; a memory configured to store one or more program instructions; and an interface configured to couple the processor and the memory; wherein the processor is configured to:
retrieve a first operand, a second operand, and an operation dependent upon at least one of the one or more program instructions;
scale the value of the first operand and the value of the second operand to generate a first scaled value and a second scaled value, respectively;
compress the first scaled value and the second scaled value to generate a first compressed value and a second compressed value, respectively;
wherein a number of data bits included in the first compressed value is less than a number of data bits included in the first scaled value, and a number of data bits included in the second compressed value is less than a number of data bits included in the second scaled value; and
estimate a portion of a result of the operation dependent upon the first compressed value and the second compressed value. 16. The system of claim 15, wherein to estimate the portion of the result of the operation, the processor is further configured to select, from a lookup table, a given one of a plurality of entries dependent upon the first compressed value and the second compressed value. 17. The system of claim 16, wherein to estimate the portion of the result of the operation, the processor is further configured to determine a minimum possible value for the portion of the result and a maximum possible value for the portion of the result dependent upon the given one of the plurality of entries. 18. The system of claim 17, wherein the processor is further configured to determine the portion of the result of the operation dependent upon the minimum possible value for the portion of the result and the maximum possible value for the portion of the result. 19. The system of claim 15, wherein to retrieve the first operand and the second operand, the processor is further configured to convert the value of the first operand and the value of the second operand from a first number format to a second number format. 20. The system of claim 19, wherein the processor is further configured to convert a value of the result of the operation from the second number format to the first number format. | 2,100 |
6,134 | 6,134 | 15,114,342 | 2,199 | A machine tool device includes at least one open-loop and/or closed-loop control unit and at least one drive-unit sensor unit configured to sense at least one drive-unit characteristic value, which can be processed by the open-loop and/or closed-loop control unit at least for open-loop and/or closed-loop control of a drive unit of a machine tool and/or for an output of information to an operator. The machine tool device further includes at least one processing-tool sensor unit configured to sense at least one processing-tool characteristic value, which can be processed by the open-loop and/or closed-loop control unit at least for open-loop and/or closed-loop control of the drive unit and/or for an output of information to an operator. | 1. A power tool device, comprising:
at least one open-loop and/or closed-loop control unit; at least one drive unit sensor unit configured to record at least one drive unit characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of a drive unit of a power tool and/or for providing an output of information to an operator; and at least one machining tool sensor unit configured to record at least one machining tool characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of a drive unit and/or for providing an output of information to an operator. 2. The power tool device as claimed in claim 1, wherein in at least one operating mode the open-loop and/or closed-loop control unit processes the at least one machining tool characteristic variable recorded with the machining tool sensor unit for providing a determination of a tool type of a machining tool arranged on a tool holder of the power tool. 3. The power tool device as claimed in claim 1, wherein the open-loop and/or closed-loop control unit comprises at least one memory unit, in which at least one setting parameter that is dependent at least on at least one previous machining of a workpiece can be stored for providing an open-loop and/or closed-loop control of the drive unit. 4. The power tool device as claimed in claim 1, further comprising:
at least one operator sensor unit configured to record at least one operator-specific characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit and/or for outputting information to an operator. 5. The power tool device as claimed in claim 1, further comprising:
at least one workpiece sensor unit configured to record at least one workpiece characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit and/or for outputting information to an operator. 6. The power tool device as claimed in claim 1, further comprising:
at least one power tool accessory sensor unit configured to record at least one power tool accessory characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit and/or for outputting information to an operator. 7. The power tool device as claimed in claim 1, further comprising:
at least one input unit configured to input at least one machining characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit. 8. The power tool device as claimed in claim 1, further comprising:
at least one communication unit configured to communicate with at least one external unit for an exchange of electronic data at least for providing an open-loop and/or closed-loop control of the drive unit. 9. The power tool device as claimed in claim 8, wherein the open-loop and/or closed-loop control unit is configured to access a central database with the at least one communication unit, in which there is stored at least one safety and/or operating area rule, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit. 10. The power tool device as claimed in claim 8, wherein the open-loop and/or the closed-loop control unit is configured to adapt at least one parameter stored in a memory unit of the open-loop and/or closed-loop control unit for providing an open-loop and/or closed-loop control of the drive unit in dependence on electronic data transmitted with the communication unit. 11. The power tool device as claimed in claim 1, wherein the power tool device is included in a power tool. 12. A power tool system comprising:
at least one power tool including a power tool device; and at least one external unit, wherein the power tool device includes
at least one open-loop and/or closed-loop control unit,
at least one drive unit sensor unit configured to record at least one drive unit characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of a drive unit of a power tool and/or for providing an output of information to an operator, and
at least one machining tool sensor unit configured to record at least one machining tool characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of a drive unit and/or for providing an output of information to an operator. 13. A method for controlling at least one power tool in an open-loop and/or closed-loop manner, comprising:
determining with an open-loop and/or closed-loop control unit at least one machining tool state; outputting the determined machining tool state with an information output unit and/or making allowance for it for providing an open-loop and/or closed-loop control of a drive unit of the power tool. 14. The method as claimed in claim 13, further comprising:
making allowance for at least a drive unit characteristic variable and/or a machining tool characteristic variable for providing an open-loop and/or closed-loop control of the drive unit of the power tool in at least one operating mode of the power tool constantly over an at least substantially entire time in use. 15. The method as claimed in claim 13, comprising:
accessing at least partially automatically a central database with the open-loop and/or closed-loop control unit, in at least one operating mode, using a communication unit the central database configured to store at least one safety and/or operating area rule, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit. 16. The method as claimed in claim 15, further comprising:
using data recorded by a power tool sensor and/or data transmitted by the communication unit at least for providing an open-loop and/or closed-loop control of the drive unit. 17. The method as claimed in claim 16, further comprising:
outputting at least one item of information with an information output unit in dependence on data recorded by the power tool sensor and/or data transmitted by the communication unit. 18. The method as claimed in claim 16, further comprising:
controlling at least one operating mode setting of the power tool in an open-loop and/or closed-loop manner in dependence on data recorded by the power tool sensor and/or data transmitted by the communication unit. | A machine tool device includes at least one open-loop and/or closed-loop control unit and at least one drive-unit sensor unit configured to sense at least one drive-unit characteristic value, which can be processed by the open-loop and/or closed-loop control unit at least for open-loop and/or closed-loop control of a drive unit of a machine tool and/or for an output of information to an operator. The machine tool device further includes at least one processing-tool sensor unit configured to sense at least one processing-tool characteristic value, which can be processed by the open-loop and/or closed-loop control unit at least for open-loop and/or closed-loop control of the drive unit and/or for an output of information to an operator.1. A power tool device, comprising:
at least one open-loop and/or closed-loop control unit; at least one drive unit sensor unit configured to record at least one drive unit characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of a drive unit of a power tool and/or for providing an output of information to an operator; and at least one machining tool sensor unit configured to record at least one machining tool characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of a drive unit and/or for providing an output of information to an operator. 2. The power tool device as claimed in claim 1, wherein in at least one operating mode the open-loop and/or closed-loop control unit processes the at least one machining tool characteristic variable recorded with the machining tool sensor unit for providing a determination of a tool type of a machining tool arranged on a tool holder of the power tool. 3. The power tool device as claimed in claim 1, wherein the open-loop and/or closed-loop control unit comprises at least one memory unit, in which at least one setting parameter that is dependent at least on at least one previous machining of a workpiece can be stored for providing an open-loop and/or closed-loop control of the drive unit. 4. The power tool device as claimed in claim 1, further comprising:
at least one operator sensor unit configured to record at least one operator-specific characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit and/or for outputting information to an operator. 5. The power tool device as claimed in claim 1, further comprising:
at least one workpiece sensor unit configured to record at least one workpiece characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit and/or for outputting information to an operator. 6. The power tool device as claimed in claim 1, further comprising:
at least one power tool accessory sensor unit configured to record at least one power tool accessory characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit and/or for outputting information to an operator. 7. The power tool device as claimed in claim 1, further comprising:
at least one input unit configured to input at least one machining characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit. 8. The power tool device as claimed in claim 1, further comprising:
at least one communication unit configured to communicate with at least one external unit for an exchange of electronic data at least for providing an open-loop and/or closed-loop control of the drive unit. 9. The power tool device as claimed in claim 8, wherein the open-loop and/or closed-loop control unit is configured to access a central database with the at least one communication unit, in which there is stored at least one safety and/or operating area rule, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit. 10. The power tool device as claimed in claim 8, wherein the open-loop and/or the closed-loop control unit is configured to adapt at least one parameter stored in a memory unit of the open-loop and/or closed-loop control unit for providing an open-loop and/or closed-loop control of the drive unit in dependence on electronic data transmitted with the communication unit. 11. The power tool device as claimed in claim 1, wherein the power tool device is included in a power tool. 12. A power tool system comprising:
at least one power tool including a power tool device; and at least one external unit, wherein the power tool device includes
at least one open-loop and/or closed-loop control unit,
at least one drive unit sensor unit configured to record at least one drive unit characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of a drive unit of a power tool and/or for providing an output of information to an operator, and
at least one machining tool sensor unit configured to record at least one machining tool characteristic variable, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of a drive unit and/or for providing an output of information to an operator. 13. A method for controlling at least one power tool in an open-loop and/or closed-loop manner, comprising:
determining with an open-loop and/or closed-loop control unit at least one machining tool state; outputting the determined machining tool state with an information output unit and/or making allowance for it for providing an open-loop and/or closed-loop control of a drive unit of the power tool. 14. The method as claimed in claim 13, further comprising:
making allowance for at least a drive unit characteristic variable and/or a machining tool characteristic variable for providing an open-loop and/or closed-loop control of the drive unit of the power tool in at least one operating mode of the power tool constantly over an at least substantially entire time in use. 15. The method as claimed in claim 13, comprising:
accessing at least partially automatically a central database with the open-loop and/or closed-loop control unit, in at least one operating mode, using a communication unit the central database configured to store at least one safety and/or operating area rule, which can be processed by the open-loop and/or closed-loop control unit at least for providing an open-loop and/or closed-loop control of the drive unit. 16. The method as claimed in claim 15, further comprising:
using data recorded by a power tool sensor and/or data transmitted by the communication unit at least for providing an open-loop and/or closed-loop control of the drive unit. 17. The method as claimed in claim 16, further comprising:
outputting at least one item of information with an information output unit in dependence on data recorded by the power tool sensor and/or data transmitted by the communication unit. 18. The method as claimed in claim 16, further comprising:
controlling at least one operating mode setting of the power tool in an open-loop and/or closed-loop manner in dependence on data recorded by the power tool sensor and/or data transmitted by the communication unit. | 2,100 |
6,135 | 6,135 | 15,009,336 | 2,176 | An apparatus for providing a contact interface comprises a web page provider configured to provide a web page list comprising at least some information of at least one web page to a user terminal; and an additional contact interface provider configured to, when one of the at least one web page is selected, provide additional data corresponding to an additional contact interface provided to be contactable to the owner of the selected web page, to the user terminal. | 1. An apparatus for providing a contact interface, the apparatus comprising:
a web page provider configured to provide a web page list including information of at least one web page to a user terminal; and an additional contact interface provider configured to, when one of the at least one web page is selected at the user terminal, provide additional data corresponding to an additional contact interface provided to enable contact with an owner of the selected web page, to the user terminal. 2. The apparatus of claim 1, wherein the selected web page is displayed as a different page from the web page list on the user terminal, and
the additional contact interface is displayed on the selected web page as an upper layer of the selected web page. 3. The apparatus of claim 2, wherein the additional data comprises blank information of the selected web page such that the additional contact interface is automatically displayed on a blank region of the selected web page. 4. The apparatus of claim 2, wherein the web page list further comprises a basic contact interface provided to enable contact with each owner of the at least one web page. 5. The apparatus of claim 4, configured to receive history information from the user terminal when a user selects the basic contact interface or the additional contact interface, and provide an inflow route guide message to the owner to notify that the user contacted the owner through the basic contact interface or the additional contact interface. 6. The apparatus of claim 2, wherein the at least one web page is provided through a server separate from the apparatus. 7. A user terminal comprising:
a web page displayer configured to display, as a first web page, a web page list including information of at least one web page by using web page data received from an apparatus for providing a contact interface, and to display, when a user selects one of the at least one web page, as a second page different from the first page, the selected web page; and an additional contact interface displayer configured to display, as an upper layer of the selected web page on the second page, an additional contact interface provided to enable contact with an owner of the of the selected web page by using additional data received from the apparatus. 8. The user terminal of claim 7, wherein the additional contact interface displayer is further configured to display the additional contact interface on a blank region of the selected web page by using blank information of the selected web page included in the additional data. 9. The user terminal of claim 7, wherein the web page displayer is further configured to display a basic contact interface provided to enable contact with each owner of the at least one web page, together with the first page. 10. The user terminal of claim 9, further comprising a contact operation performer configured to perform a contact operation when the user selects the basic contact interface or the additional contact interface, and transmit history information according to the performing of the contact operation to the apparatus. 11. The user terminal of claim 10, wherein the contact operation is performed via one of a phone call method, an instant message transmitting method, and a mail transmitting method. 12. A method of providing a contact interface on a web page, the method comprising:
providing, by an apparatus for providing a contact interface, web page data including a web page list including information of at least one web page, to a user terminal; when one of the at least one web page is selected at the user terminal, providing, by the apparatus, second web page data corresponding to the selected web page to the user terminal; and providing, by the apparatus, additional data corresponding to an additional contact interface provided to enable contact with an owner of the selected web page, to the user terminal. 13. The method of claim 12, wherein the selected web page is displayed as a different web page from the web page list on the user terminal, and
the additional contact interface is displayed as an upper layer of the selected web page on the selected web page. 14. The method of claim 13, wherein the additional data comprises blank information of the selected web page such that the additional contact interface is automatically displayed on a blank region of the selected web page. 15. The method of claim 13, wherein the web page list further comprises a basic contact interface provided to enable contact with each of the at least one web page. 16. The method of claim 15, further comprising:
receiving history information from the user terminal when a user selects the basic contact interface or the additional contact interface; and providing an inflow route guide message to the owner to notify that the user contacted the owner through the basic contact interface or the additional contact interface. | An apparatus for providing a contact interface comprises a web page provider configured to provide a web page list comprising at least some information of at least one web page to a user terminal; and an additional contact interface provider configured to, when one of the at least one web page is selected, provide additional data corresponding to an additional contact interface provided to be contactable to the owner of the selected web page, to the user terminal.1. An apparatus for providing a contact interface, the apparatus comprising:
a web page provider configured to provide a web page list including information of at least one web page to a user terminal; and an additional contact interface provider configured to, when one of the at least one web page is selected at the user terminal, provide additional data corresponding to an additional contact interface provided to enable contact with an owner of the selected web page, to the user terminal. 2. The apparatus of claim 1, wherein the selected web page is displayed as a different page from the web page list on the user terminal, and
the additional contact interface is displayed on the selected web page as an upper layer of the selected web page. 3. The apparatus of claim 2, wherein the additional data comprises blank information of the selected web page such that the additional contact interface is automatically displayed on a blank region of the selected web page. 4. The apparatus of claim 2, wherein the web page list further comprises a basic contact interface provided to enable contact with each owner of the at least one web page. 5. The apparatus of claim 4, configured to receive history information from the user terminal when a user selects the basic contact interface or the additional contact interface, and provide an inflow route guide message to the owner to notify that the user contacted the owner through the basic contact interface or the additional contact interface. 6. The apparatus of claim 2, wherein the at least one web page is provided through a server separate from the apparatus. 7. A user terminal comprising:
a web page displayer configured to display, as a first web page, a web page list including information of at least one web page by using web page data received from an apparatus for providing a contact interface, and to display, when a user selects one of the at least one web page, as a second page different from the first page, the selected web page; and an additional contact interface displayer configured to display, as an upper layer of the selected web page on the second page, an additional contact interface provided to enable contact with an owner of the of the selected web page by using additional data received from the apparatus. 8. The user terminal of claim 7, wherein the additional contact interface displayer is further configured to display the additional contact interface on a blank region of the selected web page by using blank information of the selected web page included in the additional data. 9. The user terminal of claim 7, wherein the web page displayer is further configured to display a basic contact interface provided to enable contact with each owner of the at least one web page, together with the first page. 10. The user terminal of claim 9, further comprising a contact operation performer configured to perform a contact operation when the user selects the basic contact interface or the additional contact interface, and transmit history information according to the performing of the contact operation to the apparatus. 11. The user terminal of claim 10, wherein the contact operation is performed via one of a phone call method, an instant message transmitting method, and a mail transmitting method. 12. A method of providing a contact interface on a web page, the method comprising:
providing, by an apparatus for providing a contact interface, web page data including a web page list including information of at least one web page, to a user terminal; when one of the at least one web page is selected at the user terminal, providing, by the apparatus, second web page data corresponding to the selected web page to the user terminal; and providing, by the apparatus, additional data corresponding to an additional contact interface provided to enable contact with an owner of the selected web page, to the user terminal. 13. The method of claim 12, wherein the selected web page is displayed as a different web page from the web page list on the user terminal, and
the additional contact interface is displayed as an upper layer of the selected web page on the selected web page. 14. The method of claim 13, wherein the additional data comprises blank information of the selected web page such that the additional contact interface is automatically displayed on a blank region of the selected web page. 15. The method of claim 13, wherein the web page list further comprises a basic contact interface provided to enable contact with each of the at least one web page. 16. The method of claim 15, further comprising:
receiving history information from the user terminal when a user selects the basic contact interface or the additional contact interface; and providing an inflow route guide message to the owner to notify that the user contacted the owner through the basic contact interface or the additional contact interface. | 2,100 |
6,136 | 6,136 | 15,631,807 | 2,184 | Systems and methods for controlling isochronous data streams are disclosed. Particular aspects of the present disclosure are designed to be used with almost any isochronous data stream, but are well-suited for use with the Universal Serial Bus (USB) protocol. Further, aspects of the present disclosure are flexible to accommodate existing configuration possibilities within the USB protocol as well as accommodate proposed future changes in the USB protocol. The flexibility of the systems and methods is provided by calculating: (1) drift between a USB host system time and the application and (2) drift between the USB host system and a USB device clock. Based on these two drift calculations, a time stamp may be synthesized to program a next delivery schedule. Using this time stamp, jitter correction can take place and uniformly-sized packets may be assembled to pass to an application processor. | 1. A method for controlling communication in a Universal Serial Bus (USB) system, comprising:
receiving variably-sized packets at a first processor having a USB driver; assembling uniformly-sized packets at the first processor; and passing the uniformly-sized packets to a second processor for use by applications at an application layer in a protocol stack. 2. The method of claim 1, wherein the first processor and the second processor are integrated into a single integrated circuit. 3. The method of claim 1, wherein receiving the variably-sized packets at the first processor comprises receiving the variably-sized packets at a microprocessor. 4. The method of claim 1, wherein receiving the variably-sized packets at the first processor comprises receiving the variably-sized packets at an audio digital signal processor (ADSP). 5. The method of claim 1, wherein receiving the variably-sized packets at the first processor comprises receiving the variably-sized packets at an intermediate device between a peripheral and a host. 6. The method of claim 1, wherein receiving the variably-sized packets comprises receiving the variably-sized packets at a processor in a peripheral. 7. The method of claim 1, wherein assembling the uniformly-sized packets comprises using a bus frequency and a samples per packet to calculate a size. 8. The method of claim 1, wherein assembling the uniformly-sized packets comprises using a sampling frequency of content. 9. The method of claim 1, wherein assembling the uniformly-sized packets comprises receiving a time stamp from a high resolution timer. 10. A host comprising:
an application processor; Universal Serial Bus (USB) hardware; and an audio digital signal processor (ADSP) configured to:
receive variably-sized packets at the ADSP through the USB hardware;
assemble uniformly-sized packets at the ADSP; and
pass the uniformly-sized packets to the application processor for use by applications at an application layer in a protocol stack. 11. A host comprising:
an application processor; Universal Serial Bus (USB) hardware; and a system on a chip (SoC) comprising a plurality of processors configured to:
receive variably-sized packets at a first processor;
assemble uniformly-sized packets at the first processor; and
pass the uniformly-sized packets to a second processor for use by applications at an application layer in a protocol stack. 12. The host of claim 11, wherein the first processor comprises a microprocessor. 13. The host of claim 11, wherein the first processor comprises an audio digital signal processor (ADSP). 14. The host of claim 11, wherein the first processor is configured to assemble the uniformly-sized packets by using a bus frequency and a samples per packet to calculate a size. 15. The host of claim 11, wherein the first processor is configured to assemble the uniformly-sized packets by using a sampling frequency of content. 16. The host of claim 11, wherein the first processor is configured to assemble the uniformly-sized packets by receiving a time stamp from a high resolution timer. 17. A method for detecting drift in a Universal Serial Bus (USB) system, comprising:
determining that a fractional sampling rate is used on a USB bus between an audio peripheral and a host; determining a first fractional remainder associated with the fractional sampling rate over a service interval; based on the first fractional remainder, calculating a whole number corresponding to a number of intervals required to have no fractional remainder; and checking drift each whole number of intervals. 18. The method of claim 17, further comprising applying a drift correction based on checking the drift. 19. A processor comprising:
an input; and a control system configured to:
determine that a fractional sampling rate is used on a USB bus between an audio peripheral and a host;
determine a first fractional remainder associated with the fractional sampling rate over a service interval;
based on the first fractional remainder, calculate a whole number corresponding to a number of intervals required to have no fractional remainder; and
check drift each whole number of intervals. 20. The processor of claim 19 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a global positioning system (GPS) device; a mobile phone; a cellular phone; a smart phone; a session initiation protocol (SIP) phone; a tablet; a phablet; a server; a computer; a portable computer; a mobile computing device; a wearable computing device; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player; an automobile; a vehicle component; avionics systems; a drone; and a multicopter. 21. A method to synthesize a time stamp, comprising:
receiving a run command from a data delivery handler; and summing an output from a high resolution timer and a computed absolute time stamp. 22. The method of claim 21, further adding drift correction to the summing to synthesize the time stamp. 23. The method of claim 22, further comprising performing in-band drift detection. 24. The method of claim 22, further comprising performing out-of-band drift detection. 25. The method of claim 22, further comprising adding a device drift accumulator output to a local clock drift accumulator output. 26. The method of claim 21, wherein summing comprises summing in a processor in a mobile terminal. 27. The method of claim 21, wherein summing comprises summing in a dongle. 28. A processor comprising:
an audio data buffer; and a Universal Serial Bus (USB) audio client (UAC) configured to:
receive variably-sized packets;
assemble uniformly-sized packets; and
pass the uniformly-sized packets to a second processor for use by applications at an application layer in a protocol stack. 29. The processor of claim 28 wherein the processor is positioned within a USB peripheral. 30. The processor of claim 28, wherein the processor is positioned in an intermediate device configured to sit between a peripheral and a host. 31. The processor of claim 28, wherein the processor is positioned in a host. 32. The processor of claim 28 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a global positioning system (GPS) device; a mobile phone; a cellular phone; a smart phone; a session initiation protocol (SIP) phone; a tablet; a phablet; a server; a computer; a portable computer; a mobile computing device; a wearable computing device; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player; an automobile; a vehicle component; avionics systems; a drone; and a multicopter. | Systems and methods for controlling isochronous data streams are disclosed. Particular aspects of the present disclosure are designed to be used with almost any isochronous data stream, but are well-suited for use with the Universal Serial Bus (USB) protocol. Further, aspects of the present disclosure are flexible to accommodate existing configuration possibilities within the USB protocol as well as accommodate proposed future changes in the USB protocol. The flexibility of the systems and methods is provided by calculating: (1) drift between a USB host system time and the application and (2) drift between the USB host system and a USB device clock. Based on these two drift calculations, a time stamp may be synthesized to program a next delivery schedule. Using this time stamp, jitter correction can take place and uniformly-sized packets may be assembled to pass to an application processor.1. A method for controlling communication in a Universal Serial Bus (USB) system, comprising:
receiving variably-sized packets at a first processor having a USB driver; assembling uniformly-sized packets at the first processor; and passing the uniformly-sized packets to a second processor for use by applications at an application layer in a protocol stack. 2. The method of claim 1, wherein the first processor and the second processor are integrated into a single integrated circuit. 3. The method of claim 1, wherein receiving the variably-sized packets at the first processor comprises receiving the variably-sized packets at a microprocessor. 4. The method of claim 1, wherein receiving the variably-sized packets at the first processor comprises receiving the variably-sized packets at an audio digital signal processor (ADSP). 5. The method of claim 1, wherein receiving the variably-sized packets at the first processor comprises receiving the variably-sized packets at an intermediate device between a peripheral and a host. 6. The method of claim 1, wherein receiving the variably-sized packets comprises receiving the variably-sized packets at a processor in a peripheral. 7. The method of claim 1, wherein assembling the uniformly-sized packets comprises using a bus frequency and a samples per packet to calculate a size. 8. The method of claim 1, wherein assembling the uniformly-sized packets comprises using a sampling frequency of content. 9. The method of claim 1, wherein assembling the uniformly-sized packets comprises receiving a time stamp from a high resolution timer. 10. A host comprising:
an application processor; Universal Serial Bus (USB) hardware; and an audio digital signal processor (ADSP) configured to:
receive variably-sized packets at the ADSP through the USB hardware;
assemble uniformly-sized packets at the ADSP; and
pass the uniformly-sized packets to the application processor for use by applications at an application layer in a protocol stack. 11. A host comprising:
an application processor; Universal Serial Bus (USB) hardware; and a system on a chip (SoC) comprising a plurality of processors configured to:
receive variably-sized packets at a first processor;
assemble uniformly-sized packets at the first processor; and
pass the uniformly-sized packets to a second processor for use by applications at an application layer in a protocol stack. 12. The host of claim 11, wherein the first processor comprises a microprocessor. 13. The host of claim 11, wherein the first processor comprises an audio digital signal processor (ADSP). 14. The host of claim 11, wherein the first processor is configured to assemble the uniformly-sized packets by using a bus frequency and a samples per packet to calculate a size. 15. The host of claim 11, wherein the first processor is configured to assemble the uniformly-sized packets by using a sampling frequency of content. 16. The host of claim 11, wherein the first processor is configured to assemble the uniformly-sized packets by receiving a time stamp from a high resolution timer. 17. A method for detecting drift in a Universal Serial Bus (USB) system, comprising:
determining that a fractional sampling rate is used on a USB bus between an audio peripheral and a host; determining a first fractional remainder associated with the fractional sampling rate over a service interval; based on the first fractional remainder, calculating a whole number corresponding to a number of intervals required to have no fractional remainder; and checking drift each whole number of intervals. 18. The method of claim 17, further comprising applying a drift correction based on checking the drift. 19. A processor comprising:
an input; and a control system configured to:
determine that a fractional sampling rate is used on a USB bus between an audio peripheral and a host;
determine a first fractional remainder associated with the fractional sampling rate over a service interval;
based on the first fractional remainder, calculate a whole number corresponding to a number of intervals required to have no fractional remainder; and
check drift each whole number of intervals. 20. The processor of claim 19 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a global positioning system (GPS) device; a mobile phone; a cellular phone; a smart phone; a session initiation protocol (SIP) phone; a tablet; a phablet; a server; a computer; a portable computer; a mobile computing device; a wearable computing device; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player; an automobile; a vehicle component; avionics systems; a drone; and a multicopter. 21. A method to synthesize a time stamp, comprising:
receiving a run command from a data delivery handler; and summing an output from a high resolution timer and a computed absolute time stamp. 22. The method of claim 21, further adding drift correction to the summing to synthesize the time stamp. 23. The method of claim 22, further comprising performing in-band drift detection. 24. The method of claim 22, further comprising performing out-of-band drift detection. 25. The method of claim 22, further comprising adding a device drift accumulator output to a local clock drift accumulator output. 26. The method of claim 21, wherein summing comprises summing in a processor in a mobile terminal. 27. The method of claim 21, wherein summing comprises summing in a dongle. 28. A processor comprising:
an audio data buffer; and a Universal Serial Bus (USB) audio client (UAC) configured to:
receive variably-sized packets;
assemble uniformly-sized packets; and
pass the uniformly-sized packets to a second processor for use by applications at an application layer in a protocol stack. 29. The processor of claim 28 wherein the processor is positioned within a USB peripheral. 30. The processor of claim 28, wherein the processor is positioned in an intermediate device configured to sit between a peripheral and a host. 31. The processor of claim 28, wherein the processor is positioned in a host. 32. The processor of claim 28 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a global positioning system (GPS) device; a mobile phone; a cellular phone; a smart phone; a session initiation protocol (SIP) phone; a tablet; a phablet; a server; a computer; a portable computer; a mobile computing device; a wearable computing device; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player; an automobile; a vehicle component; avionics systems; a drone; and a multicopter. | 2,100 |
6,137 | 6,137 | 14,938,690 | 2,153 | Content creation collection and navigation techniques and systems are described. In one example, a representative image is used by a content sharing service to interact with a collection of images provided as part of a search result. In another example, a user interface image navigation control is configured to support user navigation through images based on one or more metrics. In a further example, a user interface image navigation control is configured to support user navigation through images based on one or more metrics identified for an object selected from the image. In yet another example, collections of images are leveraged as part of content creation. In another example, data obtained from a content sharing service is leveraged to indicate suitability of images of a user for licensing as part of the service. | 1. In a digital medium environment for image search result configuration and navigation control, a method implemented by one or computing devices comprising:
obtaining a search result by the one or more computing devices, the search result including a plurality of images available for licensing from a content sharing service and found in response to a search request by the content sharing service; clustering the plurality of images in the search result by the one or more computing devices based on similarity of the plurality of the images, one to another; identifying one or more metrics by the one or more computing devices to differentiate the similarity of the plurality of images, one from another; and configuring a user interface image navigation control for output in a user interface to support user navigation through the plurality of images in the search result based on the identified one or more metrics. 2. The method as described in claim 1, wherein the clustering includes calculating an image vector for each of the plurality of images using one or more metrics. 3. The method as described in claim 2, wherein the one or more metrics are identified from the image vector. 4. The method as described in claim 1, wherein the clustering is based at least in part by leveraging semantic labels of objects included in respective ones of the plurality of images. 5. The method as described in claim 4, further comprising labelling the objects in the respective ones of the plurality of images by the one or more computing devices. 6. The method as described in claim 4, wherein the identifying of the one or more metrics is performed at least in part using the semantic labels. 7. The method as described in claim 1, wherein the user interface image navigation control is configured as a slider. 8. The method as described in claim 1, wherein the search result is obtained by matching keywords in the search request to tags associated with the plurality of images. 9. In a digital medium environment for image search result configuration and control of navigation through the image search result, a system comprising:
one or more computing devices configured to perform operations comprising:
displaying a search result that includes a plurality of images found in response to a search request by a content sharing service, the plurality of images available for licensing via the content sharing service;
receiving a user selection of an object included in a respective one of the plurality of images;
identifying one or more metrics associated with the selected object that are usable to navigate through the plurality of images; and
configuring a user interface image navigation control for output in a user interface to support user navigation through the plurality of images in the search result based on the identified one or more metrics. 10. The system as described in claim 9, wherein the identifying includes calculating an image vector for each of the plurality of images using one or more metrics. 11. The system as described in claim 9, wherein the identifying is based at least in part by leveraging semantic labels of objects included in respective ones of the plurality of images. 12. The system as described in claim 11, further comprising labelling the objects in the respective ones of the plurality of images by the one or more computing devices. 13. The system as described in claim 9, wherein the user interface image navigation control is configured as a slider. 14. The system as described in claim 9, wherein the search result is obtained by matching keywords in the search request to tags associated with the plurality of images. 15. In a digital medium environment for image sharing, a method implemented by one or computing devices of a content sharing service comprising:
receiving a plurality of images by the one or more computing devices of the content sharing service; grouping the plurality of images responsive to a determination by the one or more computing devices that the plurality of images exhibit at least a threshold amount of similarity, one to another; and responsive to locating of at least one of the plurality of images as corresponding to a search request received by the content sharing service, configuring a search result by the one or more computing devices that includes the at least one said image that represents a grouping as a whole in the search result along with functionality that is selectable to cause output of one or more other said images of the grouping, the one or more other said images not being output absent the selection. 16. The method as described in claim 15, further comprising outputting a user interface image navigation control that supports user interaction to navigate through the grouping of the plurality of images. 17. The method as described in claim 16, wherein the user interface image navigation control is configured as a slider. 18. The method as described in claim 16, wherein the grouping of the plurality of images in the search result by the one or more computing devices is based on similarity of the plurality of the images, one to another. 19. The method as described in claim 18, wherein grouping includes calculating an image vector for each of the plurality of images using one or more metrics. 20. The method as described in claim 15, wherein the grouping is based at least in part by leveraging semantic labels of objects included in respective ones of the plurality of images. | Content creation collection and navigation techniques and systems are described. In one example, a representative image is used by a content sharing service to interact with a collection of images provided as part of a search result. In another example, a user interface image navigation control is configured to support user navigation through images based on one or more metrics. In a further example, a user interface image navigation control is configured to support user navigation through images based on one or more metrics identified for an object selected from the image. In yet another example, collections of images are leveraged as part of content creation. In another example, data obtained from a content sharing service is leveraged to indicate suitability of images of a user for licensing as part of the service.1. In a digital medium environment for image search result configuration and navigation control, a method implemented by one or computing devices comprising:
obtaining a search result by the one or more computing devices, the search result including a plurality of images available for licensing from a content sharing service and found in response to a search request by the content sharing service; clustering the plurality of images in the search result by the one or more computing devices based on similarity of the plurality of the images, one to another; identifying one or more metrics by the one or more computing devices to differentiate the similarity of the plurality of images, one from another; and configuring a user interface image navigation control for output in a user interface to support user navigation through the plurality of images in the search result based on the identified one or more metrics. 2. The method as described in claim 1, wherein the clustering includes calculating an image vector for each of the plurality of images using one or more metrics. 3. The method as described in claim 2, wherein the one or more metrics are identified from the image vector. 4. The method as described in claim 1, wherein the clustering is based at least in part by leveraging semantic labels of objects included in respective ones of the plurality of images. 5. The method as described in claim 4, further comprising labelling the objects in the respective ones of the plurality of images by the one or more computing devices. 6. The method as described in claim 4, wherein the identifying of the one or more metrics is performed at least in part using the semantic labels. 7. The method as described in claim 1, wherein the user interface image navigation control is configured as a slider. 8. The method as described in claim 1, wherein the search result is obtained by matching keywords in the search request to tags associated with the plurality of images. 9. In a digital medium environment for image search result configuration and control of navigation through the image search result, a system comprising:
one or more computing devices configured to perform operations comprising:
displaying a search result that includes a plurality of images found in response to a search request by a content sharing service, the plurality of images available for licensing via the content sharing service;
receiving a user selection of an object included in a respective one of the plurality of images;
identifying one or more metrics associated with the selected object that are usable to navigate through the plurality of images; and
configuring a user interface image navigation control for output in a user interface to support user navigation through the plurality of images in the search result based on the identified one or more metrics. 10. The system as described in claim 9, wherein the identifying includes calculating an image vector for each of the plurality of images using one or more metrics. 11. The system as described in claim 9, wherein the identifying is based at least in part by leveraging semantic labels of objects included in respective ones of the plurality of images. 12. The system as described in claim 11, further comprising labelling the objects in the respective ones of the plurality of images by the one or more computing devices. 13. The system as described in claim 9, wherein the user interface image navigation control is configured as a slider. 14. The system as described in claim 9, wherein the search result is obtained by matching keywords in the search request to tags associated with the plurality of images. 15. In a digital medium environment for image sharing, a method implemented by one or computing devices of a content sharing service comprising:
receiving a plurality of images by the one or more computing devices of the content sharing service; grouping the plurality of images responsive to a determination by the one or more computing devices that the plurality of images exhibit at least a threshold amount of similarity, one to another; and responsive to locating of at least one of the plurality of images as corresponding to a search request received by the content sharing service, configuring a search result by the one or more computing devices that includes the at least one said image that represents a grouping as a whole in the search result along with functionality that is selectable to cause output of one or more other said images of the grouping, the one or more other said images not being output absent the selection. 16. The method as described in claim 15, further comprising outputting a user interface image navigation control that supports user interaction to navigate through the grouping of the plurality of images. 17. The method as described in claim 16, wherein the user interface image navigation control is configured as a slider. 18. The method as described in claim 16, wherein the grouping of the plurality of images in the search result by the one or more computing devices is based on similarity of the plurality of the images, one to another. 19. The method as described in claim 18, wherein grouping includes calculating an image vector for each of the plurality of images using one or more metrics. 20. The method as described in claim 15, wherein the grouping is based at least in part by leveraging semantic labels of objects included in respective ones of the plurality of images. | 2,100 |
6,138 | 6,138 | 15,650,765 | 2,173 | An electronic device, such as held device, having a display and camera, displays a user interface that includes a user interface object displayed at a first size; detects, via the camera, a change in distance between a user of the electronic device and the electronic device; and in response to detecting the change in distance between the user the electronic device and the electronic device, changes size of the displayed user interface object. | 1. A method, comprising:
at an electronic device with a display and a camera:
displaying, on the display, a user interface that includes a user interface object displayed at a first size;
detecting, via the camera, a change in distance between a user of the electronic device and the electronic device; and
in response to detecting the change in distance between the user the electronic device and the electronic device, changing size of the displayed user interface object. 2. The method of claim 1, wherein changing size of the displayed the user interface object comprises zooming in on a portion of the user interface. 3. The method of claim 2, including setting a zoom mode of the device to enable said zooming. 4. The method of claim 1, wherein the change in distance between the user of the electronic device and the electronic device is a change in distance between the electronic device and eyes of the user, and the method includes changing size of the displayed user interface object by an amount that is based on the change in distance between the electronic device and the eyes of the user. 5. The method of claim 1, wherein changing size of the displayed user interface object includes changing a zoom factor based on rotation of the electronic device. 6. The method of claim 5, wherein rotation of the electronic device is determined, using the camera, based on orientation of the electronic device in relation to the user. 7. The method of claim 1, including changing a zoom factor for the user interface or user interface object based on a tilting of the device. 8. The method of claim 7, wherein tilt of the electronic device is determined, using the camera, based on orientation of the electronic device in relation to the user. 9. An electronic device, comprising:
a processor; a camera; and a display in communication with the processor, wherein the processor is configured to:
display, on the display, a user interface that includes a user interface object displayed at a first size;
detect, via the camera, a change in distance between a user of the electronic device and the electronic device; and
in response to detecting the change in distance between the user the electronic device and the electronic device, change size of the displayed user interface object. 10. The electronic device of claim 9, wherein changing size of the displayed user interface object comprises zooming in on a portion of the user interface. 11. The electronic device of claim 10, including setting a zoom mode of the device to enable said zooming. 12. The electronic device of claim 9, wherein the change in distance between the user of the electronic device and the electronic device is a change in distance between the electronic device and eyes of the user, and the method includes changing size of the displayed user interface object by an amount that is based on the change in distance between the electronic device and the eyes of the user. 13. The electronic device of claim 9, wherein changing size of the displayed user interface object includes changing a zoom factor based on rotation of the electronic device. 14. The electronic device of claim 13, wherein rotation of the electronic device is determined, using the camera, based on orientation of the electronic device in relation to the user. 15. The electronic device of claim 9, including changing a zoom factor for the user interface or user interface object based on a tilting of the device. 16. The electronic device of claim 15, wherein tilt of the electronic device is determined, using the camera, based on orientation of the electronic device in relation to the user. 17. A non-transitory computer readable storage medium, storing one or more programs, which when executed by one or more processors of an electronic device having a display and a camera, cause the electronic device to perform operations comprising:
displaying, on the display, a user interface that includes a user interface object displayed at a first size; detecting, via the camera, a change in distance between a user of the electronic device and the electronic device; and in response to detecting the change in distance between the user the electronic device and the electronic device, changing size of the displayed user interface object. 18. The non-transitory computer readable storage medium of claim 17, wherein changing size of the displayed user interface object comprises zooming in on a portion of the user interface. 19. The non-transitory computer readable storage medium of claim 18, including setting a zoom mode of the device to enable said zooming. 20. The non-transitory computer readable storage medium of claim 17, wherein the change in distance between the user of the electronic device and the electronic device is a change in distance between the electronic device and eyes of the user, and the method includes changing size of the displayed user interface object by an amount that is based on the change in distance between the electronic device and the eyes of the user. | An electronic device, such as held device, having a display and camera, displays a user interface that includes a user interface object displayed at a first size; detects, via the camera, a change in distance between a user of the electronic device and the electronic device; and in response to detecting the change in distance between the user the electronic device and the electronic device, changes size of the displayed user interface object.1. A method, comprising:
at an electronic device with a display and a camera:
displaying, on the display, a user interface that includes a user interface object displayed at a first size;
detecting, via the camera, a change in distance between a user of the electronic device and the electronic device; and
in response to detecting the change in distance between the user the electronic device and the electronic device, changing size of the displayed user interface object. 2. The method of claim 1, wherein changing size of the displayed the user interface object comprises zooming in on a portion of the user interface. 3. The method of claim 2, including setting a zoom mode of the device to enable said zooming. 4. The method of claim 1, wherein the change in distance between the user of the electronic device and the electronic device is a change in distance between the electronic device and eyes of the user, and the method includes changing size of the displayed user interface object by an amount that is based on the change in distance between the electronic device and the eyes of the user. 5. The method of claim 1, wherein changing size of the displayed user interface object includes changing a zoom factor based on rotation of the electronic device. 6. The method of claim 5, wherein rotation of the electronic device is determined, using the camera, based on orientation of the electronic device in relation to the user. 7. The method of claim 1, including changing a zoom factor for the user interface or user interface object based on a tilting of the device. 8. The method of claim 7, wherein tilt of the electronic device is determined, using the camera, based on orientation of the electronic device in relation to the user. 9. An electronic device, comprising:
a processor; a camera; and a display in communication with the processor, wherein the processor is configured to:
display, on the display, a user interface that includes a user interface object displayed at a first size;
detect, via the camera, a change in distance between a user of the electronic device and the electronic device; and
in response to detecting the change in distance between the user the electronic device and the electronic device, change size of the displayed user interface object. 10. The electronic device of claim 9, wherein changing size of the displayed user interface object comprises zooming in on a portion of the user interface. 11. The electronic device of claim 10, including setting a zoom mode of the device to enable said zooming. 12. The electronic device of claim 9, wherein the change in distance between the user of the electronic device and the electronic device is a change in distance between the electronic device and eyes of the user, and the method includes changing size of the displayed user interface object by an amount that is based on the change in distance between the electronic device and the eyes of the user. 13. The electronic device of claim 9, wherein changing size of the displayed user interface object includes changing a zoom factor based on rotation of the electronic device. 14. The electronic device of claim 13, wherein rotation of the electronic device is determined, using the camera, based on orientation of the electronic device in relation to the user. 15. The electronic device of claim 9, including changing a zoom factor for the user interface or user interface object based on a tilting of the device. 16. The electronic device of claim 15, wherein tilt of the electronic device is determined, using the camera, based on orientation of the electronic device in relation to the user. 17. A non-transitory computer readable storage medium, storing one or more programs, which when executed by one or more processors of an electronic device having a display and a camera, cause the electronic device to perform operations comprising:
displaying, on the display, a user interface that includes a user interface object displayed at a first size; detecting, via the camera, a change in distance between a user of the electronic device and the electronic device; and in response to detecting the change in distance between the user the electronic device and the electronic device, changing size of the displayed user interface object. 18. The non-transitory computer readable storage medium of claim 17, wherein changing size of the displayed user interface object comprises zooming in on a portion of the user interface. 19. The non-transitory computer readable storage medium of claim 18, including setting a zoom mode of the device to enable said zooming. 20. The non-transitory computer readable storage medium of claim 17, wherein the change in distance between the user of the electronic device and the electronic device is a change in distance between the electronic device and eyes of the user, and the method includes changing size of the displayed user interface object by an amount that is based on the change in distance between the electronic device and the eyes of the user. | 2,100 |
6,139 | 6,139 | 15,629,291 | 2,177 | A computer-based system comprising a library module associated with an application, the library module using stored configuration data and configuration metadata for the application and a configurator to generate a web user interface using the configuration metadata. The web user interface allowing a user to input configuration information for the application. | 1. A method, comprising:
retrieving, by a configuration application on a computer system, configuration metadata from a centralized configuration data store, the configuration metadata comprising a first configuration element of a first user application on the computer system and a second configuration element of a second user application on the computer system; generating, using the configuration application, a user interface comprising a first data entry field for the first configuration element and a test button for the first configuration element; receiving, by the configuration application from the user interface, a first data value for the first configuration element; storing, by the configuration application in the centralized configuration data store, a first configuration data having the first data value for the first configuration element, the first configuration data to be used by the first user application during execution for configuration of the first user application; retrieving, by the configuration application from the centralized configuration data store, a second configuration data, the second configuration data having a second data value for the second configuration element of the second user application; regenerating, using the configuration application, the user interface to display the first configuration element associated with the first data value and the second configuration element associated with the second data value; receiving, by the configuration application from the user interface, a third data value for the second configuration element; updating, by the configuration application in the centralized configuration data store, the second data value in the second configuration data with the third data value, the second configuration data to be used by the second user application during execution for configuration of the second user application; executing, by the computer system, the first user application using the first configuration data from the centralized configuration data store; and executing, by the computer system, the second user application using the second configuration data from the centralized configuration data store. 2. The method of claim 1, wherein the configuration metadata indicates that the first configuration element is testable and includes a token used to locate at least one test. 3. The method of claim 2, further comprising:
receiving, by the computer system, an indication of a user selection of the test button; and performing, by the computer system in response to receiving the indication of the user selection of the test button, the at least one test of the first data value, wherein the at least one test includes pinging an input URL, checking a file system, testing a database connection, or a combination thereof, the at least one test further implemented as standalone code that does not perform the at least one test as part of the first user application. 4. The method of claim 1, wherein the configuration metadata includes a name and a description of the second configuration element, resources for on-line help, and a list of selectable values for the first configuration element. 5. The method of claim 4, wherein the configuration metadata further includes a third configuration element of the first user application, options for the first configuration element depending on selection of a fourth data value for the third configuration element, and
wherein the first data entry field for the first configuration element is a dropdown box populated with the list of selectable values filtered to be context aware based on the selection of the fourth data value. 6. The method of claim 1, wherein the user interface is accessed through a web browser, and wherein generating the user interface comprises:
receiving a username and a password; authenticating a user associated with the username and the password using secure socket layer encryption; and displaying a generic error if the authenticating fails. 7. The method of claim 1, further comprising:
retrieving, by the configuration application from the centralized configuration data store, a third configuration data, the third configuration data having a fourth data value for a third configuration element, wherein the fourth data value is encrypted in the centralized configuration data store; and regenerating, using the configuration application, the user interface to display (1) the first configuration element associated with the first data value, (2) the second configuration element associated with the second data value, and (3) the third configuration element associated with the fourth data value, wherein the fourth data value is displayed using at least one mask character based on the fourth data value being encrypted. 8. The method of claim 1, wherein the second configuration element is a port number and the third data value is the port number used when the second user application is executed. 9. The method of claim 1, further comprising:
executing a first time configuration wizard, wherein:
the first time configuration wizard provides an interface for entry of one or more data values for one or more configuration elements of a third user application,
the first time configuration wizard requires entry of a fourth data value associated with a third configuration element of a third user application,
the third configuration element is a setting required by the third user application to execute properly,
the third configuration element requires a string value,
the configuration metadata comprises a diagnostic warm-up sequence for the third user application, and
the diagnostic warm-up sequence comprises test functions that test a complete configuration profile of the third user application;
receiving, by the configuration application from the first time configuration wizard, the fourth data value; and validating that the fourth data value is a string. 10. The method of claim 1, wherein a new application can inherit the first configuration data or the second configuration data. 11. A system, comprising:
a processor; and a memory having stored thereon instructions that, when executed by the processor, cause the processor to:
execute a configuration application, the configuration application configured to:
retrieve configuration metadata from a centralized configuration data store, the configuration metadata comprising a first configuration element of a first user application on the computer system and a second configuration element of a second user application on the computer system,
generate a user interface comprising a first data entry field for the first configuration element and a test button for the first configuration element,
receive, via the user interface, a first data value for the first configuration element,
store a first configuration data having the first data value for the first configuration element, the first configuration data to be used by the first user application during execution for configuration of the first user application,
retrieve, from the centralized configuration data store, a second configuration data, the second configuration data having a second data value for the second configuration element of the second user application,
regenerate the user interface to display the first configuration element associated with the first data value and the second configuration element associated with the second data value,
receive, via the user interface, a third data value for the second configuration element, and
update, in the centralized configuration data store, the second data value in the second configuration data with the third data value, the second configuration data to be used by the second user application during execution for configuration of the second user application;
execute the first user application using the first configuration data from the centralized configuration data store; and execute the second user application using the second configuration data from the centralized configuration data store. 12. The system of claim 11, wherein the configuration metadata indicates that the first configuration element is testable and includes a token used to locate at least one test. 13. The method of claim 12, wherein the memory has stored thereon further instructions that, when executed by the processor, cause the processor to:
receive an indication of a user selection of the test button; and perform, in response to receiving the indication of the user selection of the test button, the at least one test of the first data value, wherein the at least one test includes pinging an input URL, checking a file system, testing a database connection, or a combination thereof, the at least one test further implemented as standalone code that does not perform the at least one test as part of the first user application. 14. The system of claim 11, wherein the configuration metadata includes a name and a description of the second configuration element, resources for on-line help, and a list of selectable values for the first configuration element. 15. The system, of claim 14, wherein the configuration metadata further includes a third configuration element of the first user application, options for the first configuration element depending on selection of a fourth data value for the third configuration element, and
wherein the first data entry field for the first configuration element is a dropdown box populated with the list of selectable values filtered to be context aware based on the selection of the fourth data value. 16. The system of claim 11, wherein the user interface is accessed through a web browser, and wherein generating the user interface comprises:
receiving a username and a password; authenticating a user associated with the username and the password using secure socket layer encryption; and displaying a generic error if the authenticating fails. 17. The method of claim 11, the configuration application is further configured to:
retrieve, from the centralized configuration data store, a third configuration data, the third configuration data having a fourth data value for a third configuration element, wherein the fourth data value is encrypted in the centralized configuration data store; and regenerate the user interface to display (1) the first configuration element associated with the first data value, (2) the second configuration element associated with the second data value, and (3) the third configuration element associated with the fourth data value, wherein the fourth data value is displayed using at least one mask character based on the fourth data value being encrypted. 18. The system of claim 11, wherein the second configuration element is a port number and the third data value is the port number used when the second user application is executed. 19. The system of claim 11, wherein the memory has stored thereon further instructions that, when executed by the processor, cause the processor to:
execute a first time configuration wizard, wherein:
the first time configuration wizard provides an interface for entry of one or more data values for one or more configuration elements of a third user application,
the first time configuration wizard requires entry of a fourth data value associated with a third configuration element of a third user application,
the third configuration element is a setting required by the third user application to execute properly,
the third configuration element requires a string value,
the configuration metadata comprises a diagnostic warm-up sequence for the third user application, and
the diagnostic warm-up sequence comprises test functions that test a complete configuration profile of the third user application;
receiving, by the configuration application from the first time configuration wizard, the fourth data value; and validating that the fourth data value is a string. 20. The system of claim 11, wherein a new application can inherit the first configuration data or the second configuration data. | A computer-based system comprising a library module associated with an application, the library module using stored configuration data and configuration metadata for the application and a configurator to generate a web user interface using the configuration metadata. The web user interface allowing a user to input configuration information for the application.1. A method, comprising:
retrieving, by a configuration application on a computer system, configuration metadata from a centralized configuration data store, the configuration metadata comprising a first configuration element of a first user application on the computer system and a second configuration element of a second user application on the computer system; generating, using the configuration application, a user interface comprising a first data entry field for the first configuration element and a test button for the first configuration element; receiving, by the configuration application from the user interface, a first data value for the first configuration element; storing, by the configuration application in the centralized configuration data store, a first configuration data having the first data value for the first configuration element, the first configuration data to be used by the first user application during execution for configuration of the first user application; retrieving, by the configuration application from the centralized configuration data store, a second configuration data, the second configuration data having a second data value for the second configuration element of the second user application; regenerating, using the configuration application, the user interface to display the first configuration element associated with the first data value and the second configuration element associated with the second data value; receiving, by the configuration application from the user interface, a third data value for the second configuration element; updating, by the configuration application in the centralized configuration data store, the second data value in the second configuration data with the third data value, the second configuration data to be used by the second user application during execution for configuration of the second user application; executing, by the computer system, the first user application using the first configuration data from the centralized configuration data store; and executing, by the computer system, the second user application using the second configuration data from the centralized configuration data store. 2. The method of claim 1, wherein the configuration metadata indicates that the first configuration element is testable and includes a token used to locate at least one test. 3. The method of claim 2, further comprising:
receiving, by the computer system, an indication of a user selection of the test button; and performing, by the computer system in response to receiving the indication of the user selection of the test button, the at least one test of the first data value, wherein the at least one test includes pinging an input URL, checking a file system, testing a database connection, or a combination thereof, the at least one test further implemented as standalone code that does not perform the at least one test as part of the first user application. 4. The method of claim 1, wherein the configuration metadata includes a name and a description of the second configuration element, resources for on-line help, and a list of selectable values for the first configuration element. 5. The method of claim 4, wherein the configuration metadata further includes a third configuration element of the first user application, options for the first configuration element depending on selection of a fourth data value for the third configuration element, and
wherein the first data entry field for the first configuration element is a dropdown box populated with the list of selectable values filtered to be context aware based on the selection of the fourth data value. 6. The method of claim 1, wherein the user interface is accessed through a web browser, and wherein generating the user interface comprises:
receiving a username and a password; authenticating a user associated with the username and the password using secure socket layer encryption; and displaying a generic error if the authenticating fails. 7. The method of claim 1, further comprising:
retrieving, by the configuration application from the centralized configuration data store, a third configuration data, the third configuration data having a fourth data value for a third configuration element, wherein the fourth data value is encrypted in the centralized configuration data store; and regenerating, using the configuration application, the user interface to display (1) the first configuration element associated with the first data value, (2) the second configuration element associated with the second data value, and (3) the third configuration element associated with the fourth data value, wherein the fourth data value is displayed using at least one mask character based on the fourth data value being encrypted. 8. The method of claim 1, wherein the second configuration element is a port number and the third data value is the port number used when the second user application is executed. 9. The method of claim 1, further comprising:
executing a first time configuration wizard, wherein:
the first time configuration wizard provides an interface for entry of one or more data values for one or more configuration elements of a third user application,
the first time configuration wizard requires entry of a fourth data value associated with a third configuration element of a third user application,
the third configuration element is a setting required by the third user application to execute properly,
the third configuration element requires a string value,
the configuration metadata comprises a diagnostic warm-up sequence for the third user application, and
the diagnostic warm-up sequence comprises test functions that test a complete configuration profile of the third user application;
receiving, by the configuration application from the first time configuration wizard, the fourth data value; and validating that the fourth data value is a string. 10. The method of claim 1, wherein a new application can inherit the first configuration data or the second configuration data. 11. A system, comprising:
a processor; and a memory having stored thereon instructions that, when executed by the processor, cause the processor to:
execute a configuration application, the configuration application configured to:
retrieve configuration metadata from a centralized configuration data store, the configuration metadata comprising a first configuration element of a first user application on the computer system and a second configuration element of a second user application on the computer system,
generate a user interface comprising a first data entry field for the first configuration element and a test button for the first configuration element,
receive, via the user interface, a first data value for the first configuration element,
store a first configuration data having the first data value for the first configuration element, the first configuration data to be used by the first user application during execution for configuration of the first user application,
retrieve, from the centralized configuration data store, a second configuration data, the second configuration data having a second data value for the second configuration element of the second user application,
regenerate the user interface to display the first configuration element associated with the first data value and the second configuration element associated with the second data value,
receive, via the user interface, a third data value for the second configuration element, and
update, in the centralized configuration data store, the second data value in the second configuration data with the third data value, the second configuration data to be used by the second user application during execution for configuration of the second user application;
execute the first user application using the first configuration data from the centralized configuration data store; and execute the second user application using the second configuration data from the centralized configuration data store. 12. The system of claim 11, wherein the configuration metadata indicates that the first configuration element is testable and includes a token used to locate at least one test. 13. The method of claim 12, wherein the memory has stored thereon further instructions that, when executed by the processor, cause the processor to:
receive an indication of a user selection of the test button; and perform, in response to receiving the indication of the user selection of the test button, the at least one test of the first data value, wherein the at least one test includes pinging an input URL, checking a file system, testing a database connection, or a combination thereof, the at least one test further implemented as standalone code that does not perform the at least one test as part of the first user application. 14. The system of claim 11, wherein the configuration metadata includes a name and a description of the second configuration element, resources for on-line help, and a list of selectable values for the first configuration element. 15. The system, of claim 14, wherein the configuration metadata further includes a third configuration element of the first user application, options for the first configuration element depending on selection of a fourth data value for the third configuration element, and
wherein the first data entry field for the first configuration element is a dropdown box populated with the list of selectable values filtered to be context aware based on the selection of the fourth data value. 16. The system of claim 11, wherein the user interface is accessed through a web browser, and wherein generating the user interface comprises:
receiving a username and a password; authenticating a user associated with the username and the password using secure socket layer encryption; and displaying a generic error if the authenticating fails. 17. The method of claim 11, the configuration application is further configured to:
retrieve, from the centralized configuration data store, a third configuration data, the third configuration data having a fourth data value for a third configuration element, wherein the fourth data value is encrypted in the centralized configuration data store; and regenerate the user interface to display (1) the first configuration element associated with the first data value, (2) the second configuration element associated with the second data value, and (3) the third configuration element associated with the fourth data value, wherein the fourth data value is displayed using at least one mask character based on the fourth data value being encrypted. 18. The system of claim 11, wherein the second configuration element is a port number and the third data value is the port number used when the second user application is executed. 19. The system of claim 11, wherein the memory has stored thereon further instructions that, when executed by the processor, cause the processor to:
execute a first time configuration wizard, wherein:
the first time configuration wizard provides an interface for entry of one or more data values for one or more configuration elements of a third user application,
the first time configuration wizard requires entry of a fourth data value associated with a third configuration element of a third user application,
the third configuration element is a setting required by the third user application to execute properly,
the third configuration element requires a string value,
the configuration metadata comprises a diagnostic warm-up sequence for the third user application, and
the diagnostic warm-up sequence comprises test functions that test a complete configuration profile of the third user application;
receiving, by the configuration application from the first time configuration wizard, the fourth data value; and validating that the fourth data value is a string. 20. The system of claim 11, wherein a new application can inherit the first configuration data or the second configuration data. | 2,100 |
6,140 | 6,140 | 15,428,889 | 2,153 | Systems and methods of a search engine for interacting with a computer user as a conversation bot at the direction of the computer user. The search engine provides the computer user with the ability to selectively direct the search engine to interact with the computer user as a conversation bot. In interacting as a conversation bot, upon receive a request from the computer user, the search engine/conversation bot identifies an intent of the request, maps the intent to an action, and carries out the action on behalf of the computer user. | 1. A computer implemented method as implemented by a search engine, the method comprising:
proving a computer user with a user interface page for interacting with the search engine, wherein the user interface page includes a first user control for submitting a search query to the search engine, and further including a second user control for directing the search engine to interact with the computer user as a conversation bot; receiving an indication of the computer user interaction of the second user control directing the search engine to interact with the computer user as a conversation bot; receiving a request from the computer user; determining an intent of the request; determining an action to satisfy the determined intent of the request; and executing the determined action on behalf of the computer user. 2. The computer implemented method of claim 1 further comprising:
maintaining a current conversation with the computer user; and
wherein determining the intent of the request comprises determining the intent of the request according to the current conversation with the computer user. 3. The computer implemented method of claim 2 further comprising:
maintaining a plurality of conversations with the computer user, including the current conversation; and
wherein determining the intent of the request comprises determining the intent of the request according to the plurality of conversations with the computer user. 4. The computer implemented method of claim 3, wherein each conversation of the plurality of conversations with the user comprises a set of data/value tuples, each data/value tuple of the set of data/value tuples identifying a data type and one or more corresponding data values. 5. The computer implemented method of claim 4, wherein determining the intent of the request further comprises conducting a semantic analysis of the request to identify the intent of the request. 6. The computer implemented method of claim 5, wherein determining the intent of the request further comprises determining the intent according to the information in the set of data/value tuples of the current conversation. 7. The computer implemented method of claim 5 further comprising:
creating a new conversation with the computer user, the new conversation corresponding to the determined intent of the request; and
establishing the new conversation and the current conversation with the computer user. 8. The computer implemented method of claim 4 further comprising identifying a first executable resource for carrying out at least some of the determined action; and
wherein executing the determined action on behalf of the computer user comprises executing the determined action according to the identified executable resource. 9. The computer implemented method of claim 8 further comprising identifying a plurality of executable resources for carrying out the determined action, the plurality of executable resources including the first executable resource; and
wherein executing the determined action on behalf of the computer user comprises executing the determined action according to the identified plurality of executable resources. 10. The computer implemented method of claim 8, wherein the first executable resources is a local resource to the search engine. 11. The computer implemented method of claim 10, wherein the first executable resources is a remote resource to the search engine. 12. A computer readable medium bearing computer executable instructions which, when executed on a computing system comprising at least a processor, carry out a method of a search engine for responding to a request from a computer user, the method comprising:
proving a computer user with a user interface page for interacting with the search engine, wherein the user interface page includes a first user control for submitting a search query to the search engine, and further including a second user control for directing the search engine to interact with the computer user as a conversation bot; receiving an indicating of the computer user interaction of the second user control directing the search engine to interact with the computer user as a conversation bot; receiving a request from the computer user; determining the intent of the request; determining an action to satisfy the determined intent of the request; and executing the determined action on behalf of the computer user. 13. The computer readable medium of claim 12, wherein the method further comprises:
maintaining a current conversation with the computer user; and wherein determining the intent of the request comprises determining the intent of the request according to the current conversation with the computer user. 14. The computer readable medium of claim 13, wherein the method further comprises:
maintaining a plurality of conversations with the computer user, including the current conversation; and wherein determining the intent of the request comprises determining the intent of the request according to the plurality of conversations with the computer user. 15. The computer readable medium of claim 14, wherein each conversation of the plurality of conversations with the user comprises a set of data/value tuples, each data/value tuple of the set of data/value tuples identifying a data type and one or more corresponding data values. 16. The computer readable medium of claim 15, wherein determining the intent of the request further comprises determining the intent according to the information in the set of data/value tuples of the current conversation. 17. The computer readable medium of claim 16, wherein determining the intent of the request further comprises conducting a semantic analysis of the request to identify the intent of the request. 18. The computer readable medium of claim 16, wherein the method further comprises:
creating a new conversation with the computer user, the new conversation corresponding to the determined intent of the request; and establishing the new conversation and the current conversation with the computer user. 19. The computer readable medium of claim 16, wherein the method further comprises identifying a first executable resource for carrying out at least some of the determined action; and
wherein executing the determined action on behalf of the computer user comprises executing the determined action according to the identified executable resource. 20. A computer system implementing a search engine for responding to search queries and to requests from one or more computer users, the system comprising a processor and a memory, wherein the processor executes instructions stored in the memory as part of or in conjunction with additional components to respond to requests from one or more computer users, the additional components comprising:
an executable search results page generator for responding to a search query with one or more search results pages, each search results page comprises search results corresponding to content available over a network as determined according to information maintained in a content store; and a executable conversation bot for responding to a request from a computer user, the conversation bot comprising:
an executable intent identification component for identifying an intent of the request according to a current conversation with the computer user;
an executable conversation manager for determining a current conversation with the computer user; and
an executable action manager for:
determining an action to carry out in response to the request from the computer user according to the identified intent of the request; and
carrying out the determined action according to one or more resources stored in a resource list. | Systems and methods of a search engine for interacting with a computer user as a conversation bot at the direction of the computer user. The search engine provides the computer user with the ability to selectively direct the search engine to interact with the computer user as a conversation bot. In interacting as a conversation bot, upon receive a request from the computer user, the search engine/conversation bot identifies an intent of the request, maps the intent to an action, and carries out the action on behalf of the computer user.1. A computer implemented method as implemented by a search engine, the method comprising:
proving a computer user with a user interface page for interacting with the search engine, wherein the user interface page includes a first user control for submitting a search query to the search engine, and further including a second user control for directing the search engine to interact with the computer user as a conversation bot; receiving an indication of the computer user interaction of the second user control directing the search engine to interact with the computer user as a conversation bot; receiving a request from the computer user; determining an intent of the request; determining an action to satisfy the determined intent of the request; and executing the determined action on behalf of the computer user. 2. The computer implemented method of claim 1 further comprising:
maintaining a current conversation with the computer user; and
wherein determining the intent of the request comprises determining the intent of the request according to the current conversation with the computer user. 3. The computer implemented method of claim 2 further comprising:
maintaining a plurality of conversations with the computer user, including the current conversation; and
wherein determining the intent of the request comprises determining the intent of the request according to the plurality of conversations with the computer user. 4. The computer implemented method of claim 3, wherein each conversation of the plurality of conversations with the user comprises a set of data/value tuples, each data/value tuple of the set of data/value tuples identifying a data type and one or more corresponding data values. 5. The computer implemented method of claim 4, wherein determining the intent of the request further comprises conducting a semantic analysis of the request to identify the intent of the request. 6. The computer implemented method of claim 5, wherein determining the intent of the request further comprises determining the intent according to the information in the set of data/value tuples of the current conversation. 7. The computer implemented method of claim 5 further comprising:
creating a new conversation with the computer user, the new conversation corresponding to the determined intent of the request; and
establishing the new conversation and the current conversation with the computer user. 8. The computer implemented method of claim 4 further comprising identifying a first executable resource for carrying out at least some of the determined action; and
wherein executing the determined action on behalf of the computer user comprises executing the determined action according to the identified executable resource. 9. The computer implemented method of claim 8 further comprising identifying a plurality of executable resources for carrying out the determined action, the plurality of executable resources including the first executable resource; and
wherein executing the determined action on behalf of the computer user comprises executing the determined action according to the identified plurality of executable resources. 10. The computer implemented method of claim 8, wherein the first executable resources is a local resource to the search engine. 11. The computer implemented method of claim 10, wherein the first executable resources is a remote resource to the search engine. 12. A computer readable medium bearing computer executable instructions which, when executed on a computing system comprising at least a processor, carry out a method of a search engine for responding to a request from a computer user, the method comprising:
proving a computer user with a user interface page for interacting with the search engine, wherein the user interface page includes a first user control for submitting a search query to the search engine, and further including a second user control for directing the search engine to interact with the computer user as a conversation bot; receiving an indicating of the computer user interaction of the second user control directing the search engine to interact with the computer user as a conversation bot; receiving a request from the computer user; determining the intent of the request; determining an action to satisfy the determined intent of the request; and executing the determined action on behalf of the computer user. 13. The computer readable medium of claim 12, wherein the method further comprises:
maintaining a current conversation with the computer user; and wherein determining the intent of the request comprises determining the intent of the request according to the current conversation with the computer user. 14. The computer readable medium of claim 13, wherein the method further comprises:
maintaining a plurality of conversations with the computer user, including the current conversation; and wherein determining the intent of the request comprises determining the intent of the request according to the plurality of conversations with the computer user. 15. The computer readable medium of claim 14, wherein each conversation of the plurality of conversations with the user comprises a set of data/value tuples, each data/value tuple of the set of data/value tuples identifying a data type and one or more corresponding data values. 16. The computer readable medium of claim 15, wherein determining the intent of the request further comprises determining the intent according to the information in the set of data/value tuples of the current conversation. 17. The computer readable medium of claim 16, wherein determining the intent of the request further comprises conducting a semantic analysis of the request to identify the intent of the request. 18. The computer readable medium of claim 16, wherein the method further comprises:
creating a new conversation with the computer user, the new conversation corresponding to the determined intent of the request; and establishing the new conversation and the current conversation with the computer user. 19. The computer readable medium of claim 16, wherein the method further comprises identifying a first executable resource for carrying out at least some of the determined action; and
wherein executing the determined action on behalf of the computer user comprises executing the determined action according to the identified executable resource. 20. A computer system implementing a search engine for responding to search queries and to requests from one or more computer users, the system comprising a processor and a memory, wherein the processor executes instructions stored in the memory as part of or in conjunction with additional components to respond to requests from one or more computer users, the additional components comprising:
an executable search results page generator for responding to a search query with one or more search results pages, each search results page comprises search results corresponding to content available over a network as determined according to information maintained in a content store; and a executable conversation bot for responding to a request from a computer user, the conversation bot comprising:
an executable intent identification component for identifying an intent of the request according to a current conversation with the computer user;
an executable conversation manager for determining a current conversation with the computer user; and
an executable action manager for:
determining an action to carry out in response to the request from the computer user according to the identified intent of the request; and
carrying out the determined action according to one or more resources stored in a resource list. | 2,100 |
6,141 | 6,141 | 15,258,298 | 2,125 | A method, system and a computer program product are provided for verifying ground truth data by iteratively assigning machine-annotated training set examples to clusters which are prioritized based on verification scores to identify and display one or more prioritized review candidate training set examples grouped in a prioritized cluster in order to solicit verification or correction feedback from a human subject matter expert for inclusion in an accepted training set. | 1. A method of verifying ground truth data, the method comprising:
receiving, by an information handling system, comprising a processor and a memory, ground truth data comprising a human-curated training set; performing, by the information handling system, annotation operations on the training set using an annotator to generate a machine-annotated training set; assigning, by the information handling system, examples from the machine-annotated training set to one or more clusters according to a feature vector similarity measure; analyzing, by the information handling system, the one or more clusters to prioritize clusters based on verification scores computed for each cluster; and displaying, by the information handling system, machine-annotated training set examples associated with a prioritized cluster as prioritized review candidates to solicit verification or correction feedback from a human subject matter expert (SME) for inclusion in an accepted training set. 2. The method of claim 1, where the annotator comprises a dictionary annotator, rule-based annotator, or a machine learning annotator. 3. The method of claim 1, where assigning examples from the machine-annotated training set to one or more clusters comprises:
generating a vector representation for each of example from the machine-annotated training set; and applying one or more feature selection algorithms to the vector representations of the machine-annotated training set examples to identify the one or more clusters. 4. The method of claim 1, where analyzing the one or more clusters comprises computing a verification score for each cluster as a confidence metric which quantifies how likely that annotations in the cluster are true positives based on a training model for the feature set of a given annotation cluster. 5. The method of claim 1, where analyzing the one or more clusters comprises computing a verification score for each cluster as an Inter Annotator Agreement (IAA) score measuring how consistent annotations of the human SME are with annotations from a group of human SMEs for a given annotation cluster. 6. The method of claim 1, where analyzing the one or more clusters comprises computing a verification score for each cluster as a cluster size score measuring a given annotation cluster. 7. The method of claim 1, where analyzing the one or more clusters comprises computing a verification score for each cluster as a cross-validation score measuring how similar the machine-annotated training set examples are to a feature set for a given annotation cluster. 8. The method of claim 1, further comprising verifying or correcting all prioritized review candidates in a cluster as a single group based on verification or correction feedback from the human subject matter expert. 9. 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 an information handling system, causes the system to verify ground truth data by:
receiving ground truth data comprising a human-curated training set; performing annotation operations on the training set using an annotator to generate a machine-annotated training set; assigning examples from the machine-annotated training set to one or more clusters according to a feature vector similarity measure; analyzing the one or more clusters to prioritize clusters based on verification scores computed for each cluster; and displaying machine-annotated training set examples associated with a prioritized cluster as prioritized review candidates to solicit verification or correction feedback from a human subject matter expert (SME) for inclusion in an accepted training set. 10. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to perform annotation operations using a dictionary annotator, rule-based annotator, or a machine learning annotator. 11. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to assign examples from the machine-annotated training set to one or more clusters by:
generating a vector representation for each of example from the machine-annotated training set; and applying one or more feature selection algorithms to the vector representations of the machine-annotated training set examples to identify the one or more clusters. 12. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to analyze the one or more clusters by computing a verification score for each cluster as a confidence metric which quantifies how likely that annotations in the cluster are true positives based on a training model for the feature set of a given annotation cluster. 13. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to analyze the one or more clusters by computing a verification score for each cluster as an Inter Annotator Agreement (IAA) score measuring how consistent annotations of the human SME are with annotations from a group of human SMEs for a given annotation cluster. 14. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to analyze the one or more clusters by computing a verification score for each cluster as a cluster size score measuring a given annotation cluster. 15. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to analyze the one or more clusters by computing a verification score for each cluster as a cross-validation score measuring how similar the machine-annotated training set examples are to a feature set for a given annotation cluster. 16. The computer program product of claim 9, further comprising computer readable program, when executed on the system, causes the system to verify or correct all prioritized review candidates in a cluster as a single group based on verification or correction feedback from the human subject matter expert. 17. An information handling system comprising:
one or more processors; a memory coupled to at least one of the processors; and a set of instructions stored in the memory and executed by at least one of the processors to verify ground truth data, wherein the set of instructions are executable to perform actions of: receiving, by the system, ground truth data comprising a human-curated training set; perforating, by the system, annotation operations on the training set using an annotator to generate a machine-annotated training set; assigning, by the system, examples from the machine-annotated training set to one or more clusters according to a feature vector similarity measure; analyzing, by the system, the one or more clusters to prioritize clusters based on verification scores computed for each cluster; and displaying, by the system, machine-annotated training set examples associated with a prioritized cluster as prioritized review candidates to solicit verification or correction feedback from a human subject matter expert (SME) for inclusion in an accepted training set. 18. The information handling system of claim 17, where analyzing the one or more clusters comprises computing a verification score for each cluster as a confidence metric which quantifies how likely that annotations in the cluster are true positives based on a training model for the feature set of a given annotation cluster. 19. The information handling system of claim 17, where analyzing the one or more clusters comprises computing a verification score for each cluster as an Inter Annotator Agreement (IAA) score measuring how consistent annotations of the human SME are with annotations from a group of human SMEs for a given annotation cluster. 20. The information handling system of claim 17, where analyzing the one or more clusters comprises computing a verification score for each cluster as a cluster size score measuring a given annotation cluster. 21. The information handling system of claim 17, where analyzing the one or more clusters comprises computing a verification score for each cluster as a cross-validation score measuring how similar the machine-annotated training set examples are to a feature set for a given annotation cluster. 22. The information handling system of claim 17, further comprising verifying or correcting all prioritized review candidates in a cluster as a single group based on verification or correction feedback from the human subject matter expert. 23. The information handling system of claim 17, further comprising verifying or correcting prioritized review candidates in a cluster one at a time based on verification or correction feedback from the human subject matter expert. | A method, system and a computer program product are provided for verifying ground truth data by iteratively assigning machine-annotated training set examples to clusters which are prioritized based on verification scores to identify and display one or more prioritized review candidate training set examples grouped in a prioritized cluster in order to solicit verification or correction feedback from a human subject matter expert for inclusion in an accepted training set.1. A method of verifying ground truth data, the method comprising:
receiving, by an information handling system, comprising a processor and a memory, ground truth data comprising a human-curated training set; performing, by the information handling system, annotation operations on the training set using an annotator to generate a machine-annotated training set; assigning, by the information handling system, examples from the machine-annotated training set to one or more clusters according to a feature vector similarity measure; analyzing, by the information handling system, the one or more clusters to prioritize clusters based on verification scores computed for each cluster; and displaying, by the information handling system, machine-annotated training set examples associated with a prioritized cluster as prioritized review candidates to solicit verification or correction feedback from a human subject matter expert (SME) for inclusion in an accepted training set. 2. The method of claim 1, where the annotator comprises a dictionary annotator, rule-based annotator, or a machine learning annotator. 3. The method of claim 1, where assigning examples from the machine-annotated training set to one or more clusters comprises:
generating a vector representation for each of example from the machine-annotated training set; and applying one or more feature selection algorithms to the vector representations of the machine-annotated training set examples to identify the one or more clusters. 4. The method of claim 1, where analyzing the one or more clusters comprises computing a verification score for each cluster as a confidence metric which quantifies how likely that annotations in the cluster are true positives based on a training model for the feature set of a given annotation cluster. 5. The method of claim 1, where analyzing the one or more clusters comprises computing a verification score for each cluster as an Inter Annotator Agreement (IAA) score measuring how consistent annotations of the human SME are with annotations from a group of human SMEs for a given annotation cluster. 6. The method of claim 1, where analyzing the one or more clusters comprises computing a verification score for each cluster as a cluster size score measuring a given annotation cluster. 7. The method of claim 1, where analyzing the one or more clusters comprises computing a verification score for each cluster as a cross-validation score measuring how similar the machine-annotated training set examples are to a feature set for a given annotation cluster. 8. The method of claim 1, further comprising verifying or correcting all prioritized review candidates in a cluster as a single group based on verification or correction feedback from the human subject matter expert. 9. 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 an information handling system, causes the system to verify ground truth data by:
receiving ground truth data comprising a human-curated training set; performing annotation operations on the training set using an annotator to generate a machine-annotated training set; assigning examples from the machine-annotated training set to one or more clusters according to a feature vector similarity measure; analyzing the one or more clusters to prioritize clusters based on verification scores computed for each cluster; and displaying machine-annotated training set examples associated with a prioritized cluster as prioritized review candidates to solicit verification or correction feedback from a human subject matter expert (SME) for inclusion in an accepted training set. 10. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to perform annotation operations using a dictionary annotator, rule-based annotator, or a machine learning annotator. 11. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to assign examples from the machine-annotated training set to one or more clusters by:
generating a vector representation for each of example from the machine-annotated training set; and applying one or more feature selection algorithms to the vector representations of the machine-annotated training set examples to identify the one or more clusters. 12. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to analyze the one or more clusters by computing a verification score for each cluster as a confidence metric which quantifies how likely that annotations in the cluster are true positives based on a training model for the feature set of a given annotation cluster. 13. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to analyze the one or more clusters by computing a verification score for each cluster as an Inter Annotator Agreement (IAA) score measuring how consistent annotations of the human SME are with annotations from a group of human SMEs for a given annotation cluster. 14. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to analyze the one or more clusters by computing a verification score for each cluster as a cluster size score measuring a given annotation cluster. 15. The computer program product of claim 9, wherein the computer readable program, when executed on the system, causes the system to analyze the one or more clusters by computing a verification score for each cluster as a cross-validation score measuring how similar the machine-annotated training set examples are to a feature set for a given annotation cluster. 16. The computer program product of claim 9, further comprising computer readable program, when executed on the system, causes the system to verify or correct all prioritized review candidates in a cluster as a single group based on verification or correction feedback from the human subject matter expert. 17. An information handling system comprising:
one or more processors; a memory coupled to at least one of the processors; and a set of instructions stored in the memory and executed by at least one of the processors to verify ground truth data, wherein the set of instructions are executable to perform actions of: receiving, by the system, ground truth data comprising a human-curated training set; perforating, by the system, annotation operations on the training set using an annotator to generate a machine-annotated training set; assigning, by the system, examples from the machine-annotated training set to one or more clusters according to a feature vector similarity measure; analyzing, by the system, the one or more clusters to prioritize clusters based on verification scores computed for each cluster; and displaying, by the system, machine-annotated training set examples associated with a prioritized cluster as prioritized review candidates to solicit verification or correction feedback from a human subject matter expert (SME) for inclusion in an accepted training set. 18. The information handling system of claim 17, where analyzing the one or more clusters comprises computing a verification score for each cluster as a confidence metric which quantifies how likely that annotations in the cluster are true positives based on a training model for the feature set of a given annotation cluster. 19. The information handling system of claim 17, where analyzing the one or more clusters comprises computing a verification score for each cluster as an Inter Annotator Agreement (IAA) score measuring how consistent annotations of the human SME are with annotations from a group of human SMEs for a given annotation cluster. 20. The information handling system of claim 17, where analyzing the one or more clusters comprises computing a verification score for each cluster as a cluster size score measuring a given annotation cluster. 21. The information handling system of claim 17, where analyzing the one or more clusters comprises computing a verification score for each cluster as a cross-validation score measuring how similar the machine-annotated training set examples are to a feature set for a given annotation cluster. 22. The information handling system of claim 17, further comprising verifying or correcting all prioritized review candidates in a cluster as a single group based on verification or correction feedback from the human subject matter expert. 23. The information handling system of claim 17, further comprising verifying or correcting prioritized review candidates in a cluster one at a time based on verification or correction feedback from the human subject matter expert. | 2,100 |
6,142 | 6,142 | 12,722,300 | 2,166 | Accessing item information for items selected from an image including: presenting an image including a plurality of selectable items for selection by a viewer; determining a position of an item selected from the plurality of selectable items by the viewer; sending the determined position of an item along with timing information of the image to a server; receiving information related to the item selected by the viewer from the server, wherein the information related to the item was retrieved by the server from a database using the determined position of an item and the timing information of the image; and presenting the information related to the item. | 1. A method of accessing item information for items selected from an image, the method comprising:
presenting an image including a plurality of selectable items for selection by a viewer; determining a position of an item selected from the plurality of selectable items by the viewer; sending the determined position of an item along with timing information of the image to a server; receiving information related to the item selected by the viewer from the server, wherein the information related to the item was retrieved by the server from a database using the determined position of an item and the timing information of the image; and presenting the information related to the item. 2. The method of claim 1, wherein determining a position of an item comprises
determining a position of a cursor moved over the item by the viewer. 3. The method of claim 1, wherein the image represents a single frame of a video. 4. The method of claim 3, wherein the timing information of the image includes
a frame number of the single frame within the video. 5. A method of providing item information for items selected from an image, the method comprising:
receiving position information of an item selected from a plurality of items displayed on the image, along with timing information of the image from a client media device; determining information related to the selected item of the image using the position information and the timing information, wherein the image represents a single frame of multi-frame media, and wherein the position information is used to identify the selected item, and the timing information is used to identify a selected frame of the multi-frame media. 6. The method of claim 5, wherein determining information related to the selected item comprises:
identifying the selected frame and the selected item; and retrieving the information related to the selected item by searching database entry corresponding to the identified frame and item. 7. The method of claim 6, wherein determining information related to the selected item further comprises
sending the retrieved information related to the selected item to the client media device. 8. A system for accessing item information for items selected from a displayed image, the system comprising:
a client media device to present media including a plurality of images, each image of the plurality of images including selectable items, the client media device enabling a viewer to select at least one item of the selectable items, wherein when the viewer selects the at least one item, the client media device determines and sends position information of the at least one item within one image of the plurality of images, along with timing information of the one image; and a server to receive the position information and the timing information, and determine which item on which image of the plurality of images corresponds to the received position information and timing information, wherein the server retrieves and sends back to the client media device, relevant information corresponding to the at least one item matching the position information and the timing information. 9. The system of claim 8, wherein the client media device includes
an interface to enable the viewer to select the at least one item by using a remote control to move a cursor near the at least one item. 10. The system of claim 8, wherein the position information of the at least one item includes
an x-y coordinate of the at least one item within the one image of the plurality of images. 11. The system of claim 8, wherein the plurality of images comprises a video. 12. The system of claim 11, wherein the timing information of the one image includes
a timing indication of the one image within the video. 13. The system of claim 12, wherein the timing indication is a frame number of the video. 14. The system of claim 11, wherein the server includes
an item table for the video, the item table having entries including the position information, the timing information, and an identifier for at least one item, wherein the server retrieves the identifier corresponding to the received position information and the timing information. 15. The system of claim 14, wherein the server further includes
an item database for the video, the item database having entries including the identifier and corresponding relevant information, wherein the server retrieves the relevant information corresponding to the retrieved identifier, and sends the retrieved relevant information to the client media device. 16. The system of claim 8, wherein the client media device includes
a Blu-ray Disc (BD) player. 17. A client media apparatus comprising:
means for presenting an image including a plurality of selectable items for selection by a viewer; means for determining a position of an item selected from the plurality of selectable items by the viewer; means for sending the determined position of an item along with timing information of the image to a server; means for receiving information related to the item selected by the viewer from the server, wherein the information related to the item was retrieved by the server from a database using the determined position of an item and the timing information of the image; and means for presenting the information related to the item. 18. A server apparatus comprising:
means for receiving position information of an item selected from a plurality of items displayed on an image, along with timing information of the image from a client media device; and means for determining information related to the selected item of the image using the position information and the timing information, wherein the image represents a single frame of multi-frame media, and wherein the position information is used to identify the selected item, and the timing information is used to identify a selected frame of the multi-frame media. 19. The apparatus of claim 18, wherein means for determining information related to the selected item comprises:
means for identifying the selected frame and the selected item; and means for retrieving the information related to the selected item by searching database entry corresponding to the identified frame and item. 20. The apparatus of claim 19, wherein means for determining information related to the selected item further comprises
means for sending the retrieved information related to the selected item to the client media device. 21. A computer-readable storage medium storing a computer program for accessing item information for items selected from an image, the computer program comprising executable instructions that cause a computer to:
present an image including a plurality of selectable items for selection by a viewer; determine a position of an item selected from the plurality of selectable items by the viewer; send the determined position of an item along with timing information of the image to a server; receive information related to the item selected by the viewer from the server, wherein the information related to the item was retrieved by the server from a database using the determined position of an item and the timing information of the image; and present the information related to the item. 22. The storage medium of claim 21, wherein executable instructions that cause a computer to determine a position of an item comprise executable instructions that cause a computer to
determine a position of a cursor moved over the item by the viewer. 23. A computer-readable storage medium storing a computer program for providing item information for items selected from an image, the computer program comprising executable instructions that cause a computer to:
receive position information of an item selected from a plurality of items displayed on the image, along with timing information of the image from a client media device; determine information related to the selected item of the image using the position information and the timing information, wherein the image represents a single frame of multi-frame media, and wherein the position information is used to identify the selected item, and the timing information is used to identify a selected frame of the multi-frame media. 24. The storage medium of claim 23, wherein executable instructions that cause a computer to determining information related to the selected item comprise executable instructions that cause a computer to:
identify the selected frame and the selected item; and retrieve the information related to the selected item by searching database entry corresponding to the identified frame and item. 25. The storage medium of claim 24, wherein executable instructions that cause a computer to determine information related to the selected item further comprise executable instructions that cause a computer to
send the retrieved information related to the selected item to the client media device. | Accessing item information for items selected from an image including: presenting an image including a plurality of selectable items for selection by a viewer; determining a position of an item selected from the plurality of selectable items by the viewer; sending the determined position of an item along with timing information of the image to a server; receiving information related to the item selected by the viewer from the server, wherein the information related to the item was retrieved by the server from a database using the determined position of an item and the timing information of the image; and presenting the information related to the item.1. A method of accessing item information for items selected from an image, the method comprising:
presenting an image including a plurality of selectable items for selection by a viewer; determining a position of an item selected from the plurality of selectable items by the viewer; sending the determined position of an item along with timing information of the image to a server; receiving information related to the item selected by the viewer from the server, wherein the information related to the item was retrieved by the server from a database using the determined position of an item and the timing information of the image; and presenting the information related to the item. 2. The method of claim 1, wherein determining a position of an item comprises
determining a position of a cursor moved over the item by the viewer. 3. The method of claim 1, wherein the image represents a single frame of a video. 4. The method of claim 3, wherein the timing information of the image includes
a frame number of the single frame within the video. 5. A method of providing item information for items selected from an image, the method comprising:
receiving position information of an item selected from a plurality of items displayed on the image, along with timing information of the image from a client media device; determining information related to the selected item of the image using the position information and the timing information, wherein the image represents a single frame of multi-frame media, and wherein the position information is used to identify the selected item, and the timing information is used to identify a selected frame of the multi-frame media. 6. The method of claim 5, wherein determining information related to the selected item comprises:
identifying the selected frame and the selected item; and retrieving the information related to the selected item by searching database entry corresponding to the identified frame and item. 7. The method of claim 6, wherein determining information related to the selected item further comprises
sending the retrieved information related to the selected item to the client media device. 8. A system for accessing item information for items selected from a displayed image, the system comprising:
a client media device to present media including a plurality of images, each image of the plurality of images including selectable items, the client media device enabling a viewer to select at least one item of the selectable items, wherein when the viewer selects the at least one item, the client media device determines and sends position information of the at least one item within one image of the plurality of images, along with timing information of the one image; and a server to receive the position information and the timing information, and determine which item on which image of the plurality of images corresponds to the received position information and timing information, wherein the server retrieves and sends back to the client media device, relevant information corresponding to the at least one item matching the position information and the timing information. 9. The system of claim 8, wherein the client media device includes
an interface to enable the viewer to select the at least one item by using a remote control to move a cursor near the at least one item. 10. The system of claim 8, wherein the position information of the at least one item includes
an x-y coordinate of the at least one item within the one image of the plurality of images. 11. The system of claim 8, wherein the plurality of images comprises a video. 12. The system of claim 11, wherein the timing information of the one image includes
a timing indication of the one image within the video. 13. The system of claim 12, wherein the timing indication is a frame number of the video. 14. The system of claim 11, wherein the server includes
an item table for the video, the item table having entries including the position information, the timing information, and an identifier for at least one item, wherein the server retrieves the identifier corresponding to the received position information and the timing information. 15. The system of claim 14, wherein the server further includes
an item database for the video, the item database having entries including the identifier and corresponding relevant information, wherein the server retrieves the relevant information corresponding to the retrieved identifier, and sends the retrieved relevant information to the client media device. 16. The system of claim 8, wherein the client media device includes
a Blu-ray Disc (BD) player. 17. A client media apparatus comprising:
means for presenting an image including a plurality of selectable items for selection by a viewer; means for determining a position of an item selected from the plurality of selectable items by the viewer; means for sending the determined position of an item along with timing information of the image to a server; means for receiving information related to the item selected by the viewer from the server, wherein the information related to the item was retrieved by the server from a database using the determined position of an item and the timing information of the image; and means for presenting the information related to the item. 18. A server apparatus comprising:
means for receiving position information of an item selected from a plurality of items displayed on an image, along with timing information of the image from a client media device; and means for determining information related to the selected item of the image using the position information and the timing information, wherein the image represents a single frame of multi-frame media, and wherein the position information is used to identify the selected item, and the timing information is used to identify a selected frame of the multi-frame media. 19. The apparatus of claim 18, wherein means for determining information related to the selected item comprises:
means for identifying the selected frame and the selected item; and means for retrieving the information related to the selected item by searching database entry corresponding to the identified frame and item. 20. The apparatus of claim 19, wherein means for determining information related to the selected item further comprises
means for sending the retrieved information related to the selected item to the client media device. 21. A computer-readable storage medium storing a computer program for accessing item information for items selected from an image, the computer program comprising executable instructions that cause a computer to:
present an image including a plurality of selectable items for selection by a viewer; determine a position of an item selected from the plurality of selectable items by the viewer; send the determined position of an item along with timing information of the image to a server; receive information related to the item selected by the viewer from the server, wherein the information related to the item was retrieved by the server from a database using the determined position of an item and the timing information of the image; and present the information related to the item. 22. The storage medium of claim 21, wherein executable instructions that cause a computer to determine a position of an item comprise executable instructions that cause a computer to
determine a position of a cursor moved over the item by the viewer. 23. A computer-readable storage medium storing a computer program for providing item information for items selected from an image, the computer program comprising executable instructions that cause a computer to:
receive position information of an item selected from a plurality of items displayed on the image, along with timing information of the image from a client media device; determine information related to the selected item of the image using the position information and the timing information, wherein the image represents a single frame of multi-frame media, and wherein the position information is used to identify the selected item, and the timing information is used to identify a selected frame of the multi-frame media. 24. The storage medium of claim 23, wherein executable instructions that cause a computer to determining information related to the selected item comprise executable instructions that cause a computer to:
identify the selected frame and the selected item; and retrieve the information related to the selected item by searching database entry corresponding to the identified frame and item. 25. The storage medium of claim 24, wherein executable instructions that cause a computer to determine information related to the selected item further comprise executable instructions that cause a computer to
send the retrieved information related to the selected item to the client media device. | 2,100 |
6,143 | 6,143 | 15,598,340 | 2,177 | An interface performs a flick operation with a button selected from buttons of representative characters for each of the syllabic lines of the Japanese syllabary that are array-displayed on a touch panel so as to specify any one of Japanese characters assigned to the representative character in advance. The interface includes a storage unit that stores association information in which up, down, left, and right directions are set to each of the characters assigned to the representative characters in association with each button and a guide image display processing unit that displays a guide image guiding arrangement directions set to the characters assigned to the representative characters prior to selection of a button of the representative character in an outside of an array display region of the representative character. | 1. An interface for performing a flick operation with a button selected from buttons of a plurality of types of representative characters array-displayed on a touch panel so as to specify any one of a predetermined number of characters assigned to the corresponding representative character in advance, the interface comprising:
a storage unit configured to store information on an arrangement direction set for each of the characters assigned to the representative characters in a manner corresponding to each of the buttons; and a guide image display processing unit configured to display a guide image that guides the arrangement direction set for each of the characters assigned to the representative character prior to selection of a button of the representative character in an outside of an array display region of the representative character. 2. The interface according to claim 1, wherein
the guide image display processing unit changes a display form of the guide image in a manner corresponding to a button selected. 3. The interface according to claim 1, wherein
the guide image display processing unit changes to a guide image that corresponds to a button selected at a time point that the button is selected. 4. The interface according to claim 1, wherein
the guide image display processing unit periodically changes display of the guide image while the selection of a button is not performed. 5. The interface according to claim 1, wherein
the guide image display processing unit changes a display form with respect to a character in the guide image that corresponds to a character selected by a flick operation. 6. The interface according to claim 1, further comprising:
a character display processing unit configured to set a different color to each of the representative character that is displayed in a reference position in an inside of a display frame of the button and the characters assigned that are displayed in the display frame of the button in positions having arrangement directions different from one another with respect to the representative character, wherein the guide image display processing unit forms the guide image with a figure that presents a positional relationship corresponding to positions including a position of the representative character and arrangement directions of the characters assigned and displays the positions in the same colors as those set for the respective characters, and the character display processing unit erases the characters assigned at a time point that the button is selected. 7. A character input guide method for performing a flick operation with a button selected from buttons of a plurality of types of representative characters selectively array-displayed on a touch panel so as to specify any one of a predetermined number of characters assigned to the representative character of the button in advance, the character input guide method comprising:
storing information on an arrangement direction set for each of the characters assigned to the representative characters in a manner corresponding to each of the buttons; and displaying a guide image that guides the arrangement direction set for each of the characters assigned to the representative character prior to selection of a button of the representative character in an outside of an array display region of the representative character. 8. A non-transitory computer readable medium including a program for an interface for performing a flick operation with a button selected from buttons of a plurality of types of representative characters array-displayed on a touch panel so as to specify any one of a predetermined number of characters assigned to the corresponding representative character in advance, the program causing the interface to function as
a storage processing unit configured to cause a storage unit to store information on an arrangement direction set for each of the characters assigned to the representative characters in a manner corresponding to each of the buttons; and a guide image display processing unit configured to display a guide image that guides the arrangement direction set for each of the characters assigned to the representative character prior to selection of a button of the representative character in an outside of an array display region of the representative character. | An interface performs a flick operation with a button selected from buttons of representative characters for each of the syllabic lines of the Japanese syllabary that are array-displayed on a touch panel so as to specify any one of Japanese characters assigned to the representative character in advance. The interface includes a storage unit that stores association information in which up, down, left, and right directions are set to each of the characters assigned to the representative characters in association with each button and a guide image display processing unit that displays a guide image guiding arrangement directions set to the characters assigned to the representative characters prior to selection of a button of the representative character in an outside of an array display region of the representative character.1. An interface for performing a flick operation with a button selected from buttons of a plurality of types of representative characters array-displayed on a touch panel so as to specify any one of a predetermined number of characters assigned to the corresponding representative character in advance, the interface comprising:
a storage unit configured to store information on an arrangement direction set for each of the characters assigned to the representative characters in a manner corresponding to each of the buttons; and a guide image display processing unit configured to display a guide image that guides the arrangement direction set for each of the characters assigned to the representative character prior to selection of a button of the representative character in an outside of an array display region of the representative character. 2. The interface according to claim 1, wherein
the guide image display processing unit changes a display form of the guide image in a manner corresponding to a button selected. 3. The interface according to claim 1, wherein
the guide image display processing unit changes to a guide image that corresponds to a button selected at a time point that the button is selected. 4. The interface according to claim 1, wherein
the guide image display processing unit periodically changes display of the guide image while the selection of a button is not performed. 5. The interface according to claim 1, wherein
the guide image display processing unit changes a display form with respect to a character in the guide image that corresponds to a character selected by a flick operation. 6. The interface according to claim 1, further comprising:
a character display processing unit configured to set a different color to each of the representative character that is displayed in a reference position in an inside of a display frame of the button and the characters assigned that are displayed in the display frame of the button in positions having arrangement directions different from one another with respect to the representative character, wherein the guide image display processing unit forms the guide image with a figure that presents a positional relationship corresponding to positions including a position of the representative character and arrangement directions of the characters assigned and displays the positions in the same colors as those set for the respective characters, and the character display processing unit erases the characters assigned at a time point that the button is selected. 7. A character input guide method for performing a flick operation with a button selected from buttons of a plurality of types of representative characters selectively array-displayed on a touch panel so as to specify any one of a predetermined number of characters assigned to the representative character of the button in advance, the character input guide method comprising:
storing information on an arrangement direction set for each of the characters assigned to the representative characters in a manner corresponding to each of the buttons; and displaying a guide image that guides the arrangement direction set for each of the characters assigned to the representative character prior to selection of a button of the representative character in an outside of an array display region of the representative character. 8. A non-transitory computer readable medium including a program for an interface for performing a flick operation with a button selected from buttons of a plurality of types of representative characters array-displayed on a touch panel so as to specify any one of a predetermined number of characters assigned to the corresponding representative character in advance, the program causing the interface to function as
a storage processing unit configured to cause a storage unit to store information on an arrangement direction set for each of the characters assigned to the representative characters in a manner corresponding to each of the buttons; and a guide image display processing unit configured to display a guide image that guides the arrangement direction set for each of the characters assigned to the representative character prior to selection of a button of the representative character in an outside of an array display region of the representative character. | 2,100 |
6,144 | 6,144 | 15,022,256 | 2,173 | Mechanisms are described for receiving touch inputs on a touch screen display in a way that does not obscure the images and content presented on the display. Content, including selectable elements, is displayed in a main portion of a display, where as an input region that does not overlap with the main portion is provided on the display for receiving touch input selecting particular selectable elements. An extrapolated touch input in the main portion of the display is determined based on the location of the touch input in the input region, such that selection of a particular selectable element may be accomplished when the location of the extrapolated touch input coincides with the location of the selectable element. | 1-34. (canceled) 35. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the processor, cause the apparatus to at least:
provide for presentation of a selectable element in a main portion of a display; receive a touch input in an input region proximate the main portion of the display, wherein the input region does not overlap with the main portion; determine an extrapolated touch input in the main portion of the display based on a location of the touch input in the input region; and provide for selection of the selectable element in an instance in which a location of the extrapolated touch input coincides with a location of the selectable element. 36. The apparatus of claim 35, wherein the touch input comprises a first touch input and the extrapolated touch input comprises a first extrapolated touch input, and wherein the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to:
receive a second touch input in the input region; determine a second extrapolated touch input in the main portion of the display based on the location of the second touch input in the input region; and provide for selection of the selectable element in an instance in which an intersection of the first extrapolated touch input and the second extrapolated touch input coincides with the location of the selectable element. 37. The apparatus of claim 35, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to detect an angle associated with the touch input and to determine the location of the extrapolated touch input based on the angle of the touch input that is detected. 38. The apparatus of claim 35, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to provide a visual representation of the location of the extrapolated touch input in the main portion of the display. 39. The apparatus of claim 38 wherein the visual representation comprises a ray extending from the location of the touch input in the input region at least partially into the main portion of the display. 40. The apparatus of claim 35, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to modify the location of the extrapolated touch input based on a change in the angle of the touch input. 41. The apparatus of claim 35, wherein the input region is disposed along an edge of the display. 42. The apparatus of claim 35, wherein the input region is defined by a surface that is in substantially the same plane as the display. 43. The apparatus of claim 35, wherein the input region is defined by a surface that defines a non-zero angle with the display. 44. The apparatus of claim 35, wherein the input region is defined by the display. 45. A method comprising:
providing for presentation of a selectable element in a main portion of a display; receiving a touch input in an input region proximate the main portion of the display, wherein the input region does not overlap with the main portion; determining an extrapolated touch input in the main portion of the display based on a location of the touch input in the input region; and providing for selection of the selectable element in an instance in which a location of the extrapolated touch input coincides with a location of the selectable element. 46. The method of claim 45, wherein the touch input comprises a first touch input and the extrapolated touch input comprises a first extrapolated touch input, and wherein the method further comprises:
receiving a second touch input in the input region; determining a second extrapolated touch input in the main portion of the display based on the location of the second touch input in the input region; and providing for selection of the selectable element in an instance in which an intersection of the first extrapolated touch input and the second extrapolated touch input coincides with the location of the selectable element. 47. The method of claim 45, further comprising detecting an angle associated with the touch input and determining the location of the extrapolated touch input based on the angle of the touch input that is detected. 48. The method of claim 45, further comprising providing a visual representation of the location of the extrapolated touch input in the main portion of the display. 49. The method of claim 48, wherein the visual representation comprises a ray extending from the location of the touch input in the input region at least partially into the main portion of the display. 50. The method of claim 45, further comprising modifying the location of the extrapolated touch input based on a change in the angle of the touch input. 51. The method of claim 45, wherein the input region is disposed along an edge of the display. 52. The method of claim 45, wherein the input region is defined by a surface that is in substantially the same plane as the display. 53. The method of claim 45, wherein the input region is defined by a surface that defines a non-zero angle with the display. 54. A computer program product comprising at least one computer-readable storage medium having computer-executable program code portions stored therein, the computer-executable program code portions comprising program code instructions for:
providing for presentation of a selectable element in a main portion of a display; receiving a touch input in an input region proximate the main portion of the display, wherein the input region does not overlap with the main portion; determining an extrapolated touch input in the main portion of the display based on a location of the touch input in the input region; and providing for selection of the selectable element in an instance in which a location of the extrapolated touch input coincides with a location of the selectable element. | Mechanisms are described for receiving touch inputs on a touch screen display in a way that does not obscure the images and content presented on the display. Content, including selectable elements, is displayed in a main portion of a display, where as an input region that does not overlap with the main portion is provided on the display for receiving touch input selecting particular selectable elements. An extrapolated touch input in the main portion of the display is determined based on the location of the touch input in the input region, such that selection of a particular selectable element may be accomplished when the location of the extrapolated touch input coincides with the location of the selectable element.1-34. (canceled) 35. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the processor, cause the apparatus to at least:
provide for presentation of a selectable element in a main portion of a display; receive a touch input in an input region proximate the main portion of the display, wherein the input region does not overlap with the main portion; determine an extrapolated touch input in the main portion of the display based on a location of the touch input in the input region; and provide for selection of the selectable element in an instance in which a location of the extrapolated touch input coincides with a location of the selectable element. 36. The apparatus of claim 35, wherein the touch input comprises a first touch input and the extrapolated touch input comprises a first extrapolated touch input, and wherein the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to:
receive a second touch input in the input region; determine a second extrapolated touch input in the main portion of the display based on the location of the second touch input in the input region; and provide for selection of the selectable element in an instance in which an intersection of the first extrapolated touch input and the second extrapolated touch input coincides with the location of the selectable element. 37. The apparatus of claim 35, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to detect an angle associated with the touch input and to determine the location of the extrapolated touch input based on the angle of the touch input that is detected. 38. The apparatus of claim 35, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to provide a visual representation of the location of the extrapolated touch input in the main portion of the display. 39. The apparatus of claim 38 wherein the visual representation comprises a ray extending from the location of the touch input in the input region at least partially into the main portion of the display. 40. The apparatus of claim 35, wherein the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to modify the location of the extrapolated touch input based on a change in the angle of the touch input. 41. The apparatus of claim 35, wherein the input region is disposed along an edge of the display. 42. The apparatus of claim 35, wherein the input region is defined by a surface that is in substantially the same plane as the display. 43. The apparatus of claim 35, wherein the input region is defined by a surface that defines a non-zero angle with the display. 44. The apparatus of claim 35, wherein the input region is defined by the display. 45. A method comprising:
providing for presentation of a selectable element in a main portion of a display; receiving a touch input in an input region proximate the main portion of the display, wherein the input region does not overlap with the main portion; determining an extrapolated touch input in the main portion of the display based on a location of the touch input in the input region; and providing for selection of the selectable element in an instance in which a location of the extrapolated touch input coincides with a location of the selectable element. 46. The method of claim 45, wherein the touch input comprises a first touch input and the extrapolated touch input comprises a first extrapolated touch input, and wherein the method further comprises:
receiving a second touch input in the input region; determining a second extrapolated touch input in the main portion of the display based on the location of the second touch input in the input region; and providing for selection of the selectable element in an instance in which an intersection of the first extrapolated touch input and the second extrapolated touch input coincides with the location of the selectable element. 47. The method of claim 45, further comprising detecting an angle associated with the touch input and determining the location of the extrapolated touch input based on the angle of the touch input that is detected. 48. The method of claim 45, further comprising providing a visual representation of the location of the extrapolated touch input in the main portion of the display. 49. The method of claim 48, wherein the visual representation comprises a ray extending from the location of the touch input in the input region at least partially into the main portion of the display. 50. The method of claim 45, further comprising modifying the location of the extrapolated touch input based on a change in the angle of the touch input. 51. The method of claim 45, wherein the input region is disposed along an edge of the display. 52. The method of claim 45, wherein the input region is defined by a surface that is in substantially the same plane as the display. 53. The method of claim 45, wherein the input region is defined by a surface that defines a non-zero angle with the display. 54. A computer program product comprising at least one computer-readable storage medium having computer-executable program code portions stored therein, the computer-executable program code portions comprising program code instructions for:
providing for presentation of a selectable element in a main portion of a display; receiving a touch input in an input region proximate the main portion of the display, wherein the input region does not overlap with the main portion; determining an extrapolated touch input in the main portion of the display based on a location of the touch input in the input region; and providing for selection of the selectable element in an instance in which a location of the extrapolated touch input coincides with a location of the selectable element. | 2,100 |
6,145 | 6,145 | 14,872,019 | 2,157 | A computer-implemented method is provided for managing and sharing picture files. In one embodiment of the present invention, the method comprises providing a server platform and providing a datastore on the server platform for maintaining full resolution copies of the files shared between a plurality of sharing clients. A synchronization engine is provided on the server platform and is configured to send real-time updates to a plurality of sharing clients when at least one of the sharing clients updates or changes one of said files. A web interface may also be provided that allows a user to access files in the datastore through the use of a web browser. | 1-20. (canceled) 21. A method for updating user-defined settings, the method comprising:
receiving, by a synchronization server, a set of user-defined settings associated with an application of a user; storing the user-defined settings; determining whether the application is being installed on a client device associated with the user; and sending the user-defined settings to the client device. 22. The method of claim 21, wherein the user-defined setting comprises at least one of contacts, album structure, and application preferences. 23. The method of claim 21, wherein the user-defined settings include sharing permissions. 24. The method of claim 21, further comprising providing an installer for installing the application on another client device according to the user-defined settings. 25. The method of claim 21, further comprising:
receiving, at the synchronization server, an update to the user-defined settings from another client device associated with the user; and sending the updated user-defined settings to the client device. 26. The method of claim 25, further comprising automatically updating the application with the updated user-defined settings. 27. The method of claim 25, further comprising storing the updated user-defined settings on a data store on the synchronization server upon receiving the updated settings from the client device. 28. A non-transitory computer-readable medium in a client device, comprising computer-executable code for updating user-defined settings, comprising:
code for receiving a set of user-defined settings associated with an application of a user; code for storing the user-defined settings; code for determining whether the application is being installed on a client device associated with the user; and code for sending the user-defined settings to the client device. 29. The computer-readable medium of claim 28, wherein the user-defined settings comprises at least one of contacts, album structure, and application preferences. 30. The computer-readable medium of claim 28, wherein the user-defined settings includes sharing permissions. 31. The computer-readable medium of claim 28, further comprising code for providing an installer for installing the application on another client device according to the user-defined settings. 32. The computer-readable medium of claim 28, further comprising:
code for receiving, at a synchronization server, an update to the user-defined settings from another client device associated with the user; and code for sending the updated user-defined settings to the client device. 33. The computer-readable medium of claim 32, further comprising code for automatically updating the application with the updated user-defined settings. 34. The method of claim 32, further comprising code for storing the updated user-defined settings on a data store on the synchronization server upon receiving the updated settings from the client device. 35. A synchronization server configured to:
receive a set of user-defined settings associated with an application of a user; store the user-defined settings; determine whether the application is being installed on a client device associated with the user; and send the user-defined settings to the client device. 36. The server of claim 35, wherein the user-defined settings comprises at least one of contacts, album structure, and application preferences. 37. The server of claim 35, wherein the user-defined settings includes sharing permissions. 38. The server of claim 35, further configured to provide an installer for installing the application on another client device according to the user-defined settings. 39. The server of claim 35, further configured to:
receive, at a synchronization server, an update to the user-defined settings from another client device associated with the user; and send the updated user-defined settings to the client device. 40. The server of claim 39, further configured to automatically update the application with the updated user-defined settings. | A computer-implemented method is provided for managing and sharing picture files. In one embodiment of the present invention, the method comprises providing a server platform and providing a datastore on the server platform for maintaining full resolution copies of the files shared between a plurality of sharing clients. A synchronization engine is provided on the server platform and is configured to send real-time updates to a plurality of sharing clients when at least one of the sharing clients updates or changes one of said files. A web interface may also be provided that allows a user to access files in the datastore through the use of a web browser.1-20. (canceled) 21. A method for updating user-defined settings, the method comprising:
receiving, by a synchronization server, a set of user-defined settings associated with an application of a user; storing the user-defined settings; determining whether the application is being installed on a client device associated with the user; and sending the user-defined settings to the client device. 22. The method of claim 21, wherein the user-defined setting comprises at least one of contacts, album structure, and application preferences. 23. The method of claim 21, wherein the user-defined settings include sharing permissions. 24. The method of claim 21, further comprising providing an installer for installing the application on another client device according to the user-defined settings. 25. The method of claim 21, further comprising:
receiving, at the synchronization server, an update to the user-defined settings from another client device associated with the user; and sending the updated user-defined settings to the client device. 26. The method of claim 25, further comprising automatically updating the application with the updated user-defined settings. 27. The method of claim 25, further comprising storing the updated user-defined settings on a data store on the synchronization server upon receiving the updated settings from the client device. 28. A non-transitory computer-readable medium in a client device, comprising computer-executable code for updating user-defined settings, comprising:
code for receiving a set of user-defined settings associated with an application of a user; code for storing the user-defined settings; code for determining whether the application is being installed on a client device associated with the user; and code for sending the user-defined settings to the client device. 29. The computer-readable medium of claim 28, wherein the user-defined settings comprises at least one of contacts, album structure, and application preferences. 30. The computer-readable medium of claim 28, wherein the user-defined settings includes sharing permissions. 31. The computer-readable medium of claim 28, further comprising code for providing an installer for installing the application on another client device according to the user-defined settings. 32. The computer-readable medium of claim 28, further comprising:
code for receiving, at a synchronization server, an update to the user-defined settings from another client device associated with the user; and code for sending the updated user-defined settings to the client device. 33. The computer-readable medium of claim 32, further comprising code for automatically updating the application with the updated user-defined settings. 34. The method of claim 32, further comprising code for storing the updated user-defined settings on a data store on the synchronization server upon receiving the updated settings from the client device. 35. A synchronization server configured to:
receive a set of user-defined settings associated with an application of a user; store the user-defined settings; determine whether the application is being installed on a client device associated with the user; and send the user-defined settings to the client device. 36. The server of claim 35, wherein the user-defined settings comprises at least one of contacts, album structure, and application preferences. 37. The server of claim 35, wherein the user-defined settings includes sharing permissions. 38. The server of claim 35, further configured to provide an installer for installing the application on another client device according to the user-defined settings. 39. The server of claim 35, further configured to:
receive, at a synchronization server, an update to the user-defined settings from another client device associated with the user; and send the updated user-defined settings to the client device. 40. The server of claim 39, further configured to automatically update the application with the updated user-defined settings. | 2,100 |
6,146 | 6,146 | 14,076,798 | 2,171 | An embodiment provides a method, including: accepting, at a touch input component, touch input; rendering, on a display device, the touch input in a touch input interface; determining, using a processor, multi-touch input for modifying an attribute of the touch input rendering; modifying, using the processor, the attribute of the touch input rendering according to the multi-touch input; and thereafter inputting the touch input rendering into an application. Other aspects are described and claimed. | 1. A method, comprising:
accepting, at a touch input component, touch input; rendering, on a display device, the touch input in a touch input interface; determining, using a processor, multi-touch input for modifying an attribute of the touch input rendering; modifying, using the processor, the attribute of the touch input rendering according to the multi-touch input; and thereafter inputting the touch input rendering into an application. 2. The method of claim 1, wherein the multi-touch input comprises a pinch input to change a size attribute of the touch input rendering. 3. The method of claim 1, wherein the multi-touch input comprises a rotation input to change a rotation attribute of the touch input rendering. 4. The method of claim 1, wherein the touch input comprises drawing input. 5. The method of claim 4, wherein the drawing input comprises handwriting input including a character. 6. The method of claim 5, further comprising converting the handwriting input to machine text for inputting into the application. 7. The method of claim 6, wherein a modified attribute of the handwriting input is retained by the machine text. 8. The method of claim 4, wherein the drawing input comprises image input. 9. The method of claim 8, wherein the image input is not converted to machine text for inputting to the application. 10. The method of claim 1, wherein the touch input component comprises a touch sensitive surface located in a different area of a device than the display device. 11. An information handling device, comprising:
a touch input component; a display device; a processor; and a memory device storing instructions executable by the processor to: accept, at the touch input component, touch input; render, on the display device, the touch input in a touch input interface; determine multi-touch input for modifying an attribute of the touch input rendering; modify the attribute of the touch input rendering according to the multi-touch input; and thereafter input the touch input rendering into an application. 12. The information handling device of claim 11, wherein the multi-touch input comprises a pinch input to change a size attribute of the touch input rendering. 13. The information handling device of claim 11, wherein the multi-touch input comprises a rotation input to change a rotation attribute of the touch input rendering. 14. The information handling device of claim 11, wherein the touch input comprises drawing input. 15. The information handling device of claim 14, wherein the drawing input comprises handwriting input including a character. 16. The information handling device of claim 15, wherein instructions are further executable by the processor to convert the handwriting input to machine text for inputting into the application. 17. The information handling device of claim 16, wherein a modified attribute of the handwriting input is retained by the machine text. 18. The information handling device of claim 14, wherein the drawing input comprises image input. 19. The method of claim 8, wherein the image input is not converted to machine text for inputting to the application. 20. A program product, comprising:
a storage medium comprising computer readable program code, the computer readable program code comprising: computer readable program code configured to accept, at a touch input component, touch input; computer readable program code configured to render, on a display device, the touch input in a touch input interface; computer readable program code configured to determine, using a processor, multi-touch input for modifying an attribute of the touch input rendering; computer readable program code configured to modify, using the processor, the attribute of the touch input rendering according to the multi-touch input; and computer readable program code configured to thereafter input the touch input rendering into an application. | An embodiment provides a method, including: accepting, at a touch input component, touch input; rendering, on a display device, the touch input in a touch input interface; determining, using a processor, multi-touch input for modifying an attribute of the touch input rendering; modifying, using the processor, the attribute of the touch input rendering according to the multi-touch input; and thereafter inputting the touch input rendering into an application. Other aspects are described and claimed.1. A method, comprising:
accepting, at a touch input component, touch input; rendering, on a display device, the touch input in a touch input interface; determining, using a processor, multi-touch input for modifying an attribute of the touch input rendering; modifying, using the processor, the attribute of the touch input rendering according to the multi-touch input; and thereafter inputting the touch input rendering into an application. 2. The method of claim 1, wherein the multi-touch input comprises a pinch input to change a size attribute of the touch input rendering. 3. The method of claim 1, wherein the multi-touch input comprises a rotation input to change a rotation attribute of the touch input rendering. 4. The method of claim 1, wherein the touch input comprises drawing input. 5. The method of claim 4, wherein the drawing input comprises handwriting input including a character. 6. The method of claim 5, further comprising converting the handwriting input to machine text for inputting into the application. 7. The method of claim 6, wherein a modified attribute of the handwriting input is retained by the machine text. 8. The method of claim 4, wherein the drawing input comprises image input. 9. The method of claim 8, wherein the image input is not converted to machine text for inputting to the application. 10. The method of claim 1, wherein the touch input component comprises a touch sensitive surface located in a different area of a device than the display device. 11. An information handling device, comprising:
a touch input component; a display device; a processor; and a memory device storing instructions executable by the processor to: accept, at the touch input component, touch input; render, on the display device, the touch input in a touch input interface; determine multi-touch input for modifying an attribute of the touch input rendering; modify the attribute of the touch input rendering according to the multi-touch input; and thereafter input the touch input rendering into an application. 12. The information handling device of claim 11, wherein the multi-touch input comprises a pinch input to change a size attribute of the touch input rendering. 13. The information handling device of claim 11, wherein the multi-touch input comprises a rotation input to change a rotation attribute of the touch input rendering. 14. The information handling device of claim 11, wherein the touch input comprises drawing input. 15. The information handling device of claim 14, wherein the drawing input comprises handwriting input including a character. 16. The information handling device of claim 15, wherein instructions are further executable by the processor to convert the handwriting input to machine text for inputting into the application. 17. The information handling device of claim 16, wherein a modified attribute of the handwriting input is retained by the machine text. 18. The information handling device of claim 14, wherein the drawing input comprises image input. 19. The method of claim 8, wherein the image input is not converted to machine text for inputting to the application. 20. A program product, comprising:
a storage medium comprising computer readable program code, the computer readable program code comprising: computer readable program code configured to accept, at a touch input component, touch input; computer readable program code configured to render, on a display device, the touch input in a touch input interface; computer readable program code configured to determine, using a processor, multi-touch input for modifying an attribute of the touch input rendering; computer readable program code configured to modify, using the processor, the attribute of the touch input rendering according to the multi-touch input; and computer readable program code configured to thereafter input the touch input rendering into an application. | 2,100 |
6,147 | 6,147 | 14,710,152 | 2,198 | Methods, systems, and apparatus, including computer programs encoded on computer storage media, for routing events of an event stream in a stream processing system. One of the methods includes receiving, by a router, an event stream of events; identifying, for each event, by the router, a respective partition of context data that includes context data related to the event and providing the event to a respective local modeler that stores the partition of context data identified for the event in operational memory of the local modeler; processing, by each local modeler, events received from the router and aggregating information associated with each event to generate aggregated information; providing, by one or more of the local modelers, to a central modeler, the respective aggregated information; and determining, by the central modeler, a plurality of parameters of a machine learning model using the received aggregated information. | 1. A method comprising:
receiving, by a router, an event stream of events, wherein the router executes on a system of one or more computers; identifying, for each event, by the router, a partition of first context data that includes first context data related to the event; providing each event, by the router, to a local modeler of a first plurality of local modelers of a stream processing system that is identified as a local modeler that stores the partition of first context data identified for the event in operational memory of the local modeler, and wherein the local modelers execute on the system of one or more computers; processing, by each local modeler in parallel, events received from the router using the first context data in the respective partition of first context data by performing a first plurality of actions, the actions including aggregating information associated with each event received by the local modeler to generate aggregated information; providing, by one or more of the local modelers, to a first central modeler executing on the system of one or more computers, the respective aggregated information generated by the one or more of the local modelers; and determining, by the first central modeler, a plurality of parameters of a first machine learning model using the aggregated information received by the first central modeler. 2. The method of claim 1, wherein a first and a second local modeler of the first plurality of local modelers each store a same partition of first context data in operational memory. 3. The method of claim 1, further comprising:
before identifying a partition of first context data, determining that an action of the first plurality of actions requests first context data. 4. The method of claim 1, wherein:
for each local modeler, instructions implementing the first plurality of actions and the respective partition of first context data are stored in operational memory in a respective operating system process; and each local modeler processes, in the respective operating system process, events received by the local modeler according by performing the first plurality of actions. 5. The method of claim 1, further comprising:
providing, by the first central modeler, the parameters to one or more of the first plurality of local modelers for storage. 6. The method of claim 5, further comprising:
processing, by each of the one or more of the first plurality of local modelers applying the first machine learning model, the events received by the local modeler to perform scoring of the event stream; and aggregating, by each of the one or more of the first plurality of local modelers, information associated with each event received by the local modeler to generate updated aggregated information. 7. The method of claim 1, wherein identifying a partition of context data that includes context data related to an event comprises:
obtaining information identifying a first information type included in the event; obtaining data included in the event that is associated with the first information type; and performing a hashing process using the obtained data to identify the partition. 8. The method of claim 1, wherein the router is a first router, the method further comprising:
providing, by the first plurality of local modelers, processed events to a second router different from the first router; identifying, by the second router, for each processed event, a partition of second context data that includes context data related to the processed event; and providing each processed event, by the second router, to a respective local modeler of a second plurality of local modelers of the stream processing system, wherein the respective local modeler is a local modeler that stores the partition of second context data identified for the processed event in operational memory of the local modeler, and wherein the local modelers in the second plurality of local modelers execute on the system of one or more computers. 9. The method of claim 8, further comprising:
processing, by each local modeler in the second plurality of local modelers, events received from the second router using the second context data in the respective partition of second context data by performing a second plurality of actions. 10. The method of claim 1, wherein the router is a first router, the method further comprising:
providing, by the first plurality of local modelers, processed events to a second router different from the first router, wherein the processed events include further information added by local modelers in the first plurality of local modelers; and identifying, by the second router, for each processed event, using the further information added to the processed event, a respective local modeler of a second plurality of local modelers of the stream processing system, wherein the local modelers in the second plurality of local modelers execute on the system of one or more computers. 11. The method of claim 10, wherein the further information is a label classifying the respective event. 12. The method of claim 1, comprising:
providing, by the one or more local modelers of the first plurality of local modelers, to a second central modeler executing on the system, aggregated information generated by the one or more local modelers of the first plurality of local modelers; and determining, by the second central modeler, parameters of a second machine learning model using the aggregated information received by the second central modeler. 13. The method of claim 12, comprising:
receiving, by the first central modeler, data specifying a first learning program for determining parameters of the first machine learning model from aggregated information received by the first central modeler; and receiving, by the second central modeler, data specifying a third learning program for determining parameters of a third machine learning model from aggregated information received by the second central modeler. 14. The method of claim 1, wherein:
context data is pre-existing data related to an event that does not occur within data attributes of the event itself. 15. The method of claim 1, wherein:
for each local modeler, instructions implementing the first plurality of actions and the respective partition of first context data are stored in operational memory in a respective operating system process; for each local modeler, common context data is stored in operational memory in each respective operating system process; and each local modeler processes, in the respective operating system process, events received by the local modeler by performing the first plurality of actions using the respective partition of first context data and the common context data. 16. A method comprising:
receiving, by a router, an event stream of events, wherein the router executes on a system of one or more computers; providing each event, by the router, to a respective local modeler of a first plurality of local modelers of a stream processing system according to a routing key included in each event that identifies a local modeler, wherein the local modelers execute on the system of one or more computers; processing, by each local modeler in parallel, events received from the router by performing a first plurality of actions including aggregating information associated with each event received by the local modeler to generate aggregated information; providing, by one or more of the local modelers, to a first central modeler executing on the system of one or more computers, the respective aggregated information generated by the one or more of the local modelers; and determining, by the first central modeler, a plurality of parameters of a first machine learning model using the aggregated information received by the first central modeler. 17. The method of claim 16, wherein:
the routing key for each event identifies the respective local modeler. 18. The method of claim 16, further comprising:
accessing, by the router, mappings between ranges of routing keys and respective partitions of context data that store context data related to routing keys included in a range; and identifying as the respective local modeler for each event a local modeler of the first plurality of local modelers that stores a partition of context data identified by the mappings for the routing key of the event. 19. The method of claim 16, further comprising, for each event:
hashing the routing key included in the event to obtain an identifier of a partition of context data; and identifying as the respective local modeler a local modeler of the first plurality of local modelers that stores the partition of context data identified by the identifier. 20. A system comprising:
one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: receiving, by a router, an event stream of events, wherein the router executes on a system of one or more computers; identifying, for each event, by the router, a partition of first context data that includes first context data related to the event; providing each event, by the router, to a local modeler of a first plurality of local modelers of a stream processing system that is identified as a local modeler that stores the partition of first context data identified for the event in operational memory of the local modeler, and wherein the local modelers execute on the system of one or more computers; processing, by each local modeler in parallel, events received from the router using the first context data in the respective partition of first context data by performing a first plurality of actions including aggregating information associated with each event received by the local modeler to generate aggregated information; providing, by one or more of the local modelers, to a first central modeler executing on the system of one or more computers, the respective aggregated information generated by the one or more of the local modelers; and determining, by the first central modeler, a plurality of parameters of a first machine learning model using the aggregated information received by the first central modeler. | Methods, systems, and apparatus, including computer programs encoded on computer storage media, for routing events of an event stream in a stream processing system. One of the methods includes receiving, by a router, an event stream of events; identifying, for each event, by the router, a respective partition of context data that includes context data related to the event and providing the event to a respective local modeler that stores the partition of context data identified for the event in operational memory of the local modeler; processing, by each local modeler, events received from the router and aggregating information associated with each event to generate aggregated information; providing, by one or more of the local modelers, to a central modeler, the respective aggregated information; and determining, by the central modeler, a plurality of parameters of a machine learning model using the received aggregated information.1. A method comprising:
receiving, by a router, an event stream of events, wherein the router executes on a system of one or more computers; identifying, for each event, by the router, a partition of first context data that includes first context data related to the event; providing each event, by the router, to a local modeler of a first plurality of local modelers of a stream processing system that is identified as a local modeler that stores the partition of first context data identified for the event in operational memory of the local modeler, and wherein the local modelers execute on the system of one or more computers; processing, by each local modeler in parallel, events received from the router using the first context data in the respective partition of first context data by performing a first plurality of actions, the actions including aggregating information associated with each event received by the local modeler to generate aggregated information; providing, by one or more of the local modelers, to a first central modeler executing on the system of one or more computers, the respective aggregated information generated by the one or more of the local modelers; and determining, by the first central modeler, a plurality of parameters of a first machine learning model using the aggregated information received by the first central modeler. 2. The method of claim 1, wherein a first and a second local modeler of the first plurality of local modelers each store a same partition of first context data in operational memory. 3. The method of claim 1, further comprising:
before identifying a partition of first context data, determining that an action of the first plurality of actions requests first context data. 4. The method of claim 1, wherein:
for each local modeler, instructions implementing the first plurality of actions and the respective partition of first context data are stored in operational memory in a respective operating system process; and each local modeler processes, in the respective operating system process, events received by the local modeler according by performing the first plurality of actions. 5. The method of claim 1, further comprising:
providing, by the first central modeler, the parameters to one or more of the first plurality of local modelers for storage. 6. The method of claim 5, further comprising:
processing, by each of the one or more of the first plurality of local modelers applying the first machine learning model, the events received by the local modeler to perform scoring of the event stream; and aggregating, by each of the one or more of the first plurality of local modelers, information associated with each event received by the local modeler to generate updated aggregated information. 7. The method of claim 1, wherein identifying a partition of context data that includes context data related to an event comprises:
obtaining information identifying a first information type included in the event; obtaining data included in the event that is associated with the first information type; and performing a hashing process using the obtained data to identify the partition. 8. The method of claim 1, wherein the router is a first router, the method further comprising:
providing, by the first plurality of local modelers, processed events to a second router different from the first router; identifying, by the second router, for each processed event, a partition of second context data that includes context data related to the processed event; and providing each processed event, by the second router, to a respective local modeler of a second plurality of local modelers of the stream processing system, wherein the respective local modeler is a local modeler that stores the partition of second context data identified for the processed event in operational memory of the local modeler, and wherein the local modelers in the second plurality of local modelers execute on the system of one or more computers. 9. The method of claim 8, further comprising:
processing, by each local modeler in the second plurality of local modelers, events received from the second router using the second context data in the respective partition of second context data by performing a second plurality of actions. 10. The method of claim 1, wherein the router is a first router, the method further comprising:
providing, by the first plurality of local modelers, processed events to a second router different from the first router, wherein the processed events include further information added by local modelers in the first plurality of local modelers; and identifying, by the second router, for each processed event, using the further information added to the processed event, a respective local modeler of a second plurality of local modelers of the stream processing system, wherein the local modelers in the second plurality of local modelers execute on the system of one or more computers. 11. The method of claim 10, wherein the further information is a label classifying the respective event. 12. The method of claim 1, comprising:
providing, by the one or more local modelers of the first plurality of local modelers, to a second central modeler executing on the system, aggregated information generated by the one or more local modelers of the first plurality of local modelers; and determining, by the second central modeler, parameters of a second machine learning model using the aggregated information received by the second central modeler. 13. The method of claim 12, comprising:
receiving, by the first central modeler, data specifying a first learning program for determining parameters of the first machine learning model from aggregated information received by the first central modeler; and receiving, by the second central modeler, data specifying a third learning program for determining parameters of a third machine learning model from aggregated information received by the second central modeler. 14. The method of claim 1, wherein:
context data is pre-existing data related to an event that does not occur within data attributes of the event itself. 15. The method of claim 1, wherein:
for each local modeler, instructions implementing the first plurality of actions and the respective partition of first context data are stored in operational memory in a respective operating system process; for each local modeler, common context data is stored in operational memory in each respective operating system process; and each local modeler processes, in the respective operating system process, events received by the local modeler by performing the first plurality of actions using the respective partition of first context data and the common context data. 16. A method comprising:
receiving, by a router, an event stream of events, wherein the router executes on a system of one or more computers; providing each event, by the router, to a respective local modeler of a first plurality of local modelers of a stream processing system according to a routing key included in each event that identifies a local modeler, wherein the local modelers execute on the system of one or more computers; processing, by each local modeler in parallel, events received from the router by performing a first plurality of actions including aggregating information associated with each event received by the local modeler to generate aggregated information; providing, by one or more of the local modelers, to a first central modeler executing on the system of one or more computers, the respective aggregated information generated by the one or more of the local modelers; and determining, by the first central modeler, a plurality of parameters of a first machine learning model using the aggregated information received by the first central modeler. 17. The method of claim 16, wherein:
the routing key for each event identifies the respective local modeler. 18. The method of claim 16, further comprising:
accessing, by the router, mappings between ranges of routing keys and respective partitions of context data that store context data related to routing keys included in a range; and identifying as the respective local modeler for each event a local modeler of the first plurality of local modelers that stores a partition of context data identified by the mappings for the routing key of the event. 19. The method of claim 16, further comprising, for each event:
hashing the routing key included in the event to obtain an identifier of a partition of context data; and identifying as the respective local modeler a local modeler of the first plurality of local modelers that stores the partition of context data identified by the identifier. 20. A system comprising:
one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: receiving, by a router, an event stream of events, wherein the router executes on a system of one or more computers; identifying, for each event, by the router, a partition of first context data that includes first context data related to the event; providing each event, by the router, to a local modeler of a first plurality of local modelers of a stream processing system that is identified as a local modeler that stores the partition of first context data identified for the event in operational memory of the local modeler, and wherein the local modelers execute on the system of one or more computers; processing, by each local modeler in parallel, events received from the router using the first context data in the respective partition of first context data by performing a first plurality of actions including aggregating information associated with each event received by the local modeler to generate aggregated information; providing, by one or more of the local modelers, to a first central modeler executing on the system of one or more computers, the respective aggregated information generated by the one or more of the local modelers; and determining, by the first central modeler, a plurality of parameters of a first machine learning model using the aggregated information received by the first central modeler. | 2,100 |
6,148 | 6,148 | 15,368,630 | 2,173 | A computer-implemented method of interlacing responses within an instant messaging (IM) system can include, responsive to a request from a user in an IM session, storing an IM message fragment input by the user and associating the IM message fragment with a message selected from an IM session transcript. The method can include recalling the IM message fragment and outputting, at least in part, the IM message fragment in response to the message. | 1-20. (canceled) 21. A computer-implemented method within an instant messaging (IM) system, comprising:
receiving, from the user, a selection of one of a plurality of messages within an IM session transcript; generating an association between a stored IM message fragment and the selected one of the plurality of messages; recalling, responsive to a user input, the stored IM message fragment; and presenting the recalled IM message fragment within an input field of an IM session, wherein the IM message fragment has not been transmitted from the user to an intended recipient of the IM message fragment, and the IM session transcript includes messages from both the user and the intended recipient. 22. The method of claim 21, wherein
the IM message fragment is stored within a list of IM message fragments. 23. The method of claim 22, wherein
the list of IM message fragments is presented to the user responsive to the user input. 24. The method of claim 22, wherein
the recalled IM message fragment is selected, by the user, from the list of IM message fragments. 25. The method of claim 21, further comprising
outputting the IM message fragment, as a completed message, and the association. 26. The method of claim 25, wherein
an identifier specifies the association, and the IM message fragment and the identifier are sent to an IM server connecting the user to the intended recipient or an IM client of the intended recipient. 27. The method of claim 25, wherein
the completed message is displayed within an IM transcript window, of an IM client of the user, that displays the IM transcript. 28. The method of claim 21, wherein
the IM message fragment is all data within the input field upon receiving the request. 29. The method of claim 21, further comprising
visually displaying the association between the IM message fragment and the selected one of the plurality of messages. 30. The method of claim 21, further comprising
visually distinguishing, upon the IM message fragment being dragged over the selected one of the plurality of messages, the selected one of the plurality of messages from other messages in an IM transcript window, of an IM client of the user, that displays the IM transcript. 31. A computer program product, comprising:
a computer-usable hardware storage device having stored therein computer-usable program code, the computer-usable program code, which when executed on a computer hardware system including an instant messaging (IM) system, causes the computer hardware system to perform:
receiving, from the user, a selection of one of a plurality of messages within an IM session transcript;
generating an association between a stored IM message fragment and the selected one of the plurality of messages;
recalling, responsive to a user input, the stored IM message fragment; and
presenting the recalled IM message fragment within an input field of an IM session, wherein
the IM message fragment has not been transmitted from the user to an intended recipient of the IM message fragment, and the IM session transcript includes messages from both the user and the intended recipient. 32. The computer program product of claim 31, wherein
the IM message fragment is stored within a list of IM message fragments. 33. The computer program product of claim 32, wherein
the list of IM message fragments is presented to the user responsive to the user input. 34. The computer program product of claim 32, wherein
the recalled IM message fragment is selected, by the user, from the list of IM message fragments. 35. The computer program product of claim 31, wherein the computer-usable program code further causes the computer hardware system to perform
outputting the IM message fragment, as a completed message, and the association. 36. The computer program product of claim 35, wherein
an identifier specifies the association, and the IM message fragment and the identifier are sent to an IM server connecting the user to the intended recipient or an IM client of the intended recipient. 37. The computer program product of claim 35, wherein
the completed message is displayed within an IM transcript window, of an IM client of the user, that displays the IM transcript. 38. The computer program product of claim 31, wherein
the IM message fragment is all data within the input field upon receiving the request. 39. The computer program product of claim 31, wherein the computer-usable program code further causes the computer hardware system to perform
visually displaying the association between the IM message fragment and the selected one of the plurality of messages. 40. The computer program product of claim 31, wherein the computer-usable program code further causes the computer hardware system to perform
visually distinguishing, upon the IM message fragment being dragged over the selected one of the plurality of messages, the selected one of the plurality of messages from other messages in an IM transcript window, of an IM client of the user, that displays the IM transcript. | A computer-implemented method of interlacing responses within an instant messaging (IM) system can include, responsive to a request from a user in an IM session, storing an IM message fragment input by the user and associating the IM message fragment with a message selected from an IM session transcript. The method can include recalling the IM message fragment and outputting, at least in part, the IM message fragment in response to the message.1-20. (canceled) 21. A computer-implemented method within an instant messaging (IM) system, comprising:
receiving, from the user, a selection of one of a plurality of messages within an IM session transcript; generating an association between a stored IM message fragment and the selected one of the plurality of messages; recalling, responsive to a user input, the stored IM message fragment; and presenting the recalled IM message fragment within an input field of an IM session, wherein the IM message fragment has not been transmitted from the user to an intended recipient of the IM message fragment, and the IM session transcript includes messages from both the user and the intended recipient. 22. The method of claim 21, wherein
the IM message fragment is stored within a list of IM message fragments. 23. The method of claim 22, wherein
the list of IM message fragments is presented to the user responsive to the user input. 24. The method of claim 22, wherein
the recalled IM message fragment is selected, by the user, from the list of IM message fragments. 25. The method of claim 21, further comprising
outputting the IM message fragment, as a completed message, and the association. 26. The method of claim 25, wherein
an identifier specifies the association, and the IM message fragment and the identifier are sent to an IM server connecting the user to the intended recipient or an IM client of the intended recipient. 27. The method of claim 25, wherein
the completed message is displayed within an IM transcript window, of an IM client of the user, that displays the IM transcript. 28. The method of claim 21, wherein
the IM message fragment is all data within the input field upon receiving the request. 29. The method of claim 21, further comprising
visually displaying the association between the IM message fragment and the selected one of the plurality of messages. 30. The method of claim 21, further comprising
visually distinguishing, upon the IM message fragment being dragged over the selected one of the plurality of messages, the selected one of the plurality of messages from other messages in an IM transcript window, of an IM client of the user, that displays the IM transcript. 31. A computer program product, comprising:
a computer-usable hardware storage device having stored therein computer-usable program code, the computer-usable program code, which when executed on a computer hardware system including an instant messaging (IM) system, causes the computer hardware system to perform:
receiving, from the user, a selection of one of a plurality of messages within an IM session transcript;
generating an association between a stored IM message fragment and the selected one of the plurality of messages;
recalling, responsive to a user input, the stored IM message fragment; and
presenting the recalled IM message fragment within an input field of an IM session, wherein
the IM message fragment has not been transmitted from the user to an intended recipient of the IM message fragment, and the IM session transcript includes messages from both the user and the intended recipient. 32. The computer program product of claim 31, wherein
the IM message fragment is stored within a list of IM message fragments. 33. The computer program product of claim 32, wherein
the list of IM message fragments is presented to the user responsive to the user input. 34. The computer program product of claim 32, wherein
the recalled IM message fragment is selected, by the user, from the list of IM message fragments. 35. The computer program product of claim 31, wherein the computer-usable program code further causes the computer hardware system to perform
outputting the IM message fragment, as a completed message, and the association. 36. The computer program product of claim 35, wherein
an identifier specifies the association, and the IM message fragment and the identifier are sent to an IM server connecting the user to the intended recipient or an IM client of the intended recipient. 37. The computer program product of claim 35, wherein
the completed message is displayed within an IM transcript window, of an IM client of the user, that displays the IM transcript. 38. The computer program product of claim 31, wherein
the IM message fragment is all data within the input field upon receiving the request. 39. The computer program product of claim 31, wherein the computer-usable program code further causes the computer hardware system to perform
visually displaying the association between the IM message fragment and the selected one of the plurality of messages. 40. The computer program product of claim 31, wherein the computer-usable program code further causes the computer hardware system to perform
visually distinguishing, upon the IM message fragment being dragged over the selected one of the plurality of messages, the selected one of the plurality of messages from other messages in an IM transcript window, of an IM client of the user, that displays the IM transcript. | 2,100 |
6,149 | 6,149 | 15,473,194 | 2,194 | A solution is proposed for monitoring usage of bundles in the OSGi environment. For this purpose, an event notification interface of the OSGi environment is exploited. Particularly, each event relating to a change of state of a bundle (such as its addition, removal, starting and stopping) is detected by an auxiliary bundle—which previously subscribed to the event notification interface. The auxiliary bundle can then forward the detected events to a licensing agent, which identifies the bundle by means of a software catalogue. In this way, the desired result is achieved without requiring any instrumentation of the bundles to be monitored. | 1-14. (canceled) 15. A method for monitoring a component in a service framework within a computer hardware system, comprising:
receiving, by an auxiliary component, a notification of a change to a registry of the service framework; and forwarding, by the auxiliary component and to a licensing agent, an indication corresponding to the notification, wherein the auxiliary component converts the notification into a format supported by the licensing agent. 16. The method of claim 15, wherein
the auxiliary component subscribes to an event handler configured to receive events from the component, the subscription specifies an event from the component relating to a change of state of the component, and the event handler sends the notification to the auxiliary component based upon the event matching the subscription. 17. The method of claim 16, wherein
the indication includes a descriptor of the component and a topic that identifies a type of the event. 18. The method of claim 15, wherein
the auxiliary component monitors the component without instrumenting the component. 19. The method of claim 15, wherein
the change to the framework is one of:
a new component being inserted into the registry,
an old component being removed from the registry,
an existing component becoming available to other components, and
the existing component becoming unavailable to the other components. 20. The method of claim 15, wherein
the licensing agent is configured to receive the indication from both the auxiliary component and the component. 21. The method of claim 15, wherein
a service is implemented by the component. 22. A computer hardware system configured to monitor a component in a service framework within the computer hardware system, comprising:
a hardware processor configured to initiate the following operations:
receiving, by an auxiliary component, a notification of a change to a registry of the service framework; and
forwarding, by the auxiliary component and to a licensing agent, an indication corresponding to the notification, wherein
the auxiliary component converts the notification into a format supported by the licensing agent. 23. The system of claim 22, wherein
the auxiliary component subscribes to an event handler configured to receive events from the component, the subscription specifies an event from the component relating to a change of state of the component, and the event handler sends the notification to the auxiliary component based upon the event matching the subscription. 24. The system of claim 23, wherein
the indication includes a descriptor of the component and a topic that identifies a type of the event. 25. The system of claim 22, wherein
the auxiliary component monitors the component without instrumenting the component. 26. The system of claim 22, wherein
the change to the framework is one of:
a new component being inserted into the registry,
an old component being removed from the registry,
an existing component becoming available to other components, and
the existing component becoming unavailable to the other components. 27. The system of claim 22, wherein
the licensing agent is configured to receive the indication from both the auxiliary component and the component. 28. The system of claim 22, wherein
a service is implemented by the component. 29. A computer program product, comprising:
a computer-usable hardware storage device having stored therein program code for monitoring a component in a service framework within a computer hardware system, the program code, which when executed by the computer hardware system, causes the computer hardware system to perform:
receiving, by an auxiliary component, a notification of a change to a registry of the service framework; and
forwarding, by the auxiliary component and to a licensing agent, an indication corresponding to the notification, wherein
the auxiliary component converts the notification into a format supported by the licensing agent. 30. The computer program product of claim 29, wherein
the auxiliary component subscribes to an event handler configured to receive events from the component, the subscription specifies an event from the component relating to a change of state of the component, and the event handler sends the notification to the auxiliary component based upon the event matching the subscription. 31. The computer program product of claim 30, wherein
the indication includes a descriptor of the component and a topic that identifies a type of the event. 32. The computer program product of claim 29, wherein
the auxiliary component monitors the component without instrumenting the component. 33. The computer program product of claim 29, wherein
the change to the framework is one of:
a new component being inserted into the registry,
an old component being removed from the registry,
an existing component becoming available to other components, and
the existing component becoming unavailable to the other components. 34. The computer program product of claim 29, wherein
the licensing agent is configured to receive the indication from both the auxiliary component and the component. | A solution is proposed for monitoring usage of bundles in the OSGi environment. For this purpose, an event notification interface of the OSGi environment is exploited. Particularly, each event relating to a change of state of a bundle (such as its addition, removal, starting and stopping) is detected by an auxiliary bundle—which previously subscribed to the event notification interface. The auxiliary bundle can then forward the detected events to a licensing agent, which identifies the bundle by means of a software catalogue. In this way, the desired result is achieved without requiring any instrumentation of the bundles to be monitored.1-14. (canceled) 15. A method for monitoring a component in a service framework within a computer hardware system, comprising:
receiving, by an auxiliary component, a notification of a change to a registry of the service framework; and forwarding, by the auxiliary component and to a licensing agent, an indication corresponding to the notification, wherein the auxiliary component converts the notification into a format supported by the licensing agent. 16. The method of claim 15, wherein
the auxiliary component subscribes to an event handler configured to receive events from the component, the subscription specifies an event from the component relating to a change of state of the component, and the event handler sends the notification to the auxiliary component based upon the event matching the subscription. 17. The method of claim 16, wherein
the indication includes a descriptor of the component and a topic that identifies a type of the event. 18. The method of claim 15, wherein
the auxiliary component monitors the component without instrumenting the component. 19. The method of claim 15, wherein
the change to the framework is one of:
a new component being inserted into the registry,
an old component being removed from the registry,
an existing component becoming available to other components, and
the existing component becoming unavailable to the other components. 20. The method of claim 15, wherein
the licensing agent is configured to receive the indication from both the auxiliary component and the component. 21. The method of claim 15, wherein
a service is implemented by the component. 22. A computer hardware system configured to monitor a component in a service framework within the computer hardware system, comprising:
a hardware processor configured to initiate the following operations:
receiving, by an auxiliary component, a notification of a change to a registry of the service framework; and
forwarding, by the auxiliary component and to a licensing agent, an indication corresponding to the notification, wherein
the auxiliary component converts the notification into a format supported by the licensing agent. 23. The system of claim 22, wherein
the auxiliary component subscribes to an event handler configured to receive events from the component, the subscription specifies an event from the component relating to a change of state of the component, and the event handler sends the notification to the auxiliary component based upon the event matching the subscription. 24. The system of claim 23, wherein
the indication includes a descriptor of the component and a topic that identifies a type of the event. 25. The system of claim 22, wherein
the auxiliary component monitors the component without instrumenting the component. 26. The system of claim 22, wherein
the change to the framework is one of:
a new component being inserted into the registry,
an old component being removed from the registry,
an existing component becoming available to other components, and
the existing component becoming unavailable to the other components. 27. The system of claim 22, wherein
the licensing agent is configured to receive the indication from both the auxiliary component and the component. 28. The system of claim 22, wherein
a service is implemented by the component. 29. A computer program product, comprising:
a computer-usable hardware storage device having stored therein program code for monitoring a component in a service framework within a computer hardware system, the program code, which when executed by the computer hardware system, causes the computer hardware system to perform:
receiving, by an auxiliary component, a notification of a change to a registry of the service framework; and
forwarding, by the auxiliary component and to a licensing agent, an indication corresponding to the notification, wherein
the auxiliary component converts the notification into a format supported by the licensing agent. 30. The computer program product of claim 29, wherein
the auxiliary component subscribes to an event handler configured to receive events from the component, the subscription specifies an event from the component relating to a change of state of the component, and the event handler sends the notification to the auxiliary component based upon the event matching the subscription. 31. The computer program product of claim 30, wherein
the indication includes a descriptor of the component and a topic that identifies a type of the event. 32. The computer program product of claim 29, wherein
the auxiliary component monitors the component without instrumenting the component. 33. The computer program product of claim 29, wherein
the change to the framework is one of:
a new component being inserted into the registry,
an old component being removed from the registry,
an existing component becoming available to other components, and
the existing component becoming unavailable to the other components. 34. The computer program product of claim 29, wherein
the licensing agent is configured to receive the indication from both the auxiliary component and the component. | 2,100 |
6,150 | 6,150 | 16,030,549 | 2,191 | A method for validating software transforms. A target program binary is mutated, producing a plurality of variants. It is determined whether each variant passes a test suite. Upon determining the variant does not pass the test suite, the variant is discarded. Upon determining the variant passes the test suite, the variant is compared to the target program binary. A candidate transform is extracted which meets scope criteria. The candidate transform is applied to each of a plurality of test programs. It is determined whether the candidate transform is safe. Upon determining that the candidate transform is not safe, the candidate transform is discarded. Upon determining that the candidate transform is safe, the candidate transform is collected. | 1. A method for generating validated software transforms comprising:
mutating a target program binary, producing a plurality of variants; determining whether each variant of the variants passes a test suite; upon determining the variant does not pass the test suite, discarding the variant; upon determining the variant passes the test suite:
extracting a candidate transform that describes a difference between the target program binary and the variant;
applying the candidate transform to each of a plurality of test programs;
determining whether the candidate transform is safe;
upon determining the candidate transform is not safe, discarding the candidate transform; and
upon determining the candidate transform is safe, collecting the candidate transform as one of the validated software transforms. 2. The method of claim 1, wherein the target program binary is mutated using genetic mutation. 3. The method of claim 1, wherein the mutation step comprises a swapping code step. 4. The method of claim 1, wherein the mutation step comprises an inserting code step. 5. The method of claim 1, wherein the mutation step comprises a deleting code step. 6. The method of claim 1, wherein the variants are produced using a crossover combination technique. 7. The method of claim 6, wherein the crossover combination technique is a two-point technique. 8. The method of claim 1, wherein the variants are produced using tournament selection. 9. The method of claim 1, wherein the candidate transform is extracted by comparing a disassembled output of the target program binary with a disassembled output of the variant, and the candidate transform describes the difference between the disassembled outputs of the target program binary and the variant. 10. The method of claim 1, wherein at the applying the candidate transform to each of the plurality of test programs step, the candidate transform is applied to an executable section of the test program. 11. The method of claim 1, wherein at the applying the candidate transform to each of the plurality of test programs step, the test programs are a plurality of test programs other than the target program binary and the variants. 12. The method of claim 1, wherein at the determining whether the candidate transform is safe step, the candidate transform T is considered safe if, for each test program P of the test programs, the test program P and a variant P′=T(P) produced during the applying are functionally equivalent because both P and P′ pass a respective test suite for the test program P. 13. A method for generating validated software transforms comprising:
mutating a target program binary, producing a plurality of variants of the target program binary; determining whether each variant of the variants passes a test suite for the target program binary; upon determining the variant does not pass the test suite, discarding the variant; upon determining the variant passes the test suite:
extracting a candidate transform that describes a difference between a disassembled output of the target program binary and a disassembled output of the variant;
applying the candidate transform to each test program binary of a plurality of additional program binaries, producing a variant of the test program binary;
determining whether the candidate transform is safe, wherein the candidate transform is considered safe if, for each test program binary of the additional program binaries, the variant of the test program binary passes a respective test suite for the test program binary;
upon determining the candidate transform is not safe, discarding the candidate transform; and
upon determining the candidate transform is safe, collecting the candidate transform as one of the validated software transforms. 14. The method of claim 13, wherein the mutation step comprises a code swapping step. 15. The method of claim 13, wherein the mutation step comprises an inserting code step. 16. The method of claim 13, wherein the mutation step comprises a deleting code step. 17. The method of claim 13, wherein the variants are produced using a crossover combination technique. 18. The method of claim 13, wherein the variants are produced using tournament selection. 19. The method of claim 13, wherein at the applying the candidate transform to each test program binary of a plurality of additional program binaries step, the candidate transform is applied to a .text section of the test program binary. 20. A method for generating validated software transforms comprising:
mutating a target program binary using genetic mutation, producing a plurality of variants of the target program binary using a crossover combination technique and tournament selection, wherein the crossover combination technique is a two-point technique; determining whether each variant of the variants passes a test suite for the target program binary; upon determining the variant does not pass the test suite, discarding the variant; upon determining the variant passes the test suite:
extracting a candidate transform by comparing a disassembled output of the target program binary with a disassembled output of the variant, the candidate transform describing a difference between the disassembled outputs of the target program binary and the variant within a window scope criteria;
applying the candidate transform to each test program binary of a plurality of additional program binaries, producing a variant of the test program binary, wherein the candidate transform is applied to a .text section of the test program binary;
determining whether the candidate transform is safe, wherein the candidate transform is considered safe if, for each test program binary of the additional program binaries, the variant of the test program binary passes a respective test suite for the test program binary;
upon determining the candidate transform is not safe, discarding the candidate transform; and
upon determining the candidate transform is safe, collecting the candidate transform as one of the validated software transforms. | A method for validating software transforms. A target program binary is mutated, producing a plurality of variants. It is determined whether each variant passes a test suite. Upon determining the variant does not pass the test suite, the variant is discarded. Upon determining the variant passes the test suite, the variant is compared to the target program binary. A candidate transform is extracted which meets scope criteria. The candidate transform is applied to each of a plurality of test programs. It is determined whether the candidate transform is safe. Upon determining that the candidate transform is not safe, the candidate transform is discarded. Upon determining that the candidate transform is safe, the candidate transform is collected.1. A method for generating validated software transforms comprising:
mutating a target program binary, producing a plurality of variants; determining whether each variant of the variants passes a test suite; upon determining the variant does not pass the test suite, discarding the variant; upon determining the variant passes the test suite:
extracting a candidate transform that describes a difference between the target program binary and the variant;
applying the candidate transform to each of a plurality of test programs;
determining whether the candidate transform is safe;
upon determining the candidate transform is not safe, discarding the candidate transform; and
upon determining the candidate transform is safe, collecting the candidate transform as one of the validated software transforms. 2. The method of claim 1, wherein the target program binary is mutated using genetic mutation. 3. The method of claim 1, wherein the mutation step comprises a swapping code step. 4. The method of claim 1, wherein the mutation step comprises an inserting code step. 5. The method of claim 1, wherein the mutation step comprises a deleting code step. 6. The method of claim 1, wherein the variants are produced using a crossover combination technique. 7. The method of claim 6, wherein the crossover combination technique is a two-point technique. 8. The method of claim 1, wherein the variants are produced using tournament selection. 9. The method of claim 1, wherein the candidate transform is extracted by comparing a disassembled output of the target program binary with a disassembled output of the variant, and the candidate transform describes the difference between the disassembled outputs of the target program binary and the variant. 10. The method of claim 1, wherein at the applying the candidate transform to each of the plurality of test programs step, the candidate transform is applied to an executable section of the test program. 11. The method of claim 1, wherein at the applying the candidate transform to each of the plurality of test programs step, the test programs are a plurality of test programs other than the target program binary and the variants. 12. The method of claim 1, wherein at the determining whether the candidate transform is safe step, the candidate transform T is considered safe if, for each test program P of the test programs, the test program P and a variant P′=T(P) produced during the applying are functionally equivalent because both P and P′ pass a respective test suite for the test program P. 13. A method for generating validated software transforms comprising:
mutating a target program binary, producing a plurality of variants of the target program binary; determining whether each variant of the variants passes a test suite for the target program binary; upon determining the variant does not pass the test suite, discarding the variant; upon determining the variant passes the test suite:
extracting a candidate transform that describes a difference between a disassembled output of the target program binary and a disassembled output of the variant;
applying the candidate transform to each test program binary of a plurality of additional program binaries, producing a variant of the test program binary;
determining whether the candidate transform is safe, wherein the candidate transform is considered safe if, for each test program binary of the additional program binaries, the variant of the test program binary passes a respective test suite for the test program binary;
upon determining the candidate transform is not safe, discarding the candidate transform; and
upon determining the candidate transform is safe, collecting the candidate transform as one of the validated software transforms. 14. The method of claim 13, wherein the mutation step comprises a code swapping step. 15. The method of claim 13, wherein the mutation step comprises an inserting code step. 16. The method of claim 13, wherein the mutation step comprises a deleting code step. 17. The method of claim 13, wherein the variants are produced using a crossover combination technique. 18. The method of claim 13, wherein the variants are produced using tournament selection. 19. The method of claim 13, wherein at the applying the candidate transform to each test program binary of a plurality of additional program binaries step, the candidate transform is applied to a .text section of the test program binary. 20. A method for generating validated software transforms comprising:
mutating a target program binary using genetic mutation, producing a plurality of variants of the target program binary using a crossover combination technique and tournament selection, wherein the crossover combination technique is a two-point technique; determining whether each variant of the variants passes a test suite for the target program binary; upon determining the variant does not pass the test suite, discarding the variant; upon determining the variant passes the test suite:
extracting a candidate transform by comparing a disassembled output of the target program binary with a disassembled output of the variant, the candidate transform describing a difference between the disassembled outputs of the target program binary and the variant within a window scope criteria;
applying the candidate transform to each test program binary of a plurality of additional program binaries, producing a variant of the test program binary, wherein the candidate transform is applied to a .text section of the test program binary;
determining whether the candidate transform is safe, wherein the candidate transform is considered safe if, for each test program binary of the additional program binaries, the variant of the test program binary passes a respective test suite for the test program binary;
upon determining the candidate transform is not safe, discarding the candidate transform; and
upon determining the candidate transform is safe, collecting the candidate transform as one of the validated software transforms. | 2,100 |
6,151 | 6,151 | 15,279,380 | 2,195 | Embodiments may be generally directed to techniques to cause communication of one or more packets from one or more network interfaces to one or more other network interfaces through a virtual machine monitor, determine at least one of latency and jitter for the virtual machine monitor based, at least in part, on each of the one or more packets communicated through the virtual machine monitor, and perform a corrective action when at least one of the latency and the jitter does not meet a requirement for a virtual machine on the virtual machine monitor. | 1. An apparatus, comprising:
memory; processing circuitry coupled with the memory; and logic, at least partially implemented by the processing circuitry, the logic to:
cause communication of one or more packets from one or more network interfaces through a virtual machine monitor;
determine latency or jitter for the virtual machine monitor based, at least in part, on the one or more packets communicated through the virtual machine monitor; and
perform a corrective action when the latency or the jitter does not meet a defined parameter for a virtual machine on the virtual machine monitor. 2. The apparatus of claim 1, the logic to move the virtual machine on the virtual machine monitor to a different virtual machine monitor for the corrective action. 3. The apparatus of claim 1, the logic to initiate the virtual machine on a different virtual machine monitor for the corrective action. 4. The apparatus of claim 1, the defined parameter comprising one or more of a latency requirement and a jitter requirement specified in a service level agreement for the virtual machine. 5. The apparatus of claim 1, the logic to determine a latency and a jitter for each of a plurality of virtual machine monitors and generate a latency and jitter model based, at least in part, on the determined latencies and jitter. 6. The apparatus of claim 5, the logic to initiate the virtual machine on one of the plurality of virtual machine monitors based on the latency and jitter model and a service level agreement for the virtual machine. 7. The apparatus of claim 1, the logic to cause each network interface to communicate a packet to each other network interface through the virtual machine monitor to determine an instantaneous latency between the network interfaces. 8. The apparatus of claim 1, the logic to:
cause each network interface to communicate a packet to each other network interface through the virtual machine monitor on a periodic basis; determine an instantaneous latency after each communication; and update a latency and jitter model after each period using at least the instantaneous latency. 9. The apparatus of claim 1, wherein at least one of the network interfaces comprising a virtual network interface of a virtual machine supported by the virtual machine monitor. 10. A computer-readable storage medium comprising a plurality of instructions that, when executed by processing circuitry, enable processing circuitry to:
cause communication of one or more packets from one or more network interfaces to one or more other network interfaces through a virtual machine monitor; determine latency or jitter for the virtual machine monitor based, at least in part, on each of the one or more packets communicated through the virtual machine monitor; and perform a corrective action when the latency or the jitter does not meet a defined parameter for a virtual machine on the virtual machine monitor. 11. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to move the virtual machine on the virtual machine monitor to a different virtual machine monitor for the corrective action. 12. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to initiate the virtual machine on a different virtual machine monitor for the corrective action. 13. The computer-readable storage medium of claim 10, the defined parameter comprising at least one of a latency requirement and a jitter requirement specified in a service level agreement for the virtual machine. 14. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to determine a latency and jitter for each of a plurality of virtual machine monitors and generate a latency and jitter model based, at least in part, on the determined latencies. 15. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to initiate the virtual machine on one of the plurality of virtual machine monitors based on the latency and jitter model and a service level agreement for the virtual machine. 16. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to cause each network interface to communicate a packet to each other network interface through the virtual machine monitor to determine an instantaneous latency between the network interfaces. 17. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to:
cause each network interface to communicate a packet to each other network interface through the virtual machine monitor on a periodic basis; determine an instantaneous latency after each communication; and update a latency and jitter model after each period using at least the instantaneous latency. 18. The computer-readable storage medium of claim 10, wherein at least one of the network interfaces comprising a virtual network interface of a virtual machine supported by the virtual machine monitor. 19. A computer-implemented method, comprising:
causing communication of one or more packets from one or more network interfaces to one or more other network interfaces through a virtual machine monitor; determining latency or jitter for the virtual machine monitor based, at least in part, on each of the one or more packets communicated through the virtual machine monitor; and performing a corrective action when the latency or the jitter does not meet a defined parameter for a virtual machine on the virtual machine monitor. 20. The computer-implemented method of claim 19, the corrective action comprising one or more of moving the virtual machine on the virtual machine monitor to a different virtual machine monitor, and initiating the virtual machine on a different virtual machine monitor for the corrective action. 21. The computer-implemented method of claim 19, the defined parameter comprising at least one of a latency requirement and a jitter requirement specified in a service level agreement for the virtual machine. 22. The computer-implemented method of claim 19, comprising:
determining a latency and a jitter for each of a plurality of virtual machine monitors; and generating a latency and jitter model based, at least in part, on the determined latencies and jitter. 23. The computer-implemented method of claim 19, comprising initiating the virtual machine on one of the plurality of virtual machine monitors based on the latency and jitter model and a service level agreement for the virtual machine. 24. The computer-implemented method of claim 19, comprising causing each network interface to communicate a packet to each other network interface through the virtual machine monitor to determine an instantaneous latency between the network interfaces. 25. The computer-implemented method of claim 19, comprising:
causing each network interface to communicate a packet to each other network interface through the virtual machine monitor on a periodic basis; determining an instantaneous latency after each communication; and updating a latency and jitter model after each period using at least the instantaneous latency. | Embodiments may be generally directed to techniques to cause communication of one or more packets from one or more network interfaces to one or more other network interfaces through a virtual machine monitor, determine at least one of latency and jitter for the virtual machine monitor based, at least in part, on each of the one or more packets communicated through the virtual machine monitor, and perform a corrective action when at least one of the latency and the jitter does not meet a requirement for a virtual machine on the virtual machine monitor.1. An apparatus, comprising:
memory; processing circuitry coupled with the memory; and logic, at least partially implemented by the processing circuitry, the logic to:
cause communication of one or more packets from one or more network interfaces through a virtual machine monitor;
determine latency or jitter for the virtual machine monitor based, at least in part, on the one or more packets communicated through the virtual machine monitor; and
perform a corrective action when the latency or the jitter does not meet a defined parameter for a virtual machine on the virtual machine monitor. 2. The apparatus of claim 1, the logic to move the virtual machine on the virtual machine monitor to a different virtual machine monitor for the corrective action. 3. The apparatus of claim 1, the logic to initiate the virtual machine on a different virtual machine monitor for the corrective action. 4. The apparatus of claim 1, the defined parameter comprising one or more of a latency requirement and a jitter requirement specified in a service level agreement for the virtual machine. 5. The apparatus of claim 1, the logic to determine a latency and a jitter for each of a plurality of virtual machine monitors and generate a latency and jitter model based, at least in part, on the determined latencies and jitter. 6. The apparatus of claim 5, the logic to initiate the virtual machine on one of the plurality of virtual machine monitors based on the latency and jitter model and a service level agreement for the virtual machine. 7. The apparatus of claim 1, the logic to cause each network interface to communicate a packet to each other network interface through the virtual machine monitor to determine an instantaneous latency between the network interfaces. 8. The apparatus of claim 1, the logic to:
cause each network interface to communicate a packet to each other network interface through the virtual machine monitor on a periodic basis; determine an instantaneous latency after each communication; and update a latency and jitter model after each period using at least the instantaneous latency. 9. The apparatus of claim 1, wherein at least one of the network interfaces comprising a virtual network interface of a virtual machine supported by the virtual machine monitor. 10. A computer-readable storage medium comprising a plurality of instructions that, when executed by processing circuitry, enable processing circuitry to:
cause communication of one or more packets from one or more network interfaces to one or more other network interfaces through a virtual machine monitor; determine latency or jitter for the virtual machine monitor based, at least in part, on each of the one or more packets communicated through the virtual machine monitor; and perform a corrective action when the latency or the jitter does not meet a defined parameter for a virtual machine on the virtual machine monitor. 11. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to move the virtual machine on the virtual machine monitor to a different virtual machine monitor for the corrective action. 12. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to initiate the virtual machine on a different virtual machine monitor for the corrective action. 13. The computer-readable storage medium of claim 10, the defined parameter comprising at least one of a latency requirement and a jitter requirement specified in a service level agreement for the virtual machine. 14. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to determine a latency and jitter for each of a plurality of virtual machine monitors and generate a latency and jitter model based, at least in part, on the determined latencies. 15. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to initiate the virtual machine on one of the plurality of virtual machine monitors based on the latency and jitter model and a service level agreement for the virtual machine. 16. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to cause each network interface to communicate a packet to each other network interface through the virtual machine monitor to determine an instantaneous latency between the network interfaces. 17. The computer-readable storage medium of claim 10, comprising a plurality of instructions, that when executed, enable processing circuitry to:
cause each network interface to communicate a packet to each other network interface through the virtual machine monitor on a periodic basis; determine an instantaneous latency after each communication; and update a latency and jitter model after each period using at least the instantaneous latency. 18. The computer-readable storage medium of claim 10, wherein at least one of the network interfaces comprising a virtual network interface of a virtual machine supported by the virtual machine monitor. 19. A computer-implemented method, comprising:
causing communication of one or more packets from one or more network interfaces to one or more other network interfaces through a virtual machine monitor; determining latency or jitter for the virtual machine monitor based, at least in part, on each of the one or more packets communicated through the virtual machine monitor; and performing a corrective action when the latency or the jitter does not meet a defined parameter for a virtual machine on the virtual machine monitor. 20. The computer-implemented method of claim 19, the corrective action comprising one or more of moving the virtual machine on the virtual machine monitor to a different virtual machine monitor, and initiating the virtual machine on a different virtual machine monitor for the corrective action. 21. The computer-implemented method of claim 19, the defined parameter comprising at least one of a latency requirement and a jitter requirement specified in a service level agreement for the virtual machine. 22. The computer-implemented method of claim 19, comprising:
determining a latency and a jitter for each of a plurality of virtual machine monitors; and generating a latency and jitter model based, at least in part, on the determined latencies and jitter. 23. The computer-implemented method of claim 19, comprising initiating the virtual machine on one of the plurality of virtual machine monitors based on the latency and jitter model and a service level agreement for the virtual machine. 24. The computer-implemented method of claim 19, comprising causing each network interface to communicate a packet to each other network interface through the virtual machine monitor to determine an instantaneous latency between the network interfaces. 25. The computer-implemented method of claim 19, comprising:
causing each network interface to communicate a packet to each other network interface through the virtual machine monitor on a periodic basis; determining an instantaneous latency after each communication; and updating a latency and jitter model after each period using at least the instantaneous latency. | 2,100 |
6,152 | 6,152 | 14,980,675 | 2,144 | A message processing method and apparatus that are related to the field of information technologies and that can decrease complexity of message processing. The method includes displaying a message on a lock screen interface first; then, acquiring an operation track corresponding to the message; and finally determining whether the operation track is the same as a preset operation track, and processing the message if the operation track is the same as the preset operation track. The embodiments of the present disclosure are applicable to message processing by a terminal device in a lock screen state. | 1. A message processing method, comprising:
displaying a message on a lock screen interface; acquiring an operation track corresponding to the message; determining whether the operation track is the same as a preset operation track; and processing the message when the operation track is the same as the preset operation track. 2. The message processing method according to claim 1, wherein before processing the message, the method further comprises:
displaying prompt information, wherein the prompt information is used to confirm whether to process the message; and determining whether confirmation information corresponding to the prompt information is received, and wherein processing the message comprises processing the message when the confirmation information corresponding to the prompt information is received. 3. The message processing method according to claim 1, wherein before the acquiring of the operation track corresponding to the message, the method further comprises displaying a message processing area, wherein determining whether the operation track is the same as the preset operation track comprises determining whether the operation track the same as the preset operation track exists in the message processing area, and wherein processing the message when the operation track is the same as the preset operation track comprises processing the message when the operation track the same as the preset operation track exists in the message processing area. 4. The message processing method according to claim 3, wherein displaying the message processing area comprises displaying a first message processing area and a second message processing area, and wherein determining whether the operation track the same as the preset operation track exists in the message processing area comprises determining whether the operation track the same as the preset operation track exists in the first message processing area or the second message processing area. 5. The message processing method according to claim 4, wherein processing the message when the operation track the same as the preset operation track exists in the message processing area comprises performing first processing on the message when the operation track the same as the preset operation track exists in the first message processing area; and 6. The message processing method according to claim 4, wherein processing the message when the operation track the same as the preset operation track exists in the message processing area comprises performing second processing on the message when the operation track the same as the preset operation track exists in the second message processing area. 7. The message processing method according to claim 1, wherein acquiring the operation track corresponding to the message comprises acquiring a sliding track corresponding to the message, wherein determining whether the operation track is the same as the preset operation track comprises determining whether the sliding track is the same as a preset sliding track, wherein the preset sliding track is used to trigger deletion of the message, and wherein processing the message when the operation track is the same as the preset operation track comprises deleting the message when the sliding track is the same as the preset sliding track. 8. A message processing apparatus, comprising:
a display configured to display a message on a lock screen interface; a processor configured to:
acquire an operation track corresponding to the message displayed by the display;
determine whether the operation track is the same as a preset operation track; and
process the message when the operation track is the same as the preset operation track. 9. The message processing apparatus according to claim 8, wherein the display is further configured to display prompt information, wherein the prompt information is used to confirm whether to process the message, wherein the processor is further configured to:
determine whether confirmation information corresponding to the prompt information displayed by the display is received; and process the message when the confirmation information corresponding to the prompt information is received. 10. The message processing apparatus according to claim 8, wherein the display is further configured to display a message processing area, wherein the processor is further configured to:
determine whether the operation track the same as the preset operation track exists in the message processing area displayed by the display; and process the message when the operation track the same as the preset operation track exists in the message processing area. 11. The message processing apparatus according to claim 10, wherein the display is further configured to display a first message processing area and a second message processing area, and wherein the processor is further configured to determine whether the operation track the same as the preset operation track exists in the first message processing area or the second message processing area displayed by the display. 12. The message processing apparatus according to claim 11, wherein the processor is further configured to perform first processing on the message when the operation track the same as the preset operation track exists in the first message processing area. 13. The message processing apparatus according to claim 11, wherein the processor is further configured to perform second processing on the message when the operation track the same as the preset operation track exists in the second message processing area. 14. The message processing apparatus according to claim 10, wherein the processor is further configured to:
acquire a sliding track corresponding to the message; determine whether the sliding track is the same as a preset sliding track, wherein the preset sliding track is used to trigger deletion of the message; and delete the message when the sliding track is the same as the preset sliding track. | A message processing method and apparatus that are related to the field of information technologies and that can decrease complexity of message processing. The method includes displaying a message on a lock screen interface first; then, acquiring an operation track corresponding to the message; and finally determining whether the operation track is the same as a preset operation track, and processing the message if the operation track is the same as the preset operation track. The embodiments of the present disclosure are applicable to message processing by a terminal device in a lock screen state.1. A message processing method, comprising:
displaying a message on a lock screen interface; acquiring an operation track corresponding to the message; determining whether the operation track is the same as a preset operation track; and processing the message when the operation track is the same as the preset operation track. 2. The message processing method according to claim 1, wherein before processing the message, the method further comprises:
displaying prompt information, wherein the prompt information is used to confirm whether to process the message; and determining whether confirmation information corresponding to the prompt information is received, and wherein processing the message comprises processing the message when the confirmation information corresponding to the prompt information is received. 3. The message processing method according to claim 1, wherein before the acquiring of the operation track corresponding to the message, the method further comprises displaying a message processing area, wherein determining whether the operation track is the same as the preset operation track comprises determining whether the operation track the same as the preset operation track exists in the message processing area, and wherein processing the message when the operation track is the same as the preset operation track comprises processing the message when the operation track the same as the preset operation track exists in the message processing area. 4. The message processing method according to claim 3, wherein displaying the message processing area comprises displaying a first message processing area and a second message processing area, and wherein determining whether the operation track the same as the preset operation track exists in the message processing area comprises determining whether the operation track the same as the preset operation track exists in the first message processing area or the second message processing area. 5. The message processing method according to claim 4, wherein processing the message when the operation track the same as the preset operation track exists in the message processing area comprises performing first processing on the message when the operation track the same as the preset operation track exists in the first message processing area; and 6. The message processing method according to claim 4, wherein processing the message when the operation track the same as the preset operation track exists in the message processing area comprises performing second processing on the message when the operation track the same as the preset operation track exists in the second message processing area. 7. The message processing method according to claim 1, wherein acquiring the operation track corresponding to the message comprises acquiring a sliding track corresponding to the message, wherein determining whether the operation track is the same as the preset operation track comprises determining whether the sliding track is the same as a preset sliding track, wherein the preset sliding track is used to trigger deletion of the message, and wherein processing the message when the operation track is the same as the preset operation track comprises deleting the message when the sliding track is the same as the preset sliding track. 8. A message processing apparatus, comprising:
a display configured to display a message on a lock screen interface; a processor configured to:
acquire an operation track corresponding to the message displayed by the display;
determine whether the operation track is the same as a preset operation track; and
process the message when the operation track is the same as the preset operation track. 9. The message processing apparatus according to claim 8, wherein the display is further configured to display prompt information, wherein the prompt information is used to confirm whether to process the message, wherein the processor is further configured to:
determine whether confirmation information corresponding to the prompt information displayed by the display is received; and process the message when the confirmation information corresponding to the prompt information is received. 10. The message processing apparatus according to claim 8, wherein the display is further configured to display a message processing area, wherein the processor is further configured to:
determine whether the operation track the same as the preset operation track exists in the message processing area displayed by the display; and process the message when the operation track the same as the preset operation track exists in the message processing area. 11. The message processing apparatus according to claim 10, wherein the display is further configured to display a first message processing area and a second message processing area, and wherein the processor is further configured to determine whether the operation track the same as the preset operation track exists in the first message processing area or the second message processing area displayed by the display. 12. The message processing apparatus according to claim 11, wherein the processor is further configured to perform first processing on the message when the operation track the same as the preset operation track exists in the first message processing area. 13. The message processing apparatus according to claim 11, wherein the processor is further configured to perform second processing on the message when the operation track the same as the preset operation track exists in the second message processing area. 14. The message processing apparatus according to claim 10, wherein the processor is further configured to:
acquire a sliding track corresponding to the message; determine whether the sliding track is the same as a preset sliding track, wherein the preset sliding track is used to trigger deletion of the message; and delete the message when the sliding track is the same as the preset sliding track. | 2,100 |
6,153 | 6,153 | 15,295,869 | 2,145 | An electronic device with a display and, optionally, a touch-sensitive surface obtains a collection of media items. In some embodiments, the device determines one or more patterns in the collection based on a comparison between properties of sequentially adjacent items and divides the collection into multiple events that includes a plurality of multi-item events. In some embodiments, the device receives a first request to display a first portion of the collection organized in accordance with a first detailed-granularity level and, in response to the first request, displaying a first plurality of representations of the items. The device receives a second request to display a second portion of the collection organized in accordance with a respective overview-granularity level that corresponds to multiple detailed-granularity levels and, in response to the second request, displays a second plurality of representations of the items. | 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 and a touch-sensitive surface, cause the electronic device to:
obtain a collection of media items, wherein the media items are organized into a hierarchy of granularity levels that includes one or more detailed-granularity levels within one or more overview-granularity levels; receive a first request to display a first portion of the collection organized in accordance with a first detailed-granularity level; in response to the first request, display a first plurality of representations of the media items wherein:
the first plurality of representations are displayed at a detailed-granularity size; and
the first plurality of representations are spaced apart from each other by a detailed-granularity distance;
receive a second request to display a second portion of the collection organized in accordance with a respective overview-granularity level that corresponds to multiple detailed-granularity levels; and, in response to the second request, display a second plurality of representations of the media items wherein:
the second plurality of representations are displayed at an overview-granularity size, smaller than the detailed-granularity size; and
the second plurality of representations are spaced apart from each other by an overview-granularity distance, smaller than the detailed-granularity distance. 2. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device, cause the electronic device to:
receive a third request to display a third portion of the collection organized in accordance with a second detailed-granularity level different from the first detailed-granularity level; in response to the third request, display a third plurality of representations of the media items, wherein:
the third plurality of representations are displayed at the detailed-granularity size; and
the third plurality of representations are spaced apart from each other by the detailed-granularity distance. 3. The computer readable storage medium of claim 2, wherein:
the first detailed-granularity level corresponds to a first timescale; the second detailed-granularity level corresponds to a second timescale larger than the first timescale; and the overview-granularity level corresponds to a third timescale larger than the second timescale. 4. The computer readable storage medium of claim 1, wherein:
a first representation of the media items in the first plurality of representations of the media items that correspond to the first detailed-granularity level includes images that correspond to a subset of items in a first time range; and a second representation of the media items in the second plurality of representations of the media items that correspond to the overview-granularity level includes:
images that correspond to the subset of items in the first time range; and
one or more images of items in the first time range that were omitted from the images included in the first representation of the media items. 5. The computer readable storage medium of claim 1, wherein:
the detailed-granularity distance is greater than an object-selection margin; and the overview-granularity distance is smaller than the object-selection margin. 6. The computer readable storage medium of claim 1, wherein:
the detailed-granularity size is above a minimum object-selection size; and the overview-granularity size is below the minimum object-selection size. 7. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device, cause the electronic device to:
detect a tap input at a location on the touch-sensitive surface that corresponds to a respective representation of a respective media item; and in response to detecting the tap input:
in accordance with a determination that the respective representation was displayed in a plurality of representations displayed at the detailed-granularity size, replace display of the plurality of representations with display of the respective media item; and,
in accordance with a determination that the respective representation was displayed in a plurality of representations displayed at the overview-granularity size, continue to display of the plurality of representations. 8. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device, cause the electronic device to:
while displaying the second plurality of representations of the media items at the overview-granularity size, detect a contact at a location on the touch-sensitive surface that corresponds to a first representation of a first media item in the second plurality of representations of the media items; and, in response to detecting the contact:
display an enlarged representation of the first media item. 9. The computer readable storage medium of claim 8, including instructions, which when executed by the electronic device, cause the electronic device to:
in response to detecting the contact, cease to display the first representation of the first media item. 10. The computer readable storage medium of claim 8, including instructions, which when executed by the electronic device, cause the electronic device to:
while displaying the enlarged representation of the first media item, detect liftoff of the contact from the touch-sensitive surface; and, in response to detecting liftoff of the contact from the touch-sensitive surface, replace display of the plurality of representations with display of the respective media item. 11. The computer readable storage medium of claim 9, including instructions, which when executed by the electronic device, cause the electronic device to:
while displaying the enlarged representation of the first media item, detect movement of the contact to a location on the touch-sensitive surface that corresponds to a second representation of a second media item in the second plurality of representations of the media items; and in response to detecting movement of the contact:
cease to display the enlarged representation of the first media item;
redisplay the first representation of the first media item;
display an enlarged representation of the second media item; and
cease to display the second representation of the second media item. 12. The computer readable storage medium of claim 1, wherein:
the first plurality of representations that correspond to the first detailed-granularity level are grouped into a plurality of groups and different groups of representations in the first plurality of representations are separated by at least a first distance; and the second plurality of representations that correspond to the overview-granularity level are grouped into a plurality of groups and different groups of representations in the second plurality of representations are separated by a second distance that is smaller than the first distance. 13. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; a memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
obtaining a collection of media items, wherein the media items are organized into a hierarchy of granularity levels that includes one or more detailed-granularity levels within one or more overview-granularity levels;
receiving a first request to display a first portion of the collection organized in accordance with a first detailed-granularity level;
in response to the first request, displaying a first plurality of representations of the media items wherein:
the first plurality of representations are displayed at a detailed-granularity size; and
the first plurality of representations are spaced apart from each other by a detailed-granularity distance;
receiving a second request to display a second portion of the collection organized in accordance with a respective overview-granularity level that corresponds to multiple detailed-granularity levels; and
in response to the second request, displaying a second plurality of representations of the media items wherein:
the second plurality of representations are displayed at an overview-granularity size, smaller than the detailed-granularity size; and
the second plurality of representations are spaced apart from each other by an overview-granularity distance, smaller than the detailed-granularity distance. 14. A method comprising:
at an electronic device with a display, a touch-sensitive surface, one or more processors and memory:
obtaining a collection of media items, wherein the media items are organized into a hierarchy of granularity levels that includes one or more detailed-granularity levels within one or more overview-granularity levels;
receiving a first request to display a first portion of the collection organized in accordance with a first detailed-granularity level;
in response to the first request, displaying a first plurality of representations of the media items, wherein:
the first plurality of representations are displayed at a detailed-granularity size; and
the first plurality of representations are spaced apart from each other by a detailed-granularity distance;
receiving a second request to display a second portion of the collection organized in accordance with a respective overview-granularity level that corresponds to multiple detailed-granularity levels; and
in response to the second request, displaying a second plurality of representations of the media items, wherein:
the second plurality of representations are displayed at an overview-granularity size, smaller than the detailed-granularity size; and
the second plurality of representations are spaced apart from each other by an overview-granularity distance, smaller than the detailed-granularity distance.
transition point. | An electronic device with a display and, optionally, a touch-sensitive surface obtains a collection of media items. In some embodiments, the device determines one or more patterns in the collection based on a comparison between properties of sequentially adjacent items and divides the collection into multiple events that includes a plurality of multi-item events. In some embodiments, the device receives a first request to display a first portion of the collection organized in accordance with a first detailed-granularity level and, in response to the first request, displaying a first plurality of representations of the items. The device receives a second request to display a second portion of the collection organized in accordance with a respective overview-granularity level that corresponds to multiple detailed-granularity levels and, in response to the second request, displays a second plurality of representations of the items.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 and a touch-sensitive surface, cause the electronic device to:
obtain a collection of media items, wherein the media items are organized into a hierarchy of granularity levels that includes one or more detailed-granularity levels within one or more overview-granularity levels; receive a first request to display a first portion of the collection organized in accordance with a first detailed-granularity level; in response to the first request, display a first plurality of representations of the media items wherein:
the first plurality of representations are displayed at a detailed-granularity size; and
the first plurality of representations are spaced apart from each other by a detailed-granularity distance;
receive a second request to display a second portion of the collection organized in accordance with a respective overview-granularity level that corresponds to multiple detailed-granularity levels; and, in response to the second request, display a second plurality of representations of the media items wherein:
the second plurality of representations are displayed at an overview-granularity size, smaller than the detailed-granularity size; and
the second plurality of representations are spaced apart from each other by an overview-granularity distance, smaller than the detailed-granularity distance. 2. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device, cause the electronic device to:
receive a third request to display a third portion of the collection organized in accordance with a second detailed-granularity level different from the first detailed-granularity level; in response to the third request, display a third plurality of representations of the media items, wherein:
the third plurality of representations are displayed at the detailed-granularity size; and
the third plurality of representations are spaced apart from each other by the detailed-granularity distance. 3. The computer readable storage medium of claim 2, wherein:
the first detailed-granularity level corresponds to a first timescale; the second detailed-granularity level corresponds to a second timescale larger than the first timescale; and the overview-granularity level corresponds to a third timescale larger than the second timescale. 4. The computer readable storage medium of claim 1, wherein:
a first representation of the media items in the first plurality of representations of the media items that correspond to the first detailed-granularity level includes images that correspond to a subset of items in a first time range; and a second representation of the media items in the second plurality of representations of the media items that correspond to the overview-granularity level includes:
images that correspond to the subset of items in the first time range; and
one or more images of items in the first time range that were omitted from the images included in the first representation of the media items. 5. The computer readable storage medium of claim 1, wherein:
the detailed-granularity distance is greater than an object-selection margin; and the overview-granularity distance is smaller than the object-selection margin. 6. The computer readable storage medium of claim 1, wherein:
the detailed-granularity size is above a minimum object-selection size; and the overview-granularity size is below the minimum object-selection size. 7. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device, cause the electronic device to:
detect a tap input at a location on the touch-sensitive surface that corresponds to a respective representation of a respective media item; and in response to detecting the tap input:
in accordance with a determination that the respective representation was displayed in a plurality of representations displayed at the detailed-granularity size, replace display of the plurality of representations with display of the respective media item; and,
in accordance with a determination that the respective representation was displayed in a plurality of representations displayed at the overview-granularity size, continue to display of the plurality of representations. 8. The computer readable storage medium of claim 1, including instructions, which when executed by the electronic device, cause the electronic device to:
while displaying the second plurality of representations of the media items at the overview-granularity size, detect a contact at a location on the touch-sensitive surface that corresponds to a first representation of a first media item in the second plurality of representations of the media items; and, in response to detecting the contact:
display an enlarged representation of the first media item. 9. The computer readable storage medium of claim 8, including instructions, which when executed by the electronic device, cause the electronic device to:
in response to detecting the contact, cease to display the first representation of the first media item. 10. The computer readable storage medium of claim 8, including instructions, which when executed by the electronic device, cause the electronic device to:
while displaying the enlarged representation of the first media item, detect liftoff of the contact from the touch-sensitive surface; and, in response to detecting liftoff of the contact from the touch-sensitive surface, replace display of the plurality of representations with display of the respective media item. 11. The computer readable storage medium of claim 9, including instructions, which when executed by the electronic device, cause the electronic device to:
while displaying the enlarged representation of the first media item, detect movement of the contact to a location on the touch-sensitive surface that corresponds to a second representation of a second media item in the second plurality of representations of the media items; and in response to detecting movement of the contact:
cease to display the enlarged representation of the first media item;
redisplay the first representation of the first media item;
display an enlarged representation of the second media item; and
cease to display the second representation of the second media item. 12. The computer readable storage medium of claim 1, wherein:
the first plurality of representations that correspond to the first detailed-granularity level are grouped into a plurality of groups and different groups of representations in the first plurality of representations are separated by at least a first distance; and the second plurality of representations that correspond to the overview-granularity level are grouped into a plurality of groups and different groups of representations in the second plurality of representations are separated by a second distance that is smaller than the first distance. 13. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; a memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
obtaining a collection of media items, wherein the media items are organized into a hierarchy of granularity levels that includes one or more detailed-granularity levels within one or more overview-granularity levels;
receiving a first request to display a first portion of the collection organized in accordance with a first detailed-granularity level;
in response to the first request, displaying a first plurality of representations of the media items wherein:
the first plurality of representations are displayed at a detailed-granularity size; and
the first plurality of representations are spaced apart from each other by a detailed-granularity distance;
receiving a second request to display a second portion of the collection organized in accordance with a respective overview-granularity level that corresponds to multiple detailed-granularity levels; and
in response to the second request, displaying a second plurality of representations of the media items wherein:
the second plurality of representations are displayed at an overview-granularity size, smaller than the detailed-granularity size; and
the second plurality of representations are spaced apart from each other by an overview-granularity distance, smaller than the detailed-granularity distance. 14. A method comprising:
at an electronic device with a display, a touch-sensitive surface, one or more processors and memory:
obtaining a collection of media items, wherein the media items are organized into a hierarchy of granularity levels that includes one or more detailed-granularity levels within one or more overview-granularity levels;
receiving a first request to display a first portion of the collection organized in accordance with a first detailed-granularity level;
in response to the first request, displaying a first plurality of representations of the media items, wherein:
the first plurality of representations are displayed at a detailed-granularity size; and
the first plurality of representations are spaced apart from each other by a detailed-granularity distance;
receiving a second request to display a second portion of the collection organized in accordance with a respective overview-granularity level that corresponds to multiple detailed-granularity levels; and
in response to the second request, displaying a second plurality of representations of the media items, wherein:
the second plurality of representations are displayed at an overview-granularity size, smaller than the detailed-granularity size; and
the second plurality of representations are spaced apart from each other by an overview-granularity distance, smaller than the detailed-granularity distance.
transition point. | 2,100 |
6,154 | 6,154 | 14,477,480 | 2,176 | In an audio setup comprising at least one audio headset configurable to process audio for a user (e.g., when participating in an online multiplayer game), input audio and/or output audio in the audio headset may be monitored, and when the audio matches triggering criteria, one or more update messages may be triggered via a social networking service. The triggering criteria may comprise (or be set based on) identity of the speaker, content of the audio, and/or conditions association with the audio. Different triggering criteria may be associated with different applications (e.g., different video games). The update messages may be made available to one or more other users, who may be selected based on matching particular user selection criteria and/or based on successful user validation. The user selection criteria may comprise participation in the same online multiplayer game. | 1. A method, comprising:
in an audio setup comprising at least one audio headset that is configurable to process audio for a player participating in an online multiplayer game:
monitoring input audio and/or output audio in the audio headset;
detecting when the audio matches one or more triggering criteria; and
when there is a match, triggering a post of an update message via a social networking service. 2. The method of claim 1, comprising setting the one or more triggering criteria based on identity of speaker, content of the audio, and/or conditions association with the audio. 3. The method of claim 1, wherein the one or more triggering criteria are associated with a particular video game. 4. The method of claim 1, comprising interacting with a remote audio database that is used for storing data relating to triggering update messages. 5. The method of claim 4, wherein the remote audio database comprises data relating to triggering update messages based on audio associated with a plurality of different video games. 6. The method of claim 4, wherein the remote audio database comprises a plurality of entries, with each entry comprising data specifying particular set of triggering criteria and/or data relating to one or more corresponding update messages. 7. The method of claim 4, comprising downloading from the remote audio database, based on the online multiplayer game, data for determining the one or more triggering criteria and/or the update message. 8. The method of claim 1, comprising making the update message available, via the social networking service, to one or more particular other users. 9. The method of claim 8, comprising selecting the one or more particular other users based on matching one or more user selection criteria and/or based on successful user validation. 10. The method of claim 9, wherein the one or more user selection criteria comprise participation in the online multiplayer game. 11. A system, comprising:
at least one audio headset that is configurable to process audio for a first player participating in an online multiplayer game, wherein the system is operable to:
monitor input audio and/or output audio in the audio headset;
detect when the audio matches one or more triggering criteria; and
when there is a match, trigger a post of an update message via a social networking service. 12. The system of claim 11, wherein the one or more triggering criteria are set based on identity of speaker, content of the audio, and/or conditions association with the audio. 13. The system of claim 11, wherein the one or more triggering criteria are associated with a particular video game. 14. The system of claim 11, wherein the system is operable to interact with a central remote audio database that is used in storing data relating to triggering update messages. 15. The system of claim 14, wherein the remote audio database comprises data relating to triggering update messages based on audio associated with a plurality of different video games. 16. The system of claim 14, wherein the remote audio database comprises a plurality of entries, with each entry comprising data specifying particular set of triggering criteria and/or data relating to one or more corresponding update messages. 17. The system of claim 14, wherein the system is operable to from the remote audio database, based on the online multiplayer game, data for determining the one or more triggering criteria and/or the update message. 18. The system of claim 11, wherein the update message is received or accessed by one or more particular other users. 19. The system of claim 18, wherein the one or more particular other users are selected based on matching one or more user selection criteria and/or based on successful user validation. 20. The system of claim 19, wherein the one or more user selection criteria comprise participation in the online multiplayer game. | In an audio setup comprising at least one audio headset configurable to process audio for a user (e.g., when participating in an online multiplayer game), input audio and/or output audio in the audio headset may be monitored, and when the audio matches triggering criteria, one or more update messages may be triggered via a social networking service. The triggering criteria may comprise (or be set based on) identity of the speaker, content of the audio, and/or conditions association with the audio. Different triggering criteria may be associated with different applications (e.g., different video games). The update messages may be made available to one or more other users, who may be selected based on matching particular user selection criteria and/or based on successful user validation. The user selection criteria may comprise participation in the same online multiplayer game.1. A method, comprising:
in an audio setup comprising at least one audio headset that is configurable to process audio for a player participating in an online multiplayer game:
monitoring input audio and/or output audio in the audio headset;
detecting when the audio matches one or more triggering criteria; and
when there is a match, triggering a post of an update message via a social networking service. 2. The method of claim 1, comprising setting the one or more triggering criteria based on identity of speaker, content of the audio, and/or conditions association with the audio. 3. The method of claim 1, wherein the one or more triggering criteria are associated with a particular video game. 4. The method of claim 1, comprising interacting with a remote audio database that is used for storing data relating to triggering update messages. 5. The method of claim 4, wherein the remote audio database comprises data relating to triggering update messages based on audio associated with a plurality of different video games. 6. The method of claim 4, wherein the remote audio database comprises a plurality of entries, with each entry comprising data specifying particular set of triggering criteria and/or data relating to one or more corresponding update messages. 7. The method of claim 4, comprising downloading from the remote audio database, based on the online multiplayer game, data for determining the one or more triggering criteria and/or the update message. 8. The method of claim 1, comprising making the update message available, via the social networking service, to one or more particular other users. 9. The method of claim 8, comprising selecting the one or more particular other users based on matching one or more user selection criteria and/or based on successful user validation. 10. The method of claim 9, wherein the one or more user selection criteria comprise participation in the online multiplayer game. 11. A system, comprising:
at least one audio headset that is configurable to process audio for a first player participating in an online multiplayer game, wherein the system is operable to:
monitor input audio and/or output audio in the audio headset;
detect when the audio matches one or more triggering criteria; and
when there is a match, trigger a post of an update message via a social networking service. 12. The system of claim 11, wherein the one or more triggering criteria are set based on identity of speaker, content of the audio, and/or conditions association with the audio. 13. The system of claim 11, wherein the one or more triggering criteria are associated with a particular video game. 14. The system of claim 11, wherein the system is operable to interact with a central remote audio database that is used in storing data relating to triggering update messages. 15. The system of claim 14, wherein the remote audio database comprises data relating to triggering update messages based on audio associated with a plurality of different video games. 16. The system of claim 14, wherein the remote audio database comprises a plurality of entries, with each entry comprising data specifying particular set of triggering criteria and/or data relating to one or more corresponding update messages. 17. The system of claim 14, wherein the system is operable to from the remote audio database, based on the online multiplayer game, data for determining the one or more triggering criteria and/or the update message. 18. The system of claim 11, wherein the update message is received or accessed by one or more particular other users. 19. The system of claim 18, wherein the one or more particular other users are selected based on matching one or more user selection criteria and/or based on successful user validation. 20. The system of claim 19, wherein the one or more user selection criteria comprise participation in the online multiplayer game. | 2,100 |
6,155 | 6,155 | 15,686,690 | 2,132 | In a method for managing a storage device, the method includes: receiving, by a host processor located on a host system, index requirements for an index, the index requirements comprising at least one of user service requirements or data access requirements; transmitting, by the host processor, to a storage processor located on a storage device, at least some of the index requirements for the index; receiving, by the host processor, parameters of a first index created by the storage processor utilizing a device profile of the storage device comprising at least one of computing capabilities or storage capabilities of the storage device, and the index requirements; building, by the host processor, utilizing the parameters of the first index and interacting with the first index, a second index that meets the index requirements. | 1. A method for managing a storage device, the method comprising:
receiving, by a host processor located on a host system, index requirements for an index, the index requirements comprising at least one of user service requirements or data access requirements; transmitting, by the host processor, to a storage processor located on a storage device, at least some of the index requirements for the index; receiving, by the host processor, parameters of a first index created by the storage processor utilizing a device profile of the storage device comprising at least one of computing capabilities or storage capabilities of the storage device, and the index requirements; building, by the host processor, utilizing the parameters of the first index and interacting with the first index, a second index that meets the index requirements. 2. The method of claim 1, wherein the device profile of the storage device comprise at least one of memory, capacity, controller performance, storage media, or performance. 3. The method of claim 1, wherein the host system comprises a personal computer or a server configurable to connect to a local or wide area network. 4. The method of claim 1, wherein the index requirements comprise at least one of quality of service for the storage device, ordering requirements for the data, query patterns, key distribution, value distribution, partial keys, or container capacity. 5. The method of claim 1, wherein a durable copy of the second index or metadata about the second index is stored in a container created on the storage device. 6. The method of claim 1, wherein the storage device comprises a key value solid-state drive. 7. The method of claim 1, wherein an index structure of the first index is only partially structured to decrease a computational burden on the storage device. 8. The method of claim 1, wherein at least one additional storage device is utilized that has a third index created in it that can be utilized cooperatively with the second index structure of the host system. 9. The method of claim 1, wherein an index structure of the second index is constructed dynamically. 10. The method of claim 1, wherein an index structure of the second index is constructed in part in response to access requests or queries for the data stored on the storage device. 11. The method of claim 1, further comprising identifying, by the processor, performance characteristics of the storage device in response to at least one of storage device driver loading, library loading, storage device opening, container opening, data access, or user input. 12. The method of claim 1, wherein an index structure of the second index is structured to be utilized cooperatively with indexes associated with multiple, different containers having competing needs. 13. A storage system comprising:
a host comprising a host processor and a host memory; and a storage device comprising a storage processor and a storage memory, wherein the host processor is configured to receive index requirements for an index, the index requirements comprising at least one of user service requirements or data access requirements, wherein the host processor is configured to transmit, to the storage processor, at least some of the index requirements for the index, wherein the storage processor is configured to determine a device profile comprising at least one of computing capabilities and storage capabilities of the storage device, wherein the storage processor is configured to build a first index utilizing the index requirements and the device profile, wherein the host processor is configured to receive parameters of the first index, and wherein the host processor is configured to build, utilizing the parameters of the first index, and interacting with the first index, a second index that meets the index requirements. 14. The system of claim 13, wherein the device profile comprise at least one of memory, capacity, controller performance, storage media, or performance. 15. The system of claim 13, wherein the host system comprises a personal computer or a server configurable to connect to a local or wide area network. 16. The system of claim 13, wherein the index requirements comprise at least one of quality of service for the storage device, ordering requirements for the data, query patterns, key distribution, value distribution, partial keys, or container capacity. 17. The system of claim 13, wherein a durable copy of the second index or metadata about the second index is stored in a container created on the storage device. 18. The system of claim 13, wherein the storage device comprises a key value solid-state drive. 19. The system of claim 13, wherein an index structure of the first index is only partially structured to decrease a computational burden on the storage device. 20. A storage device comprising a storage processor and a memory and configured to be operatively coupled to a host, wherein the storage processor is configured to:
receive index requirements for an index, the index requirements comprising at least one of user service requirements or data access requirements; build a first index utilizing at least some of the index requirements and a device profile of the storage device, the device profile comprising at least one of computing capabilities or storage capabilities; transmit parameters of the first index to the host; and interacting with the host to generate a second index that meets the index requirements, wherein the first index and the second index are utilized cooperatively as the index for a storage system comprising the host and the storage device. | In a method for managing a storage device, the method includes: receiving, by a host processor located on a host system, index requirements for an index, the index requirements comprising at least one of user service requirements or data access requirements; transmitting, by the host processor, to a storage processor located on a storage device, at least some of the index requirements for the index; receiving, by the host processor, parameters of a first index created by the storage processor utilizing a device profile of the storage device comprising at least one of computing capabilities or storage capabilities of the storage device, and the index requirements; building, by the host processor, utilizing the parameters of the first index and interacting with the first index, a second index that meets the index requirements.1. A method for managing a storage device, the method comprising:
receiving, by a host processor located on a host system, index requirements for an index, the index requirements comprising at least one of user service requirements or data access requirements; transmitting, by the host processor, to a storage processor located on a storage device, at least some of the index requirements for the index; receiving, by the host processor, parameters of a first index created by the storage processor utilizing a device profile of the storage device comprising at least one of computing capabilities or storage capabilities of the storage device, and the index requirements; building, by the host processor, utilizing the parameters of the first index and interacting with the first index, a second index that meets the index requirements. 2. The method of claim 1, wherein the device profile of the storage device comprise at least one of memory, capacity, controller performance, storage media, or performance. 3. The method of claim 1, wherein the host system comprises a personal computer or a server configurable to connect to a local or wide area network. 4. The method of claim 1, wherein the index requirements comprise at least one of quality of service for the storage device, ordering requirements for the data, query patterns, key distribution, value distribution, partial keys, or container capacity. 5. The method of claim 1, wherein a durable copy of the second index or metadata about the second index is stored in a container created on the storage device. 6. The method of claim 1, wherein the storage device comprises a key value solid-state drive. 7. The method of claim 1, wherein an index structure of the first index is only partially structured to decrease a computational burden on the storage device. 8. The method of claim 1, wherein at least one additional storage device is utilized that has a third index created in it that can be utilized cooperatively with the second index structure of the host system. 9. The method of claim 1, wherein an index structure of the second index is constructed dynamically. 10. The method of claim 1, wherein an index structure of the second index is constructed in part in response to access requests or queries for the data stored on the storage device. 11. The method of claim 1, further comprising identifying, by the processor, performance characteristics of the storage device in response to at least one of storage device driver loading, library loading, storage device opening, container opening, data access, or user input. 12. The method of claim 1, wherein an index structure of the second index is structured to be utilized cooperatively with indexes associated with multiple, different containers having competing needs. 13. A storage system comprising:
a host comprising a host processor and a host memory; and a storage device comprising a storage processor and a storage memory, wherein the host processor is configured to receive index requirements for an index, the index requirements comprising at least one of user service requirements or data access requirements, wherein the host processor is configured to transmit, to the storage processor, at least some of the index requirements for the index, wherein the storage processor is configured to determine a device profile comprising at least one of computing capabilities and storage capabilities of the storage device, wherein the storage processor is configured to build a first index utilizing the index requirements and the device profile, wherein the host processor is configured to receive parameters of the first index, and wherein the host processor is configured to build, utilizing the parameters of the first index, and interacting with the first index, a second index that meets the index requirements. 14. The system of claim 13, wherein the device profile comprise at least one of memory, capacity, controller performance, storage media, or performance. 15. The system of claim 13, wherein the host system comprises a personal computer or a server configurable to connect to a local or wide area network. 16. The system of claim 13, wherein the index requirements comprise at least one of quality of service for the storage device, ordering requirements for the data, query patterns, key distribution, value distribution, partial keys, or container capacity. 17. The system of claim 13, wherein a durable copy of the second index or metadata about the second index is stored in a container created on the storage device. 18. The system of claim 13, wherein the storage device comprises a key value solid-state drive. 19. The system of claim 13, wherein an index structure of the first index is only partially structured to decrease a computational burden on the storage device. 20. A storage device comprising a storage processor and a memory and configured to be operatively coupled to a host, wherein the storage processor is configured to:
receive index requirements for an index, the index requirements comprising at least one of user service requirements or data access requirements; build a first index utilizing at least some of the index requirements and a device profile of the storage device, the device profile comprising at least one of computing capabilities or storage capabilities; transmit parameters of the first index to the host; and interacting with the host to generate a second index that meets the index requirements, wherein the first index and the second index are utilized cooperatively as the index for a storage system comprising the host and the storage device. | 2,100 |
6,156 | 6,156 | 14,926,373 | 2,175 | One embodiment provides a method, including: accepting, at an input surface of an electronic device, ink strokes; determining, using a processor of the electronic device, that the ink strokes include a selection indicator pair; associating, using a processor of the electronic device, the selection indicator pair with content; and selecting, using a processor of the electronic device, the content associated with the selection indicator pair. Other aspects are described and claimed. | 1. A method, comprising:
accepting, at an input surface of an electronic device, ink strokes; determining, using a processor of the electronic device, that the ink strokes include a selection indicator pair; associating, using a processor of the electronic device, the selection indicator pair with content; and selecting, using a processor of the electronic device, the content associated with the selection indicator pair. 2. The method of claim 1, wherein the associating comprises determining that the selection indicator pair bounds the content. 3. The method of claim 1, wherein the selection indicator pair comprises a character selected from the group consisting of a bracket, a parenthesis, a single pointing angle mark, a quotation mark, and a box drawing character. 4. The method of claim 1, wherein the selection indicator pair is composed of different characters. 5. The method of claim 4, wherein the different characters are mismatched. 6. The method of claim 2, wherein the selection indicator pair bounds multiple vertical lines of the content. 7. The method of claim 6, wherein the multiple vertical lines belong to a single paragraph. 8. The method of claim 6, wherein the multiple vertical lines traverse multiple pages. 9. The method of claim 1, further comprising providing an indication of selected content. 10. The method of claim 1, further comprising providing, using a display screen of the electronic device, a user interface for confirming a selection action. 11. An electronic device, comprising:
an input surface; a processor operatively coupled to the input surface; a memory device comprising instructions executable by the processor to: accept, via the input surface, ink strokes; determine that the ink strokes include a selection indicator pair; associate the selection indicator pair with content; and select the content associated with the selection indicator pair. 12. The electronic device of claim 11, wherein to associate comprises determining that the selection indicator pair bounds the content. 13. The electronic device of claim 11, wherein the selection indicator pair comprises a character selected from the group consisting of a bracket, a parenthesis, a single pointing angle mark, a quotation mark, and a box drawing character. 14. The electronic device of claim 11, wherein the selection indicator pair is composed of different characters. 15. The electronic device of claim 14, wherein the different characters are mismatched. 16. The electronic device of claim 12, wherein the selection indicator pair bounds multiple vertical lines of the content. 17. The electronic device of claim 16, wherein the multiple vertical lines belong to a single paragraph. 18. The electronic device of claim 16, wherein the multiple vertical lines traverse multiple pages. 19. The electronic device of claim 11, wherein the instructions are executable by the processor to provide an indication of selected content. 20. A product, comprising:
a storage device having code stored therewith, the code being executable by a processor and comprising: code that accepts, at an input surface of an electronic device, ink strokes; code that determines, using a processor of the electronic device, that the ink strokes include a selection indicator pair; code that associates, using a processor of the electronic device, the selection indicator pair with content; and code that selects, using a processor of the electronic device, the content associated with the selection indicator pair. | One embodiment provides a method, including: accepting, at an input surface of an electronic device, ink strokes; determining, using a processor of the electronic device, that the ink strokes include a selection indicator pair; associating, using a processor of the electronic device, the selection indicator pair with content; and selecting, using a processor of the electronic device, the content associated with the selection indicator pair. Other aspects are described and claimed.1. A method, comprising:
accepting, at an input surface of an electronic device, ink strokes; determining, using a processor of the electronic device, that the ink strokes include a selection indicator pair; associating, using a processor of the electronic device, the selection indicator pair with content; and selecting, using a processor of the electronic device, the content associated with the selection indicator pair. 2. The method of claim 1, wherein the associating comprises determining that the selection indicator pair bounds the content. 3. The method of claim 1, wherein the selection indicator pair comprises a character selected from the group consisting of a bracket, a parenthesis, a single pointing angle mark, a quotation mark, and a box drawing character. 4. The method of claim 1, wherein the selection indicator pair is composed of different characters. 5. The method of claim 4, wherein the different characters are mismatched. 6. The method of claim 2, wherein the selection indicator pair bounds multiple vertical lines of the content. 7. The method of claim 6, wherein the multiple vertical lines belong to a single paragraph. 8. The method of claim 6, wherein the multiple vertical lines traverse multiple pages. 9. The method of claim 1, further comprising providing an indication of selected content. 10. The method of claim 1, further comprising providing, using a display screen of the electronic device, a user interface for confirming a selection action. 11. An electronic device, comprising:
an input surface; a processor operatively coupled to the input surface; a memory device comprising instructions executable by the processor to: accept, via the input surface, ink strokes; determine that the ink strokes include a selection indicator pair; associate the selection indicator pair with content; and select the content associated with the selection indicator pair. 12. The electronic device of claim 11, wherein to associate comprises determining that the selection indicator pair bounds the content. 13. The electronic device of claim 11, wherein the selection indicator pair comprises a character selected from the group consisting of a bracket, a parenthesis, a single pointing angle mark, a quotation mark, and a box drawing character. 14. The electronic device of claim 11, wherein the selection indicator pair is composed of different characters. 15. The electronic device of claim 14, wherein the different characters are mismatched. 16. The electronic device of claim 12, wherein the selection indicator pair bounds multiple vertical lines of the content. 17. The electronic device of claim 16, wherein the multiple vertical lines belong to a single paragraph. 18. The electronic device of claim 16, wherein the multiple vertical lines traverse multiple pages. 19. The electronic device of claim 11, wherein the instructions are executable by the processor to provide an indication of selected content. 20. A product, comprising:
a storage device having code stored therewith, the code being executable by a processor and comprising: code that accepts, at an input surface of an electronic device, ink strokes; code that determines, using a processor of the electronic device, that the ink strokes include a selection indicator pair; code that associates, using a processor of the electronic device, the selection indicator pair with content; and code that selects, using a processor of the electronic device, the content associated with the selection indicator pair. | 2,100 |
6,157 | 6,157 | 14,669,827 | 2,164 | An approach is provided for processing drawing inputs on a mapping user interface to select one or more map elements. An interaction platform receives a drawing input via the mapping user interface. Next, the interaction platform processes the drawing input to determine one or more selection parameters of at least one spatial query. Thereafter, the interaction platform queries at least one spatial index based, at least in part, on the one or more selection parameters, the at least one spatial query, or a combination thereof to determine one or more map elements. Subsequently, the interaction platform causes, at least in part, a selection of the one or more map elements based, at least in part, on the drawing input. | 1. A method comprising:
receiving a drawing input via a mapping user interface; processing and/or facilitating a processing of the drawing input to determine one or more selection parameters of at least one spatial query; causing, at least in part, a querying of at least one spatial index based, at least in part, on the one or more selection parameters, the at least one spatial query, or a combination thereof to determine one or more map elements, wherein the at least one spatial index indexes one or more footprints of one or more geographic features; and causing, at least in part, a selection of the one or more map elements based, at least in part, on the drawing input. 2. A method of claim 1, wherein the one or more geographic features include, at least in part, one or more buildings, one or more map geographic areas, one or more streets, one or more waterways, one or more paths, or a combination thereof. 3. A method of claim 1, further comprising:
causing, at least in part, a specification one or more footprints using one or more polygons. 4. A method of claim 3, further comprising:
causing, at least in part, a subdivision of the one or more polygons, the one or more geographic features, or a combination thereof based, at least in part, on at least one threshold size value. 5. A method of claim 3, further comprising:
determining at least one geographic coordinate of the one or more geographic features based, at least in part, on at least one center point of the one or more polygons, wherein the at least one spatial index further includes, at least in part, the at least one geographic coordinate. 6. A method of claim 5, wherein the one or more selection parameters include, at least in part, one or more input geographic coordinates, the method further comprising:
determining the one or more map elements based, at least in part, on a comparison of the one or more input geographic coordinates against the at least one geographic coordinate of the one or more geographic features. 7. A method of claim 1, further comprising:
causing, at least in part, an association of one or more points of interest with the one or more footprints, the one or more geographic features, or a combination thereof, wherein the selection of the one or more map elements includes, at least in part, a selection of the one or more points of interest. 8. A method of claim 7, further comprising:
causing, at least in part, a filtering of the one or more map elements, the one or more points of interest, the one or more geographic features, or a combination thereof based, at least in part, on one or more type parameters. 9. A method of claim 1, wherein the at least one spatial index is based, at least in part, one or more tree data structures, and wherein the one or more tree data structures include, at least in part, a k-dimensional tree data structure, a quadtree data structure, an R*-tree data structure, a R-tree data structure, or a combination thereof. 10. A method of claim 1, further comprising:
causing, at least in part, a generation of one or more annotations of the one or more map elements that are selected, wherein the one or more annotations are persistent, collaborative, or a combination thereof. 11. An apparatus comprising:
at least one processor; and at least one memory including computer program code for one or more programs, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following;
receive a drawing input via a mapping user interface;
process and/or facilitate a processing of the drawing input to determine one or more selection parameters of at least one spatial query;
cause, at least in part, a querying of at least one spatial index based, at least in part, on the one or more selection parameters, the at least one spatial query, or a combination thereof to determine one or more map elements, wherein the at least one spatial index indexes one or more footprints of one or more geographic features; and
cause, at least in part, a selection of the one or more map elements based, at least in part, on the drawing input. 12. An apparatus of claim 11, wherein the one or more geographic features include, at least in part, one or more buildings, one or more map geographic areas, one or more streets, one or more waterways, one or more paths, or a combination thereof. 13. An apparatus of claim 11, wherein the apparatus is further caused to:
cause, at least in part, a specification one or more footprints using one or more polygons. 14. An apparatus of claim 13, wherein the apparatus is further caused to:
cause, at least in part, a subdivision of the one or more polygons, the one or more geographic features, or a combination thereof based, at least in part, on at least one threshold size value. 15. An apparatus of claim 13, wherein the apparatus is further caused to:
determine at least one geographic coordinate of the one or more geographic features based, at least in part, on at least one center point of the one or more polygons, wherein the at least one spatial index further includes, at least in part, the at least one geographic coordinate. 16. An apparatus of claim 15, wherein the one or more selection parameters include, at least in part, one or more input geographic coordinates, and wherein the apparatus is further caused to:
determine the one or more map elements based, at least in part, on a comparison of the one or more input geographic coordinates against the at least one geographic coordinate of the one or more geographic features. 17. An apparatus of claim 11, wherein the apparatus is further caused to:
cause, at least in part, an association of one or more points of interest with the one or more footprints, the one or more geographic features, or a combination thereof, wherein the selection of the one or more map elements includes, at least in part, a selection of the one or more points of interest. 18. A computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to perform:
receiving a drawing input via a mapping user interface; processing and/or facilitating a processing of the drawing input to determine one or more selection parameters of at least one spatial query; causing, at least in part, a querying of at least one spatial index based, at least in part, on the one or more selection parameters, the at least one spatial query, or a combination thereof to determine one or more map elements, wherein the at least one spatial index indexes one or more footprints of one or more geographic features; and causing, at least in part, a selection of the one or more map elements based, at least in part, on the drawing input. 19. A method of claim 18, wherein the one or more geographic features include, at least in part, one or more buildings, one or more map geographic areas, one or more streets, one or more waterways, one or more paths, or a combination thereof. 20. A method of claim 18, further comprising:
causing, at least in part, a specification one or more footprints using one or more polygons. 21.-48. (canceled) | An approach is provided for processing drawing inputs on a mapping user interface to select one or more map elements. An interaction platform receives a drawing input via the mapping user interface. Next, the interaction platform processes the drawing input to determine one or more selection parameters of at least one spatial query. Thereafter, the interaction platform queries at least one spatial index based, at least in part, on the one or more selection parameters, the at least one spatial query, or a combination thereof to determine one or more map elements. Subsequently, the interaction platform causes, at least in part, a selection of the one or more map elements based, at least in part, on the drawing input.1. A method comprising:
receiving a drawing input via a mapping user interface; processing and/or facilitating a processing of the drawing input to determine one or more selection parameters of at least one spatial query; causing, at least in part, a querying of at least one spatial index based, at least in part, on the one or more selection parameters, the at least one spatial query, or a combination thereof to determine one or more map elements, wherein the at least one spatial index indexes one or more footprints of one or more geographic features; and causing, at least in part, a selection of the one or more map elements based, at least in part, on the drawing input. 2. A method of claim 1, wherein the one or more geographic features include, at least in part, one or more buildings, one or more map geographic areas, one or more streets, one or more waterways, one or more paths, or a combination thereof. 3. A method of claim 1, further comprising:
causing, at least in part, a specification one or more footprints using one or more polygons. 4. A method of claim 3, further comprising:
causing, at least in part, a subdivision of the one or more polygons, the one or more geographic features, or a combination thereof based, at least in part, on at least one threshold size value. 5. A method of claim 3, further comprising:
determining at least one geographic coordinate of the one or more geographic features based, at least in part, on at least one center point of the one or more polygons, wherein the at least one spatial index further includes, at least in part, the at least one geographic coordinate. 6. A method of claim 5, wherein the one or more selection parameters include, at least in part, one or more input geographic coordinates, the method further comprising:
determining the one or more map elements based, at least in part, on a comparison of the one or more input geographic coordinates against the at least one geographic coordinate of the one or more geographic features. 7. A method of claim 1, further comprising:
causing, at least in part, an association of one or more points of interest with the one or more footprints, the one or more geographic features, or a combination thereof, wherein the selection of the one or more map elements includes, at least in part, a selection of the one or more points of interest. 8. A method of claim 7, further comprising:
causing, at least in part, a filtering of the one or more map elements, the one or more points of interest, the one or more geographic features, or a combination thereof based, at least in part, on one or more type parameters. 9. A method of claim 1, wherein the at least one spatial index is based, at least in part, one or more tree data structures, and wherein the one or more tree data structures include, at least in part, a k-dimensional tree data structure, a quadtree data structure, an R*-tree data structure, a R-tree data structure, or a combination thereof. 10. A method of claim 1, further comprising:
causing, at least in part, a generation of one or more annotations of the one or more map elements that are selected, wherein the one or more annotations are persistent, collaborative, or a combination thereof. 11. An apparatus comprising:
at least one processor; and at least one memory including computer program code for one or more programs, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following;
receive a drawing input via a mapping user interface;
process and/or facilitate a processing of the drawing input to determine one or more selection parameters of at least one spatial query;
cause, at least in part, a querying of at least one spatial index based, at least in part, on the one or more selection parameters, the at least one spatial query, or a combination thereof to determine one or more map elements, wherein the at least one spatial index indexes one or more footprints of one or more geographic features; and
cause, at least in part, a selection of the one or more map elements based, at least in part, on the drawing input. 12. An apparatus of claim 11, wherein the one or more geographic features include, at least in part, one or more buildings, one or more map geographic areas, one or more streets, one or more waterways, one or more paths, or a combination thereof. 13. An apparatus of claim 11, wherein the apparatus is further caused to:
cause, at least in part, a specification one or more footprints using one or more polygons. 14. An apparatus of claim 13, wherein the apparatus is further caused to:
cause, at least in part, a subdivision of the one or more polygons, the one or more geographic features, or a combination thereof based, at least in part, on at least one threshold size value. 15. An apparatus of claim 13, wherein the apparatus is further caused to:
determine at least one geographic coordinate of the one or more geographic features based, at least in part, on at least one center point of the one or more polygons, wherein the at least one spatial index further includes, at least in part, the at least one geographic coordinate. 16. An apparatus of claim 15, wherein the one or more selection parameters include, at least in part, one or more input geographic coordinates, and wherein the apparatus is further caused to:
determine the one or more map elements based, at least in part, on a comparison of the one or more input geographic coordinates against the at least one geographic coordinate of the one or more geographic features. 17. An apparatus of claim 11, wherein the apparatus is further caused to:
cause, at least in part, an association of one or more points of interest with the one or more footprints, the one or more geographic features, or a combination thereof, wherein the selection of the one or more map elements includes, at least in part, a selection of the one or more points of interest. 18. A computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to perform:
receiving a drawing input via a mapping user interface; processing and/or facilitating a processing of the drawing input to determine one or more selection parameters of at least one spatial query; causing, at least in part, a querying of at least one spatial index based, at least in part, on the one or more selection parameters, the at least one spatial query, or a combination thereof to determine one or more map elements, wherein the at least one spatial index indexes one or more footprints of one or more geographic features; and causing, at least in part, a selection of the one or more map elements based, at least in part, on the drawing input. 19. A method of claim 18, wherein the one or more geographic features include, at least in part, one or more buildings, one or more map geographic areas, one or more streets, one or more waterways, one or more paths, or a combination thereof. 20. A method of claim 18, further comprising:
causing, at least in part, a specification one or more footprints using one or more polygons. 21.-48. (canceled) | 2,100 |
6,158 | 6,158 | 14,297,267 | 2,154 | Mechanisms are provided for generating an answer to an input question. The mechanisms process a received input question to identify a temporal categorization of the input question indicating an intended time context for an answer to the input question. The input question does not specify a temporal categorization of the input question. The mechanisms perform analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information to determine, for each source of information, a degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information. An answer to the input question is generated and output based on the degrees of correspondence of the sources of information. | 1. A method, in a data processing system comprising a processor and a memory, for generating an answer to an input question, the method comprising:
processing, by the data processing system, a received input question to identify a temporal categorization of the input question indicating an intended time context for an answer to the input question, wherein the input question does not specify a temporal categorization of the input question; performing, by the data processing system, analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information to determine, for each source of information, a degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information; generating, by the data processing system, at least one answer to the input question based on the degrees of correspondence of the sources of information; and outputting, by the data processing system to a source of the input question, the at least one answer to the input question. 2. The method of claim 1, wherein processing the received input question to identify a temporal categorization of the input question comprises:
parsing the input question to extract one or more features of the input question; performing a temporal categorization operation on each of the extracted one or more features of the input question; and identifying a temporal categorization of the input question based on results of the temporal categorization operation of each of the extracted one or more features of the input question. 3. The method of claim 2, wherein performing the temporal categorization operation on each of the extracted one or more features of the input question comprises, for each extracted feature:
determining a frequency of occurrence of the extracted feature in association with one or more time spans or temporal characteristics referenced in a corpus of content to thereby generate one or more frequencies of occurrence for the extracted feature; and selecting a highest frequency of occurrence from the one or more frequencies of occurrence for generating a temporal categorization for the extracted feature. 4. The method of claim 3, wherein the corpus of content is a sub-portion of the corpus of information used to generate candidate answers. 5. The method of claim 2, wherein performing the temporal categorization operation on each of the extracted one or more features of the input question comprises performing a lookup operation of the extracted one or more features in a mapping data structure to identify a temporal categorization for each of the extracted one or more features, wherein the mapping data structure comprises entries where each entry maps an extracted feature to a temporal category. 6. The method of claim 5, wherein entries in the mapping data structure are generated by analyzing, for each previously processed feature in a plurality of previously processed features, crowdsource information and crowdsource indicators identifying a temporal category for the previously processed feature. 7. The method of claim 2, wherein the one or more extracted features comprise at least one of key terms, a focus of the input question, or a lexical answer type of the input question. 8. The method of claim 1, wherein performing analysis of the corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information comprises eliminating a source of information in the corpus of information from further consideration for generating at least one answer to the input question, in response to a temporal categorization of the source of information not matching the temporal categorization of the input question. 9. The method of claim 1, wherein performing analysis of the corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information comprises:
generating a plurality of candidate answers to the input question based on content of the sources of information; and calculating, for each candidate answer in the plurality of candidate answers, a score associated with the candidate answer based on a weight value applied to the calculation of the score for the candidate answer, wherein the weight value is determined based on the degree of correspondence between the temporal categorization of the input question and the temporal categorization of a source of information that is a source of the candidate answer. 10. The method of claim 1, wherein performing analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information to determine, for each source of information, a degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information further comprises modifying the input question based on the temporal categorization of the input question such that the input question specifies the temporal categorization of the input question. 11. The method of claim 1, wherein the method is implemented in response to a determination that an answer to the input question is dependent upon the temporal categorization of the input question. 12. The method of claim 1, further comprising:
processing the corpus of information to identify, for each source of information in the corpus of information, a corresponding temporal categorization for the source of information, wherein the corresponding temporal categorization for the source of information is determined from analysis of at least one of temporal terms and time spans specified in content of the source of information, publication information associated with the source of information, dates or times specified in metadata associated with the source of information, or posting information associated with the source of information. 13. The method of claim 12, wherein a temporal categorization for the source of information is determined from analysis of at least one of temporal terms and time spans specified in content of the source of information by performing a mapping of the temporal terms or time spans to a temporal category in a plurality of temporal categories for a domain with which the source of information is associated. 14. The method of claim 13, wherein the temporal categories are specific to the domain and wherein the domain is one of a plurality of domains in the corpus of information. 15. The method of claim 13, wherein the plurality of temporal categories for the domain are determined by performing pattern analysis of plots of frequencies of occurrence of references to key concepts in sources of information of the domain to identify patterns of time spans corresponding to temporal categories. 16. The method of claim 1, wherein the data processing system implements a question and answer system pipeline that receives an input question and generates a ranked listing of at least one answer to the input question. 17. The method of claim 16, wherein the ranked listing lists a plurality of answers to the input question ranked in order of confidence scores associated with the answers, and wherein the confidence scores are calculated at least partially based on the degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information providing a corresponding answer in the plurality of answers. 18. The method of claim 1, wherein the temporal categorization of the input question comprises a plurality of temporal categorizations of the input question, and wherein performing analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information and generating at least one answer to the input question based on the degrees of correspondence of the sources of information are performed with regard to each temporal categorization of the input question such that at least one answer to the input question is generated for each temporal categorization of the plurality of temporal categorizations of the input question. 19. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a data processing system, causes the data processing system to:
process a received input question to identify a temporal categorization of the input question indicating an intended time context for an answer to the input question, wherein the input question does not specify a temporal categorization of the input question; perform analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information to determine, for each source of information, a degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information; generate at least one answer to the input question based on the degrees of correspondence of the sources of information; and output, to a source of the input question, the at least one answer to the input question. 20. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: process a received input question to identify a temporal categorization of the input question indicating an intended time context for an answer to the input question, wherein the input question does not specify a temporal categorization of the input question; perform analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information to determine, for each source of information, a degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information; generate at least one answer to the input question based on the degrees of correspondence of the sources of information; and output, to a source of the input question, the at least one answer to the input question. | Mechanisms are provided for generating an answer to an input question. The mechanisms process a received input question to identify a temporal categorization of the input question indicating an intended time context for an answer to the input question. The input question does not specify a temporal categorization of the input question. The mechanisms perform analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information to determine, for each source of information, a degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information. An answer to the input question is generated and output based on the degrees of correspondence of the sources of information.1. A method, in a data processing system comprising a processor and a memory, for generating an answer to an input question, the method comprising:
processing, by the data processing system, a received input question to identify a temporal categorization of the input question indicating an intended time context for an answer to the input question, wherein the input question does not specify a temporal categorization of the input question; performing, by the data processing system, analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information to determine, for each source of information, a degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information; generating, by the data processing system, at least one answer to the input question based on the degrees of correspondence of the sources of information; and outputting, by the data processing system to a source of the input question, the at least one answer to the input question. 2. The method of claim 1, wherein processing the received input question to identify a temporal categorization of the input question comprises:
parsing the input question to extract one or more features of the input question; performing a temporal categorization operation on each of the extracted one or more features of the input question; and identifying a temporal categorization of the input question based on results of the temporal categorization operation of each of the extracted one or more features of the input question. 3. The method of claim 2, wherein performing the temporal categorization operation on each of the extracted one or more features of the input question comprises, for each extracted feature:
determining a frequency of occurrence of the extracted feature in association with one or more time spans or temporal characteristics referenced in a corpus of content to thereby generate one or more frequencies of occurrence for the extracted feature; and selecting a highest frequency of occurrence from the one or more frequencies of occurrence for generating a temporal categorization for the extracted feature. 4. The method of claim 3, wherein the corpus of content is a sub-portion of the corpus of information used to generate candidate answers. 5. The method of claim 2, wherein performing the temporal categorization operation on each of the extracted one or more features of the input question comprises performing a lookup operation of the extracted one or more features in a mapping data structure to identify a temporal categorization for each of the extracted one or more features, wherein the mapping data structure comprises entries where each entry maps an extracted feature to a temporal category. 6. The method of claim 5, wherein entries in the mapping data structure are generated by analyzing, for each previously processed feature in a plurality of previously processed features, crowdsource information and crowdsource indicators identifying a temporal category for the previously processed feature. 7. The method of claim 2, wherein the one or more extracted features comprise at least one of key terms, a focus of the input question, or a lexical answer type of the input question. 8. The method of claim 1, wherein performing analysis of the corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information comprises eliminating a source of information in the corpus of information from further consideration for generating at least one answer to the input question, in response to a temporal categorization of the source of information not matching the temporal categorization of the input question. 9. The method of claim 1, wherein performing analysis of the corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information comprises:
generating a plurality of candidate answers to the input question based on content of the sources of information; and calculating, for each candidate answer in the plurality of candidate answers, a score associated with the candidate answer based on a weight value applied to the calculation of the score for the candidate answer, wherein the weight value is determined based on the degree of correspondence between the temporal categorization of the input question and the temporal categorization of a source of information that is a source of the candidate answer. 10. The method of claim 1, wherein performing analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information to determine, for each source of information, a degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information further comprises modifying the input question based on the temporal categorization of the input question such that the input question specifies the temporal categorization of the input question. 11. The method of claim 1, wherein the method is implemented in response to a determination that an answer to the input question is dependent upon the temporal categorization of the input question. 12. The method of claim 1, further comprising:
processing the corpus of information to identify, for each source of information in the corpus of information, a corresponding temporal categorization for the source of information, wherein the corresponding temporal categorization for the source of information is determined from analysis of at least one of temporal terms and time spans specified in content of the source of information, publication information associated with the source of information, dates or times specified in metadata associated with the source of information, or posting information associated with the source of information. 13. The method of claim 12, wherein a temporal categorization for the source of information is determined from analysis of at least one of temporal terms and time spans specified in content of the source of information by performing a mapping of the temporal terms or time spans to a temporal category in a plurality of temporal categories for a domain with which the source of information is associated. 14. The method of claim 13, wherein the temporal categories are specific to the domain and wherein the domain is one of a plurality of domains in the corpus of information. 15. The method of claim 13, wherein the plurality of temporal categories for the domain are determined by performing pattern analysis of plots of frequencies of occurrence of references to key concepts in sources of information of the domain to identify patterns of time spans corresponding to temporal categories. 16. The method of claim 1, wherein the data processing system implements a question and answer system pipeline that receives an input question and generates a ranked listing of at least one answer to the input question. 17. The method of claim 16, wherein the ranked listing lists a plurality of answers to the input question ranked in order of confidence scores associated with the answers, and wherein the confidence scores are calculated at least partially based on the degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information providing a corresponding answer in the plurality of answers. 18. The method of claim 1, wherein the temporal categorization of the input question comprises a plurality of temporal categorizations of the input question, and wherein performing analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information and generating at least one answer to the input question based on the degrees of correspondence of the sources of information are performed with regard to each temporal categorization of the input question such that at least one answer to the input question is generated for each temporal categorization of the plurality of temporal categorizations of the input question. 19. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a data processing system, causes the data processing system to:
process a received input question to identify a temporal categorization of the input question indicating an intended time context for an answer to the input question, wherein the input question does not specify a temporal categorization of the input question; perform analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information to determine, for each source of information, a degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information; generate at least one answer to the input question based on the degrees of correspondence of the sources of information; and output, to a source of the input question, the at least one answer to the input question. 20. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: process a received input question to identify a temporal categorization of the input question indicating an intended time context for an answer to the input question, wherein the input question does not specify a temporal categorization of the input question; perform analysis of a corpus of information based on the temporal categorization of the input question and temporal categorizations of sources of information in the corpus of information to determine, for each source of information, a degree of correspondence of the temporal categorization of the input question to a temporal categorization of the source of information; generate at least one answer to the input question based on the degrees of correspondence of the sources of information; and output, to a source of the input question, the at least one answer to the input question. | 2,100 |
6,159 | 6,159 | 15,035,070 | 2,176 | A method by a user terminal are a related user terminal are disclosed for managing applications that are executable by the user terminal. Folder information is generated that defines folders of applications. Action rule information is generated which defines, for each of the folders, an action to be performed on the folder and a rule that initiates performance of the action. A first one of the rules is determined to be satisfied. A first one of the folders is selected which is associated with the satisfied first rule. Applications are identified which are missing from a memory of the user terminal that are members of the selected first folder. The identified applications are downloaded from an application storage node via a network to the memory of the user terminal. Related methods and network nodes are disclosed for managing which applications are downloaded to user terminals. | 1. A method by a user terminal for managing applications executable by the user terminal, the method comprising the steps of:
generating folder information that defines folders of the applications; generating action rule information that defines, for each of the folders of applications, an action to be performed on the folder of applications and a rule that initiates performance of the action; determining that a first one of the rules is satisfied; selecting a first one of the folders of the applications associated with the satisfied first one of the rules; identifying applications missing from a memory of the user terminal that are members of the selected first one of the folders of the applications; and downloading the identified applications from an application storage node via a network to the memory of the user terminal. 2. The method of claim 1, further comprising the step of:
communicating the folder information to a folder identification, ID, repository node via the network based on the generating; and wherein the step of identifying applications missing from the memory of the user terminal that are members of the selected first one of the folders of the applications, comprises:
retrieving from the folder ID repository node via the network, a first list of applications that are members of the selected first one of the folders of the applications; and
comparing the first list of applications to applications residing in the memory of the user terminal to identify applications missing from the memory of the user terminal that are members of the selected first one of the folders of the applications. 3. The method of claim 2, further comprising the steps of:
generating a message containing an address link used to retrieve of-at least a portion of the folder information from the folder ID repository node; and communicating the message to other user terminals and/or posting the message on a social media service network node for retrieval by other user terminals. 4. The method of claim 2, further comprising the steps of:
querying the folder ID repository node to obtain folder information that defines a second folder of the applications, that was provided to the folder ID repository node by another user terminal for sharing with other users of the folder ID repository node, and that satisfies a search criteria defined by the user terminal; identifying applications missing from the memory of the user terminal that are members of the second folder of the applications; and downloading, via the network to the memory of the user terminal, the applications identified as missing from the memory of the user terminal that are members of the second folder of the applications. 5. The method of claim 4, further comprising the step of:
adding to the action rule information, a second rule for the second folder of the applications that defines an event that will initiate deletion of the second folder of the applications from the memory of the user terminal; determining that the second rule is satisfied by occurrence of the event; and deleting the second folder of the applications from the memory of the user terminal. 6. The method of claim 4, wherein the step of querying the folder ID repository node to obtain folder information that defines the second folder of the applications, comprises:
receiving, from the folder ID repository node, shared folder information defining a plurality of folders of applications that were provided to the folder ID repository node by one or more other user terminals and which satisfy the search criteria; displaying, on a display device of the user terminal, the shared folder information; and receiving, via a user interface of the user terminal, a user selection of the second folder of the applications among other folders of the applications defined by the shared folder information. 7. The method of claim 2, further comprising the steps of:
determining that a third one of the rules is satisfied; selecting a third one of the folders of the applications associated with the satisfied third one of the rules; retrieving, from the folder ID repository node via the network, a third list of applications that are members of the selected third one of the folders of the applications; comparing the third list of applications to applications residing in the memory of the user terminal to identify further applications missing from the memory of the user terminal that are members of the selected third one of the folders of the applications; and downloading the identified further applications from the application storage node via the network to the memory of the user terminal. 8. The method of claim 1, further comprising the steps of:
determining that a fourth one of the rules is satisfied, wherein the fourth one of the rules defines an event that will initiate deletion of the first one of the folders of the applications from the memory of the user terminal; and deleting applications of the selected first one of the folders of the applications from the memory of the user terminal responsive to the satisfied fourth one of the rules. 9. The method of claim 1, wherein:
the first one of the rules defines a geographic area; and the step of determining that the first one of the rules is satisfied, comprises determining that the user terminal has moved to the geographic area. 10. The method of claim 8, wherein:
the fourth one of the rules defines an elapsed time; and the step of determining that the fourth one of the rules is satisfied, comprises determining that the elapsed time has elapsed since the first one of the folders of the applications was downloaded from the application storage node to the memory of the user terminal. 11. The method of claim 8, wherein:
the fourth one of the rules defines a geographic area; and the step of determining that the fourth one of the rules is satisfied, comprises determining that the user terminal has returned to the geographic area after being determined to have left the geographic area. 12. A user terminal comprising:
at least one processor; and at least one memory coupled to the at least one processor and comprising computer readable program code embodied in the at least one memory that when executed by the at least one processor causes the at least one processor to perform operations comprising:
generating folder information that defines folders of the applications;
generating action rule information that defines, for each of the folders of applications, an action to be performed on the folder of applications and a rule that initiates performance of the action;
determining that a first one of the rules is satisfied;
selecting a first one of the folders of the applications associated with the satisfied first one of the rules;
identifying applications missing from a memory of the user terminal that are members of the selected first one of the folders of the applications; and
downloading the identified applications from an application storage node via a network to the memory of the user terminal. 13. The user terminal of claim 12, wherein the operations further comprise:
communicating the folder information to a folder ID repository node via the network based on the generating; and wherein the operation of identifying applications missing from the memory of the user terminal that are members of the selected first one of the folders of the applications, comprises:
retrieving from the folder ID repository node via the network, a first list of applications that are members of the selected first one of the folders of the applications; and
comparing the first list of applications to applications residing in the memory of the user terminal to identify applications missing from the memory of the user terminal that are members of the selected first one of the folders of the applications. 14. The user terminal of claim 12, wherein the operations further comprise:
generating a message containing an address link used to retrieve of at least a portion of the folder information from the folder ID repository node; and communicating the message to other user terminals and/or posting the message on a social media service network node for retrieval by other user terminals. 15. The user terminal of claim 12, wherein the operations further comprise:
querying the folder ID repository node to obtain folder information that defines a second folder of the applications, that was provided to the folder ID repository node by another user terminal for sharing with other users of the folder ID repository node, and that satisfies a search criteria defined by the user terminal; identifying applications missing from the memory of the user terminal that are members of the second folder of the applications; and downloading, via the network to the memory of the user terminal, the applications identified as missing from the memory of the user terminal that are members of the second folder of the applications. 16. The user terminal of claim 15, wherein the operations further comprise:
adding to the action rule information, a second rule for the second folder of the applications that defines an event that will initiate deletion of the second folder of the applications from the memory of the user terminal; determining that the second rule is satisfied by occurrence of the event; and deleting the second folder of the applications from the memory of the user terminal. 17. The user terminal of claim 15, wherein the operation of querying the folder ID repository node to obtain folder information that defines the second folder of the applications, comprises:
receiving, from the folder ID repository node, shared folder information defining a plurality of folders of applications that were provided to the folder ID repository node by one or more other user terminals and which satisfy the search criteria; displaying, on a display device of the user terminal, the shared folder information; and receiving, via a user interface of the user terminal, a user selection of the second folder of the applications among other folders of the applications defined by the shared folder information. 18. A method by at least one network node, which includes a folder ID repository node of a distributed computing system, for managing which applications are downloaded to user terminals, the method comprising the steps of:
receiving folder information via the network from a plurality of user terminals, wherein the folder information defines folders of applications that the user terminals can select among for downloading; receiving a query from one of the user terminals that identifies a search criteria for searching among the folders of applications defined by the folder information; identifying one of the folders of applications that satisfies the search criteria; and communicating a list of the applications within the identified one of the folders of applications, to the one of the user terminals. 19. The method of claim 18, wherein the step of identifying one of the folders of applications that satisfies the search criteria, comprises:
generating shared folder information defining a plurality of the folders of applications that satisfies the search criteria; communicating the shared folder information to the one of the user terminals for display on a display device; receiving from the one of the user terminals, information indicating a user selection of the one of the folders of applications; and identifying the one of the folders of applications that satisfies the search criteria responsive to the information indicating the user selection. 20. The method of claim 18, wherein the at least one node further comprises an application storage node that stores applications, and further comprising the steps of:
receiving a download command from the one of the user terminals requesting downloading of the identified one of the folders of applications; and downloading each of the applications within the identified one of the folders of applications from the application storage node to the one of the user terminals. | A method by a user terminal are a related user terminal are disclosed for managing applications that are executable by the user terminal. Folder information is generated that defines folders of applications. Action rule information is generated which defines, for each of the folders, an action to be performed on the folder and a rule that initiates performance of the action. A first one of the rules is determined to be satisfied. A first one of the folders is selected which is associated with the satisfied first rule. Applications are identified which are missing from a memory of the user terminal that are members of the selected first folder. The identified applications are downloaded from an application storage node via a network to the memory of the user terminal. Related methods and network nodes are disclosed for managing which applications are downloaded to user terminals.1. A method by a user terminal for managing applications executable by the user terminal, the method comprising the steps of:
generating folder information that defines folders of the applications; generating action rule information that defines, for each of the folders of applications, an action to be performed on the folder of applications and a rule that initiates performance of the action; determining that a first one of the rules is satisfied; selecting a first one of the folders of the applications associated with the satisfied first one of the rules; identifying applications missing from a memory of the user terminal that are members of the selected first one of the folders of the applications; and downloading the identified applications from an application storage node via a network to the memory of the user terminal. 2. The method of claim 1, further comprising the step of:
communicating the folder information to a folder identification, ID, repository node via the network based on the generating; and wherein the step of identifying applications missing from the memory of the user terminal that are members of the selected first one of the folders of the applications, comprises:
retrieving from the folder ID repository node via the network, a first list of applications that are members of the selected first one of the folders of the applications; and
comparing the first list of applications to applications residing in the memory of the user terminal to identify applications missing from the memory of the user terminal that are members of the selected first one of the folders of the applications. 3. The method of claim 2, further comprising the steps of:
generating a message containing an address link used to retrieve of-at least a portion of the folder information from the folder ID repository node; and communicating the message to other user terminals and/or posting the message on a social media service network node for retrieval by other user terminals. 4. The method of claim 2, further comprising the steps of:
querying the folder ID repository node to obtain folder information that defines a second folder of the applications, that was provided to the folder ID repository node by another user terminal for sharing with other users of the folder ID repository node, and that satisfies a search criteria defined by the user terminal; identifying applications missing from the memory of the user terminal that are members of the second folder of the applications; and downloading, via the network to the memory of the user terminal, the applications identified as missing from the memory of the user terminal that are members of the second folder of the applications. 5. The method of claim 4, further comprising the step of:
adding to the action rule information, a second rule for the second folder of the applications that defines an event that will initiate deletion of the second folder of the applications from the memory of the user terminal; determining that the second rule is satisfied by occurrence of the event; and deleting the second folder of the applications from the memory of the user terminal. 6. The method of claim 4, wherein the step of querying the folder ID repository node to obtain folder information that defines the second folder of the applications, comprises:
receiving, from the folder ID repository node, shared folder information defining a plurality of folders of applications that were provided to the folder ID repository node by one or more other user terminals and which satisfy the search criteria; displaying, on a display device of the user terminal, the shared folder information; and receiving, via a user interface of the user terminal, a user selection of the second folder of the applications among other folders of the applications defined by the shared folder information. 7. The method of claim 2, further comprising the steps of:
determining that a third one of the rules is satisfied; selecting a third one of the folders of the applications associated with the satisfied third one of the rules; retrieving, from the folder ID repository node via the network, a third list of applications that are members of the selected third one of the folders of the applications; comparing the third list of applications to applications residing in the memory of the user terminal to identify further applications missing from the memory of the user terminal that are members of the selected third one of the folders of the applications; and downloading the identified further applications from the application storage node via the network to the memory of the user terminal. 8. The method of claim 1, further comprising the steps of:
determining that a fourth one of the rules is satisfied, wherein the fourth one of the rules defines an event that will initiate deletion of the first one of the folders of the applications from the memory of the user terminal; and deleting applications of the selected first one of the folders of the applications from the memory of the user terminal responsive to the satisfied fourth one of the rules. 9. The method of claim 1, wherein:
the first one of the rules defines a geographic area; and the step of determining that the first one of the rules is satisfied, comprises determining that the user terminal has moved to the geographic area. 10. The method of claim 8, wherein:
the fourth one of the rules defines an elapsed time; and the step of determining that the fourth one of the rules is satisfied, comprises determining that the elapsed time has elapsed since the first one of the folders of the applications was downloaded from the application storage node to the memory of the user terminal. 11. The method of claim 8, wherein:
the fourth one of the rules defines a geographic area; and the step of determining that the fourth one of the rules is satisfied, comprises determining that the user terminal has returned to the geographic area after being determined to have left the geographic area. 12. A user terminal comprising:
at least one processor; and at least one memory coupled to the at least one processor and comprising computer readable program code embodied in the at least one memory that when executed by the at least one processor causes the at least one processor to perform operations comprising:
generating folder information that defines folders of the applications;
generating action rule information that defines, for each of the folders of applications, an action to be performed on the folder of applications and a rule that initiates performance of the action;
determining that a first one of the rules is satisfied;
selecting a first one of the folders of the applications associated with the satisfied first one of the rules;
identifying applications missing from a memory of the user terminal that are members of the selected first one of the folders of the applications; and
downloading the identified applications from an application storage node via a network to the memory of the user terminal. 13. The user terminal of claim 12, wherein the operations further comprise:
communicating the folder information to a folder ID repository node via the network based on the generating; and wherein the operation of identifying applications missing from the memory of the user terminal that are members of the selected first one of the folders of the applications, comprises:
retrieving from the folder ID repository node via the network, a first list of applications that are members of the selected first one of the folders of the applications; and
comparing the first list of applications to applications residing in the memory of the user terminal to identify applications missing from the memory of the user terminal that are members of the selected first one of the folders of the applications. 14. The user terminal of claim 12, wherein the operations further comprise:
generating a message containing an address link used to retrieve of at least a portion of the folder information from the folder ID repository node; and communicating the message to other user terminals and/or posting the message on a social media service network node for retrieval by other user terminals. 15. The user terminal of claim 12, wherein the operations further comprise:
querying the folder ID repository node to obtain folder information that defines a second folder of the applications, that was provided to the folder ID repository node by another user terminal for sharing with other users of the folder ID repository node, and that satisfies a search criteria defined by the user terminal; identifying applications missing from the memory of the user terminal that are members of the second folder of the applications; and downloading, via the network to the memory of the user terminal, the applications identified as missing from the memory of the user terminal that are members of the second folder of the applications. 16. The user terminal of claim 15, wherein the operations further comprise:
adding to the action rule information, a second rule for the second folder of the applications that defines an event that will initiate deletion of the second folder of the applications from the memory of the user terminal; determining that the second rule is satisfied by occurrence of the event; and deleting the second folder of the applications from the memory of the user terminal. 17. The user terminal of claim 15, wherein the operation of querying the folder ID repository node to obtain folder information that defines the second folder of the applications, comprises:
receiving, from the folder ID repository node, shared folder information defining a plurality of folders of applications that were provided to the folder ID repository node by one or more other user terminals and which satisfy the search criteria; displaying, on a display device of the user terminal, the shared folder information; and receiving, via a user interface of the user terminal, a user selection of the second folder of the applications among other folders of the applications defined by the shared folder information. 18. A method by at least one network node, which includes a folder ID repository node of a distributed computing system, for managing which applications are downloaded to user terminals, the method comprising the steps of:
receiving folder information via the network from a plurality of user terminals, wherein the folder information defines folders of applications that the user terminals can select among for downloading; receiving a query from one of the user terminals that identifies a search criteria for searching among the folders of applications defined by the folder information; identifying one of the folders of applications that satisfies the search criteria; and communicating a list of the applications within the identified one of the folders of applications, to the one of the user terminals. 19. The method of claim 18, wherein the step of identifying one of the folders of applications that satisfies the search criteria, comprises:
generating shared folder information defining a plurality of the folders of applications that satisfies the search criteria; communicating the shared folder information to the one of the user terminals for display on a display device; receiving from the one of the user terminals, information indicating a user selection of the one of the folders of applications; and identifying the one of the folders of applications that satisfies the search criteria responsive to the information indicating the user selection. 20. The method of claim 18, wherein the at least one node further comprises an application storage node that stores applications, and further comprising the steps of:
receiving a download command from the one of the user terminals requesting downloading of the identified one of the folders of applications; and downloading each of the applications within the identified one of the folders of applications from the application storage node to the one of the user terminals. | 2,100 |
6,160 | 6,160 | 14,928,470 | 2,116 | A system for facilitating power tool operation and positioning includes a power tool, remote detectable device attached to the power tool, a computing device communicating with the power tool to detect the location of the power tool relative to the computing device by detecting the location remote detectable device, and a display for displaying or inputting information into the computing device. The computing device is able to receive and store CAD dimensional data representing a layout of a work area and specific locations in that area where work need to be done. The computing device directs a positioning of the tool at a work site by comparing the position of the tool with the CAD layout position of a location where work needs to be done. | 1. A system for facilitating a tool operation, comprising:
a tool; a remotely locatable device positioned on the tool; a computing device capable of determining a point location of the remotely locatable device relative to the computing device, the computer device also capable of receive and storing data representing at least one work point location where the tool is to perform a construction operation; a support mechanism for supporting and automatically positioning the tool, the support device including a signal receiver for receiving a signal from the computer device; wherein the support device receives a signal from the computing device to instruct the support mechanism to move the tool or the remotely locatable device toward the at least one work point location. 2. The system of claim 1, wherein the system includes a speaker or a display and generates a visual or audible signal that indicates to a user that the remotely locatable device is close to the at least one work point location. 3. The system of claim 1, wherein the system includes a speaker or display and generates a visual or audible signal to instruct a user holding the support mechanism which way to move the tool to position the tool closer to the at least one work point location. 4. The system of claim 3, wherein the visual or audible signal is one of a visual arrow on the display and an audible voice instructing a user to move the tool right, left, backward, or forward. 5. The system of claim 4, wherein the display is one or more displays positioned on one of the user, the support mechanism, the computer device, or the tool. 6. The system of claim 5, wherein the one or more displays also includes a remote hand held display wirelessly communicating with the computer device. 7. The system of claim 6, wherein the operator may use the remote display to chose the at least one location and be directed to the at least one location by the computer device. 8. The system of claim 1, wherein the support mechanism includes a motor. 9. The system of claim 1, wherein the tool includes a motor. 10. A system for facilitating a tool operation, comprising:
a tool; a remotely locatable device positioned on the tool; a computing device capable of determining a point location of the remotely locatable device relative to the computing device, the computer device also capable of receive and storing data representing at least one work point location where the tool is to perform a construction operation; a support mechanism for supporting and automatically positioning the tool, the support device includes a receiver for receiving a signal from the computer device; wherein the receiver receives a signal from the computing device; and wherein the system indicates to a user a necessary direction in which to move the support mechanism so that the support mechanism will be closer to or at the work point location. 11. The system of claim 10, wherein the system includes a speaker or a display and generates a visual or audible signal that indicates to a user that the remotely locatable device is close to the at least one work point location. 12. The system of claim 10, wherein the system includes a speaker or display and generates a visual or audible signal to instruct a user holding the support mechanism which way to move the tool to position the tool closer to the at least one work point location. 13. The system of claim 12, wherein the visual or audible signal is one of a visual arrow on the display and an audible voice instructing a user to move the tool right, left, backward, or forward. 14. The system of claim 13, wherein the display is one or more displays positioned on one of the user, the support mechanism, the computer device, or the tool. 15. The system of claim 14, wherein the one or more displays also includes a remote hand held display wirelessly communicating with the computer device. 16. The system of claim 15, wherein the operator may use the remote display to chose the at least one location and be directed to the at least one location by the computer device. 17. The system of claim 10, wherein the support mechanism includes a motor. 18. The system of claim 10, wherein the tool includes a motor. | A system for facilitating power tool operation and positioning includes a power tool, remote detectable device attached to the power tool, a computing device communicating with the power tool to detect the location of the power tool relative to the computing device by detecting the location remote detectable device, and a display for displaying or inputting information into the computing device. The computing device is able to receive and store CAD dimensional data representing a layout of a work area and specific locations in that area where work need to be done. The computing device directs a positioning of the tool at a work site by comparing the position of the tool with the CAD layout position of a location where work needs to be done.1. A system for facilitating a tool operation, comprising:
a tool; a remotely locatable device positioned on the tool; a computing device capable of determining a point location of the remotely locatable device relative to the computing device, the computer device also capable of receive and storing data representing at least one work point location where the tool is to perform a construction operation; a support mechanism for supporting and automatically positioning the tool, the support device including a signal receiver for receiving a signal from the computer device; wherein the support device receives a signal from the computing device to instruct the support mechanism to move the tool or the remotely locatable device toward the at least one work point location. 2. The system of claim 1, wherein the system includes a speaker or a display and generates a visual or audible signal that indicates to a user that the remotely locatable device is close to the at least one work point location. 3. The system of claim 1, wherein the system includes a speaker or display and generates a visual or audible signal to instruct a user holding the support mechanism which way to move the tool to position the tool closer to the at least one work point location. 4. The system of claim 3, wherein the visual or audible signal is one of a visual arrow on the display and an audible voice instructing a user to move the tool right, left, backward, or forward. 5. The system of claim 4, wherein the display is one or more displays positioned on one of the user, the support mechanism, the computer device, or the tool. 6. The system of claim 5, wherein the one or more displays also includes a remote hand held display wirelessly communicating with the computer device. 7. The system of claim 6, wherein the operator may use the remote display to chose the at least one location and be directed to the at least one location by the computer device. 8. The system of claim 1, wherein the support mechanism includes a motor. 9. The system of claim 1, wherein the tool includes a motor. 10. A system for facilitating a tool operation, comprising:
a tool; a remotely locatable device positioned on the tool; a computing device capable of determining a point location of the remotely locatable device relative to the computing device, the computer device also capable of receive and storing data representing at least one work point location where the tool is to perform a construction operation; a support mechanism for supporting and automatically positioning the tool, the support device includes a receiver for receiving a signal from the computer device; wherein the receiver receives a signal from the computing device; and wherein the system indicates to a user a necessary direction in which to move the support mechanism so that the support mechanism will be closer to or at the work point location. 11. The system of claim 10, wherein the system includes a speaker or a display and generates a visual or audible signal that indicates to a user that the remotely locatable device is close to the at least one work point location. 12. The system of claim 10, wherein the system includes a speaker or display and generates a visual or audible signal to instruct a user holding the support mechanism which way to move the tool to position the tool closer to the at least one work point location. 13. The system of claim 12, wherein the visual or audible signal is one of a visual arrow on the display and an audible voice instructing a user to move the tool right, left, backward, or forward. 14. The system of claim 13, wherein the display is one or more displays positioned on one of the user, the support mechanism, the computer device, or the tool. 15. The system of claim 14, wherein the one or more displays also includes a remote hand held display wirelessly communicating with the computer device. 16. The system of claim 15, wherein the operator may use the remote display to chose the at least one location and be directed to the at least one location by the computer device. 17. The system of claim 10, wherein the support mechanism includes a motor. 18. The system of claim 10, wherein the tool includes a motor. | 2,100 |
6,161 | 6,161 | 15,501,278 | 2,132 | An apparatus for processing data and a method of data processing are provided. A processor core in the apparatus performs data processing operations in response to a sequence of instructions, including write operations which write data items to a non-volatile memory. A write-back cache stores local copies of the data items retrieved from the memory and written to the memory by the processor core. A storage unit is provided which stores indications of the write operations initiated by the processor core and the processor core is configured to respond to an end instruction by causing the local copies of data items which are the subject of the write operations by the processor core, and for which an indication is stored in the storage unit, to be cleaned from the write-back cache to the memory. The indications of the write operations stored in the storage unit are then cleared. | 1. Apparatus for processing data comprising:
a processor core capable of performing data processing operations in response to a sequence of instructions, wherein the data processing operations comprise read operations which retrieve data items from a memory and write operations which write data items to the memory, wherein the memory is a non-volatile memory; a write-back cache capable of storing local copies of the data items retrieved from the memory and written to the memory by the processor core when executing the sequence of instructions; and a storage unit capable of storing indications of the write operations initiated by the processor core, and the processor core is capable of responding to an end instruction in the sequence of instructions by: causing the local copies of data items which are the subject of the write operations by the processor core and for which an indication is stored in the storage unit to be cleaned from the write-back cache to the memory; and clearing the indications of the write operations stored in the storage unit. 2. The apparatus as claimed in claim 1, wherein the non-volatile memory is byte-addressable. 3. The apparatus as claimed in claim 1, wherein the processor core is further capable of causing the indications of the write operations initiated by the processor core to be stored in the storage unit after a begin instruction in the sequence of instructions. 4. The apparatus as claimed in claim 3, wherein the processor core is capable of only performing a write operation to a predetermined portion of the memory if a pending write instruction specifying the predetermined portion of the memory is preceded by the begin instruction and followed by the end instruction. 5. The apparatus as claimed in claim 3, wherein the processor core is capable of preventing a write operation to a predetermined portion of the memory from being performed if a pending write instruction specifying the predetermined portion of the memory is not preceded by the begin instruction and followed by the end instruction. 6. The apparatus as claimed in claim 3, wherein the processor core is capable of responding to the end instruction and a subsequent begin instruction in the sequence of instructions by causing the subsequent begin instruction in the sequence of instructions to stall until the end instruction has completed. 7. The apparatus as claimed in claim 3, wherein the processor core is capable of responding to the end instruction and a subsequent memory operation instruction in the sequence of instructions by causing the subsequent memory operation instruction in the sequence of instructions to stall until the end instruction has completed. 8. The apparatus as claimed in claim 1, wherein the processor core is capable of responding to the end instruction and a subsequent instruction in the sequence of instructions by causing the subsequent instruction in the sequence of instructions to stall until the end instruction has completed. 9. The apparatus as claimed in claim 1, wherein the storage unit is a first-in-first-out storage unit. 10. The apparatus as claimed in claim 9, wherein the processor core comprises the first-in-first-out storage unit. 11. The apparatus as claimed in claim 1, wherein the storage unit is provided by the write-back cache and the indications of the write operations initiated by the processor core are stored as markers associated with cache lines stored in the write-back cache, wherein setting of a marker of the markers indicates if a local copy of a data item forming at least part of a cache line of the cache lines is the subject of the write operations by the processor core. 12. The apparatus as claimed in claim 1, wherein the storage unit is capable of storing at least partial memory addresses of the write operations initiated by the processor core as the indications. 13. The apparatus as claimed in claim 1, wherein the indications stored in the storage unit indicate at least one cache block where data items corresponding to the write operations are stored in the write-back cache. 14. The apparatus as claimed in claim 1, wherein the processor core is further capable of referencing a page table to determine virtual-to-physical memory address mappings, each entry in the page table comprises a flag to indicate if that entry corresponds to a predetermined memory address space, and the processor core is capable of causing indications of write operations to the predetermined memory address space initiated by the processor core to be stored in the storage unit. 15. The apparatus as claimed in claim 3, wherein the processor core is capable of responding to an encoding within the begin instruction to stall any instructions which follow the end instruction until a controller in the memory acknowledges receipt of a command to commit the local copies of data items cleaned from the write-back cache to the memory. 16. The apparatus as claimed in claim 3, wherein the processor core is capable of responding to an encoding within the begin instruction to stall any instructions which follow the end instruction until a controller in the memory indicates that the local copies of data items cleaned from the write-back cache to the memory have been committed to the memory. 17. The apparatus as claimed in claim 1, further capable of, in response to a clean condition to cause at least one local copy of the local copies stored in the write-back cache which is the subject of at least one write operation by the processor core and for which an indication is stored in the storage unit to be cleaned from the write-back cache to the memory and to clear at least one corresponding indication of the at least one write operation stored in the storage unit. 18. The apparatus as claimed in claim 17, wherein the clean condition is satisfied when the storage unit is full. 19. The apparatus as claimed in claim 17, wherein the clean condition is satisfied when a local copy stored in the write-back cache is evicted to the memory. 20. The apparatus as claimed in claim 17, wherein the clean condition is satisfied when a local copy stored in the write-back cache is snooped by a cache coherence mechanism and for which an indication is stored in the storage unit. 21. The apparatus as claimed in claim 20, wherein the write-back cache is capable of storing clean-on-snoop markers associated with cache lines stored in the write-back cache, wherein setting of a clean-on-snoop marker indicates that a corresponding indication is stored in the storage unit. 22. The apparatus as claimed in claim 1, wherein the storage unit is a content-addressable storage unit. 23. A method of processing data comprising the steps of:
performing data processing operations in response to a sequence of instructions, wherein the data processing operations comprise read operations which retrieve data items from a memory and write operations which write data items to the memory, wherein the memory is a non-volatile memory; storing local copies in a write-back cache of the data items retrieved from the memory and written to the memory when executing the sequence of instructions; storing indications of the write operations initiated in the performing data processing operation step; and responding to an end instruction in the sequence of instructions by: causing the local copies of data items which are the subject of the write operations and for which an indication has been stored in the storing local copies step to be cleaned from the write-back cache to the memory; and clearing the indications of the write operations stored in the storing indications step. 24. Apparatus for processing data comprising:
means for performing data processing operations in response to a sequence of instructions, wherein the data processing operations comprise read operations which retrieve data items from a memory and write operations which write data items to the memory, wherein the memory is a non-volatile memory; means for storing local copies of the data items retrieved from the memory and written to the memory when executing the sequence of instructions, wherein the means for storing has a write-back configuration with respect to the memory; means for storing indications of the write operations initiated by the means for performing data processing operations; and means for responding to an end instruction in the sequence of instructions which: causes the local copies of data items which are the subject of the write operations and for which an indication has been stored by the means for storing local copies to be cleaned from the write-back cache to the memory; and clears the indications of the write operations stored in the means for storing indications. | An apparatus for processing data and a method of data processing are provided. A processor core in the apparatus performs data processing operations in response to a sequence of instructions, including write operations which write data items to a non-volatile memory. A write-back cache stores local copies of the data items retrieved from the memory and written to the memory by the processor core. A storage unit is provided which stores indications of the write operations initiated by the processor core and the processor core is configured to respond to an end instruction by causing the local copies of data items which are the subject of the write operations by the processor core, and for which an indication is stored in the storage unit, to be cleaned from the write-back cache to the memory. The indications of the write operations stored in the storage unit are then cleared.1. Apparatus for processing data comprising:
a processor core capable of performing data processing operations in response to a sequence of instructions, wherein the data processing operations comprise read operations which retrieve data items from a memory and write operations which write data items to the memory, wherein the memory is a non-volatile memory; a write-back cache capable of storing local copies of the data items retrieved from the memory and written to the memory by the processor core when executing the sequence of instructions; and a storage unit capable of storing indications of the write operations initiated by the processor core, and the processor core is capable of responding to an end instruction in the sequence of instructions by: causing the local copies of data items which are the subject of the write operations by the processor core and for which an indication is stored in the storage unit to be cleaned from the write-back cache to the memory; and clearing the indications of the write operations stored in the storage unit. 2. The apparatus as claimed in claim 1, wherein the non-volatile memory is byte-addressable. 3. The apparatus as claimed in claim 1, wherein the processor core is further capable of causing the indications of the write operations initiated by the processor core to be stored in the storage unit after a begin instruction in the sequence of instructions. 4. The apparatus as claimed in claim 3, wherein the processor core is capable of only performing a write operation to a predetermined portion of the memory if a pending write instruction specifying the predetermined portion of the memory is preceded by the begin instruction and followed by the end instruction. 5. The apparatus as claimed in claim 3, wherein the processor core is capable of preventing a write operation to a predetermined portion of the memory from being performed if a pending write instruction specifying the predetermined portion of the memory is not preceded by the begin instruction and followed by the end instruction. 6. The apparatus as claimed in claim 3, wherein the processor core is capable of responding to the end instruction and a subsequent begin instruction in the sequence of instructions by causing the subsequent begin instruction in the sequence of instructions to stall until the end instruction has completed. 7. The apparatus as claimed in claim 3, wherein the processor core is capable of responding to the end instruction and a subsequent memory operation instruction in the sequence of instructions by causing the subsequent memory operation instruction in the sequence of instructions to stall until the end instruction has completed. 8. The apparatus as claimed in claim 1, wherein the processor core is capable of responding to the end instruction and a subsequent instruction in the sequence of instructions by causing the subsequent instruction in the sequence of instructions to stall until the end instruction has completed. 9. The apparatus as claimed in claim 1, wherein the storage unit is a first-in-first-out storage unit. 10. The apparatus as claimed in claim 9, wherein the processor core comprises the first-in-first-out storage unit. 11. The apparatus as claimed in claim 1, wherein the storage unit is provided by the write-back cache and the indications of the write operations initiated by the processor core are stored as markers associated with cache lines stored in the write-back cache, wherein setting of a marker of the markers indicates if a local copy of a data item forming at least part of a cache line of the cache lines is the subject of the write operations by the processor core. 12. The apparatus as claimed in claim 1, wherein the storage unit is capable of storing at least partial memory addresses of the write operations initiated by the processor core as the indications. 13. The apparatus as claimed in claim 1, wherein the indications stored in the storage unit indicate at least one cache block where data items corresponding to the write operations are stored in the write-back cache. 14. The apparatus as claimed in claim 1, wherein the processor core is further capable of referencing a page table to determine virtual-to-physical memory address mappings, each entry in the page table comprises a flag to indicate if that entry corresponds to a predetermined memory address space, and the processor core is capable of causing indications of write operations to the predetermined memory address space initiated by the processor core to be stored in the storage unit. 15. The apparatus as claimed in claim 3, wherein the processor core is capable of responding to an encoding within the begin instruction to stall any instructions which follow the end instruction until a controller in the memory acknowledges receipt of a command to commit the local copies of data items cleaned from the write-back cache to the memory. 16. The apparatus as claimed in claim 3, wherein the processor core is capable of responding to an encoding within the begin instruction to stall any instructions which follow the end instruction until a controller in the memory indicates that the local copies of data items cleaned from the write-back cache to the memory have been committed to the memory. 17. The apparatus as claimed in claim 1, further capable of, in response to a clean condition to cause at least one local copy of the local copies stored in the write-back cache which is the subject of at least one write operation by the processor core and for which an indication is stored in the storage unit to be cleaned from the write-back cache to the memory and to clear at least one corresponding indication of the at least one write operation stored in the storage unit. 18. The apparatus as claimed in claim 17, wherein the clean condition is satisfied when the storage unit is full. 19. The apparatus as claimed in claim 17, wherein the clean condition is satisfied when a local copy stored in the write-back cache is evicted to the memory. 20. The apparatus as claimed in claim 17, wherein the clean condition is satisfied when a local copy stored in the write-back cache is snooped by a cache coherence mechanism and for which an indication is stored in the storage unit. 21. The apparatus as claimed in claim 20, wherein the write-back cache is capable of storing clean-on-snoop markers associated with cache lines stored in the write-back cache, wherein setting of a clean-on-snoop marker indicates that a corresponding indication is stored in the storage unit. 22. The apparatus as claimed in claim 1, wherein the storage unit is a content-addressable storage unit. 23. A method of processing data comprising the steps of:
performing data processing operations in response to a sequence of instructions, wherein the data processing operations comprise read operations which retrieve data items from a memory and write operations which write data items to the memory, wherein the memory is a non-volatile memory; storing local copies in a write-back cache of the data items retrieved from the memory and written to the memory when executing the sequence of instructions; storing indications of the write operations initiated in the performing data processing operation step; and responding to an end instruction in the sequence of instructions by: causing the local copies of data items which are the subject of the write operations and for which an indication has been stored in the storing local copies step to be cleaned from the write-back cache to the memory; and clearing the indications of the write operations stored in the storing indications step. 24. Apparatus for processing data comprising:
means for performing data processing operations in response to a sequence of instructions, wherein the data processing operations comprise read operations which retrieve data items from a memory and write operations which write data items to the memory, wherein the memory is a non-volatile memory; means for storing local copies of the data items retrieved from the memory and written to the memory when executing the sequence of instructions, wherein the means for storing has a write-back configuration with respect to the memory; means for storing indications of the write operations initiated by the means for performing data processing operations; and means for responding to an end instruction in the sequence of instructions which: causes the local copies of data items which are the subject of the write operations and for which an indication has been stored by the means for storing local copies to be cleaned from the write-back cache to the memory; and clears the indications of the write operations stored in the means for storing indications. | 2,100 |
6,162 | 6,162 | 14,622,140 | 2,144 | Various technologies described herein pertain to controlling programming for manipulating an input document based on example(s) and/or natural language input(s). A data manipulation system includes an interface component configured to receive an input document, which is semi-structured or unstructured. The data manipulation system further includes an extraction component configured to synthesize, based on a first input, a first program for parsing data of the input document. The extraction component is configured to execute the first program on the input document to form structured data. The data manipulation system also includes an operation component configured to synthesize, based on a second input, a second program for performing an operation on the structured data. The operation component is configured to execute the second program on the structured data to generate a result of the operation, which is output by the data manipulation system. | 1. A computing system, comprising:
at least one processor; and memory comprising a data manipulation system, the data manipulation system being executable by the at least one processor, the data manipulation system comprising:
an interface component configured to receive an input document, the input document being at least one of a semi-structured document or an unstructured document;
an extraction component configured to:
synthesize a first program for parsing data of the input document, the first program synthesized based on a first input; and
execute the first program on the input document to form structured data; and
an operation component configured to:
synthesize a second program for performing an operation on the structured data, the second program synthesized based on a second input; and
execute the second program on the structured data to generate a result of the operation, the result of the operation being output by the data manipulation system. 2. The computing system of claim 1, the first input comprises at least one of a first example or a first natural language input, and the second input comprises at least one of a second example or a second natural language input. 3. The computing system of claim 1, the extraction component further configured to synthesize the first program using at least one of programming by example (PBE) or programming by natural language (PBNL), and the operation component further configured to synthesize the second program using at least one of PBE or PBNL. 4. The computing system of claim 1, the second program being a transformation program for transforming text strings having a selection criterion, the structured data comprising the text strings, the operation component further comprising a transformation component configured to:
synthesize the transformation program based on the second input, the second input providing a modified text string corresponding to a text string in the structured data, the modified text string indicative of a transformation performed on the text string, the transformation program configured to transform the text strings having the selection criterion in the structured data to corresponding modified text strings; evaluate the structured data to identify the text strings having the selection criterion; and transform the text strings having the selection criterion to the corresponding modified text strings using the transformation program. 5. The computing system of claim 1, the second program being a query program, the operation component further comprising a query component configured to:
synthesize the query program based on the second input and the structured data, the second input comprising a natural language query; and generate the result using the query program, the result being responsive to the natural language query. 6. The computing system of claim 1, the extraction component further configured to:
synthesize an updated first program for parsing the data of the input document based on a refined first input subsequent to execution of the first program on the input document, the refined first input causing refinement of the structured data; and execute the updated first program on the input document to form updated structured data; wherein the operation component synthesizes the second program for performing the operation on the updated structured data and executes the second program on the updated structured data. 7. The computing system of claim 1, the operation component further configured to:
synthesize an updated second program for performing the operation on the structured data based on a refined second input, the refined second input causing refinement of the result; and execute the updated second program on the structured data to generate an updated result of the operation, the updated result of the operation being output by the data manipulation system. 8. The computing system of claim 1, the data manipulation system further comprising an interaction component configured to:
responsive to receipt of the first input, incorporate a graphical representation of the first input as part of a uniform user interface, the uniform user interface comprising a region that includes the data of the input document; responsive to execution of the first program, incorporate the structured data as part of the uniform user interface; responsive to receipt of the second input, incorporate a graphical representation of the second input as part of the uniform user interface; and responsive to execution of the second program, incorporate the result of the operation as part of the uniform user interface. 9. The computing system of claim 8, the graphical representation of the first input comprising a highlighted region over a portion of the data of the input document, the first program synthesized based at least on the portion of the data of the input document included in the highlighted region. 10. The computing system of claim 8, the interaction component further configured to receive the first input and the second input from a user of the computing system. 11. The computing system of claim 1, the input document being one of a text file, a log file, a word processor document, a semi-structured spreadsheet, a webpage, or a fixed-layout document. 12. The computing system of claim 1, the data manipulation system further comprising a communication component configured to:
receive the first input and the second input from a client computing device; and transmit the result of the operation to the client computing device. 13. The computing system of claim 1, the extraction component configured to form the structured data having one of a tabular structure or a tree-shaped structure. 14. The computing system of claim 1, the input document comprising at least one of a nested structure, a non-uniform structure, nested records, or sub-headers. 15. A method of controlling programming for data manipulation executed on data of an input document, comprising:
receiving the input document, the input document being at least one of a semi-structured document or an unstructured document; receiving a first input for parsing the data of the input document; forming structured data from the data of the input document using at least one of programming by example (PBE) or programming by natural language (PBNL) based on the first input; receiving a second input for performing an operation on the structured data; and generating a result of the operation on the structured data using at least one of PBE or PBNL based on the second input. 16. The method of claim 15, the operation being transformation of text strings in the structured data having a selection criterion. 17. The method of claim 15, the operation being execution of a natural language query over the structured data. 18. The method of claim 15, further comprising:
responsive to receipt of the first input, incorporating a graphical representation of the first input as part of a uniform user interface, the uniform user interface comprising a region that includes the data of the input document; responsive to formation of the structured data, incorporating the structured data in the region of the uniform user interface, the structured data being incorporated by including highlighted regions over portions of the data of the input document; responsive to receipt of the second input, incorporating a graphical representation of the second input as part of the uniform user interface; and incorporating the result of the operation as part of the uniform user interface. 19. A computing system, comprising:
at least one processor; and memory comprising a data manipulation system, the data manipulation system being executable by the at least one processor, the data manipulation system comprising:
an interface component configured to receive an input document, the input document being one of a text file, a log file, a word processor document, a semi-structured spreadsheet, a webpage, or a fixed-layout document;
an extraction component configured to form structured data from data of the input document using at least one of programming by example (PBE) or programming by natural language (PBNL); and
an operation component configured to generate a result of an operation on the structured data using at least one of PBE or PBNL, the result of the operation being output by the data manipulation system. 20. The computing system of claim 19, the data manipulation system further comprising an interaction component configured to:
incorporate the structured data in a region of a uniform user interface, the region includes the data of the input document, the structured data being incorporated by including highlighted regions over portions of the data of the input document; and incorporate the result of the operation as part of the uniform user interface. | Various technologies described herein pertain to controlling programming for manipulating an input document based on example(s) and/or natural language input(s). A data manipulation system includes an interface component configured to receive an input document, which is semi-structured or unstructured. The data manipulation system further includes an extraction component configured to synthesize, based on a first input, a first program for parsing data of the input document. The extraction component is configured to execute the first program on the input document to form structured data. The data manipulation system also includes an operation component configured to synthesize, based on a second input, a second program for performing an operation on the structured data. The operation component is configured to execute the second program on the structured data to generate a result of the operation, which is output by the data manipulation system.1. A computing system, comprising:
at least one processor; and memory comprising a data manipulation system, the data manipulation system being executable by the at least one processor, the data manipulation system comprising:
an interface component configured to receive an input document, the input document being at least one of a semi-structured document or an unstructured document;
an extraction component configured to:
synthesize a first program for parsing data of the input document, the first program synthesized based on a first input; and
execute the first program on the input document to form structured data; and
an operation component configured to:
synthesize a second program for performing an operation on the structured data, the second program synthesized based on a second input; and
execute the second program on the structured data to generate a result of the operation, the result of the operation being output by the data manipulation system. 2. The computing system of claim 1, the first input comprises at least one of a first example or a first natural language input, and the second input comprises at least one of a second example or a second natural language input. 3. The computing system of claim 1, the extraction component further configured to synthesize the first program using at least one of programming by example (PBE) or programming by natural language (PBNL), and the operation component further configured to synthesize the second program using at least one of PBE or PBNL. 4. The computing system of claim 1, the second program being a transformation program for transforming text strings having a selection criterion, the structured data comprising the text strings, the operation component further comprising a transformation component configured to:
synthesize the transformation program based on the second input, the second input providing a modified text string corresponding to a text string in the structured data, the modified text string indicative of a transformation performed on the text string, the transformation program configured to transform the text strings having the selection criterion in the structured data to corresponding modified text strings; evaluate the structured data to identify the text strings having the selection criterion; and transform the text strings having the selection criterion to the corresponding modified text strings using the transformation program. 5. The computing system of claim 1, the second program being a query program, the operation component further comprising a query component configured to:
synthesize the query program based on the second input and the structured data, the second input comprising a natural language query; and generate the result using the query program, the result being responsive to the natural language query. 6. The computing system of claim 1, the extraction component further configured to:
synthesize an updated first program for parsing the data of the input document based on a refined first input subsequent to execution of the first program on the input document, the refined first input causing refinement of the structured data; and execute the updated first program on the input document to form updated structured data; wherein the operation component synthesizes the second program for performing the operation on the updated structured data and executes the second program on the updated structured data. 7. The computing system of claim 1, the operation component further configured to:
synthesize an updated second program for performing the operation on the structured data based on a refined second input, the refined second input causing refinement of the result; and execute the updated second program on the structured data to generate an updated result of the operation, the updated result of the operation being output by the data manipulation system. 8. The computing system of claim 1, the data manipulation system further comprising an interaction component configured to:
responsive to receipt of the first input, incorporate a graphical representation of the first input as part of a uniform user interface, the uniform user interface comprising a region that includes the data of the input document; responsive to execution of the first program, incorporate the structured data as part of the uniform user interface; responsive to receipt of the second input, incorporate a graphical representation of the second input as part of the uniform user interface; and responsive to execution of the second program, incorporate the result of the operation as part of the uniform user interface. 9. The computing system of claim 8, the graphical representation of the first input comprising a highlighted region over a portion of the data of the input document, the first program synthesized based at least on the portion of the data of the input document included in the highlighted region. 10. The computing system of claim 8, the interaction component further configured to receive the first input and the second input from a user of the computing system. 11. The computing system of claim 1, the input document being one of a text file, a log file, a word processor document, a semi-structured spreadsheet, a webpage, or a fixed-layout document. 12. The computing system of claim 1, the data manipulation system further comprising a communication component configured to:
receive the first input and the second input from a client computing device; and transmit the result of the operation to the client computing device. 13. The computing system of claim 1, the extraction component configured to form the structured data having one of a tabular structure or a tree-shaped structure. 14. The computing system of claim 1, the input document comprising at least one of a nested structure, a non-uniform structure, nested records, or sub-headers. 15. A method of controlling programming for data manipulation executed on data of an input document, comprising:
receiving the input document, the input document being at least one of a semi-structured document or an unstructured document; receiving a first input for parsing the data of the input document; forming structured data from the data of the input document using at least one of programming by example (PBE) or programming by natural language (PBNL) based on the first input; receiving a second input for performing an operation on the structured data; and generating a result of the operation on the structured data using at least one of PBE or PBNL based on the second input. 16. The method of claim 15, the operation being transformation of text strings in the structured data having a selection criterion. 17. The method of claim 15, the operation being execution of a natural language query over the structured data. 18. The method of claim 15, further comprising:
responsive to receipt of the first input, incorporating a graphical representation of the first input as part of a uniform user interface, the uniform user interface comprising a region that includes the data of the input document; responsive to formation of the structured data, incorporating the structured data in the region of the uniform user interface, the structured data being incorporated by including highlighted regions over portions of the data of the input document; responsive to receipt of the second input, incorporating a graphical representation of the second input as part of the uniform user interface; and incorporating the result of the operation as part of the uniform user interface. 19. A computing system, comprising:
at least one processor; and memory comprising a data manipulation system, the data manipulation system being executable by the at least one processor, the data manipulation system comprising:
an interface component configured to receive an input document, the input document being one of a text file, a log file, a word processor document, a semi-structured spreadsheet, a webpage, or a fixed-layout document;
an extraction component configured to form structured data from data of the input document using at least one of programming by example (PBE) or programming by natural language (PBNL); and
an operation component configured to generate a result of an operation on the structured data using at least one of PBE or PBNL, the result of the operation being output by the data manipulation system. 20. The computing system of claim 19, the data manipulation system further comprising an interaction component configured to:
incorporate the structured data in a region of a uniform user interface, the region includes the data of the input document, the structured data being incorporated by including highlighted regions over portions of the data of the input document; and incorporate the result of the operation as part of the uniform user interface. | 2,100 |
6,163 | 6,163 | 16,180,181 | 2,182 | Hardware units and methods for performing matrix multiplication via a multi-stage pipeline wherein the storage elements associated with one or more stages of the pipeline are clock gated based on the data elements and/or portions thereof that known to have a zero value (or can be treated as having a zero value). In some cases, the storage elements may be clock gated on a per data element basis based on whether the data element has a zero value (or can be treated as having a zero value). In other cases, the storage elements may be clock gated on a partial element basis based on the bit width of the data elements. For example, if bit width of the data elements is less than a maximum bit width for the data elements then a portion of the bits related to that data element can be treated as having a zero value and a portion of the storage elements associated with that data element may not be clocked. In yet other cases the storage elements may be clock gated on both a per element and a partial element basis. | 1. A hardware unit to perform a matrix multiplication, the hardware unit comprising:
a multiplier stage comprising a plurality of multipliers, each multiplier configured to multiply a first data element and a second data element to produce a multiplication data element; one or more adder stages following the multiplier stage that form an adder tree to produce a sum of the multiplication data elements, each adder stage comprising one or more adders configured to add at least two data elements output by a previous stage to produce an addition data element; wherein at least one multiplier and/or at least one adder is preceded by a storage element corresponding to each bit of the data elements input to the at least one adder and/or the at least one multiplier; and control logic configured to clock gate all or a portion of the storage elements corresponding to a data element in response to determining that all or a portion of that data element can be treated as having a zero value. 2. The hardware unit of claim 1, wherein the at least one multiplier and/or the at least one adder comprises a multiplier and the control logic is configured to treat both the first and second data elements as having a zero value if at least one of the first and second data elements input to the multiplier has a zero value. 3. The hardware unit of claim 1, wherein the control logic is configured to clock gate the storage elements on a partial data element basis based on a bit width of the first data element and/or a bit width of the second data element. 4. The hardware unit of claim 3, wherein the storage elements corresponding to each data element are divided into a plurality of blocks which can be independently clock gated, and the control logic is configured to clock gate the storage elements of one or more blocks corresponding to a data element of the at least one adder and/or the at least one multiplier based on the bit width of the first data element and/or the second data element. 5. The hardware unit of claim 3, wherein the at least one adder and/or the at least one multiplier comprises a multiplier and the control logic is configured to clock gate a portion of the storage elements corresponding to the first data element of the multiplier when the bit width of the first data element is less than a maximum bit width. 6. The hardware unit of claim 5, wherein a number of storage elements corresponding to the first data element that are clock gated is equal to the maximum bit width less the bit width of the first data element. 7. The hardware unit of claim 3, wherein the at least one adder and/or the at least one multiplier comprises a multiplier and the control logic is configured to clock gate a portion of the storage elements corresponding to the second data element of the multiplier when the bit width of the second data element is less than a maximum bit width. 8. The hardware unit of claim 7, wherein a number of storage elements corresponding to the second data element that are clock gated is equal to the maximum bit width less the bit width of the second data element. 9. The hardware unit of claim 3, wherein the at least one adder and/or the at least one multiplier comprises an adder and a portion of the storage elements associated with each data element input to the adder are clock-gated when at least one of the bit width of the first data element and the bit width of the second data element is less than a maximum bit width. 10. The hardware unit of claim 3, wherein the data elements are most significant bit aligned and the portion of the storage elements corresponding to a data element that are clock-gated are the storage elements corresponding to the least significant bits of the data element. 11. The hardware unit of claim 1, wherein the control logic is configured to clock gate the storage elements on a per data element basis. 12. The hardware unit of claim 11, wherein the control logic, is configured to receive information indicating which data elements input to the at least one multiplier and/or the at least one adder can be treated as having a zero value, and in response to determining that a particular data element can be treated as having a zero value, clock gate all the storage elements corresponding to that data element. 13. The hardware unit of claim 12, wherein the at least one multiplier and/or the at least one adder comprises a multiplier and the information indicating which data elements input to the multiplier can be treated as having a zero value is configured to indicate that both the first and second data elements of the multiplier can be treated as having a zero value if at least one of the first data element and the second data element has a zero value. 14. The hardware unit of claim 12, wherein the control logic is further configured to generate information indicating whether the output data element of the at least one adder and/or the at least one multiplier can be treated as having a zero value based on whether the data elements input to the at least one multiplier and/or the at least one adder can be treated as having a zero value. 15. The hardware unit of claim 1, wherein the control logic is further configured to, for each storage element that is clock gated, cause a zero bit to be provided to the corresponding multiplier or adder. 16. A method of clock gating storage elements in a hardware unit for performing matrix multiplication, the hardware unit comprising a plurality of multipliers each configured to multiply data elements to output a multiplication data element, and a plurality of adders that form an adder tree to produce a sum of the multiplication data elements by adding data elements from a multiplier or an adder, wherein at least one multiplier and/or at least one adder is preceded by a storage element for each bit of each input data element, the method comprising;
receiving information indicating whether each data element input to the at least one multiplier and/or the at least one adder can be treated as having a zero value, and/or, indicating whether a portion of each data element input to the at least one multiplier and/or the at least one adder can be treated as having a zero value; and in response to receiving information that indicates that a data element or portion of a data element can be treated as having a zero value, clock gating all or a portion of the storage elements corresponding to that data element. 17. A method of manufacturing, using an integrated circuit manufacturing system, the hardware unit as set forth in claim 1, the method comprising:
processing, using a layout processing system, a computer readable description of the hardware unit so as to generate a circuit layout description of an integrated circuit embodying the hardware unit; and manufacturing, using an integrated circuit generation system, the hardware unit according to the circuit layout description. 18. A hardware implementation of a Deep Neural Network “DNN” comprising the hardware unit as set forth in claim 1 configured to compute the convolution associated with one or more convolution layers and/or one or more fully-connected layers of the DNN. 19. A non-transitory computer readable storage medium having stored thereon computer readable instructions that, when executed at a computer system, cause the computer system to perform the method as set forth in claim 16. 20. A non-transitory computer readable storage medium having stored thereon a computer readable description of the hardware unit as set forth in claim 1 that, when processed in an integrated circuit manufacturing system, causes the integrated circuit manufacturing system to manufacture an integrated circuit embodying the hardware unit. | Hardware units and methods for performing matrix multiplication via a multi-stage pipeline wherein the storage elements associated with one or more stages of the pipeline are clock gated based on the data elements and/or portions thereof that known to have a zero value (or can be treated as having a zero value). In some cases, the storage elements may be clock gated on a per data element basis based on whether the data element has a zero value (or can be treated as having a zero value). In other cases, the storage elements may be clock gated on a partial element basis based on the bit width of the data elements. For example, if bit width of the data elements is less than a maximum bit width for the data elements then a portion of the bits related to that data element can be treated as having a zero value and a portion of the storage elements associated with that data element may not be clocked. In yet other cases the storage elements may be clock gated on both a per element and a partial element basis.1. A hardware unit to perform a matrix multiplication, the hardware unit comprising:
a multiplier stage comprising a plurality of multipliers, each multiplier configured to multiply a first data element and a second data element to produce a multiplication data element; one or more adder stages following the multiplier stage that form an adder tree to produce a sum of the multiplication data elements, each adder stage comprising one or more adders configured to add at least two data elements output by a previous stage to produce an addition data element; wherein at least one multiplier and/or at least one adder is preceded by a storage element corresponding to each bit of the data elements input to the at least one adder and/or the at least one multiplier; and control logic configured to clock gate all or a portion of the storage elements corresponding to a data element in response to determining that all or a portion of that data element can be treated as having a zero value. 2. The hardware unit of claim 1, wherein the at least one multiplier and/or the at least one adder comprises a multiplier and the control logic is configured to treat both the first and second data elements as having a zero value if at least one of the first and second data elements input to the multiplier has a zero value. 3. The hardware unit of claim 1, wherein the control logic is configured to clock gate the storage elements on a partial data element basis based on a bit width of the first data element and/or a bit width of the second data element. 4. The hardware unit of claim 3, wherein the storage elements corresponding to each data element are divided into a plurality of blocks which can be independently clock gated, and the control logic is configured to clock gate the storage elements of one or more blocks corresponding to a data element of the at least one adder and/or the at least one multiplier based on the bit width of the first data element and/or the second data element. 5. The hardware unit of claim 3, wherein the at least one adder and/or the at least one multiplier comprises a multiplier and the control logic is configured to clock gate a portion of the storage elements corresponding to the first data element of the multiplier when the bit width of the first data element is less than a maximum bit width. 6. The hardware unit of claim 5, wherein a number of storage elements corresponding to the first data element that are clock gated is equal to the maximum bit width less the bit width of the first data element. 7. The hardware unit of claim 3, wherein the at least one adder and/or the at least one multiplier comprises a multiplier and the control logic is configured to clock gate a portion of the storage elements corresponding to the second data element of the multiplier when the bit width of the second data element is less than a maximum bit width. 8. The hardware unit of claim 7, wherein a number of storage elements corresponding to the second data element that are clock gated is equal to the maximum bit width less the bit width of the second data element. 9. The hardware unit of claim 3, wherein the at least one adder and/or the at least one multiplier comprises an adder and a portion of the storage elements associated with each data element input to the adder are clock-gated when at least one of the bit width of the first data element and the bit width of the second data element is less than a maximum bit width. 10. The hardware unit of claim 3, wherein the data elements are most significant bit aligned and the portion of the storage elements corresponding to a data element that are clock-gated are the storage elements corresponding to the least significant bits of the data element. 11. The hardware unit of claim 1, wherein the control logic is configured to clock gate the storage elements on a per data element basis. 12. The hardware unit of claim 11, wherein the control logic, is configured to receive information indicating which data elements input to the at least one multiplier and/or the at least one adder can be treated as having a zero value, and in response to determining that a particular data element can be treated as having a zero value, clock gate all the storage elements corresponding to that data element. 13. The hardware unit of claim 12, wherein the at least one multiplier and/or the at least one adder comprises a multiplier and the information indicating which data elements input to the multiplier can be treated as having a zero value is configured to indicate that both the first and second data elements of the multiplier can be treated as having a zero value if at least one of the first data element and the second data element has a zero value. 14. The hardware unit of claim 12, wherein the control logic is further configured to generate information indicating whether the output data element of the at least one adder and/or the at least one multiplier can be treated as having a zero value based on whether the data elements input to the at least one multiplier and/or the at least one adder can be treated as having a zero value. 15. The hardware unit of claim 1, wherein the control logic is further configured to, for each storage element that is clock gated, cause a zero bit to be provided to the corresponding multiplier or adder. 16. A method of clock gating storage elements in a hardware unit for performing matrix multiplication, the hardware unit comprising a plurality of multipliers each configured to multiply data elements to output a multiplication data element, and a plurality of adders that form an adder tree to produce a sum of the multiplication data elements by adding data elements from a multiplier or an adder, wherein at least one multiplier and/or at least one adder is preceded by a storage element for each bit of each input data element, the method comprising;
receiving information indicating whether each data element input to the at least one multiplier and/or the at least one adder can be treated as having a zero value, and/or, indicating whether a portion of each data element input to the at least one multiplier and/or the at least one adder can be treated as having a zero value; and in response to receiving information that indicates that a data element or portion of a data element can be treated as having a zero value, clock gating all or a portion of the storage elements corresponding to that data element. 17. A method of manufacturing, using an integrated circuit manufacturing system, the hardware unit as set forth in claim 1, the method comprising:
processing, using a layout processing system, a computer readable description of the hardware unit so as to generate a circuit layout description of an integrated circuit embodying the hardware unit; and manufacturing, using an integrated circuit generation system, the hardware unit according to the circuit layout description. 18. A hardware implementation of a Deep Neural Network “DNN” comprising the hardware unit as set forth in claim 1 configured to compute the convolution associated with one or more convolution layers and/or one or more fully-connected layers of the DNN. 19. A non-transitory computer readable storage medium having stored thereon computer readable instructions that, when executed at a computer system, cause the computer system to perform the method as set forth in claim 16. 20. A non-transitory computer readable storage medium having stored thereon a computer readable description of the hardware unit as set forth in claim 1 that, when processed in an integrated circuit manufacturing system, causes the integrated circuit manufacturing system to manufacture an integrated circuit embodying the hardware unit. | 2,100 |
6,164 | 6,164 | 14,927,200 | 2,175 | A method, system, apparatus, and computer program product provide the ability to navigate between components in a computer-aided design (CAD) mobile drawing application. A drawing is opened in the CAD mobile drawing application on a mobile device. A navigation panel is activated. A component is selected in the drawing. In response to the selecting, information about the selected component is displayed within the navigation panel. Via a mobile device gesture, an element of the information is selected and used as the selected element. The navigation panel is updated by displaying information about the selected element. | 1. A computer-implemented method for navigating between components in a computer-aided design (CAD) mobile drawing application, comprising:
opening a drawing in the CAD mobile drawing application on a mobile device; activating a navigation panel; selecting a component in the drawing; in response to the selecting, displaying, within the navigation panel, information about the selected component; selecting, via a mobile device gesture, an element of the information; utilizing the selected element as the selected component; and updating the navigation panel by displaying information about the selected element. 2. The computer-implemented method of claim 1, wherein the activating comprises:
tapping an icon corresponding to a navigation panel. 3. The computer-implemented method of claim 1, wherein the selecting the component in the drawing comprises:
tapping the component in a schematic drawing view of the CAD mobile drawing application. 4. The computer-implemented method of claim 1, wherein the selecting an element of the information comprises:
tapping on the element within the navigation panel. 5. The computer-implemented method of claim 1, wherein the information about the selected component comprises an icon and text. 6. The computer-implemented method of claim 1, wherein the navigation panel comprises a source and destination navigation panel, the method further comprising:
receiving a vertical swipe gesture in the navigation panel; in response to the vertical swipe gesture, navigating within the navigation panel from a source area to a destination area. 7. The computer-implemented method of claim 1, wherein:
the navigation panel comprises a component navigation panel; the selected component is a parent component of one or more related child components; a first area of the component navigation panel comprises a parent component area displaying information about the selected parent component, and a parent visual identification that visually identifies the selected component as a parent component; a second area of the component navigation panel comprises a child component area displaying information about one child component of the selected parent component, and a child visual identification that visually identifies the child component as a child component. 8. The computer-implemented method of claim 7, wherein the method further comprises:
receiving a horizontal swipe gesture adjacent to the child component area; in response to the horizontal swipe gesture, navigating to additional children components of a selected parent component. 9. The computer-implemented method of claim 1, wherein:
the selected component is displayed in a visually distinguishable manner in the navigation panel. 10. A mobile apparatus for navigating between components in a computer-aided design (CAD) mobile drawing application, comprising:
a mobile device comprising a multi-touch device comprising a touch screen; the CAD mobile drawing application executing on the mobile device, wherein the CAD mobile drawing application is configured to:
open a drawing;
activate a navigation panel;
select a component in the drawing;
in response to the selection, display, within the navigation panel, information about the selected component;
select, via a mobile device gesture, an element of the information;
utilize the selected element as the selected component; and
update the navigation panel by displaying information about the selected element. 11. The mobile apparatus method of claim 10, wherein the activation of the navigation panel comprises:
tapping an icon corresponding to a navigation panel. 12. The mobile apparatus method of claim 10, wherein the selection of the component in the drawing comprises:
tapping the component in a schematic drawing view of the CAD mobile drawing application. 13. The mobile apparatus method of claim 10, wherein the selection of an element of the information comprises:
tapping on the element within the navigation panel. 14. The mobile apparatus method of claim 10, wherein the information about the selected component comprises an icon and text. 15. The mobile apparatus method of claim 10, wherein the navigation panel comprises a source and destination navigation panel, and the CAD mobile drawing application is further configured to:
receive a vertical swipe gesture in the navigation panel; in response to the vertical swipe gesture, navigate within the navigation panel from a source area to a destination area. 16. The mobile apparatus method of claim 10, wherein:
the navigation panel comprises a component navigation panel; the selected component is a parent component of one or more related child components; a first area of the component navigation panel comprises a parent component area displaying information about the selected parent component, and a parent visual identification that visually identifies the selected component as a parent component; a second area of the component navigation panel comprises a child component area displaying information about one child component of the selected parent component, and a child visual identification that visually identifies the child component as a child component. 17. The mobile apparatus method of claim 16, wherein the CAD mobile drawing application is further configured to:
receive a horizontal swipe gesture adjacent to the child component area; in response to the horizontal swipe gesture, navigate to additional children components of a selected parent component. 18. The mobile apparatus method of claim 10, wherein:
the selected component is displayed in a visually distinguishable manner in the navigation panel. | A method, system, apparatus, and computer program product provide the ability to navigate between components in a computer-aided design (CAD) mobile drawing application. A drawing is opened in the CAD mobile drawing application on a mobile device. A navigation panel is activated. A component is selected in the drawing. In response to the selecting, information about the selected component is displayed within the navigation panel. Via a mobile device gesture, an element of the information is selected and used as the selected element. The navigation panel is updated by displaying information about the selected element.1. A computer-implemented method for navigating between components in a computer-aided design (CAD) mobile drawing application, comprising:
opening a drawing in the CAD mobile drawing application on a mobile device; activating a navigation panel; selecting a component in the drawing; in response to the selecting, displaying, within the navigation panel, information about the selected component; selecting, via a mobile device gesture, an element of the information; utilizing the selected element as the selected component; and updating the navigation panel by displaying information about the selected element. 2. The computer-implemented method of claim 1, wherein the activating comprises:
tapping an icon corresponding to a navigation panel. 3. The computer-implemented method of claim 1, wherein the selecting the component in the drawing comprises:
tapping the component in a schematic drawing view of the CAD mobile drawing application. 4. The computer-implemented method of claim 1, wherein the selecting an element of the information comprises:
tapping on the element within the navigation panel. 5. The computer-implemented method of claim 1, wherein the information about the selected component comprises an icon and text. 6. The computer-implemented method of claim 1, wherein the navigation panel comprises a source and destination navigation panel, the method further comprising:
receiving a vertical swipe gesture in the navigation panel; in response to the vertical swipe gesture, navigating within the navigation panel from a source area to a destination area. 7. The computer-implemented method of claim 1, wherein:
the navigation panel comprises a component navigation panel; the selected component is a parent component of one or more related child components; a first area of the component navigation panel comprises a parent component area displaying information about the selected parent component, and a parent visual identification that visually identifies the selected component as a parent component; a second area of the component navigation panel comprises a child component area displaying information about one child component of the selected parent component, and a child visual identification that visually identifies the child component as a child component. 8. The computer-implemented method of claim 7, wherein the method further comprises:
receiving a horizontal swipe gesture adjacent to the child component area; in response to the horizontal swipe gesture, navigating to additional children components of a selected parent component. 9. The computer-implemented method of claim 1, wherein:
the selected component is displayed in a visually distinguishable manner in the navigation panel. 10. A mobile apparatus for navigating between components in a computer-aided design (CAD) mobile drawing application, comprising:
a mobile device comprising a multi-touch device comprising a touch screen; the CAD mobile drawing application executing on the mobile device, wherein the CAD mobile drawing application is configured to:
open a drawing;
activate a navigation panel;
select a component in the drawing;
in response to the selection, display, within the navigation panel, information about the selected component;
select, via a mobile device gesture, an element of the information;
utilize the selected element as the selected component; and
update the navigation panel by displaying information about the selected element. 11. The mobile apparatus method of claim 10, wherein the activation of the navigation panel comprises:
tapping an icon corresponding to a navigation panel. 12. The mobile apparatus method of claim 10, wherein the selection of the component in the drawing comprises:
tapping the component in a schematic drawing view of the CAD mobile drawing application. 13. The mobile apparatus method of claim 10, wherein the selection of an element of the information comprises:
tapping on the element within the navigation panel. 14. The mobile apparatus method of claim 10, wherein the information about the selected component comprises an icon and text. 15. The mobile apparatus method of claim 10, wherein the navigation panel comprises a source and destination navigation panel, and the CAD mobile drawing application is further configured to:
receive a vertical swipe gesture in the navigation panel; in response to the vertical swipe gesture, navigate within the navigation panel from a source area to a destination area. 16. The mobile apparatus method of claim 10, wherein:
the navigation panel comprises a component navigation panel; the selected component is a parent component of one or more related child components; a first area of the component navigation panel comprises a parent component area displaying information about the selected parent component, and a parent visual identification that visually identifies the selected component as a parent component; a second area of the component navigation panel comprises a child component area displaying information about one child component of the selected parent component, and a child visual identification that visually identifies the child component as a child component. 17. The mobile apparatus method of claim 16, wherein the CAD mobile drawing application is further configured to:
receive a horizontal swipe gesture adjacent to the child component area; in response to the horizontal swipe gesture, navigate to additional children components of a selected parent component. 18. The mobile apparatus method of claim 10, wherein:
the selected component is displayed in a visually distinguishable manner in the navigation panel. | 2,100 |
6,165 | 6,165 | 16,546,134 | 2,125 | A recommendation system models unknown preferences as samples from a noise distribution to generate recommendations for an online system. Specifically, the recommendation system obtains latent user and item representations from preference information that are representations of users and items in a lower-dimensional latent space. A recommendation for a user and item with an unknown preference can be generated by combining the latent representation for the user with the latent representation for the item. The latent user and item representations are learned to discriminate between observed interactions and unobserved noise samples in the preference information by increasing estimated predictions for known preferences in the ratings matrix, and decreasing estimated predictions for unobserved preferences sampled from the noise distribution. | 1. A system comprising:
a processor configured to execute instructions; a computer-readable medium containing instructions for execution on the processor, the instructions causing the processor to perform steps of:
obtaining a ratings matrix representing a plurality of ratings between a set of users and a set of items, wherein an entry in the ratings matrix for a user and an item indicates whether the user interacted with the item;
scaling the ratings matrix to generate a depopularized matrix including a set of scaled ratings, wherein the ratings matrix is scaled by modifying a rating for a user and an item based on a number of users who interacted with the item;
generating a set of latent user representations and a set of latent item representations from the depopularized matrix, a latent user vector representing a user in the set of users in a latent space, and a latent item vector representing an item in the set of items in the latent space; and
generating the rating predictions for the set of users and the set of items from the set of latent user representations or the set of latent item representations. 2. The system of claim 1, wherein the entry in the ratings matrix for the user and the item is represented as a Boolean value, in which the entry is zero if a preference of the user for the item is unknown, or a non-zero value if the user interacted with the item. 3. The system of claim 1, wherein scaling the ratings matrix comprises instructions for multiplying the rating by a total number of interactions in the ratings matrix and an inverse of the number of users who interacted with the item. 4. The system of claim 1, wherein generating the rating predictions for the set of users and the set of items comprises instructions for combining the set of latent user representations and the set of latent item representations through a dot product. 5. The system of claim 1, wherein generating the rating predictions for the set of users and the set of items comprises instructions for:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with, and combing the dynamic user representation for the user with a set of projected item weights through a dot product. 6. The system of claim 1, wherein the instructions further comprise:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with; and determining a projected weight vector for an item by repeatedly performing, for each user in the set of users:
combining the dynamic user representation for the user and an estimated set of projected item weights for the item to determine an estimated rating for the user and the item,
determining a loss function indicating a difference between a rating in the ratings matrix for the user and the item, and the estimated rating for the user and the item, and
updating the estimated set of projected item weights for the item to reduce the loss function. 7. The system of claim 1, wherein a dimensionality of the set of latent user representations and the set of latent item representations is smaller than a number of the set of users and a number of the set of items. 8. A method for generating rating predictions for a set of users and a set of items of an online system, comprising:
obtaining a ratings matrix representing a plurality of ratings between the set of users and the set of items, wherein an entry in the ratings matrix for a user and an item indicates whether the user interacted with the item; scaling the ratings matrix to generate a depopularized matrix including a set of scaled ratings, wherein the ratings matrix is scaled by modifying a rating for a user and an item based on a number of users who interacted with the item; generating a set of latent user representations and a set of latent item representations from the depopularized matrix, a latent user representation representing a user in the set of users in a latent space, and a latent item representation representing an item in the set of items in the latent space; and generating the rating predictions for the set of users and the set of items from the set of latent user representations or the set of latent item representations. 9. The method of claim 8, wherein the entry in the ratings matrix for the user and the item is represented as a Boolean value, in which the entry is zero if a preference of the user for the item is unknown, or a non-zero value if the user interacted with the item. 10. The method of claim 8, wherein scaling the ratings matrix comprises multiplying the rating by a total number of interactions in the ratings matrix and an inverse of the number of users who interacted with the item. 11. The method of claim 8, wherein generating the rating predictions for the set of users and the set of items comprises combining the set of latent user representations and the set of latent item representations through a dot product. 12. The method of claim 8, wherein generating the rating predictions for the set of users and the set of items comprises:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with, and combing the dynamic user representation for the user with a set of projected item weights through a dot product. 13. The method of claim 8, further comprising:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with; and determining a set of projected item weights for an item by repeatedly performing, for each user in the set of users:
combining the dynamic user representation for the user and an estimated set of projected item weights for the item to determine an estimated rating for the user and the item,
determining a loss function indicating a difference between a rating in the ratings matrix for the user and the item, and the estimated rating for the user and the item, and
updating the estimated set of projected item weights for the item to reduce the loss function. 14. The method of claim 8, wherein a dimensionality of the set of latent user representations and the set of latent item representations is smaller than a number of the set of users and a number of the set of items. 15. A non-transitory computer-readable medium containing instructions for execution on a processor, the instructions comprising:
obtaining a ratings matrix representing a plurality of ratings between a set of users and a set of items, wherein an entry in the ratings matrix for a user and an item indicates whether the user interacted with the item; scaling the ratings matrix to generate a depopularized matrix including a set of scaled ratings, wherein the ratings matrix is scaled by modifying a rating for a user and an item based on a number of users who interacted with the item; generating a set of latent user representations and a set of latent item representations from the depopularized matrix, a latent user representation representing a user in the set of users in a latent space, and a latent item representation representing an item in the set of items in the latent space; and generating the rating predictions for the set of users and the set of items from the set of latent user representations or the set of latent item representations. 16. The non-transitory computer-readable medium of claim 15, wherein the entry in the ratings matrix for the user and the item is represented as a Boolean value, in which the entry is zero if a preference of the user for the item is unknown, or a non-zero value if the user interacted with the item. 17. The non-transitory computer-readable medium of claim 15, wherein scaling the ratings matrix comprises instructions for multiplying the rating by a total number of interactions in the ratings matrix and an inverse of the number of users who interacted with the item. 18. The non-transitory computer-readable medium of claim 15, wherein generating the rating predictions for the set of users and the set of items comprises instructions for combining the set of latent user representations and the set of latent item representations through a dot product. 19. The non-transitory computer-readable medium of claim 15, wherein generating the rating predictions for the set of users and the set of items comprises instructions for:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with, and combing the dynamic user representation for the user with a set of projected item weights through a dot product. 20. The non-transitory computer-readable medium of claim 15, wherein the instructions further comprise:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with; and determining a set of projected item weights for an item by repeatedly performing, for each user in the set of users:
combining the dynamic user representation for the user and an estimated set of projected item weights for the item to determine an estimated rating for the user and the item,
determining a loss function indicating a difference between a rating in the ratings matrix for the user and the item, and the estimated rating for the user and the item, and
updating the estimated set of projected item weights for the item to reduce the loss function. | A recommendation system models unknown preferences as samples from a noise distribution to generate recommendations for an online system. Specifically, the recommendation system obtains latent user and item representations from preference information that are representations of users and items in a lower-dimensional latent space. A recommendation for a user and item with an unknown preference can be generated by combining the latent representation for the user with the latent representation for the item. The latent user and item representations are learned to discriminate between observed interactions and unobserved noise samples in the preference information by increasing estimated predictions for known preferences in the ratings matrix, and decreasing estimated predictions for unobserved preferences sampled from the noise distribution.1. A system comprising:
a processor configured to execute instructions; a computer-readable medium containing instructions for execution on the processor, the instructions causing the processor to perform steps of:
obtaining a ratings matrix representing a plurality of ratings between a set of users and a set of items, wherein an entry in the ratings matrix for a user and an item indicates whether the user interacted with the item;
scaling the ratings matrix to generate a depopularized matrix including a set of scaled ratings, wherein the ratings matrix is scaled by modifying a rating for a user and an item based on a number of users who interacted with the item;
generating a set of latent user representations and a set of latent item representations from the depopularized matrix, a latent user vector representing a user in the set of users in a latent space, and a latent item vector representing an item in the set of items in the latent space; and
generating the rating predictions for the set of users and the set of items from the set of latent user representations or the set of latent item representations. 2. The system of claim 1, wherein the entry in the ratings matrix for the user and the item is represented as a Boolean value, in which the entry is zero if a preference of the user for the item is unknown, or a non-zero value if the user interacted with the item. 3. The system of claim 1, wherein scaling the ratings matrix comprises instructions for multiplying the rating by a total number of interactions in the ratings matrix and an inverse of the number of users who interacted with the item. 4. The system of claim 1, wherein generating the rating predictions for the set of users and the set of items comprises instructions for combining the set of latent user representations and the set of latent item representations through a dot product. 5. The system of claim 1, wherein generating the rating predictions for the set of users and the set of items comprises instructions for:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with, and combing the dynamic user representation for the user with a set of projected item weights through a dot product. 6. The system of claim 1, wherein the instructions further comprise:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with; and determining a projected weight vector for an item by repeatedly performing, for each user in the set of users:
combining the dynamic user representation for the user and an estimated set of projected item weights for the item to determine an estimated rating for the user and the item,
determining a loss function indicating a difference between a rating in the ratings matrix for the user and the item, and the estimated rating for the user and the item, and
updating the estimated set of projected item weights for the item to reduce the loss function. 7. The system of claim 1, wherein a dimensionality of the set of latent user representations and the set of latent item representations is smaller than a number of the set of users and a number of the set of items. 8. A method for generating rating predictions for a set of users and a set of items of an online system, comprising:
obtaining a ratings matrix representing a plurality of ratings between the set of users and the set of items, wherein an entry in the ratings matrix for a user and an item indicates whether the user interacted with the item; scaling the ratings matrix to generate a depopularized matrix including a set of scaled ratings, wherein the ratings matrix is scaled by modifying a rating for a user and an item based on a number of users who interacted with the item; generating a set of latent user representations and a set of latent item representations from the depopularized matrix, a latent user representation representing a user in the set of users in a latent space, and a latent item representation representing an item in the set of items in the latent space; and generating the rating predictions for the set of users and the set of items from the set of latent user representations or the set of latent item representations. 9. The method of claim 8, wherein the entry in the ratings matrix for the user and the item is represented as a Boolean value, in which the entry is zero if a preference of the user for the item is unknown, or a non-zero value if the user interacted with the item. 10. The method of claim 8, wherein scaling the ratings matrix comprises multiplying the rating by a total number of interactions in the ratings matrix and an inverse of the number of users who interacted with the item. 11. The method of claim 8, wherein generating the rating predictions for the set of users and the set of items comprises combining the set of latent user representations and the set of latent item representations through a dot product. 12. The method of claim 8, wherein generating the rating predictions for the set of users and the set of items comprises:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with, and combing the dynamic user representation for the user with a set of projected item weights through a dot product. 13. The method of claim 8, further comprising:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with; and determining a set of projected item weights for an item by repeatedly performing, for each user in the set of users:
combining the dynamic user representation for the user and an estimated set of projected item weights for the item to determine an estimated rating for the user and the item,
determining a loss function indicating a difference between a rating in the ratings matrix for the user and the item, and the estimated rating for the user and the item, and
updating the estimated set of projected item weights for the item to reduce the loss function. 14. The method of claim 8, wherein a dimensionality of the set of latent user representations and the set of latent item representations is smaller than a number of the set of users and a number of the set of items. 15. A non-transitory computer-readable medium containing instructions for execution on a processor, the instructions comprising:
obtaining a ratings matrix representing a plurality of ratings between a set of users and a set of items, wherein an entry in the ratings matrix for a user and an item indicates whether the user interacted with the item; scaling the ratings matrix to generate a depopularized matrix including a set of scaled ratings, wherein the ratings matrix is scaled by modifying a rating for a user and an item based on a number of users who interacted with the item; generating a set of latent user representations and a set of latent item representations from the depopularized matrix, a latent user representation representing a user in the set of users in a latent space, and a latent item representation representing an item in the set of items in the latent space; and generating the rating predictions for the set of users and the set of items from the set of latent user representations or the set of latent item representations. 16. The non-transitory computer-readable medium of claim 15, wherein the entry in the ratings matrix for the user and the item is represented as a Boolean value, in which the entry is zero if a preference of the user for the item is unknown, or a non-zero value if the user interacted with the item. 17. The non-transitory computer-readable medium of claim 15, wherein scaling the ratings matrix comprises instructions for multiplying the rating by a total number of interactions in the ratings matrix and an inverse of the number of users who interacted with the item. 18. The non-transitory computer-readable medium of claim 15, wherein generating the rating predictions for the set of users and the set of items comprises instructions for combining the set of latent user representations and the set of latent item representations through a dot product. 19. The non-transitory computer-readable medium of claim 15, wherein generating the rating predictions for the set of users and the set of items comprises instructions for:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with, and combing the dynamic user representation for the user with a set of projected item weights through a dot product. 20. The non-transitory computer-readable medium of claim 15, wherein the instructions further comprise:
for each user in the set of users, obtaining a dynamic user representation for the user, the dynamic user representation obtained by combining a subset of latent item representations for a subset of items that the user has interacted with; and determining a set of projected item weights for an item by repeatedly performing, for each user in the set of users:
combining the dynamic user representation for the user and an estimated set of projected item weights for the item to determine an estimated rating for the user and the item,
determining a loss function indicating a difference between a rating in the ratings matrix for the user and the item, and the estimated rating for the user and the item, and
updating the estimated set of projected item weights for the item to reduce the loss function. | 2,100 |
6,166 | 6,166 | 15,638,122 | 2,177 | Techniques for object insertion are described. In one or more implementations, user input is received to an interactive canvas and the user input is detected as corresponding to a closed shape. In response to detecting that the user input corresponds to the closed shape, an object insertion menu is displayed on the interactive canvas. The object insertion menu includes selectable representations corresponding to multiple different object types which may be inserted into the interactive canvas within the closed shape. In response to receiving a user selection of a selectable representation associated with an object type from the object insertion menu, an object insertion control associated with the selected object type is displayed in the object insertion menu. The object insertion control includes additional selectable representations corresponding to objects associated with the selected object type which are selectable to insert a respective object into the interactive canvas within the closed shape. | 1. A method implemented by a computing device, the method comprising:
receiving user input to an interactive canvas and detecting that the user input corresponds to a closed shape; displaying an object insertion menu on the interactive canvas, the object insertion menu comprising selectable representations corresponding to multiple different object types which may be inserted into the interactive canvas within the closed shape; and in response to receiving a user selection of a selectable representation associated with an object type from the object insertion menu, displaying an object insertion control associated with the selected object type in the object insertion menu, the object insertion control comprising additional selectable representations corresponding to objects associated with the selected object type which are selectable to insert a respective object into the interactive canvas within the closed shape. 2. The method of claim 1, further comprising receiving a user selection of one of the additional selectable representations and from the object insertion control and inserting the respective object associated with the selected additional selectable control into the interactive canvas within the closed shape. 3. The method of claim 1, wherein the object insertion menu displays selectable representations corresponding to a first subset of object types, and wherein the object insertion menu includes a navigation control that is selectable to cause display of additional selectable representations corresponding to at least a second subset of object types. 4. The method of claim 1, further comprising digitizing and displaying the user input corresponding to the closed shape on the interactive canvas. 5. The method of claim 3, wherein the object insertion menu is displayed within the closed shape. 6. The method of claim 1, wherein the object insertion menu is displayed proximate the closed shape on the interactive canvas. 7. The method of claim 1, wherein the object insertion menu is displayed at a fixed location of the interactive canvas. 8. The method of claim 1, further removing display of the object insertion menu if a selectable representation is not selected from the object insertion menu within a certain period of time. 9. The method of claim 7, further comprising enabling the closed shape to remain displayed on the interactive canvas. 10. The method of claim 1, wherein the selectable representations are associated with object types corresponding to at least two of photos, videos, text, or documents. 11. The method of claim 1, wherein the closed shape comprises a square, a rectangle, a circle, or a triangle. 12. The method of claim 1, wherein the closed shape comprises a free-form shape. 13. The method of claim 1, wherein the interactive canvas is displayed as pages of a journal application on a first and second display device of a dual display device. 14. A computing device comprising:
one or more display devices; at least one processor; and at least one computer-readable storage media storing instructions that are executable by the at least one processor to:
receive user input to an interactive canvas displayed on the one or more display devices and detect that the user input corresponds to a closed shape;
display an object insertion menu on the interactive canvas, the object insertion menu comprising selectable representations corresponding to multiple different object types which may be inserted into the interactive canvas within the closed shape; and
in response to receiving a user selection of a selectable representation associated with an object type from the object insertion menu, display an object insertion control associated with the selected object type in the object insertion menu, the object insertion control comprising additional selectable representations corresponding to objects associated with the selected object type which are selectable to insert a respective object into the interactive canvas within the closed shape. 15. The computing device of claim 14, further comprising instructions that are executable by the at least one processor to receive a user selection of one of the additional selectable representations and from the object insertion control and insert the respective object associated with the selected additional selectable control into the interactive canvas within the closed shape. 16. The computing device of claim 14, wherein the object insertion menu displays selectable representations corresponding to a first subset of object types, and wherein the object insertion menu includes a navigation control that is selectable to cause display of additional selectable representations corresponding to at least a second subset of object types. 17. The computing device of claim 14, further comprising digitizing and displaying the user input corresponding to the closed shape on the interactive canvas. 18. The computing device of claim 17, wherein the object insertion menu is displayed within the closed shape. 19. The computing device of claim 17, wherein the object insertion menu is displayed proximate the closed shape on the interactive canvas. 20. The computing device of claim 17, wherein the object insertion menu is displayed at a fixed location of the interactive canvas. | Techniques for object insertion are described. In one or more implementations, user input is received to an interactive canvas and the user input is detected as corresponding to a closed shape. In response to detecting that the user input corresponds to the closed shape, an object insertion menu is displayed on the interactive canvas. The object insertion menu includes selectable representations corresponding to multiple different object types which may be inserted into the interactive canvas within the closed shape. In response to receiving a user selection of a selectable representation associated with an object type from the object insertion menu, an object insertion control associated with the selected object type is displayed in the object insertion menu. The object insertion control includes additional selectable representations corresponding to objects associated with the selected object type which are selectable to insert a respective object into the interactive canvas within the closed shape.1. A method implemented by a computing device, the method comprising:
receiving user input to an interactive canvas and detecting that the user input corresponds to a closed shape; displaying an object insertion menu on the interactive canvas, the object insertion menu comprising selectable representations corresponding to multiple different object types which may be inserted into the interactive canvas within the closed shape; and in response to receiving a user selection of a selectable representation associated with an object type from the object insertion menu, displaying an object insertion control associated with the selected object type in the object insertion menu, the object insertion control comprising additional selectable representations corresponding to objects associated with the selected object type which are selectable to insert a respective object into the interactive canvas within the closed shape. 2. The method of claim 1, further comprising receiving a user selection of one of the additional selectable representations and from the object insertion control and inserting the respective object associated with the selected additional selectable control into the interactive canvas within the closed shape. 3. The method of claim 1, wherein the object insertion menu displays selectable representations corresponding to a first subset of object types, and wherein the object insertion menu includes a navigation control that is selectable to cause display of additional selectable representations corresponding to at least a second subset of object types. 4. The method of claim 1, further comprising digitizing and displaying the user input corresponding to the closed shape on the interactive canvas. 5. The method of claim 3, wherein the object insertion menu is displayed within the closed shape. 6. The method of claim 1, wherein the object insertion menu is displayed proximate the closed shape on the interactive canvas. 7. The method of claim 1, wherein the object insertion menu is displayed at a fixed location of the interactive canvas. 8. The method of claim 1, further removing display of the object insertion menu if a selectable representation is not selected from the object insertion menu within a certain period of time. 9. The method of claim 7, further comprising enabling the closed shape to remain displayed on the interactive canvas. 10. The method of claim 1, wherein the selectable representations are associated with object types corresponding to at least two of photos, videos, text, or documents. 11. The method of claim 1, wherein the closed shape comprises a square, a rectangle, a circle, or a triangle. 12. The method of claim 1, wherein the closed shape comprises a free-form shape. 13. The method of claim 1, wherein the interactive canvas is displayed as pages of a journal application on a first and second display device of a dual display device. 14. A computing device comprising:
one or more display devices; at least one processor; and at least one computer-readable storage media storing instructions that are executable by the at least one processor to:
receive user input to an interactive canvas displayed on the one or more display devices and detect that the user input corresponds to a closed shape;
display an object insertion menu on the interactive canvas, the object insertion menu comprising selectable representations corresponding to multiple different object types which may be inserted into the interactive canvas within the closed shape; and
in response to receiving a user selection of a selectable representation associated with an object type from the object insertion menu, display an object insertion control associated with the selected object type in the object insertion menu, the object insertion control comprising additional selectable representations corresponding to objects associated with the selected object type which are selectable to insert a respective object into the interactive canvas within the closed shape. 15. The computing device of claim 14, further comprising instructions that are executable by the at least one processor to receive a user selection of one of the additional selectable representations and from the object insertion control and insert the respective object associated with the selected additional selectable control into the interactive canvas within the closed shape. 16. The computing device of claim 14, wherein the object insertion menu displays selectable representations corresponding to a first subset of object types, and wherein the object insertion menu includes a navigation control that is selectable to cause display of additional selectable representations corresponding to at least a second subset of object types. 17. The computing device of claim 14, further comprising digitizing and displaying the user input corresponding to the closed shape on the interactive canvas. 18. The computing device of claim 17, wherein the object insertion menu is displayed within the closed shape. 19. The computing device of claim 17, wherein the object insertion menu is displayed proximate the closed shape on the interactive canvas. 20. The computing device of claim 17, wherein the object insertion menu is displayed at a fixed location of the interactive canvas. | 2,100 |
6,167 | 6,167 | 14,090,010 | 2,179 | An embodiment provides a method, including: detecting, at an information handling device, a trigger event for insertion of an emoticon into a messaging application; providing, using a processor of the information handling device, an emoticon derived from one or more of an image of a user and a gesture of a user; after the trigger has been detected, inserting, using the processor, the emoticon into the text portion of the chat application. Other aspects are described and claimed. | 1. A method, comprising:
detecting, at an information handling device, a trigger event for insertion of an emoticon into a messaging application; providing, using a processor of the information handling device, an emoticon derived from one or more of an image of a user and a gesture of a user; after the trigger has been detected, inserting, using the processor, the emoticon into the text portion of the chat application. 2. The method 1, further comprising:
capturing, with an optical sensor of the information handling device, an image of the user; and generating the emoticon using the image captured. 3. The method of claim 2, wherein generating the emoticon using the image of the user comprises converting the image into a cartoon version. 4. The method of claim 1, wherein the trigger event is selected from the group of events consisting of a predefined key input combination, a gesture, and a user input to a graphical user interface. 5. The method of claim 4, wherein the emoticon is matched to at least a portion of the predefined key input combination. 6. The method of claim 5, wherein providing an emoticon comprises providing two or more emoticons comprising a stock emoticon matched to the predefined key input and an image derived emoticon matched to at least a portion of the key input. 7. The method of claim 1, further comprising:
providing an analysis of one or more of a gesture of the user, text input to the chat application by the user and chat messages received by the chat application from another user; wherein the emoticon is modified based on the analysis. 8. The method of claim 7, wherein the emoticon is modified to match a context derived from the analysis. 9. The method of claim 2, wherein the optical sensor captures the image of the user responsive to the trigger event. 10. The method of claim 9, wherein the emoticon is provided automatically responsive to the trigger event. 11. An information handling device, comprising:
a display device; a processor; and a memory device storing instructions executable by the processor to: detect a trigger event for insertion of an emoticon into a messaging application; provide an emoticon derived from one or more of an image of a user and a gesture of a user; after the trigger has been detected, insert the emoticon into the text portion of the chat application. 12. The information handling device 11, wherein the instructions are further executable by the processor to:
capture, with an optical sensor of the information handling device, an image of the user; and generate the emoticon using the image captured. 13. The information handling device of claim 12, wherein the emoticon generated using the image of the user is generated via converting the image into a cartoon version. 14. The information handling device of claim 11, wherein the trigger event is selected from the group of events consisting of a predefined key input combination, a gesture, and a user input to a graphical user interface. 15. The information handling device of claim 14, wherein the emoticon is matched to at least a portion of the predefined key input combination. 16. The information handling device of claim 15, wherein to provide an emoticon comprises providing two or more emoticons comprising a stock emoticon matched to the predefined key input and an image derived emoticon matched to at least a portion of the key input. 17. The information handling device of claim 1, wherein the instructions are further executable by the processor to:
provide an analysis of one or more of a gesture of the user, text input to the chat application by the user and chat messages received by the chat application from another user; wherein the emoticon is modified based on the analysis. 18. The information handling device of claim 17, wherein the emoticon is modified to match a context derived from the analysis. 19. The information handling device of claim 12, wherein the optical sensor captures the image of the user responsive to the trigger event. 20. A product, comprising:
a computer readable storage device having computer readable program code stored therewith, the computer readable program code comprising: computer readable program code configured to detect, at an information handling device, a trigger event for insertion of an emoticon into a messaging application; computer readable program code configured to provide, using a processor of the information handling device, an emoticon derived from one or more of an image of a user and a gesture of a user; computer readable program code configured to, after the trigger has been detected, insert, using the processor, the emoticon into the text portion of the chat application. | An embodiment provides a method, including: detecting, at an information handling device, a trigger event for insertion of an emoticon into a messaging application; providing, using a processor of the information handling device, an emoticon derived from one or more of an image of a user and a gesture of a user; after the trigger has been detected, inserting, using the processor, the emoticon into the text portion of the chat application. Other aspects are described and claimed.1. A method, comprising:
detecting, at an information handling device, a trigger event for insertion of an emoticon into a messaging application; providing, using a processor of the information handling device, an emoticon derived from one or more of an image of a user and a gesture of a user; after the trigger has been detected, inserting, using the processor, the emoticon into the text portion of the chat application. 2. The method 1, further comprising:
capturing, with an optical sensor of the information handling device, an image of the user; and generating the emoticon using the image captured. 3. The method of claim 2, wherein generating the emoticon using the image of the user comprises converting the image into a cartoon version. 4. The method of claim 1, wherein the trigger event is selected from the group of events consisting of a predefined key input combination, a gesture, and a user input to a graphical user interface. 5. The method of claim 4, wherein the emoticon is matched to at least a portion of the predefined key input combination. 6. The method of claim 5, wherein providing an emoticon comprises providing two or more emoticons comprising a stock emoticon matched to the predefined key input and an image derived emoticon matched to at least a portion of the key input. 7. The method of claim 1, further comprising:
providing an analysis of one or more of a gesture of the user, text input to the chat application by the user and chat messages received by the chat application from another user; wherein the emoticon is modified based on the analysis. 8. The method of claim 7, wherein the emoticon is modified to match a context derived from the analysis. 9. The method of claim 2, wherein the optical sensor captures the image of the user responsive to the trigger event. 10. The method of claim 9, wherein the emoticon is provided automatically responsive to the trigger event. 11. An information handling device, comprising:
a display device; a processor; and a memory device storing instructions executable by the processor to: detect a trigger event for insertion of an emoticon into a messaging application; provide an emoticon derived from one or more of an image of a user and a gesture of a user; after the trigger has been detected, insert the emoticon into the text portion of the chat application. 12. The information handling device 11, wherein the instructions are further executable by the processor to:
capture, with an optical sensor of the information handling device, an image of the user; and generate the emoticon using the image captured. 13. The information handling device of claim 12, wherein the emoticon generated using the image of the user is generated via converting the image into a cartoon version. 14. The information handling device of claim 11, wherein the trigger event is selected from the group of events consisting of a predefined key input combination, a gesture, and a user input to a graphical user interface. 15. The information handling device of claim 14, wherein the emoticon is matched to at least a portion of the predefined key input combination. 16. The information handling device of claim 15, wherein to provide an emoticon comprises providing two or more emoticons comprising a stock emoticon matched to the predefined key input and an image derived emoticon matched to at least a portion of the key input. 17. The information handling device of claim 1, wherein the instructions are further executable by the processor to:
provide an analysis of one or more of a gesture of the user, text input to the chat application by the user and chat messages received by the chat application from another user; wherein the emoticon is modified based on the analysis. 18. The information handling device of claim 17, wherein the emoticon is modified to match a context derived from the analysis. 19. The information handling device of claim 12, wherein the optical sensor captures the image of the user responsive to the trigger event. 20. A product, comprising:
a computer readable storage device having computer readable program code stored therewith, the computer readable program code comprising: computer readable program code configured to detect, at an information handling device, a trigger event for insertion of an emoticon into a messaging application; computer readable program code configured to provide, using a processor of the information handling device, an emoticon derived from one or more of an image of a user and a gesture of a user; computer readable program code configured to, after the trigger has been detected, insert, using the processor, the emoticon into the text portion of the chat application. | 2,100 |
6,168 | 6,168 | 15,481,583 | 2,169 | One embodiment provides a method, comprising: receiving, at an information handling device, an indication to begin an interaction session, wherein the interaction session comprises receiving at least one user input and providing at least one output responsive to the at least one user input; determining, using a processor, if the interaction session has concluded; and responsive to determining that the interaction session has not concluded, receiving another at least one user input and providing another at least one output responsive to the another at least one user input. Other aspects are described and claimed. | 1. A method, comprising:
receiving, at an information handling device, an indication to begin an interaction session, wherein the interaction session comprises receiving at least one user input and providing at least one output responsive to the at least one user input; determining, using a processor, if the interaction session has concluded; and responsive to determining that the interaction session has not concluded, receiving another at least one user input and providing another at least one output responsive to the another at least one user input. 2. The method of claim 1, wherein the at least one output comprises a suggestion associated with a user query of the at least one user input. 3. The method of claim 1, wherein the at least one output comprises a clarification query associated with a user query of the at least one user input. 4. The method of claim 3, wherein the another at least one user input comprises elaboration input responsive to the clarification query. 5. The method of claim 1, wherein the at least one output comprises a satisfaction query. 6. The method of claim 5, wherein the another at least one user input comprises input responsive to the satisfaction query and wherein the another at least one output comprises at least one of a query and a statement. 7. The method of claim 1, wherein the another at least one user input comprises another user query, wherein the another user query is associated with the at least one output. 8. The method of claim 7, wherein the another user query comprises a clarification query. 9. The method of claim 1, wherein the another at least one output comprises an explanation output associated with the at least one output. 10. The method of claim 9, wherein the explanation output comprises references supporting the at least one output. 11. An information handling device, comprising:
a processor; a memory device that stores instructions executable by the processor to: receive an indication to begin an interaction session, wherein the interaction session comprises receiving at least one user input and providing at least one output responsive to the at least one user input; determine if the interaction session has concluded; and responsive to determining that the interaction session has not concluded, receive another at least one user input and provide another at least one output responsive to the another at least one user input. 12. The information handling device of claim 11, wherein the at least one output comprises a suggestion associated with a user query of the at least one user input. 13. The information handling device of claim 11, wherein the at least one output comprises a clarification query associated with the user query. 14. The information handling device of claim 13, wherein the another at least one user input comprises elaboration input responsive to the clarification query. 15. The information handling device of claim 11, wherein the at least one output comprises a satisfaction query. 16. The information handling device of claim 15, wherein the another at least one user input comprises input responsive to the satisfaction query and wherein the another at least one output comprises at least one of a query and a statement. 17. The information handling device of claim 11, wherein the another at least one user input comprises another user query, wherein the another user query is associated with the at least one output. 18. The information handling device of claim 17, wherein the another at least one user query comprises a clarification query. 19. The information handling device of claim 11, wherein the another at least one output comprises an explanation output associated with the at least one output. 20. A product, comprising:
a storage device that stores code, the code being executable by a processor and comprising: code that receives an indication to begin an interaction session, wherein the interaction session comprises receiving at least one user input an providing at least one output responsive to the at least one user input; code that determines if the interaction session has concluded; and code that receives, responsive to determining that the interaction session has not concluded, another at least one user input and providing another at least one output responsive to the another at least one user input. | One embodiment provides a method, comprising: receiving, at an information handling device, an indication to begin an interaction session, wherein the interaction session comprises receiving at least one user input and providing at least one output responsive to the at least one user input; determining, using a processor, if the interaction session has concluded; and responsive to determining that the interaction session has not concluded, receiving another at least one user input and providing another at least one output responsive to the another at least one user input. Other aspects are described and claimed.1. A method, comprising:
receiving, at an information handling device, an indication to begin an interaction session, wherein the interaction session comprises receiving at least one user input and providing at least one output responsive to the at least one user input; determining, using a processor, if the interaction session has concluded; and responsive to determining that the interaction session has not concluded, receiving another at least one user input and providing another at least one output responsive to the another at least one user input. 2. The method of claim 1, wherein the at least one output comprises a suggestion associated with a user query of the at least one user input. 3. The method of claim 1, wherein the at least one output comprises a clarification query associated with a user query of the at least one user input. 4. The method of claim 3, wherein the another at least one user input comprises elaboration input responsive to the clarification query. 5. The method of claim 1, wherein the at least one output comprises a satisfaction query. 6. The method of claim 5, wherein the another at least one user input comprises input responsive to the satisfaction query and wherein the another at least one output comprises at least one of a query and a statement. 7. The method of claim 1, wherein the another at least one user input comprises another user query, wherein the another user query is associated with the at least one output. 8. The method of claim 7, wherein the another user query comprises a clarification query. 9. The method of claim 1, wherein the another at least one output comprises an explanation output associated with the at least one output. 10. The method of claim 9, wherein the explanation output comprises references supporting the at least one output. 11. An information handling device, comprising:
a processor; a memory device that stores instructions executable by the processor to: receive an indication to begin an interaction session, wherein the interaction session comprises receiving at least one user input and providing at least one output responsive to the at least one user input; determine if the interaction session has concluded; and responsive to determining that the interaction session has not concluded, receive another at least one user input and provide another at least one output responsive to the another at least one user input. 12. The information handling device of claim 11, wherein the at least one output comprises a suggestion associated with a user query of the at least one user input. 13. The information handling device of claim 11, wherein the at least one output comprises a clarification query associated with the user query. 14. The information handling device of claim 13, wherein the another at least one user input comprises elaboration input responsive to the clarification query. 15. The information handling device of claim 11, wherein the at least one output comprises a satisfaction query. 16. The information handling device of claim 15, wherein the another at least one user input comprises input responsive to the satisfaction query and wherein the another at least one output comprises at least one of a query and a statement. 17. The information handling device of claim 11, wherein the another at least one user input comprises another user query, wherein the another user query is associated with the at least one output. 18. The information handling device of claim 17, wherein the another at least one user query comprises a clarification query. 19. The information handling device of claim 11, wherein the another at least one output comprises an explanation output associated with the at least one output. 20. A product, comprising:
a storage device that stores code, the code being executable by a processor and comprising: code that receives an indication to begin an interaction session, wherein the interaction session comprises receiving at least one user input an providing at least one output responsive to the at least one user input; code that determines if the interaction session has concluded; and code that receives, responsive to determining that the interaction session has not concluded, another at least one user input and providing another at least one output responsive to the another at least one user input. | 2,100 |
6,169 | 6,169 | 14,944,340 | 2,181 | There is provided an interconnect for transferring requests between ports in which the ports include both source ports destination ports. The interconnect includes storage circuitry for storing the requests. Input circuitry receives the requests from the plurality of source ports, selects at least one selected source port from an allowed set of said plurality of source ports, and transfers a presented request from the at least one selected source port to the storage circuitry. Output circuitry causes a request in said storage circuitry to be output at one of said plurality of destination ports. Counter circuitry maintains counter values for a plurality of tracked ports from amongst said ports, each counter value indicating the number of requests in said storage circuitry associated with a corresponding tracked port that are waiting to be output by said output circuitry and filter circuitry determines whether or not a given source port is in said allowed set in dependence on said counter circuitry. | 1. An interconnect to transfer requests between ports, the ports comprising a plurality of source ports and a plurality of destination ports, the interconnect comprising:
storage circuitry to store said requests; input circuitry to receive said requests from said plurality of source ports, to select at least one selected source port from an allowed set of said plurality of source ports, and to transfer a presented request from said at least one selected source port to said storage circuitry; output circuitry to cause a request in said storage circuitry to be output at one of said plurality of destination ports; counter circuitry to maintain counter values for a plurality of tracked ports from amongst said ports, each counter value indicating the number of requests in said storage circuitry associated with a corresponding tracked port that are waiting to be output by said output circuitry; and filter circuitry to determine whether or not a given source port is in said allowed set in dependence on said counter circuitry. 2. An interconnect according to claim 1, wherein
said plurality of tracked ports comprise said plurality of source ports; and said counter value corresponds to the number of requests stored in the storage circuitry that have been sent by that source port that have not yet been output by said output circuitry. 3. An interconnect according to claim 1, wherein the counter circuitry comprises:
first adjustment circuitry to adjust the counter value associated with a port in a first direction in response to said presented request being associated with said port. 4. An interconnect according to claim 3, wherein
said first direction is towards zero. 5. An interconnect according to claim 3, wherein the counter circuitry comprises:
second adjustment circuitry to adjust the counter value associated with a port in a second direction opposite to said first direction in response to a request associated with said port being output by said output circuitry. 6. An interconnect according to claim 1, wherein the output circuitry comprises:
further output circuitry to cause a request in said storage circuitry to be output at one of said plurality of source ports. 7. An interconnect according to claim 6, wherein
said further output circuitry outputs said request at said one of said plurality of source ports in accordance with a cache coherency protocol. 8. An interconnect according to claim 6, wherein
said further output circuitry outputs said request at said one of said plurality of source ports in response to a master device, connected to one of said plurality of source ports, comprising a cache that comprises a data value that is related to said request. 9. An interconnect according to claim 1, wherein
said filter circuitry determines that a tracked port is in said allowed set in dependence on said counter value for said tracked port reaching a threshold value associated with that source port. 10. An interconnect according to claim 9, wherein
said threshold value is different for at least some of said plurality of tracked ports. 11. An interconnect according to claim 1, wherein
said counter circuitry maintains a plurality of flags each associated with one of said ports, wherein a flag associated with a port is set in dependence on said counter value associated with said port; said filter circuitry determines that a particular port is in said allowed set in dependence on whether or not said flag associated with said particular port is set. 12. An interconnect according to claim 9, wherein
said threshold value is chosen having regard to balancing the inhibition of head-of-line blocking amongst said plurality of source ports. 13. An interconnect according to claim 9, wherein
said threshold value is chosen so at to allow at least one request from each port to be stored in said storage circuitry and waiting to be output by said output circuitry. 14. An interconnect to transfer requests between ports, the ports comprising a plurality of source ports and a plurality of destination ports, the interconnect comprising:
storage means for storing said requests; input means for receiving said requests from said plurality of source ports, for selecting at least one selected source port from an allowed set of said plurality of source ports, and for transferring a presented request from said at least one selected source port to said storage means; output means for causing a request in said storage means to be output at one of said plurality of destination ports; counter means for maintaining counter values for a plurality of tracked ports from amongst said ports, each counter value indicating the number of requests in said storage means associated with a corresponding tracked port that are waiting to be output by said output means; and filter means for determining whether or not a given source port is in said allowed set in dependence on said counter circuitry. 15. A method of transferring requests between ports, the ports comprising a plurality of source ports and a plurality of destination ports, the method comprising the steps:
receiving said requests from said plurality of source ports; selecting at least one sleeted source port from an allowed set of said plurality of source ports; transferring a presented request from said at least one selected source port to storage circuitry; outputting, at one of said plurality of destination ports, a request in said storage circuitry; maintaining counter values for a plurality of tracked ports from amongst said ports, each counter value indicating the number of requests in said storage circuitry associated with a corresponding tracked port that are waiting to be output, wherein it is determined whether or not a given source port is in said allowed set in dependence on said counter values. | There is provided an interconnect for transferring requests between ports in which the ports include both source ports destination ports. The interconnect includes storage circuitry for storing the requests. Input circuitry receives the requests from the plurality of source ports, selects at least one selected source port from an allowed set of said plurality of source ports, and transfers a presented request from the at least one selected source port to the storage circuitry. Output circuitry causes a request in said storage circuitry to be output at one of said plurality of destination ports. Counter circuitry maintains counter values for a plurality of tracked ports from amongst said ports, each counter value indicating the number of requests in said storage circuitry associated with a corresponding tracked port that are waiting to be output by said output circuitry and filter circuitry determines whether or not a given source port is in said allowed set in dependence on said counter circuitry.1. An interconnect to transfer requests between ports, the ports comprising a plurality of source ports and a plurality of destination ports, the interconnect comprising:
storage circuitry to store said requests; input circuitry to receive said requests from said plurality of source ports, to select at least one selected source port from an allowed set of said plurality of source ports, and to transfer a presented request from said at least one selected source port to said storage circuitry; output circuitry to cause a request in said storage circuitry to be output at one of said plurality of destination ports; counter circuitry to maintain counter values for a plurality of tracked ports from amongst said ports, each counter value indicating the number of requests in said storage circuitry associated with a corresponding tracked port that are waiting to be output by said output circuitry; and filter circuitry to determine whether or not a given source port is in said allowed set in dependence on said counter circuitry. 2. An interconnect according to claim 1, wherein
said plurality of tracked ports comprise said plurality of source ports; and said counter value corresponds to the number of requests stored in the storage circuitry that have been sent by that source port that have not yet been output by said output circuitry. 3. An interconnect according to claim 1, wherein the counter circuitry comprises:
first adjustment circuitry to adjust the counter value associated with a port in a first direction in response to said presented request being associated with said port. 4. An interconnect according to claim 3, wherein
said first direction is towards zero. 5. An interconnect according to claim 3, wherein the counter circuitry comprises:
second adjustment circuitry to adjust the counter value associated with a port in a second direction opposite to said first direction in response to a request associated with said port being output by said output circuitry. 6. An interconnect according to claim 1, wherein the output circuitry comprises:
further output circuitry to cause a request in said storage circuitry to be output at one of said plurality of source ports. 7. An interconnect according to claim 6, wherein
said further output circuitry outputs said request at said one of said plurality of source ports in accordance with a cache coherency protocol. 8. An interconnect according to claim 6, wherein
said further output circuitry outputs said request at said one of said plurality of source ports in response to a master device, connected to one of said plurality of source ports, comprising a cache that comprises a data value that is related to said request. 9. An interconnect according to claim 1, wherein
said filter circuitry determines that a tracked port is in said allowed set in dependence on said counter value for said tracked port reaching a threshold value associated with that source port. 10. An interconnect according to claim 9, wherein
said threshold value is different for at least some of said plurality of tracked ports. 11. An interconnect according to claim 1, wherein
said counter circuitry maintains a plurality of flags each associated with one of said ports, wherein a flag associated with a port is set in dependence on said counter value associated with said port; said filter circuitry determines that a particular port is in said allowed set in dependence on whether or not said flag associated with said particular port is set. 12. An interconnect according to claim 9, wherein
said threshold value is chosen having regard to balancing the inhibition of head-of-line blocking amongst said plurality of source ports. 13. An interconnect according to claim 9, wherein
said threshold value is chosen so at to allow at least one request from each port to be stored in said storage circuitry and waiting to be output by said output circuitry. 14. An interconnect to transfer requests between ports, the ports comprising a plurality of source ports and a plurality of destination ports, the interconnect comprising:
storage means for storing said requests; input means for receiving said requests from said plurality of source ports, for selecting at least one selected source port from an allowed set of said plurality of source ports, and for transferring a presented request from said at least one selected source port to said storage means; output means for causing a request in said storage means to be output at one of said plurality of destination ports; counter means for maintaining counter values for a plurality of tracked ports from amongst said ports, each counter value indicating the number of requests in said storage means associated with a corresponding tracked port that are waiting to be output by said output means; and filter means for determining whether or not a given source port is in said allowed set in dependence on said counter circuitry. 15. A method of transferring requests between ports, the ports comprising a plurality of source ports and a plurality of destination ports, the method comprising the steps:
receiving said requests from said plurality of source ports; selecting at least one sleeted source port from an allowed set of said plurality of source ports; transferring a presented request from said at least one selected source port to storage circuitry; outputting, at one of said plurality of destination ports, a request in said storage circuitry; maintaining counter values for a plurality of tracked ports from amongst said ports, each counter value indicating the number of requests in said storage circuitry associated with a corresponding tracked port that are waiting to be output, wherein it is determined whether or not a given source port is in said allowed set in dependence on said counter values. | 2,100 |
6,170 | 6,170 | 15,481,201 | 2,184 | An apparatus includes multiple computing cores, where each computing core is configured to perform one or more processing operations and generate input data. The apparatus also includes multiple coprocessors associated with each computing core, where each coprocessor is configured to receive the input data from at least one of the computing cores, process the input data, and generate output data. The apparatus further includes multiple reducer circuits, where each reducer circuit is configured to receive the output data from each of the coprocessors of an associated computing core, apply one or more functions to the output data, and provide one or more results to the associated computing core. In addition, the apparatus includes multiple communication links communicatively coupling the computing cores and the coprocessors associated with the computing cores. | 1. An apparatus comprising:
multiple computing cores, each computing core configured to perform one or more processing operations and generate input data; multiple coprocessors associated with each computing core, each coprocessor configured to receive the input data from at least one of the computing cores, process the input data, and generate output data; multiple reducer circuits, each reducer circuit configured to receive the output data from each of the coprocessors of an associated computing core, apply one or more functions to the output data, and provide one or more results to the associated computing core; and multiple communication links communicatively coupling the computing cores and the coprocessors associated with the computing cores. 2. The apparatus of claim 1, wherein the communication links comprise direct connections between the computing cores and their associated coprocessors. 3. The apparatus of claim 1, wherein, for each computing core:
the coprocessors associated with that computing core are linked together in one or more chains; and the communication links comprise one or more direct connections between that computing core and one or more coprocessors at a beginning of the one or more chains. 4. The apparatus of claim 1, wherein, for each computing core:
the communication links comprise a direct connection between that computing core and one of the coprocessors associated with that computing core; and the one of the coprocessors is coupled to multiple additional coprocessors associated with that computing core. 5. The apparatus of claim 1, wherein the coprocessors associated with each of the computing cores are arranged in a tree. 6. The apparatus of claim 1, wherein the communication links comprise links to a shared resource, the shared resource configured to store the input data from the computing cores and to provide the input data to the coprocessors. 7. The apparatus of claim 6, wherein the shared resource comprises a shared memory. 8. The apparatus of claim 7, wherein:
the shared memory comprises multiple memory locations having multiple memory addresses; the computing cores are configured to write the input data to different memory addresses; and the coprocessors are configured to read the input data from the different memory addresses. 9. An apparatus comprising:
multiple computing cores, each computing core configured to perform one or more processing operations and generate input data; multiple coprocessors associated with each computing core, each coprocessor configured to receive the input data from at least one of the computing cores, process the input data, and generate output data; and multiple communication links communicatively coupling the computing cores and the coprocessors associated with the computing cores; wherein the coprocessors in a subset of the coprocessors for each computing core are also configured to collectively apply one or more functions to the output data, one of the coprocessors in the subset further configured to provide one or more results to the associated computing core. 10. The apparatus of claim 9, wherein the communication links comprise direct connections between the computing cores and their associated coprocessors. 11. The apparatus of claim 9, wherein, for each computing core:
the coprocessors associated with that computing core are linked together in one or more chains; and the communication links comprise one or more direct connections between that computing core and one or more coprocessors at a beginning of the one or more chains. 12. The apparatus of claim 9, wherein, for each computing core:
the communication links comprise a direct connection between that computing core and one of the coprocessors associated with that computing core; and the one of the coprocessors is coupled to multiple additional coprocessors associated with that computing core. 13. The apparatus of claim 9, wherein the coprocessors associated with each of the computing cores are arranged in a tree. 14. The apparatus of claim 9, wherein the communication links comprise links to a shared resource, the shared resource configured to store the input data from the computing cores and to provide the input data to the coprocessors. 15. The apparatus of claim 14, wherein the shared resource comprises a shared memory. 16. The apparatus of claim 15, wherein:
the shared memory comprises multiple memory locations having multiple memory addresses; the computing cores are configured to write the input data to different memory addresses; and the coprocessors are configured to read the input data from the different memory addresses. 17. An apparatus comprising:
N parallel computing cores, each computing core configured to perform one or more processing operations and generate input data; N×N coprocessors, wherein each computing core is associated with N parallel coprocessors, each coprocessor configured to receive the input data from at least one of the computing cores, process the input data, and generate output data; N reducer circuits, each computing core associated with one of the reducer circuits, each reducer circuit configured to receive the output data from each of the coprocessors of the associated computing core, apply one or more functions to the output data, and provide one or more results to the associated computing core; and multiple communication links communicatively coupling the computing cores and the coprocessors associated with the computing cores. 18. The apparatus of claim 17, wherein N is an integer having a value of at least sixteen. 19. The apparatus of claim 17, wherein the communication links comprise links to a shared resource, the shared resource configured to store the input data from the computing cores and to provide the input data to the coprocessors. 20. The apparatus of claim 19, wherein:
the shared resource comprises a shared memory; the shared memory comprises multiple memory locations having multiple memory addresses; the computing cores are configured to write the input data to different memory addresses; and the coprocessors are configured to read the input data from the different memory addresses. | An apparatus includes multiple computing cores, where each computing core is configured to perform one or more processing operations and generate input data. The apparatus also includes multiple coprocessors associated with each computing core, where each coprocessor is configured to receive the input data from at least one of the computing cores, process the input data, and generate output data. The apparatus further includes multiple reducer circuits, where each reducer circuit is configured to receive the output data from each of the coprocessors of an associated computing core, apply one or more functions to the output data, and provide one or more results to the associated computing core. In addition, the apparatus includes multiple communication links communicatively coupling the computing cores and the coprocessors associated with the computing cores.1. An apparatus comprising:
multiple computing cores, each computing core configured to perform one or more processing operations and generate input data; multiple coprocessors associated with each computing core, each coprocessor configured to receive the input data from at least one of the computing cores, process the input data, and generate output data; multiple reducer circuits, each reducer circuit configured to receive the output data from each of the coprocessors of an associated computing core, apply one or more functions to the output data, and provide one or more results to the associated computing core; and multiple communication links communicatively coupling the computing cores and the coprocessors associated with the computing cores. 2. The apparatus of claim 1, wherein the communication links comprise direct connections between the computing cores and their associated coprocessors. 3. The apparatus of claim 1, wherein, for each computing core:
the coprocessors associated with that computing core are linked together in one or more chains; and the communication links comprise one or more direct connections between that computing core and one or more coprocessors at a beginning of the one or more chains. 4. The apparatus of claim 1, wherein, for each computing core:
the communication links comprise a direct connection between that computing core and one of the coprocessors associated with that computing core; and the one of the coprocessors is coupled to multiple additional coprocessors associated with that computing core. 5. The apparatus of claim 1, wherein the coprocessors associated with each of the computing cores are arranged in a tree. 6. The apparatus of claim 1, wherein the communication links comprise links to a shared resource, the shared resource configured to store the input data from the computing cores and to provide the input data to the coprocessors. 7. The apparatus of claim 6, wherein the shared resource comprises a shared memory. 8. The apparatus of claim 7, wherein:
the shared memory comprises multiple memory locations having multiple memory addresses; the computing cores are configured to write the input data to different memory addresses; and the coprocessors are configured to read the input data from the different memory addresses. 9. An apparatus comprising:
multiple computing cores, each computing core configured to perform one or more processing operations and generate input data; multiple coprocessors associated with each computing core, each coprocessor configured to receive the input data from at least one of the computing cores, process the input data, and generate output data; and multiple communication links communicatively coupling the computing cores and the coprocessors associated with the computing cores; wherein the coprocessors in a subset of the coprocessors for each computing core are also configured to collectively apply one or more functions to the output data, one of the coprocessors in the subset further configured to provide one or more results to the associated computing core. 10. The apparatus of claim 9, wherein the communication links comprise direct connections between the computing cores and their associated coprocessors. 11. The apparatus of claim 9, wherein, for each computing core:
the coprocessors associated with that computing core are linked together in one or more chains; and the communication links comprise one or more direct connections between that computing core and one or more coprocessors at a beginning of the one or more chains. 12. The apparatus of claim 9, wherein, for each computing core:
the communication links comprise a direct connection between that computing core and one of the coprocessors associated with that computing core; and the one of the coprocessors is coupled to multiple additional coprocessors associated with that computing core. 13. The apparatus of claim 9, wherein the coprocessors associated with each of the computing cores are arranged in a tree. 14. The apparatus of claim 9, wherein the communication links comprise links to a shared resource, the shared resource configured to store the input data from the computing cores and to provide the input data to the coprocessors. 15. The apparatus of claim 14, wherein the shared resource comprises a shared memory. 16. The apparatus of claim 15, wherein:
the shared memory comprises multiple memory locations having multiple memory addresses; the computing cores are configured to write the input data to different memory addresses; and the coprocessors are configured to read the input data from the different memory addresses. 17. An apparatus comprising:
N parallel computing cores, each computing core configured to perform one or more processing operations and generate input data; N×N coprocessors, wherein each computing core is associated with N parallel coprocessors, each coprocessor configured to receive the input data from at least one of the computing cores, process the input data, and generate output data; N reducer circuits, each computing core associated with one of the reducer circuits, each reducer circuit configured to receive the output data from each of the coprocessors of the associated computing core, apply one or more functions to the output data, and provide one or more results to the associated computing core; and multiple communication links communicatively coupling the computing cores and the coprocessors associated with the computing cores. 18. The apparatus of claim 17, wherein N is an integer having a value of at least sixteen. 19. The apparatus of claim 17, wherein the communication links comprise links to a shared resource, the shared resource configured to store the input data from the computing cores and to provide the input data to the coprocessors. 20. The apparatus of claim 19, wherein:
the shared resource comprises a shared memory; the shared memory comprises multiple memory locations having multiple memory addresses; the computing cores are configured to write the input data to different memory addresses; and the coprocessors are configured to read the input data from the different memory addresses. | 2,100 |
6,171 | 6,171 | 14,763,518 | 2,119 | Automation agents are utilized to modify operating characteristics of a client, such as a piece of equipment. An operating characteristic of equipment can be selectively adjusted by modification of a set point value, which is associated with the operating characteristic of the equipment. The equipment can adjust the operating characteristic based upon the set point value. A remote control indication can be provided to indicate when a set point value is available for modification. The remote control indication is adjustable by an execution module associated with the equipment. A set point latch can be provided for indicating when the set point value is modifiable by an automation agent. | 1. A method comprising:
selectively adjusting an operating characteristic of equipment by modification of a set point value, the set point value associated with the operating characteristic of the equipment, the equipment for adjusting the operating characteristic based upon the set point value; providing a remote control indication, the remote control indication for indicating when a set point value is available for modification, the remote control indication adjusted by an execution module associated with the equipment; and providing a set point latch, the set point latch representing a value for indicating when the set point value is to be modified by an automation agent, the automation agent to automatically adjust the operating characteristic by modification of the set point value when the set point latch is latched. 2. The method as recited in claim 1, further comprising receiving a fail-safe value corresponding to the operating characteristic, wherein the execution module adjusts the operating characteristic based upon a fail-safe value when a fail-safe event is detected. 3. The method as recited in claim 1, wherein the set point latch comprises a Boolean value. 4. The method as recited in claim 1, wherein the remote control indication is a Boolean value. 5. The method as recited in claim 3, further comprising adjusting the operating characteristic of the equipment when the set point latch comprises a true Boolean value. 6. The method as recited in claim 1, wherein the operating characteristic comprises at least one of a drill revolutions per minute, a mud pump flow rate, a torque, a throttle position, a maximum torque, a direction, or an automation routine. 7. A computing device comprising:
a memory for storing one or more modules; a processor communicatively coupled to the memory, the processor for executing the one or more modules to cause the processor to:
selectively adjust an operating characteristic of equipment by modification of a set point value, the set point value associated with the operating characteristic of the equipment, the equipment for adjusting the operating characteristic based upon the set point value;
providing a remote control indication, the remote control indication for indicating when a set point value is available for modification, the remote control indication adjusted by an execution module associated with the equipment;
providing a set point latch, the set point latch a value for indicating when the set point value is modifiable by an automation agent, the automation agent to automatically adjust the operating characteristic by modification of the set point value when the set point latch is latched. 8. The computing device as recited in claim 7, wherein the processor executes the one or more modules to cause the processor to furnish a user interface operable to selectively adjust the operating characteristic by modification of the set point value, the user interface configured to furnish an indication when the set point value is to be modified by the automation agent. 9. The computing device as recited in claim 7, wherein the processor executes the one or more modules to cause the processor to furnish a fail-safe value to the equipment, the fail safe value corresponding to the operating characteristic, wherein the execution module adjusts the operating characteristic based upon a fail-safe value when a fail-safe event is detected. 10. The computing device as recited in claim 7, wherein the set point latch comprises a Boolean value, and the remote control indication comprises a Boolean value. 11. The computing device as recited in claim 10, wherein the processor executes the one or more modules to cause the processor to adjust the operating characteristic of the equipment when the set point latch comprises a true Boolean value. 12. The computing device as recited in claim 7, wherein the operating characteristic comprises at least one of a drill revolutions per minute, a mud pump flow rate, a torque, a throttle position, a maximum torque, a direction, or an automation routine. 13. The computing device as recited in claim 7, wherein the equipment comprises at least one of a drill, a mud pump, a hoist, a rotary device, a choke, a valve, a blowout preventer, an auto-driller, or an alarm device. 14. A system comprising:
equipment having a memory for storing a set point value associated with an operating characteristic of the equipment, the equipment operable to adjust the operating characteristic based upon the set point value, the memory also storing a set point latch associated with the set point value; an automation agent for automatically adjusting the operating characteristic by modification of the set point value, the set point latch indicating when the set point value is to be modified by the automation agent; and an execution module operatively coupled with the equipment to selectively adjust the operating characteristic by modification of the set point value, wherein the execution module applies the set point value when the set point latch is latched and the set point value is available for remote control as indicated by a remote control indication. 15. The system as recited in claim 14, wherein the execution module furnishes a user interface operable to selectively adjust the operating characteristic by modification of the set point value, the user interface configured to furnish an indication when the set point value is to be modified by the automation agent, wherein the user interface receives a user remote control command indicating that remote control is allowed. 16. The system as recited in claim 14, wherein the execution module adjusts the operating characteristic based upon a fail-safe value when a fail-safe event is detected, the failsafe value corresponding to the operating characteristic. 17. The system as recited in claim 14, wherein the set point latch comprises a Boolean value. 18. The system as recited in claim 18, wherein the execution module adjusts the operating characteristic of the equipment using the set point value provided by the automation agent when the set point latch comprises a true Boolean value. 19. The system as recited in claim 14, wherein the operating characteristic comprises at least one of a drill revolutions per minute, a mud pump flow rate, a torque, a throttle position, a maximum torque, a direction, or an automation routine. 20. The system as recited in claim 14, wherein the equipment comprises at least one of a drill, a mud pump, a hoist, a rotary device, a choke, a valve, a blowout preventer, an auto-driller, or an alarm device. | Automation agents are utilized to modify operating characteristics of a client, such as a piece of equipment. An operating characteristic of equipment can be selectively adjusted by modification of a set point value, which is associated with the operating characteristic of the equipment. The equipment can adjust the operating characteristic based upon the set point value. A remote control indication can be provided to indicate when a set point value is available for modification. The remote control indication is adjustable by an execution module associated with the equipment. A set point latch can be provided for indicating when the set point value is modifiable by an automation agent.1. A method comprising:
selectively adjusting an operating characteristic of equipment by modification of a set point value, the set point value associated with the operating characteristic of the equipment, the equipment for adjusting the operating characteristic based upon the set point value; providing a remote control indication, the remote control indication for indicating when a set point value is available for modification, the remote control indication adjusted by an execution module associated with the equipment; and providing a set point latch, the set point latch representing a value for indicating when the set point value is to be modified by an automation agent, the automation agent to automatically adjust the operating characteristic by modification of the set point value when the set point latch is latched. 2. The method as recited in claim 1, further comprising receiving a fail-safe value corresponding to the operating characteristic, wherein the execution module adjusts the operating characteristic based upon a fail-safe value when a fail-safe event is detected. 3. The method as recited in claim 1, wherein the set point latch comprises a Boolean value. 4. The method as recited in claim 1, wherein the remote control indication is a Boolean value. 5. The method as recited in claim 3, further comprising adjusting the operating characteristic of the equipment when the set point latch comprises a true Boolean value. 6. The method as recited in claim 1, wherein the operating characteristic comprises at least one of a drill revolutions per minute, a mud pump flow rate, a torque, a throttle position, a maximum torque, a direction, or an automation routine. 7. A computing device comprising:
a memory for storing one or more modules; a processor communicatively coupled to the memory, the processor for executing the one or more modules to cause the processor to:
selectively adjust an operating characteristic of equipment by modification of a set point value, the set point value associated with the operating characteristic of the equipment, the equipment for adjusting the operating characteristic based upon the set point value;
providing a remote control indication, the remote control indication for indicating when a set point value is available for modification, the remote control indication adjusted by an execution module associated with the equipment;
providing a set point latch, the set point latch a value for indicating when the set point value is modifiable by an automation agent, the automation agent to automatically adjust the operating characteristic by modification of the set point value when the set point latch is latched. 8. The computing device as recited in claim 7, wherein the processor executes the one or more modules to cause the processor to furnish a user interface operable to selectively adjust the operating characteristic by modification of the set point value, the user interface configured to furnish an indication when the set point value is to be modified by the automation agent. 9. The computing device as recited in claim 7, wherein the processor executes the one or more modules to cause the processor to furnish a fail-safe value to the equipment, the fail safe value corresponding to the operating characteristic, wherein the execution module adjusts the operating characteristic based upon a fail-safe value when a fail-safe event is detected. 10. The computing device as recited in claim 7, wherein the set point latch comprises a Boolean value, and the remote control indication comprises a Boolean value. 11. The computing device as recited in claim 10, wherein the processor executes the one or more modules to cause the processor to adjust the operating characteristic of the equipment when the set point latch comprises a true Boolean value. 12. The computing device as recited in claim 7, wherein the operating characteristic comprises at least one of a drill revolutions per minute, a mud pump flow rate, a torque, a throttle position, a maximum torque, a direction, or an automation routine. 13. The computing device as recited in claim 7, wherein the equipment comprises at least one of a drill, a mud pump, a hoist, a rotary device, a choke, a valve, a blowout preventer, an auto-driller, or an alarm device. 14. A system comprising:
equipment having a memory for storing a set point value associated with an operating characteristic of the equipment, the equipment operable to adjust the operating characteristic based upon the set point value, the memory also storing a set point latch associated with the set point value; an automation agent for automatically adjusting the operating characteristic by modification of the set point value, the set point latch indicating when the set point value is to be modified by the automation agent; and an execution module operatively coupled with the equipment to selectively adjust the operating characteristic by modification of the set point value, wherein the execution module applies the set point value when the set point latch is latched and the set point value is available for remote control as indicated by a remote control indication. 15. The system as recited in claim 14, wherein the execution module furnishes a user interface operable to selectively adjust the operating characteristic by modification of the set point value, the user interface configured to furnish an indication when the set point value is to be modified by the automation agent, wherein the user interface receives a user remote control command indicating that remote control is allowed. 16. The system as recited in claim 14, wherein the execution module adjusts the operating characteristic based upon a fail-safe value when a fail-safe event is detected, the failsafe value corresponding to the operating characteristic. 17. The system as recited in claim 14, wherein the set point latch comprises a Boolean value. 18. The system as recited in claim 18, wherein the execution module adjusts the operating characteristic of the equipment using the set point value provided by the automation agent when the set point latch comprises a true Boolean value. 19. The system as recited in claim 14, wherein the operating characteristic comprises at least one of a drill revolutions per minute, a mud pump flow rate, a torque, a throttle position, a maximum torque, a direction, or an automation routine. 20. The system as recited in claim 14, wherein the equipment comprises at least one of a drill, a mud pump, a hoist, a rotary device, a choke, a valve, a blowout preventer, an auto-driller, or an alarm device. | 2,100 |
6,172 | 6,172 | 15,825,082 | 2,181 | Low cost storage for write once read rarely data is described. In an embodiment a storage device comprises a plurality of hard disk drives connected to a server via an interconnect fabric. The storage device comprises a cooling system which is only capable of cooling a first subset of the hard disk drives and a power supply system which is only capable of powering a second subset of the hard disk drives and in some examples, the interconnect fabric may be only capable of providing full bandwidth for a third subset of the hard disk drives. Each subset may comprise only a small fraction of hard disk drives. A control mechanism, which may be implemented in software, is provided which controls which hard disk drives are active at any time in order that the constraints set by the cooling and power supply systems and interconnect fabric are not violated. | 1. An electronic storage system comprising:
a plurality of computer storage media, each of the plurality of computer storage media having an active state and a non active state; a power supply system capable of providing sufficient power for only a subset of the plurality of computer storage media to be in an active state concurrently; a cooling system provisioned to provide sufficient cooling when operating for only a subset of the plurality of computer storage media to be in an active state concurrently; a control mechanism arranged to dynamically control which of the plurality of computer storage media are in an active state; and at least one of:
one or more of the plurality of computer storage media having a maximum bandwidth in the active state;
at least a portion of the plurality of computer storage media being arranged logically into groups, each group comprising a plurality of computer storage media capable of being in an active state concurrently; or
each computer storage media belonging to at least one of a cooling domain and a power domain, a cooling domain comprising one or more computer storage media linked by a cooling constraint and a power domain comprising one or more computer storage media linked by a power constraint; 2. The electronic storage system according to claim 1, wherein the plurality of computer storage media are located within a device. 3. The electronic storage system according to claim 1, wherein the control mechanism is arranged to dynamically control which of the plurality of computer storage media are in an active state using the maximum bandwidth of at least one of the one or more the plurality of computer storage media having a maximum bandwidth in the active state. 4. The electronic storage system according to claim 1, further comprising an interconnect fabric connecting the plurality of computer storage media and a server, the interconnect fabric comprising a plurality of SATA controllers and PCIe switches, wherein each of the plurality of computer storage media is connected to the server via a SATA controller and one or more PCIe switches arranged in a tree structure and wherein the PCIe switches are physically distributed within the electronic storage system. 5. The electronic storage system according to claim 1, further comprising an interconnect fabric connecting the plurality of devices and a server, the interconnect fabric comprising a plurality of SATA multiplexers arranged in a tree structure. 6. The electronic storage system according to claim 1, further comprising a server comprising a data store arranged to store a ‘no access’ flag associated with each of the plurality of computer storage media and when set, a ‘no access’ flag causes all IO requests on a computer storage media to fail. 7. The electronic storage system according to claim 1, wherein at least one of the plurality of computer storage media includes a spinning disk in an active state. 8. The electronic storage system according to claim 1, wherein the cooling constraint corresponds to characteristics of the cooling system and the power constraint corresponds to characteristics of the power supply system and wherein each group comprises a plurality of computer storage media in non-overlapping cooling domains and non-overlapping power domains. 9. The electronic storage system according to claim 8, wherein the plurality of computer storage media are arranged logically into groups such that each group comprises a plurality of computer storage media in non-overlapping cooling domains and non-overlapping power domains and wherein groups are arranged to be either fully colliding or disjoint, wherein two groups are fully colliding if each computer storage media in a first group is a member of the same cooling and power domain as computer storage media in a second group and two groups are disjoint if each computer storage media in a first group is not a member of the same cooling or power domain as any computer storage media in a second group. 10. The electronic storage system according to claim 1, further comprising a server comprising a scheduler arranged to:
receive a burst of data to be written to the electronic storage system divided into portions; add error correction data to each portion; and write each portion to computer storage media from a single group. 11. The electronic storage system according to claim 1, wherein each portion is divided into a plurality of stripes and each stripe is divided into a plurality of blocks, and wherein adding error correction to each portion comprises: adding one or more blocks comprising redundancy information to each stripe and wherein writing each portion to computer storage media from a single group comprises:
for each stripe, writing one block from the stripe to a different one of the computer storage media from the single group. 12. The electronic storage system according to claim 11, wherein for each stripe, writing one block from the stripe to a different one of the computer storage media from the single group comprises:
assembling a sequence of blocks comprising one block from each stripe; and writing each sequence of blocks to a separate computer storage media from the single group. 13. The electronic storage system according to claim 1, further comprising a server comprising a scheduler arranged to:
reorder a plurality of operations into sets of operations operating on the same group of computer storage media, the operations comprising one or more of read, write and delete operations; and schedule sets of operations in an order which maximizes throughput of the electronic storage system. 14. The electronic storage system according to claim 13, wherein the scheduler is further arranged to receive a burst of operations and to perform reordering on the burst of operations. 15. The electronic storage system according to claim 13, wherein the scheduler is arranged to perform reordering on a subset of operations in a queue of operations, wherein the subset of operations is defined by a window and wherein the window has a length specified in terms of a number of operations or a period of time. 16. The electronic storage system according to claim 13, wherein the scheduler is arranged to schedule sets of operations in an order which minimizes switching between groups of computer storage media. 17. The electronic storage system according to claim 1, further comprising a server comprising a scheduler arranged to:
receive a burst of data to be written to the electronic storage system divided into portions; divide each portion into a plurality of segments; add one or more error correction segments; and write each segment to a different computer storage media from a single group. 18. The electronic storage system according to claim 1, wherein each computer storage media belongs to a cooling domain and a power domain, a cooling domain comprising computer storage media linked by a cooling constraint and a power domain comprising computer storage media linked by a power constraint, the cooling constraint corresponding to characteristics of the cooling system and the power constraint corresponding to characteristics of the power supply system,
the electronic storage system further comprising a server comprising a scheduler arranged to:
identify a subset of the computer storage media storing data corresponding to a read request;
determine a migration path from a current configuration comprising those computer storage media in an active state to a target configuration comprising the identified subset of computer storage media in active state via a plurality of intermediate configurations, wherein each configuration satisfies all power and cooling constraints; and
migrating the current configuration of the electronic storage system to the target configuration via the plurality of intermediate configurations. 19. A method of operating an electronic storage system comprising a plurality of computer storage media and insufficient cooling or power infrastructure for all of the computer storage media to be in an active state concurrently, wherein at least a portion of the plurality of computer storage media are arranged logically into groups, each group comprising a plurality of computer storage media capable of being in the active state concurrently, the method comprising:
reordering a plurality of operations into sets of operations operating on the same group of computer storage media; and scheduling sets of operations in an order which maximizes throughput of the electronic storage system. 20. An electronic storage system comprising:
a plurality of computer storage media, each computer storage media having an active state and a non active state, and at least a portion of the plurality of computer storage media being arranged logically into groups, each group comprising a plurality of computer storage media capable of being in an active state concurrently while complying with at least one of a bandwidth constraint, a power constraint, or a cooling constraint; at least a portion of the computer storage media belonging to at least one of a cooling domain or a power domain, a cooling domain comprising computer storage media linked by a cooling constraint and a power domain comprising computer storage media linked by a power constraint; at least one of:
a power supply system capable of providing sufficient power for only a subset of the computer storage media to be in an active state concurrently; or
a cooling system provisioned to provide sufficient cooling when operating for only a subset of the computer storage media to be in an active state concurrently; and
a control mechanism arranged to dynamically control which groups of computer storage media are in an active state according to a request received by the server. | Low cost storage for write once read rarely data is described. In an embodiment a storage device comprises a plurality of hard disk drives connected to a server via an interconnect fabric. The storage device comprises a cooling system which is only capable of cooling a first subset of the hard disk drives and a power supply system which is only capable of powering a second subset of the hard disk drives and in some examples, the interconnect fabric may be only capable of providing full bandwidth for a third subset of the hard disk drives. Each subset may comprise only a small fraction of hard disk drives. A control mechanism, which may be implemented in software, is provided which controls which hard disk drives are active at any time in order that the constraints set by the cooling and power supply systems and interconnect fabric are not violated.1. An electronic storage system comprising:
a plurality of computer storage media, each of the plurality of computer storage media having an active state and a non active state; a power supply system capable of providing sufficient power for only a subset of the plurality of computer storage media to be in an active state concurrently; a cooling system provisioned to provide sufficient cooling when operating for only a subset of the plurality of computer storage media to be in an active state concurrently; a control mechanism arranged to dynamically control which of the plurality of computer storage media are in an active state; and at least one of:
one or more of the plurality of computer storage media having a maximum bandwidth in the active state;
at least a portion of the plurality of computer storage media being arranged logically into groups, each group comprising a plurality of computer storage media capable of being in an active state concurrently; or
each computer storage media belonging to at least one of a cooling domain and a power domain, a cooling domain comprising one or more computer storage media linked by a cooling constraint and a power domain comprising one or more computer storage media linked by a power constraint; 2. The electronic storage system according to claim 1, wherein the plurality of computer storage media are located within a device. 3. The electronic storage system according to claim 1, wherein the control mechanism is arranged to dynamically control which of the plurality of computer storage media are in an active state using the maximum bandwidth of at least one of the one or more the plurality of computer storage media having a maximum bandwidth in the active state. 4. The electronic storage system according to claim 1, further comprising an interconnect fabric connecting the plurality of computer storage media and a server, the interconnect fabric comprising a plurality of SATA controllers and PCIe switches, wherein each of the plurality of computer storage media is connected to the server via a SATA controller and one or more PCIe switches arranged in a tree structure and wherein the PCIe switches are physically distributed within the electronic storage system. 5. The electronic storage system according to claim 1, further comprising an interconnect fabric connecting the plurality of devices and a server, the interconnect fabric comprising a plurality of SATA multiplexers arranged in a tree structure. 6. The electronic storage system according to claim 1, further comprising a server comprising a data store arranged to store a ‘no access’ flag associated with each of the plurality of computer storage media and when set, a ‘no access’ flag causes all IO requests on a computer storage media to fail. 7. The electronic storage system according to claim 1, wherein at least one of the plurality of computer storage media includes a spinning disk in an active state. 8. The electronic storage system according to claim 1, wherein the cooling constraint corresponds to characteristics of the cooling system and the power constraint corresponds to characteristics of the power supply system and wherein each group comprises a plurality of computer storage media in non-overlapping cooling domains and non-overlapping power domains. 9. The electronic storage system according to claim 8, wherein the plurality of computer storage media are arranged logically into groups such that each group comprises a plurality of computer storage media in non-overlapping cooling domains and non-overlapping power domains and wherein groups are arranged to be either fully colliding or disjoint, wherein two groups are fully colliding if each computer storage media in a first group is a member of the same cooling and power domain as computer storage media in a second group and two groups are disjoint if each computer storage media in a first group is not a member of the same cooling or power domain as any computer storage media in a second group. 10. The electronic storage system according to claim 1, further comprising a server comprising a scheduler arranged to:
receive a burst of data to be written to the electronic storage system divided into portions; add error correction data to each portion; and write each portion to computer storage media from a single group. 11. The electronic storage system according to claim 1, wherein each portion is divided into a plurality of stripes and each stripe is divided into a plurality of blocks, and wherein adding error correction to each portion comprises: adding one or more blocks comprising redundancy information to each stripe and wherein writing each portion to computer storage media from a single group comprises:
for each stripe, writing one block from the stripe to a different one of the computer storage media from the single group. 12. The electronic storage system according to claim 11, wherein for each stripe, writing one block from the stripe to a different one of the computer storage media from the single group comprises:
assembling a sequence of blocks comprising one block from each stripe; and writing each sequence of blocks to a separate computer storage media from the single group. 13. The electronic storage system according to claim 1, further comprising a server comprising a scheduler arranged to:
reorder a plurality of operations into sets of operations operating on the same group of computer storage media, the operations comprising one or more of read, write and delete operations; and schedule sets of operations in an order which maximizes throughput of the electronic storage system. 14. The electronic storage system according to claim 13, wherein the scheduler is further arranged to receive a burst of operations and to perform reordering on the burst of operations. 15. The electronic storage system according to claim 13, wherein the scheduler is arranged to perform reordering on a subset of operations in a queue of operations, wherein the subset of operations is defined by a window and wherein the window has a length specified in terms of a number of operations or a period of time. 16. The electronic storage system according to claim 13, wherein the scheduler is arranged to schedule sets of operations in an order which minimizes switching between groups of computer storage media. 17. The electronic storage system according to claim 1, further comprising a server comprising a scheduler arranged to:
receive a burst of data to be written to the electronic storage system divided into portions; divide each portion into a plurality of segments; add one or more error correction segments; and write each segment to a different computer storage media from a single group. 18. The electronic storage system according to claim 1, wherein each computer storage media belongs to a cooling domain and a power domain, a cooling domain comprising computer storage media linked by a cooling constraint and a power domain comprising computer storage media linked by a power constraint, the cooling constraint corresponding to characteristics of the cooling system and the power constraint corresponding to characteristics of the power supply system,
the electronic storage system further comprising a server comprising a scheduler arranged to:
identify a subset of the computer storage media storing data corresponding to a read request;
determine a migration path from a current configuration comprising those computer storage media in an active state to a target configuration comprising the identified subset of computer storage media in active state via a plurality of intermediate configurations, wherein each configuration satisfies all power and cooling constraints; and
migrating the current configuration of the electronic storage system to the target configuration via the plurality of intermediate configurations. 19. A method of operating an electronic storage system comprising a plurality of computer storage media and insufficient cooling or power infrastructure for all of the computer storage media to be in an active state concurrently, wherein at least a portion of the plurality of computer storage media are arranged logically into groups, each group comprising a plurality of computer storage media capable of being in the active state concurrently, the method comprising:
reordering a plurality of operations into sets of operations operating on the same group of computer storage media; and scheduling sets of operations in an order which maximizes throughput of the electronic storage system. 20. An electronic storage system comprising:
a plurality of computer storage media, each computer storage media having an active state and a non active state, and at least a portion of the plurality of computer storage media being arranged logically into groups, each group comprising a plurality of computer storage media capable of being in an active state concurrently while complying with at least one of a bandwidth constraint, a power constraint, or a cooling constraint; at least a portion of the computer storage media belonging to at least one of a cooling domain or a power domain, a cooling domain comprising computer storage media linked by a cooling constraint and a power domain comprising computer storage media linked by a power constraint; at least one of:
a power supply system capable of providing sufficient power for only a subset of the computer storage media to be in an active state concurrently; or
a cooling system provisioned to provide sufficient cooling when operating for only a subset of the computer storage media to be in an active state concurrently; and
a control mechanism arranged to dynamically control which groups of computer storage media are in an active state according to a request received by the server. | 2,100 |
6,173 | 6,173 | 15,695,844 | 2,143 | Some embodiments provide a non-transitory machine-readable medium that stores a program. The program generates a plurality of background user interface (UI) pages. The program further receives a request for a layout page comprising a set of locations for presenting a set of visualizations. The program also instructs the plurality of background UI pages to process a subset of the set of visualizations. The program further presents the processed subset of the set of visualizations in the corresponding locations of the layout page. | 1. A non-transitory machine-readable medium storing a program executable by at least one processing unit of a device, the program comprising sets of instructions for:
generating a plurality of background user interface (UI) pages; receiving a request for a layout page comprising a set of locations for presenting a set of visualizations; instructing the plurality of background UI pages to process a subset of the set of visualizations; presenting the processed subset of the set of visualizations in the corresponding locations of the layout page. 2. The non-transitory machine-readable medium of claim 1, wherein a background UI page in the plurality of background UI pages processes a visualization in the subset of the set of visualizations by sending a visualization definition to a computing system, receiving the visualization from the computing system, rendering the visualization on the background UI page, and generating an image of the visualization. 3. The non-transitory machine-readable medium of claim 2, wherein presenting the processed subset of the set of visualizations comprises presenting the generated images of the subset of the set of visualizations in the corresponding locations of the layout page. 4. The non-transitory machine-readable medium of claim 1, wherein the subset of the set of visualizations is a first subset of the set of visualizations, wherein the program further comprises sets of instructions for:
receiving input to scroll the layout page to display a second subset of the set of visualizations; instructing the plurality of background UI pages to process the second subset of the set of visualizations; and presenting the processed second subset of the set of visualizations in the corresponding locations of the layout page. 5. The non-transitory machine-readable medium of claim 1, wherein the program further comprises a set of instructions for adding a set of jobs for the subset of the set of visualizations to a work queue. 6. The non-transitory machine-readable medium of claim 5, wherein instructing the plurality of background UI pages to process the subset of the set of visualizations comprises instructing the plurality of background UI page to process jobs from the work queue. 7. The non-transitory machine-readable medium of claim 1, wherein the subset of locations comprises locations in the set of locations have been displayed in a display area of a graphical user interface (GUI) through which the layout page is presented. 8. A method comprising:
generating a plurality of background user interface (UI) pages; receiving a request for a layout page comprising a set of locations for presenting a set of visualizations; instructing the plurality of background UI pages to process a subset of the set of visualizations; presenting the processed subset of the set of visualizations in the corresponding locations of the layout page. 9. The method of claim 8, wherein a background UI page in the plurality of background UI pages processes a visualization in the subset of the set of visualizations by sending a visualization definition to a computing system, receiving the visualization from the computing system, rendering the visualization on the background UI page, and generating an image of the visualization. 10. The method of claim 9, wherein presenting the processed subset of the set of visualizations comprises presenting the generated images of the subset of the set of visualizations in the corresponding locations of the layout page. 11. The method of claim 8, wherein the subset of the set of visualizations is a first subset of the set of visualizations, wherein the method further comprises:
receiving input to scroll the layout page to display a second subset of the set of visualizations; instructing the plurality of background UI pages to process the second subset of the set of visualizations; and presenting the processed second subset of the set of visualizations in the corresponding locations of the layout page. 12. The method of claim 8 further comprising adding a set of jobs for the subset of the set of visualizations to a work queue. 13. The method of claim 12, wherein instructing the plurality of background UI pages to process the subset of the set of visualizations comprises instructing the plurality of background UI page to process jobs from the work queue. 14. The method of claim 8, wherein the subset of locations comprises locations in the set of locations have been displayed in a display area of a graphical user interface (GUI) through which the layout page is presented. 15. A system comprising:
a set of processing units; and a non-transitory computer-readable medium storing instructions that when executed by at least one processing unit in the set of processing units cause the at least one processing unit to: generate a plurality of background user interface (UI) pages; receive a request for a layout page comprising a set of locations for presenting a set of visualizations; instruct the plurality of background UI pages to process a subset of the set of visualizations; present the processed subset of the set of visualizations in the corresponding locations of the layout page. 16. The system of claim 15, wherein a background UI page in the plurality of background UI pages processes a visualization in the subset of the set of visualizations by sending a visualization definition to a computing system, receiving the visualization from the computing system, rendering the visualization on the background UI page, and generating an image of the visualization. 17. The system of claim 16, wherein presenting the processed subset of the set of visualizations comprises presenting the generated images of the subset of the set of visualizations in the corresponding locations of the layout page. 18. The system of claim 15, wherein the subset of the set of visualizations is a first subset of the set of visualizations, wherein the instructions further cause the at least one processing unit to:
receive input to scroll the layout page to display a second subset of the set of visualizations; instruct the plurality of background UI pages to process the second subset of the set of visualizations; and present the processed second subset of the set of visualizations in the corresponding locations of the layout page. 19. The system of claim 15, wherein the instructions further cause the at least one processing unit to add a set of jobs for the subset of the set of visualizations to a work queue. 20. The system of claim 19, wherein instructing the plurality of background UI pages to process the subset of the set of visualizations comprises instructing the plurality of background UI page to process jobs from the work queue. | Some embodiments provide a non-transitory machine-readable medium that stores a program. The program generates a plurality of background user interface (UI) pages. The program further receives a request for a layout page comprising a set of locations for presenting a set of visualizations. The program also instructs the plurality of background UI pages to process a subset of the set of visualizations. The program further presents the processed subset of the set of visualizations in the corresponding locations of the layout page.1. A non-transitory machine-readable medium storing a program executable by at least one processing unit of a device, the program comprising sets of instructions for:
generating a plurality of background user interface (UI) pages; receiving a request for a layout page comprising a set of locations for presenting a set of visualizations; instructing the plurality of background UI pages to process a subset of the set of visualizations; presenting the processed subset of the set of visualizations in the corresponding locations of the layout page. 2. The non-transitory machine-readable medium of claim 1, wherein a background UI page in the plurality of background UI pages processes a visualization in the subset of the set of visualizations by sending a visualization definition to a computing system, receiving the visualization from the computing system, rendering the visualization on the background UI page, and generating an image of the visualization. 3. The non-transitory machine-readable medium of claim 2, wherein presenting the processed subset of the set of visualizations comprises presenting the generated images of the subset of the set of visualizations in the corresponding locations of the layout page. 4. The non-transitory machine-readable medium of claim 1, wherein the subset of the set of visualizations is a first subset of the set of visualizations, wherein the program further comprises sets of instructions for:
receiving input to scroll the layout page to display a second subset of the set of visualizations; instructing the plurality of background UI pages to process the second subset of the set of visualizations; and presenting the processed second subset of the set of visualizations in the corresponding locations of the layout page. 5. The non-transitory machine-readable medium of claim 1, wherein the program further comprises a set of instructions for adding a set of jobs for the subset of the set of visualizations to a work queue. 6. The non-transitory machine-readable medium of claim 5, wherein instructing the plurality of background UI pages to process the subset of the set of visualizations comprises instructing the plurality of background UI page to process jobs from the work queue. 7. The non-transitory machine-readable medium of claim 1, wherein the subset of locations comprises locations in the set of locations have been displayed in a display area of a graphical user interface (GUI) through which the layout page is presented. 8. A method comprising:
generating a plurality of background user interface (UI) pages; receiving a request for a layout page comprising a set of locations for presenting a set of visualizations; instructing the plurality of background UI pages to process a subset of the set of visualizations; presenting the processed subset of the set of visualizations in the corresponding locations of the layout page. 9. The method of claim 8, wherein a background UI page in the plurality of background UI pages processes a visualization in the subset of the set of visualizations by sending a visualization definition to a computing system, receiving the visualization from the computing system, rendering the visualization on the background UI page, and generating an image of the visualization. 10. The method of claim 9, wherein presenting the processed subset of the set of visualizations comprises presenting the generated images of the subset of the set of visualizations in the corresponding locations of the layout page. 11. The method of claim 8, wherein the subset of the set of visualizations is a first subset of the set of visualizations, wherein the method further comprises:
receiving input to scroll the layout page to display a second subset of the set of visualizations; instructing the plurality of background UI pages to process the second subset of the set of visualizations; and presenting the processed second subset of the set of visualizations in the corresponding locations of the layout page. 12. The method of claim 8 further comprising adding a set of jobs for the subset of the set of visualizations to a work queue. 13. The method of claim 12, wherein instructing the plurality of background UI pages to process the subset of the set of visualizations comprises instructing the plurality of background UI page to process jobs from the work queue. 14. The method of claim 8, wherein the subset of locations comprises locations in the set of locations have been displayed in a display area of a graphical user interface (GUI) through which the layout page is presented. 15. A system comprising:
a set of processing units; and a non-transitory computer-readable medium storing instructions that when executed by at least one processing unit in the set of processing units cause the at least one processing unit to: generate a plurality of background user interface (UI) pages; receive a request for a layout page comprising a set of locations for presenting a set of visualizations; instruct the plurality of background UI pages to process a subset of the set of visualizations; present the processed subset of the set of visualizations in the corresponding locations of the layout page. 16. The system of claim 15, wherein a background UI page in the plurality of background UI pages processes a visualization in the subset of the set of visualizations by sending a visualization definition to a computing system, receiving the visualization from the computing system, rendering the visualization on the background UI page, and generating an image of the visualization. 17. The system of claim 16, wherein presenting the processed subset of the set of visualizations comprises presenting the generated images of the subset of the set of visualizations in the corresponding locations of the layout page. 18. The system of claim 15, wherein the subset of the set of visualizations is a first subset of the set of visualizations, wherein the instructions further cause the at least one processing unit to:
receive input to scroll the layout page to display a second subset of the set of visualizations; instruct the plurality of background UI pages to process the second subset of the set of visualizations; and present the processed second subset of the set of visualizations in the corresponding locations of the layout page. 19. The system of claim 15, wherein the instructions further cause the at least one processing unit to add a set of jobs for the subset of the set of visualizations to a work queue. 20. The system of claim 19, wherein instructing the plurality of background UI pages to process the subset of the set of visualizations comprises instructing the plurality of background UI page to process jobs from the work queue. | 2,100 |
6,174 | 6,174 | 15,073,807 | 2,111 | An error protection key generation method and system are provided, the method being used to generate a key for use in computing an error protection code for an input data value according to a chosen error protection scheme. The method comprises inputting a plurality of desired data value sizes, and then applying a key generation algorithm to generate a key for use in computing the error protection code for a maximum data value size amongst the plurality of data value sizes. The key generation algorithm is arranged so that it generates the key so as to comprise a plurality of sub-keys, where each sub-key is associated with one of the input data value sizes, and where each sub-key conforms to a key requirement of the error protection scheme. As a result, a generic key is produced containing a plurality of sub-keys, where each sub-key is associated with a particular desired data value size, and can be extracted and used independently given that each sub-key conforms to the error protection scheme requirements. This provides significant benefits in the design and verification of error protection circuits using such keys. | 1. A computer-implemented method of generating a key for use in computing an error protection code for an input data value according to an error protection scheme, comprising:
inputting a plurality of data value sizes; and applying a key generation algorithm to generate a key for use in computing the error protection code for a maximum data value size amongst said plurality of data value sizes, the key generation algorithm generating the key to comprise a plurality of sub-keys, each sub-key being associated with one of the input data value sizes and conforming to a key requirement for the error protection scheme. 2. A computer-implemented method as claimed in claim 1, further comprising:
outputting said key for use in generating error protection circuitry conforming to the error protection scheme. 3. A computer-implemented method as claimed in claim 1, wherein the step of applying the key generation algorithm comprises:
computing a sequence of sub-keys, such that each sub-key in the sequence other than a first sub-key contains an immediately preceding sub-key in the sequence, with the remaining portion computed to ensure that the key requirement is conformed to, and with the final sub-key forming the key to be used in computing the error protection code for said maximum data value size. 4. A computer-implemented method as claimed in claim 3, wherein the step of applying the key generation algorithm comprises:
processing the plurality of data sizes in increasing size order, such that the first sub-key computed is a sub-key for a smallest data value size amongst said plurality of data sizes; for each subsequent sub-key in the sequence, computing that sub-key by incorporating therein the immediately preceding sub-key in the sequence, determining the remaining portion of the sub-key having regard to the associated data value size, and computing values for the remaining portion of the sub-key such that the key requirement is conformed to. 5. A computer-implemented method as claimed in claim 4, wherein each of the sub-keys contains a matrix of values arranged in rows and columns, for each subsequent sub-key in the sequence, the immediately preceding sub-key occupies a subset of the columns of that subsequent sub-key, and the step of computing the remaining portion of the sub-key includes filling the remaining column values within the subset of columns with a predetermined value, and computing the values for the remaining columns not in said subset of the columns. 6. A computer-implemented method as claimed in claim 5, wherein said predetermined value is a zero value. 7. A computer-implemented method as claimed in claim 5, wherein when computing the values for the remaining columns not in said subset of the columns, the key generation algorithm excludes any value sequences already present in the subset of the columns. 8. A computer-implemented method as claimed in claim 1, wherein the plurality of data sizes are specified independently. 9. A computer-implemented method as claimed in claim 1, wherein the plurality of data sizes are determined by input of a range identifying a minimum data size and a maximum data size. 10. A non-transitory computer program product providing a computer program which, when executed on a computer, performs a method of generating a key for use in computing an error protection code for an input data value according to an error protection scheme, as claimed in claim 1. 11. A data processing system comprising:
a plurality of error protection circuits including at least a first error protection circuit to handle data values of a first data value size, and a second error protection circuit to handle data values of a second data value size different to said first data value size; said first and second error protection circuits comprising computation circuitry to perform a computation utilising a sub-key selected from a key generated in accordance with the computer-implemented method of claim 1, for each of the first and second error protection circuits the sub-key being selected based on the associated data value size handled by that error protection circuit. 12. A data processing system as claimed in claim 11, wherein:
the computation circuitry in each of the first and second error protection circuits implements a function utilising the entirety of the selected sub-key for that error protection circuit. 13. A data processing system as claimed in claim 11, wherein:
the computation circuitry in the first error protection circuit implements a function utilising the entirety of the selected sub-key for the first error protection circuit; and the computation circuitry in the second error protection circuit implements a first function utilising a determined portion of the selected sub-key for the second error protection circuit, and a second function utilising an output of the function implemented by the computation circuitry in the first error protection circuit. 14. A data processing system as claimed in claim 13, wherein the first data value size is smaller than the second data value size. 15. A data processing system as claimed in claim 13, wherein the first data value size is larger than the second data value size. 16. A data processing system as claimed in claim 11, wherein the first and second error protection circuits are error protection code generation circuits for generating an error protection code using the selected sub-key and an input data value. 17. A data processing system as claimed in claim 16, wherein:
the computation circuitry in the first error protection circuit implements a function utilising the entirety of the selected sub-key for the first error protection circuit; and the computation circuitry in the second error protection circuit implements a first function utilising a determined portion of the selected sub-key for the second error protection circuit, and a second function utilising an output of the function implemented by the computation circuitry in the first error protection circuit, wherein within the second error protection circuit the second function is arranged to apply an operation using as inputs an output from the first function and data derived from the output of the function implemented by the computation circuitry in the first error protection circuit. 18. A data processing system as claimed in claim 11, wherein the first and second error protection circuits are error checking circuits used to generate syndrome information using the selected sub-key, an input data value, and an associated error protection code. 19. A data processing system comprising:
a plurality of error protection means including at least a first error protection means for handling data values of a first data value size, and a second error protection means for handling data values of a second data value size different to said first data value size; said first and second error protection means comprising computation means for performing a computation utilising a sub-key selected from a key generated in accordance with the computer-implemented method of claim 1, for each of the first and second error protection means the sub-key being selected based on the associated data value size handled by that error protection means. | An error protection key generation method and system are provided, the method being used to generate a key for use in computing an error protection code for an input data value according to a chosen error protection scheme. The method comprises inputting a plurality of desired data value sizes, and then applying a key generation algorithm to generate a key for use in computing the error protection code for a maximum data value size amongst the plurality of data value sizes. The key generation algorithm is arranged so that it generates the key so as to comprise a plurality of sub-keys, where each sub-key is associated with one of the input data value sizes, and where each sub-key conforms to a key requirement of the error protection scheme. As a result, a generic key is produced containing a plurality of sub-keys, where each sub-key is associated with a particular desired data value size, and can be extracted and used independently given that each sub-key conforms to the error protection scheme requirements. This provides significant benefits in the design and verification of error protection circuits using such keys.1. A computer-implemented method of generating a key for use in computing an error protection code for an input data value according to an error protection scheme, comprising:
inputting a plurality of data value sizes; and applying a key generation algorithm to generate a key for use in computing the error protection code for a maximum data value size amongst said plurality of data value sizes, the key generation algorithm generating the key to comprise a plurality of sub-keys, each sub-key being associated with one of the input data value sizes and conforming to a key requirement for the error protection scheme. 2. A computer-implemented method as claimed in claim 1, further comprising:
outputting said key for use in generating error protection circuitry conforming to the error protection scheme. 3. A computer-implemented method as claimed in claim 1, wherein the step of applying the key generation algorithm comprises:
computing a sequence of sub-keys, such that each sub-key in the sequence other than a first sub-key contains an immediately preceding sub-key in the sequence, with the remaining portion computed to ensure that the key requirement is conformed to, and with the final sub-key forming the key to be used in computing the error protection code for said maximum data value size. 4. A computer-implemented method as claimed in claim 3, wherein the step of applying the key generation algorithm comprises:
processing the plurality of data sizes in increasing size order, such that the first sub-key computed is a sub-key for a smallest data value size amongst said plurality of data sizes; for each subsequent sub-key in the sequence, computing that sub-key by incorporating therein the immediately preceding sub-key in the sequence, determining the remaining portion of the sub-key having regard to the associated data value size, and computing values for the remaining portion of the sub-key such that the key requirement is conformed to. 5. A computer-implemented method as claimed in claim 4, wherein each of the sub-keys contains a matrix of values arranged in rows and columns, for each subsequent sub-key in the sequence, the immediately preceding sub-key occupies a subset of the columns of that subsequent sub-key, and the step of computing the remaining portion of the sub-key includes filling the remaining column values within the subset of columns with a predetermined value, and computing the values for the remaining columns not in said subset of the columns. 6. A computer-implemented method as claimed in claim 5, wherein said predetermined value is a zero value. 7. A computer-implemented method as claimed in claim 5, wherein when computing the values for the remaining columns not in said subset of the columns, the key generation algorithm excludes any value sequences already present in the subset of the columns. 8. A computer-implemented method as claimed in claim 1, wherein the plurality of data sizes are specified independently. 9. A computer-implemented method as claimed in claim 1, wherein the plurality of data sizes are determined by input of a range identifying a minimum data size and a maximum data size. 10. A non-transitory computer program product providing a computer program which, when executed on a computer, performs a method of generating a key for use in computing an error protection code for an input data value according to an error protection scheme, as claimed in claim 1. 11. A data processing system comprising:
a plurality of error protection circuits including at least a first error protection circuit to handle data values of a first data value size, and a second error protection circuit to handle data values of a second data value size different to said first data value size; said first and second error protection circuits comprising computation circuitry to perform a computation utilising a sub-key selected from a key generated in accordance with the computer-implemented method of claim 1, for each of the first and second error protection circuits the sub-key being selected based on the associated data value size handled by that error protection circuit. 12. A data processing system as claimed in claim 11, wherein:
the computation circuitry in each of the first and second error protection circuits implements a function utilising the entirety of the selected sub-key for that error protection circuit. 13. A data processing system as claimed in claim 11, wherein:
the computation circuitry in the first error protection circuit implements a function utilising the entirety of the selected sub-key for the first error protection circuit; and the computation circuitry in the second error protection circuit implements a first function utilising a determined portion of the selected sub-key for the second error protection circuit, and a second function utilising an output of the function implemented by the computation circuitry in the first error protection circuit. 14. A data processing system as claimed in claim 13, wherein the first data value size is smaller than the second data value size. 15. A data processing system as claimed in claim 13, wherein the first data value size is larger than the second data value size. 16. A data processing system as claimed in claim 11, wherein the first and second error protection circuits are error protection code generation circuits for generating an error protection code using the selected sub-key and an input data value. 17. A data processing system as claimed in claim 16, wherein:
the computation circuitry in the first error protection circuit implements a function utilising the entirety of the selected sub-key for the first error protection circuit; and the computation circuitry in the second error protection circuit implements a first function utilising a determined portion of the selected sub-key for the second error protection circuit, and a second function utilising an output of the function implemented by the computation circuitry in the first error protection circuit, wherein within the second error protection circuit the second function is arranged to apply an operation using as inputs an output from the first function and data derived from the output of the function implemented by the computation circuitry in the first error protection circuit. 18. A data processing system as claimed in claim 11, wherein the first and second error protection circuits are error checking circuits used to generate syndrome information using the selected sub-key, an input data value, and an associated error protection code. 19. A data processing system comprising:
a plurality of error protection means including at least a first error protection means for handling data values of a first data value size, and a second error protection means for handling data values of a second data value size different to said first data value size; said first and second error protection means comprising computation means for performing a computation utilising a sub-key selected from a key generated in accordance with the computer-implemented method of claim 1, for each of the first and second error protection means the sub-key being selected based on the associated data value size handled by that error protection means. | 2,100 |
6,175 | 6,175 | 12,895,360 | 2,168 | Queries applied to content sets (e.g., files in a filesystem) often produce search results including many content items having identifiers that match the keywords of the query. However, many search techniques do not account for the relevance of the matching, e.g., whether the match is predictably relevant to the user, or whether the content item only tangentially matches the query. The techniques presented herein involve indexing the content items in a content index according to various identifiers having an identifier weight indicating the predicted relevance if a token of a query matches the identifier. Candidate content items may then be presented as search results sorted by the aggregated identifier weights of the matching identifiers, thereby promoting highly relevant content items and demoting incidentally matching content items. Additional adjustments may be made (e.g., promoting content items that match a particularly infrequent token or that match a phrase in the query). | 1. A method of evaluating queries comprising at least one token against at least one content set respectively comprising at least one content item respectively having at least one identifier on a device having a processor and a content index, comprising:
executing on the processor instructions configured to:
for respective content items, index the content item in the content index according to at least one identifier having an identifier weight; and
upon receiving a query:
identify candidate content items indexed in the content index by, for respective tokens of the query, at least an identifier portion of an identifier matching the token;
for respective candidate content items, calculate a rank score according to the identifier weights of the identifiers matching the tokens of the query; and
present the candidate content items sorted according to the rank scores. 2. The method of claim 1:
the query provided in a search context associated with at least one identifier; and calculating the rank score comprising: for respective candidate content items, raising the identifier weights of identifiers of candidate content items matching at least one token of the query and associated with the search context. 3. The method of claim 1, calculating the rank score comprising: raising the rank scores of popular candidate content items. 4. The method of claim 1, comprising:
upon receiving a second query related to the query:
remove from the candidate content items at least zero removed candidate content items that, for at least one second query token included in the second query and not included in the query, are not indexed by at least one identifier portion matching the second query token;
insert into the candidate content items at least zero added candidate content items that are indexed in the content index by, for respective tokens of the second query, at least an identifier portion of an identifier matching the token, and that, for at least one first query token included in the query and not included in the second query, are not indexed by at least one identifier portion matching the first query token;
for respective candidate content items, calculate a second rank score according to the identifier weights of the identifiers matching the tokens of the second query; and
present the candidate content items sorted according to the second rank scores. 5. The method of claim 1:
the at least one content set comprising a locally stored content item set comprising content items of a content item type; the content item type of at least one content item comprising a custom item type associated with an application; and the instructions configured to, upon receiving from the application a request to index a content item of the custom item type according to at least one custom identifier, index the content item in the content index according to at least one custom identifier. 6. The method of claim 1:
a content item comprising a name having at least one name component; and the instructions configured to index the content item in the content index according to:
the name of the content item, and
respective name components of the name of the content item. 7. The method of claim 6, the instructions configured to:
index the name of the content item as an identifier having a high identifier weight; and match respective name components of the name of the content item with a low identifier weight that is lower than the high identifier weight of the name of the content item. 8. The method of claim 1:
identifying the candidate content items comprising:
for respective tokens of the query, identify candidate content items indexed in the content index by at least an identifier portion of an identifier matching the token;
for the query, identify candidate content items indexed in the content index by at least an identifier portion of an identifier matching the token; and
calculating the rank scores comprising: for respective candidate content items, adding the identifier weights of the identifiers matching the respective tokens of the query and the query. 9. The method of claim 1:
the instructions configured to sort the candidate content items according to a name length of a name of the respective candidate content items; and presenting the candidate content items comprising: presenting the candidate content items stably sorted according to the rank scores after sorting the candidate content items according to the name length of the names of the respective content items. 10. The method of claim 1, presenting the candidate content items comprising: presenting with respective candidate content items the identifiers matching the tokens of the query. 11. The method of claim 10, presenting the candidate content items comprising: emphasizing identifier portions of the identifiers of the candidate content items matching the tokens of the query. 12. The method of claim 1, calculating the rank score of a candidate content item comprising: raising the identifier weights of identifiers matching more than one token of the query. 13. The method of claim 1:
at least one content item identified by a first identifier portion sequentially followed by a second identifier portion; the query comprising a first token sequentially followed by a second token; and calculating the rank score of a candidate content item comprising: raising the identifier weights of identifiers having a second identifier portion sequentially following the first identifier portion and matching the second token sequentially following the first token matching the first identifier portion. 14. The method of claim 13, raising the identifier weight of the identifiers comprising: raising the identifier weights of identifiers having a second identifier portion directly sequentially following the first identifier portion and matching the second token directly sequentially following the first token matching the first identifier portion. 15. The method of claim 13, raising the identifier weight of the identifiers comprising: raising the identifier weights of identifiers having a second identifier portion sequentially following the first identifier portion and matching the second token sequentially following the first token proportional to a proximity of the second identifier portion with the first identifier portion. 16. The method of claim 1, calculating the rank score of a candidate content item comprising: raising the identifier weights of identifiers fully matching the query. 17. The method of claim 1, calculating the rank score of a candidate content item comprising: raising the identifier weights of identifiers matching a token proportionally to a percentage of an identifier portion of the identifier matched by the token. 18. The method of claim 1, calculating the rank score of a candidate content item comprising: raising the identifier weights of identifiers matching a token inversely proportionally to a content item count of content items having at least one identifier matching the token. 19. A system configured to evaluate queries comprising at least one token against at least one content set respectively comprising at least one content item respectively having at least one identifier on a device having a content index, the system comprising:
a content item indexing component configured to, for respective content items, index the content item in the content index according to at least one identifier having an identifier weight; a content item evaluating component configured to, upon receiving a query:
identify candidate content items indexed in the content index by, for respective tokens of the query, at least an identifier portion of an identifier matching the token, and
for respective candidate content items, calculate a rank score according to the identifier weights of the identifiers matching the tokens of the query; and
a search result presenting component configured to, in response to the query, present the candidate content items sorted according to the rank scores. 20. A computer-readable storage medium comprising instructions that, when executed on a processor of a device having a memory component storing a content index, evaluate queries comprising at least one token against at least one locally stored content set respectively comprising at least one content item of a content item type and having at least one identifier including a name having at least one name component, at least one content item having a custom content item type associated with an application, by:
for respective content items:
indexing the content item in the content index according to the name having a high identifier weight;
indexing the content item in the content index according to at least one name component having a low identifier weight that is lower than the high identifier weight of the name of the content item;
indexing the content item in the content index according to at least one identifier having an identifier weight; and
if the content item was received from an application with a request to index a content item of the custom item type according to at least one custom identifier, indexing the content item in the content index according to at least one custom identifier;
upon receiving a query in a search context associated with at least one identifier:
identifying candidate content items indexed in the content index by:
for respective tokens of the query, identify candidate content items indexed in the content index by at least an identifier portion of an identifier matching the token; and
for the query, identify candidate content items indexed in the content index by at least an identifier portion of an identifier matching the token;
for respective candidate content items, calculating a rank score according to the identifier weights of the identifiers matching the tokens of the query by:
adding the identifier weights of the identifiers matching the respective tokens of the query and the query;
raising the identifier weights of identifiers matching more than one token of the query;
raising the identifier weights of identifiers having a second identifier portion sequentially following a first identifier portion and matching a second token sequentially following a first token in the query and matching the first identifier portion by:
raising the identifier weights of identifiers having a second identifier portion directly sequentially following the first identifier portion and matching the second token directly sequentially following the first token matching the first identifier portion; and
raising the identifier weights of identifiers having a second identifier portion sequentially following the first identifier portion and matching the second token sequentially following the first token proportional to a proximity of the second identifier portion with the first identifier portion;
raising the identifier weights of identifiers fully matching the query;
raising the identifier weights of identifiers matching a token proportionally to a percentage of an identifier portion of the identifier matched by the token;
raising the identifier weights of identifiers matching a token inversely proportionally to a content item count of content items having at least one identifier matching the token;
raising the identifier weights of identifiers of candidate content items matching at least one token of the query and associated with the search context; and
raising the rank scores of popular candidate content items;
presenting the candidate content items by:
sorting the candidate content items according to a name length of a name;
stably sorting the candidate content items according to the rank scores; and
presenting the candidate content items with respective identifiers matching the tokens of the query and emphasizing identifier portions of the identifiers of the candidate content items matching the tokens of the query; and
upon receiving a second query related to the query:
remove from the candidate content items at least zero removed candidate content items that, for at least one second query token included in the second query and not included in the query, are not indexed by at least one identifier portion matching the second query token;
insert into the candidate content items at least zero added candidate content items that are indexed in the content index by, for respective tokens of the second query, at least an identifier portion of an identifier matching the token, and that, for at least one first query token included in the query and not included in the second query, are not indexed by at least one identifier portion matching the first query token;
for respective candidate content items, calculate a second rank score according to the identifier weights of the identifiers matching the tokens of the second query; and
present the candidate content items sorted according to the second rank scores. | Queries applied to content sets (e.g., files in a filesystem) often produce search results including many content items having identifiers that match the keywords of the query. However, many search techniques do not account for the relevance of the matching, e.g., whether the match is predictably relevant to the user, or whether the content item only tangentially matches the query. The techniques presented herein involve indexing the content items in a content index according to various identifiers having an identifier weight indicating the predicted relevance if a token of a query matches the identifier. Candidate content items may then be presented as search results sorted by the aggregated identifier weights of the matching identifiers, thereby promoting highly relevant content items and demoting incidentally matching content items. Additional adjustments may be made (e.g., promoting content items that match a particularly infrequent token or that match a phrase in the query).1. A method of evaluating queries comprising at least one token against at least one content set respectively comprising at least one content item respectively having at least one identifier on a device having a processor and a content index, comprising:
executing on the processor instructions configured to:
for respective content items, index the content item in the content index according to at least one identifier having an identifier weight; and
upon receiving a query:
identify candidate content items indexed in the content index by, for respective tokens of the query, at least an identifier portion of an identifier matching the token;
for respective candidate content items, calculate a rank score according to the identifier weights of the identifiers matching the tokens of the query; and
present the candidate content items sorted according to the rank scores. 2. The method of claim 1:
the query provided in a search context associated with at least one identifier; and calculating the rank score comprising: for respective candidate content items, raising the identifier weights of identifiers of candidate content items matching at least one token of the query and associated with the search context. 3. The method of claim 1, calculating the rank score comprising: raising the rank scores of popular candidate content items. 4. The method of claim 1, comprising:
upon receiving a second query related to the query:
remove from the candidate content items at least zero removed candidate content items that, for at least one second query token included in the second query and not included in the query, are not indexed by at least one identifier portion matching the second query token;
insert into the candidate content items at least zero added candidate content items that are indexed in the content index by, for respective tokens of the second query, at least an identifier portion of an identifier matching the token, and that, for at least one first query token included in the query and not included in the second query, are not indexed by at least one identifier portion matching the first query token;
for respective candidate content items, calculate a second rank score according to the identifier weights of the identifiers matching the tokens of the second query; and
present the candidate content items sorted according to the second rank scores. 5. The method of claim 1:
the at least one content set comprising a locally stored content item set comprising content items of a content item type; the content item type of at least one content item comprising a custom item type associated with an application; and the instructions configured to, upon receiving from the application a request to index a content item of the custom item type according to at least one custom identifier, index the content item in the content index according to at least one custom identifier. 6. The method of claim 1:
a content item comprising a name having at least one name component; and the instructions configured to index the content item in the content index according to:
the name of the content item, and
respective name components of the name of the content item. 7. The method of claim 6, the instructions configured to:
index the name of the content item as an identifier having a high identifier weight; and match respective name components of the name of the content item with a low identifier weight that is lower than the high identifier weight of the name of the content item. 8. The method of claim 1:
identifying the candidate content items comprising:
for respective tokens of the query, identify candidate content items indexed in the content index by at least an identifier portion of an identifier matching the token;
for the query, identify candidate content items indexed in the content index by at least an identifier portion of an identifier matching the token; and
calculating the rank scores comprising: for respective candidate content items, adding the identifier weights of the identifiers matching the respective tokens of the query and the query. 9. The method of claim 1:
the instructions configured to sort the candidate content items according to a name length of a name of the respective candidate content items; and presenting the candidate content items comprising: presenting the candidate content items stably sorted according to the rank scores after sorting the candidate content items according to the name length of the names of the respective content items. 10. The method of claim 1, presenting the candidate content items comprising: presenting with respective candidate content items the identifiers matching the tokens of the query. 11. The method of claim 10, presenting the candidate content items comprising: emphasizing identifier portions of the identifiers of the candidate content items matching the tokens of the query. 12. The method of claim 1, calculating the rank score of a candidate content item comprising: raising the identifier weights of identifiers matching more than one token of the query. 13. The method of claim 1:
at least one content item identified by a first identifier portion sequentially followed by a second identifier portion; the query comprising a first token sequentially followed by a second token; and calculating the rank score of a candidate content item comprising: raising the identifier weights of identifiers having a second identifier portion sequentially following the first identifier portion and matching the second token sequentially following the first token matching the first identifier portion. 14. The method of claim 13, raising the identifier weight of the identifiers comprising: raising the identifier weights of identifiers having a second identifier portion directly sequentially following the first identifier portion and matching the second token directly sequentially following the first token matching the first identifier portion. 15. The method of claim 13, raising the identifier weight of the identifiers comprising: raising the identifier weights of identifiers having a second identifier portion sequentially following the first identifier portion and matching the second token sequentially following the first token proportional to a proximity of the second identifier portion with the first identifier portion. 16. The method of claim 1, calculating the rank score of a candidate content item comprising: raising the identifier weights of identifiers fully matching the query. 17. The method of claim 1, calculating the rank score of a candidate content item comprising: raising the identifier weights of identifiers matching a token proportionally to a percentage of an identifier portion of the identifier matched by the token. 18. The method of claim 1, calculating the rank score of a candidate content item comprising: raising the identifier weights of identifiers matching a token inversely proportionally to a content item count of content items having at least one identifier matching the token. 19. A system configured to evaluate queries comprising at least one token against at least one content set respectively comprising at least one content item respectively having at least one identifier on a device having a content index, the system comprising:
a content item indexing component configured to, for respective content items, index the content item in the content index according to at least one identifier having an identifier weight; a content item evaluating component configured to, upon receiving a query:
identify candidate content items indexed in the content index by, for respective tokens of the query, at least an identifier portion of an identifier matching the token, and
for respective candidate content items, calculate a rank score according to the identifier weights of the identifiers matching the tokens of the query; and
a search result presenting component configured to, in response to the query, present the candidate content items sorted according to the rank scores. 20. A computer-readable storage medium comprising instructions that, when executed on a processor of a device having a memory component storing a content index, evaluate queries comprising at least one token against at least one locally stored content set respectively comprising at least one content item of a content item type and having at least one identifier including a name having at least one name component, at least one content item having a custom content item type associated with an application, by:
for respective content items:
indexing the content item in the content index according to the name having a high identifier weight;
indexing the content item in the content index according to at least one name component having a low identifier weight that is lower than the high identifier weight of the name of the content item;
indexing the content item in the content index according to at least one identifier having an identifier weight; and
if the content item was received from an application with a request to index a content item of the custom item type according to at least one custom identifier, indexing the content item in the content index according to at least one custom identifier;
upon receiving a query in a search context associated with at least one identifier:
identifying candidate content items indexed in the content index by:
for respective tokens of the query, identify candidate content items indexed in the content index by at least an identifier portion of an identifier matching the token; and
for the query, identify candidate content items indexed in the content index by at least an identifier portion of an identifier matching the token;
for respective candidate content items, calculating a rank score according to the identifier weights of the identifiers matching the tokens of the query by:
adding the identifier weights of the identifiers matching the respective tokens of the query and the query;
raising the identifier weights of identifiers matching more than one token of the query;
raising the identifier weights of identifiers having a second identifier portion sequentially following a first identifier portion and matching a second token sequentially following a first token in the query and matching the first identifier portion by:
raising the identifier weights of identifiers having a second identifier portion directly sequentially following the first identifier portion and matching the second token directly sequentially following the first token matching the first identifier portion; and
raising the identifier weights of identifiers having a second identifier portion sequentially following the first identifier portion and matching the second token sequentially following the first token proportional to a proximity of the second identifier portion with the first identifier portion;
raising the identifier weights of identifiers fully matching the query;
raising the identifier weights of identifiers matching a token proportionally to a percentage of an identifier portion of the identifier matched by the token;
raising the identifier weights of identifiers matching a token inversely proportionally to a content item count of content items having at least one identifier matching the token;
raising the identifier weights of identifiers of candidate content items matching at least one token of the query and associated with the search context; and
raising the rank scores of popular candidate content items;
presenting the candidate content items by:
sorting the candidate content items according to a name length of a name;
stably sorting the candidate content items according to the rank scores; and
presenting the candidate content items with respective identifiers matching the tokens of the query and emphasizing identifier portions of the identifiers of the candidate content items matching the tokens of the query; and
upon receiving a second query related to the query:
remove from the candidate content items at least zero removed candidate content items that, for at least one second query token included in the second query and not included in the query, are not indexed by at least one identifier portion matching the second query token;
insert into the candidate content items at least zero added candidate content items that are indexed in the content index by, for respective tokens of the second query, at least an identifier portion of an identifier matching the token, and that, for at least one first query token included in the query and not included in the second query, are not indexed by at least one identifier portion matching the first query token;
for respective candidate content items, calculate a second rank score according to the identifier weights of the identifiers matching the tokens of the second query; and
present the candidate content items sorted according to the second rank scores. | 2,100 |
6,176 | 6,176 | 15,271,850 | 2,191 | Priority data is accessed to determine a priority of a software update specific to a vehicle to be updated. The software update is pushed to a vehicle responsive to the priority indicating that the software update is an add-on authorized for use by the vehicle. Otherwise, the software update is scheduled to the vehicle at a time according to the priority and a geographic region of the vehicle. | 1. A system comprising:
a server configured to:
access stored priority data to determine a priority of a software update specific to a vehicle to be updated,
responsive to the priority indicating that the software update is an add-on authorized for use by the vehicle, schedule the software update for immediate push, and
otherwise, schedule the software update to the vehicle at a time according to the priority and a geographic region of the vehicle. 2. The system of claim 1, wherein the server is further configured to, responsive to a vehicle request for software updates, indicate that the software update is provided by a regional software delivery network located within the geographic region of the vehicle. 3. The system of claim 1, wherein the server is further configured to:
receive, from the vehicle responsive to vehicle presence in the geographic region for a predefined period, a message indicating the geographic region in which the vehicle is located, responsive to the message, update a data store to associate the vehicle with the geographic region. 4. The system of claim 3, wherein the server is further configured to update the data store to indicate that the vehicle is associated with the geographic region using a vehicle identification number (VIN) of the vehicle included in the message. 5. The system of claim 1, wherein the geographic region corresponds to a political boundary. 6. The system of claim 1, wherein the priority includes one or more of: a first priority indicating a mandatory fix, a second priority indicating that the vehicle is paid for the software update, a third priority indicating a software update to fix functional issues in one or more features, a fourth priority indicating a software update to provide new features, a fifth priority indicating a software update to adjust settings of an operational vehicle feature, a sixth priority indicating a preferred update, and a seventh priority indicating a non-imminent update to be scheduled at a customer-specific time. 7. The system of claim 1, wherein the server is further programmed to push the software update to the vehicle responsive to determining by the server that the time is reached. 8. The system of claim 1, wherein the server is further programmed to initiate determination of the priority of the software update responsive to addition of availability of the software update. 9. A method comprising:
including, in a data store, priority data for a software update to a vehicle based on metadata of the software update; responsive to receiving an indication of a vehicle-specific priority override for the software update for the vehicle, updating the priority data with the vehicle-specific priority override; and scheduling the software update to the vehicle at a time according to the vehicle-specific priority override and a geographic region of the vehicle. 10. The method of claim 9, further comprising updating the data store to associate the vehicle with the geographic region responsive to receiving, from the vehicle, a message indicating the geographic region in which the vehicle is located. 11. The method of claim 9, further comprising indicating in the metadata that the software update is a mandatory fix for immediate distribution. 12. The method of claim 9, further comprising indicating in the metadata that the software update is a non-essential update. 13. The method of claim 9, wherein the indication of the vehicle-specific priority includes payment for the software update. 14. The method of claim 9, further comprising determining the geographic region of the vehicle according to an origination address of a message received from the vehicle. 15. A non-transitory computer-readable medium comprising instructions, that when executed by a processor, cause the processor to schedule a software update to a vehicle at a time specific to a priority determined using metadata of the software update and a geographic region in which the vehicle identifies in a message to the processor as being located. 16. The medium of claim 15, further comprising instructions to cause the processor to update the time using user-defined timing settings specific to the vehicle. 17. The medium of claim 15, further comprising instructions to cause the processor to:
receive, from the vehicle, a message indicating the geographic region in which the vehicle is located responsive to vehicle presence in the geographic region for a predefined period, responsive to the message, update a data store to associate the vehicle with the geographic region. 18. The medium of claim 17, further comprising instructions to cause the processor to update the data store to identify the vehicle to associate with the geographic region based on a vehicle identification number (VIN) of the vehicle included in the message. 19. The medium of claim 15, wherein the geographic region corresponds to a political boundary. 20. The medium of claim 15, wherein the priority includes one or more of: a first priority indicating a mandatory fix, a second priority indicating that the vehicle is paid for the software update, a third priority indicating a software update to fix functional issues in one or more features, a fourth priority indicating a software update to provide new features, a fifth priority indicating a software update to adjust settings of an operational vehicle feature, a sixth priority indicating a preferred update, and a seventh priority indicating a non-imminent update to be scheduled at a customer-specific time. | Priority data is accessed to determine a priority of a software update specific to a vehicle to be updated. The software update is pushed to a vehicle responsive to the priority indicating that the software update is an add-on authorized for use by the vehicle. Otherwise, the software update is scheduled to the vehicle at a time according to the priority and a geographic region of the vehicle.1. A system comprising:
a server configured to:
access stored priority data to determine a priority of a software update specific to a vehicle to be updated,
responsive to the priority indicating that the software update is an add-on authorized for use by the vehicle, schedule the software update for immediate push, and
otherwise, schedule the software update to the vehicle at a time according to the priority and a geographic region of the vehicle. 2. The system of claim 1, wherein the server is further configured to, responsive to a vehicle request for software updates, indicate that the software update is provided by a regional software delivery network located within the geographic region of the vehicle. 3. The system of claim 1, wherein the server is further configured to:
receive, from the vehicle responsive to vehicle presence in the geographic region for a predefined period, a message indicating the geographic region in which the vehicle is located, responsive to the message, update a data store to associate the vehicle with the geographic region. 4. The system of claim 3, wherein the server is further configured to update the data store to indicate that the vehicle is associated with the geographic region using a vehicle identification number (VIN) of the vehicle included in the message. 5. The system of claim 1, wherein the geographic region corresponds to a political boundary. 6. The system of claim 1, wherein the priority includes one or more of: a first priority indicating a mandatory fix, a second priority indicating that the vehicle is paid for the software update, a third priority indicating a software update to fix functional issues in one or more features, a fourth priority indicating a software update to provide new features, a fifth priority indicating a software update to adjust settings of an operational vehicle feature, a sixth priority indicating a preferred update, and a seventh priority indicating a non-imminent update to be scheduled at a customer-specific time. 7. The system of claim 1, wherein the server is further programmed to push the software update to the vehicle responsive to determining by the server that the time is reached. 8. The system of claim 1, wherein the server is further programmed to initiate determination of the priority of the software update responsive to addition of availability of the software update. 9. A method comprising:
including, in a data store, priority data for a software update to a vehicle based on metadata of the software update; responsive to receiving an indication of a vehicle-specific priority override for the software update for the vehicle, updating the priority data with the vehicle-specific priority override; and scheduling the software update to the vehicle at a time according to the vehicle-specific priority override and a geographic region of the vehicle. 10. The method of claim 9, further comprising updating the data store to associate the vehicle with the geographic region responsive to receiving, from the vehicle, a message indicating the geographic region in which the vehicle is located. 11. The method of claim 9, further comprising indicating in the metadata that the software update is a mandatory fix for immediate distribution. 12. The method of claim 9, further comprising indicating in the metadata that the software update is a non-essential update. 13. The method of claim 9, wherein the indication of the vehicle-specific priority includes payment for the software update. 14. The method of claim 9, further comprising determining the geographic region of the vehicle according to an origination address of a message received from the vehicle. 15. A non-transitory computer-readable medium comprising instructions, that when executed by a processor, cause the processor to schedule a software update to a vehicle at a time specific to a priority determined using metadata of the software update and a geographic region in which the vehicle identifies in a message to the processor as being located. 16. The medium of claim 15, further comprising instructions to cause the processor to update the time using user-defined timing settings specific to the vehicle. 17. The medium of claim 15, further comprising instructions to cause the processor to:
receive, from the vehicle, a message indicating the geographic region in which the vehicle is located responsive to vehicle presence in the geographic region for a predefined period, responsive to the message, update a data store to associate the vehicle with the geographic region. 18. The medium of claim 17, further comprising instructions to cause the processor to update the data store to identify the vehicle to associate with the geographic region based on a vehicle identification number (VIN) of the vehicle included in the message. 19. The medium of claim 15, wherein the geographic region corresponds to a political boundary. 20. The medium of claim 15, wherein the priority includes one or more of: a first priority indicating a mandatory fix, a second priority indicating that the vehicle is paid for the software update, a third priority indicating a software update to fix functional issues in one or more features, a fourth priority indicating a software update to provide new features, a fifth priority indicating a software update to adjust settings of an operational vehicle feature, a sixth priority indicating a preferred update, and a seventh priority indicating a non-imminent update to be scheduled at a customer-specific time. | 2,100 |
6,177 | 6,177 | 14,292,662 | 2,156 | A method begins by a dispersed storage (DS) processing module receiving a data object co-locate write request. The method continues with the DS processing module obtaining a plurality of sets of encoded data slices for a data object to co-locate. The method continues with the DS processing module generating a plurality of sets of slice names for the data object to co-locate based on another plurality of sets of slice names associated with a data object to be co-located with. The method continues with the DS processing module storing the plurality of sets of encoded data slices in the DSN using the generated plurality of sets of slice names for the data object co-locate. | 1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method comprises:
receiving a data object co-locate write request; obtaining a plurality of sets of encoded data slices for a data object to co-locate; generating a plurality of sets of slice names for the data object to co-locate based on another plurality of sets of slice names associated with a data object to be co-located with; and storing the plurality of sets of encoded data slices in the DSN using the generated plurality of sets of slice names for the data object to co-locate. 2. The method of claim 1, wherein the data object co-locate write request includes a first data identifier for the data object to be co-located and a second data identifier for the data object to be co-located with. 3. The method of claim 2, wherein the first and second data identifiers include at least:
a data name; an object number; and source name. 4. The method of claim 2, wherein the first and second data identifiers include at least:
a slice index field; a vault identifier (ID) field; a generation field; an object number field; and a segment number field. 5. The method of claim 4, wherein the co-located data objects have same vault identifier (ID), same generation field number, and similar object field numbers with storage of the plurality of sets of encoded data slices in the DSN within a range of DSN addresses assigned to a common set of storage units within the DSN. 6. The method of claim 4, wherein generating the plurality of sets of slice names further comprises:
modifying the vault ID of the first data identifier to match the vault ID of the second data identifier; and modifying the object number fields of the first data identifier to be in a range of the object number fields of the second data identifier. 7. The method of claim 4 further comprises:
when obtaining a plurality of sets of encoded data slices, identifying a set of execution units associated with the data ID of the data object to be co-located with. 8. The method of claim 7, wherein the identifying includes:
accessing one or more of a directory and a dispersed hierarchical index to identify a DSN address associated with the data ID of the data object to be co-located with; and performing a DSN address-to-physical location table lookup to identify the set of execution units. 9. The method of claim 1 further comprises:
after storing the plurality of sets of encoded data slices in the DSN, confirming storage of the plurality of sets of encoded data slices; and
after confirming, and when the sets of encoded data slices for a data object to co-locate were previous stored in the DSN, deleting the previously stored plurality of sets of encoded data slices. 10. The method of claim 1, wherein the obtaining includes one or more of:
receiving by extracting the plurality of sets of encoded data slices from the write request; generating by encoding the data object be co-located using a dispersed storage error coding function to produce the plurality of sets of encoded data slices; and retrieving by identifying previous sets of slice names utilized to store the plurality of sets of encoded data slices based on a data ID of the data object to become co-located, determining if they are presently co-located and, if not, issuing one or more sets of read slice requests to a previously utilized set of storage units where the one or more sets of read slice requests includes the previous sets of slice names, and receiving the plurality of sets of encoded data slices. 11. The method of claim 1, wherein the data object co-locate request further includes the data object to be co-located. 12. The method of claim 1, wherein the received data object comprises two or more data objects to be co-located. 13. A dispersed storage (DS) module comprises:
a first module, when operable within a computing device, causes the computing device to: receive a data object co-locate write request; a second module, when operable within the computing device, causes the computing device to: obtain a plurality of sets of encoded data slices for a data object to co-locate; a third module, when operable within the computing device, causes the computing device to: generate a plurality of sets of slice names for the data object to co-locate based on another plurality of sets of slice names associated with a data object to be co-located with; and a fourth module, when operable within the computing device, causes the computing device to: store the plurality of sets of encoded data slices in memory using the generated plurality of sets of slice names for the data object co-locate. 14. The DS module of claim 13 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
receive, wherein the second module extracts the plurality of sets of encoded data slices from the write request;
generate, wherein the second module encodes the data object be co-located using a dispersed storage error coding function to produce the plurality of sets of encoded data slices; and
retrieve, wherein the second module identifies previous sets of slice names utilized to store the plurality of sets of encoded data slices based on a data ID of the data object to become co-located, issues one or more sets of read slice requests to a previously utilized set of storage units where the one or more sets of read slice requests includes the previous sets of slice names, and receiving the plurality of sets of encoded data slices. 15. The DS module of claim 13 further comprises:
the third module, when operable within the computing device, further causes the computing device to:
generate the plurality of sets of slice names to produce co-located data objects with same vault identifier (ID), same generation field number, and similar object field numbers. 16. The DS module of claim 13 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
when obtaining the plurality of sets of encoded data slices, identify a set of execution units associated with the data ID of the data object to be co-located with, wherein the identifying includes:
accessing one or more of a directory and a dispersed hierarchical index to identify a memory address associated with a data ID of the data object to be co-located with; and performing an address-to-physical location table lookup to identify the set of execution units. 17. The DS module of claim 13 further comprises:
the third module, when operable within the computing device, further causes the computing device to:
modify a vault ID of a first data identifier data of the object to co-locate to match a vault ID of a second data identifier of the data object to co-locate with; and
modify the object number fields of the first data identifier to be in a range of the object number fields of the second data identifier. 18. The DS module of claim 13 further comprises:
a fifth module, when operable within the computing device, further causes the computing device to:
after storing the plurality of sets of encoded data slices in the memory, confirm storage of the plurality of sets of encoded data slices; and
after confirming, delete the plurality of sets of encoded data slices associated with the first data identifier. 19. The DS module of claim 13 further comprises:
the fourth module, when operable within the computing device, further causes the computing device to:
store the plurality of sets of encoded data slices in the memory within a range of the memory addresses assigned to a common set of storage units within the memory. 20. A method for execution within a dispersed storage network (DSN), the method comprises:
receiving a data object co-locate write request; obtaining a plurality of sets of encoded data slices for a data object to co-locate including:
when the write request includes the data object to be co-located, encoding the included data object to produce a plurality of sets of encoded data slices; and
when the write request identifies a previously stored data object to be co-located, retrieving sets of encoded data slices of the previously stored data object;
generating a plurality of sets of slice names for the data object to co-locate based on another plurality of sets of slice names associated with a data object to be co-located with including:
generating co-located data objects have same vault identifier (ID), same generation field number, and object field numbers within a range of addresses assigned to a common set of storage units storing the plurality of sets of slice names associated with a data object to be co-located with; and
storing the plurality of sets of encoded data slices in the DSN using the generated plurality of sets of slice names for the data object to co-locate. | A method begins by a dispersed storage (DS) processing module receiving a data object co-locate write request. The method continues with the DS processing module obtaining a plurality of sets of encoded data slices for a data object to co-locate. The method continues with the DS processing module generating a plurality of sets of slice names for the data object to co-locate based on another plurality of sets of slice names associated with a data object to be co-located with. The method continues with the DS processing module storing the plurality of sets of encoded data slices in the DSN using the generated plurality of sets of slice names for the data object co-locate.1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method comprises:
receiving a data object co-locate write request; obtaining a plurality of sets of encoded data slices for a data object to co-locate; generating a plurality of sets of slice names for the data object to co-locate based on another plurality of sets of slice names associated with a data object to be co-located with; and storing the plurality of sets of encoded data slices in the DSN using the generated plurality of sets of slice names for the data object to co-locate. 2. The method of claim 1, wherein the data object co-locate write request includes a first data identifier for the data object to be co-located and a second data identifier for the data object to be co-located with. 3. The method of claim 2, wherein the first and second data identifiers include at least:
a data name; an object number; and source name. 4. The method of claim 2, wherein the first and second data identifiers include at least:
a slice index field; a vault identifier (ID) field; a generation field; an object number field; and a segment number field. 5. The method of claim 4, wherein the co-located data objects have same vault identifier (ID), same generation field number, and similar object field numbers with storage of the plurality of sets of encoded data slices in the DSN within a range of DSN addresses assigned to a common set of storage units within the DSN. 6. The method of claim 4, wherein generating the plurality of sets of slice names further comprises:
modifying the vault ID of the first data identifier to match the vault ID of the second data identifier; and modifying the object number fields of the first data identifier to be in a range of the object number fields of the second data identifier. 7. The method of claim 4 further comprises:
when obtaining a plurality of sets of encoded data slices, identifying a set of execution units associated with the data ID of the data object to be co-located with. 8. The method of claim 7, wherein the identifying includes:
accessing one or more of a directory and a dispersed hierarchical index to identify a DSN address associated with the data ID of the data object to be co-located with; and performing a DSN address-to-physical location table lookup to identify the set of execution units. 9. The method of claim 1 further comprises:
after storing the plurality of sets of encoded data slices in the DSN, confirming storage of the plurality of sets of encoded data slices; and
after confirming, and when the sets of encoded data slices for a data object to co-locate were previous stored in the DSN, deleting the previously stored plurality of sets of encoded data slices. 10. The method of claim 1, wherein the obtaining includes one or more of:
receiving by extracting the plurality of sets of encoded data slices from the write request; generating by encoding the data object be co-located using a dispersed storage error coding function to produce the plurality of sets of encoded data slices; and retrieving by identifying previous sets of slice names utilized to store the plurality of sets of encoded data slices based on a data ID of the data object to become co-located, determining if they are presently co-located and, if not, issuing one or more sets of read slice requests to a previously utilized set of storage units where the one or more sets of read slice requests includes the previous sets of slice names, and receiving the plurality of sets of encoded data slices. 11. The method of claim 1, wherein the data object co-locate request further includes the data object to be co-located. 12. The method of claim 1, wherein the received data object comprises two or more data objects to be co-located. 13. A dispersed storage (DS) module comprises:
a first module, when operable within a computing device, causes the computing device to: receive a data object co-locate write request; a second module, when operable within the computing device, causes the computing device to: obtain a plurality of sets of encoded data slices for a data object to co-locate; a third module, when operable within the computing device, causes the computing device to: generate a plurality of sets of slice names for the data object to co-locate based on another plurality of sets of slice names associated with a data object to be co-located with; and a fourth module, when operable within the computing device, causes the computing device to: store the plurality of sets of encoded data slices in memory using the generated plurality of sets of slice names for the data object co-locate. 14. The DS module of claim 13 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
receive, wherein the second module extracts the plurality of sets of encoded data slices from the write request;
generate, wherein the second module encodes the data object be co-located using a dispersed storage error coding function to produce the plurality of sets of encoded data slices; and
retrieve, wherein the second module identifies previous sets of slice names utilized to store the plurality of sets of encoded data slices based on a data ID of the data object to become co-located, issues one or more sets of read slice requests to a previously utilized set of storage units where the one or more sets of read slice requests includes the previous sets of slice names, and receiving the plurality of sets of encoded data slices. 15. The DS module of claim 13 further comprises:
the third module, when operable within the computing device, further causes the computing device to:
generate the plurality of sets of slice names to produce co-located data objects with same vault identifier (ID), same generation field number, and similar object field numbers. 16. The DS module of claim 13 further comprises:
the second module, when operable within the computing device, further causes the computing device to:
when obtaining the plurality of sets of encoded data slices, identify a set of execution units associated with the data ID of the data object to be co-located with, wherein the identifying includes:
accessing one or more of a directory and a dispersed hierarchical index to identify a memory address associated with a data ID of the data object to be co-located with; and performing an address-to-physical location table lookup to identify the set of execution units. 17. The DS module of claim 13 further comprises:
the third module, when operable within the computing device, further causes the computing device to:
modify a vault ID of a first data identifier data of the object to co-locate to match a vault ID of a second data identifier of the data object to co-locate with; and
modify the object number fields of the first data identifier to be in a range of the object number fields of the second data identifier. 18. The DS module of claim 13 further comprises:
a fifth module, when operable within the computing device, further causes the computing device to:
after storing the plurality of sets of encoded data slices in the memory, confirm storage of the plurality of sets of encoded data slices; and
after confirming, delete the plurality of sets of encoded data slices associated with the first data identifier. 19. The DS module of claim 13 further comprises:
the fourth module, when operable within the computing device, further causes the computing device to:
store the plurality of sets of encoded data slices in the memory within a range of the memory addresses assigned to a common set of storage units within the memory. 20. A method for execution within a dispersed storage network (DSN), the method comprises:
receiving a data object co-locate write request; obtaining a plurality of sets of encoded data slices for a data object to co-locate including:
when the write request includes the data object to be co-located, encoding the included data object to produce a plurality of sets of encoded data slices; and
when the write request identifies a previously stored data object to be co-located, retrieving sets of encoded data slices of the previously stored data object;
generating a plurality of sets of slice names for the data object to co-locate based on another plurality of sets of slice names associated with a data object to be co-located with including:
generating co-located data objects have same vault identifier (ID), same generation field number, and object field numbers within a range of addresses assigned to a common set of storage units storing the plurality of sets of slice names associated with a data object to be co-located with; and
storing the plurality of sets of encoded data slices in the DSN using the generated plurality of sets of slice names for the data object to co-locate. | 2,100 |
6,178 | 6,178 | 14,846,511 | 2,176 | The present disclosure relates to techniques for accessing modes of operation and techniques for providing an alarm interface for electronic devices. In some embodiments, a device detects that a battery is being charged and that the device is oriented in a predefined orientation. In accordance with the detection that the battery is being charged and that the device is oriented in the predefined orientation, the device activates a predefined mode of operation. In some embodiments, a device displays a first user interface object in a first color, and, at a predetermined time, the device displays the first user interface object in a second color and displays an option for dismissing an alarm, wherein the option for dismissing is displayed as a second user interface object located at a portion of a display of the device proximate to a hardware button of the device. | 1. A non-transitory computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a portable multifunction device with a battery, cause the device to:
detect that the battery is being charged; detect that the device is oriented in a predefined orientation; and in accordance with the detection that the battery is being charged and the detection that the device is oriented in the predefined orientation, activate a predefined mode of operation. 2. The non-transitory computer-readable storage medium of claim 1, wherein detecting that the device is in a predefined orientation comprises detecting that a face of the display of the device is substantially vertical. 3. The non-transitory computer-readable storage medium of claim 1, wherein detecting that the device is in a predefined orientation comprises detecting that a predefined face of the device is facing substantially upward. 4. The non-transitory computer-readable storage medium of claim 1, wherein activating the predefined mode of operation comprises activating a nightstand mode and displaying an interface of the nightstand mode. 5. The non-transitory computer-readable storage medium of claim 1, wherein activating the predefined mode of operation comprises activating a do-not-disturb mode. 6. The non-transitory computer-readable storage medium of claim 4, wherein displaying an interface of the nightstand mode comprises displaying a clock face. 7. The non-transitory computer-readable storage medium of claim 4, wherein displaying an interface of the nightstand mode comprises displaying a battery indicator. 8. The non-transitory computer-readable storage medium of claim 4, wherein displaying an interface of the nightstand mode comprises displaying an alarm indicator. 9. The non-transitory computer-readable storage medium of claim 4, wherein the instructions further cause the device to:
while nightstand mode is activated:
in response to receipt on an incoming notification:
suppress providing a first notification indicator configured to be provided when nightstand mode is inactive; and
provide a second notification indicator. 10. The non-transitory computer-readable storage medium of claim 1, wherein the instructions further cause the device to:
after a predefined period of time following the activation of the predefined mode of operation, cease to display a user interface. 11. The non-transitory computer-readable storage medium of claim 10, wherein the instructions further cause the device to:
resume display of the user interface at a predetermined time. 12. The non-transitory computer-readable storage medium of claim 10, wherein the instructions further cause the device to:
detect a first input; and in response to detecting the first input, resume display of the user interface. 13. The non-transitory computer-readable storage medium of claim 12, wherein the first input comprises acceleration of the device. 14. The non-transitory computer-readable storage medium of claim 13, wherein the acceleration is transmitted to the device through a surface on which the device is resting. 15. The non-transitory computer-readable storage medium of claim 12, wherein first the input comprises one or more taps. 16. The non-transitory computer-readable storage medium of claim 1, wherein the instructions further cause the device to:
while nightstand mode is activated:
detect a second input; and
in response to detecting the second input, display a user interface indicating a plurality of notifications. 17. A method comprising:
at an electronic device with a display, a battery, and one or more processors;
detecting that the battery is being charged;
detecting that the device is oriented in a predefined orientation; and
in accordance with the detection that the battery is being charged and the detection that the device is oriented in the predefined orientation, activating a predefined mode of operation. 18. A device comprising:
a display; a battery; one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the device to:
detect that the battery is being charged;
detect that the device is oriented in a predefined orientation; and
in accordance with the detection that the battery is being charged and the detection that the device is oriented in the predefined orientation, activate a predefined mode of operation. 19. A non-transitory computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a portable multifunction device with a hardware button, cause the device to:
display a first user interface object in a first color; at a predetermined time:
display the first user interface object in a second color; and
display an option for dismissing an alarm, wherein the option for dismissing is displayed as a second user interface object located at a portion of the display proximate to the a hardware button 20. The non-transitory computer-readable storage medium of claim 19, further comprising instructions for:
detecting a first input comprising an actuation of the hardware button; and in response to detecting the first input, dismissing the alarm. 21. The non-transitory computer-readable storage medium of claim 19, wherein the instructions further cause the device to:
detect a second input comprising acceleration of the device; and in response to detecting the second input, dismiss the alarm. 22. The non-transitory computer-readable storage medium of claim 19, wherein the instructions further cause the device to:
detect a third input comprising a voice command; and; in response to detecting the third input, dismiss the alarm. 23. The non-transitory computer-readable storage medium of claim 19, wherein the instructions further cause the device to:
detect a fourth input comprising a disconnection of the device from a charging connector; and in response to detecting the fourth input, dismiss the alarm. 24. The non-transitory computer-readable storage medium of claim 19, wherein the device comprises a second hardware button, wherein the instructions further cause the device to:
at the predetermined time:
display an option for snoozing the alarm, wherein the option for snoozing is displayed as a third user interface object located at a portion of the display proximate to the second hardware button. 25. The non-transitory computer-readable storage medium of claim 24, wherein the instructions further cause the device to:
detect a fifth input comprising actuation of the second hardware button; and in response to detecting the fifth input, snooze the alarm. 26. The non-transitory computer-readable storage medium of claim 24, wherein the instructions further cause the device to:
detect a sixth input comprising acceleration of the device; and in response to detecting the sixth input, snooze the alarm. 27. The non-transitory computer-readable storage medium of claim 24, wherein the instructions further cause the device to:
detect a seventh input comprising a voice command; and in response to detecting the seventh input, snooze the alarm. 28. The non-transitory computer-readable storage medium of claim 24, wherein the instructions further cause the device to:
after snoozing the alarm, display an indication that the alarm has been snoozed, wherein the indication is displayed in the second color. 29. The non-transitory computer-readable storage medium of claim 24, wherein:
displaying an option for dismissing the alarm comprises displaying an animation of the second user interface object moving across the display from an edge of the display proximate to the first hardware button; and displaying an option for snoozing the alarm comprises displaying an animation of the third user interface object moving across the display from an edge of the display proximate to the second hardware button. 30. The non-transitory computer-readable storage medium of claim 20, wherein the instructions further cause the device to:
upon dismissing the alarm, display a user interface indicating a plurality of notifications. 31. The non-transitory computer-readable storage medium of claim 30, wherein the instructions further cause the device to:
detect an eighth input comprising a disconnection of the device from a charging connector; and in response to detecting the eighth input, cease to display the user interface indicating the plurality of notifications. 32. A method comprising:
at an electronic device with a display, a hardware button, and one or more processors;
displaying a first user interface object in a first color;
at a predetermined time:
displaying the first user interface object in a second color; and
displaying an option for dismissing an alarm, wherein the option for dismissing is displayed as a second user interface object located at a portion of the display proximate to the hardware button. 33. A device comprising:
a display; a hardware button; one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the device to:
display a first user interface object in a first color;
at a predetermined time:
display the first user interface object in a second color; and
display an option for dismissing an alarm, wherein the option for dismissing is displayed as a second user interface object located at a portion of the display proximate to the hardware button. | The present disclosure relates to techniques for accessing modes of operation and techniques for providing an alarm interface for electronic devices. In some embodiments, a device detects that a battery is being charged and that the device is oriented in a predefined orientation. In accordance with the detection that the battery is being charged and that the device is oriented in the predefined orientation, the device activates a predefined mode of operation. In some embodiments, a device displays a first user interface object in a first color, and, at a predetermined time, the device displays the first user interface object in a second color and displays an option for dismissing an alarm, wherein the option for dismissing is displayed as a second user interface object located at a portion of a display of the device proximate to a hardware button of the device.1. A non-transitory computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a portable multifunction device with a battery, cause the device to:
detect that the battery is being charged; detect that the device is oriented in a predefined orientation; and in accordance with the detection that the battery is being charged and the detection that the device is oriented in the predefined orientation, activate a predefined mode of operation. 2. The non-transitory computer-readable storage medium of claim 1, wherein detecting that the device is in a predefined orientation comprises detecting that a face of the display of the device is substantially vertical. 3. The non-transitory computer-readable storage medium of claim 1, wherein detecting that the device is in a predefined orientation comprises detecting that a predefined face of the device is facing substantially upward. 4. The non-transitory computer-readable storage medium of claim 1, wherein activating the predefined mode of operation comprises activating a nightstand mode and displaying an interface of the nightstand mode. 5. The non-transitory computer-readable storage medium of claim 1, wherein activating the predefined mode of operation comprises activating a do-not-disturb mode. 6. The non-transitory computer-readable storage medium of claim 4, wherein displaying an interface of the nightstand mode comprises displaying a clock face. 7. The non-transitory computer-readable storage medium of claim 4, wherein displaying an interface of the nightstand mode comprises displaying a battery indicator. 8. The non-transitory computer-readable storage medium of claim 4, wherein displaying an interface of the nightstand mode comprises displaying an alarm indicator. 9. The non-transitory computer-readable storage medium of claim 4, wherein the instructions further cause the device to:
while nightstand mode is activated:
in response to receipt on an incoming notification:
suppress providing a first notification indicator configured to be provided when nightstand mode is inactive; and
provide a second notification indicator. 10. The non-transitory computer-readable storage medium of claim 1, wherein the instructions further cause the device to:
after a predefined period of time following the activation of the predefined mode of operation, cease to display a user interface. 11. The non-transitory computer-readable storage medium of claim 10, wherein the instructions further cause the device to:
resume display of the user interface at a predetermined time. 12. The non-transitory computer-readable storage medium of claim 10, wherein the instructions further cause the device to:
detect a first input; and in response to detecting the first input, resume display of the user interface. 13. The non-transitory computer-readable storage medium of claim 12, wherein the first input comprises acceleration of the device. 14. The non-transitory computer-readable storage medium of claim 13, wherein the acceleration is transmitted to the device through a surface on which the device is resting. 15. The non-transitory computer-readable storage medium of claim 12, wherein first the input comprises one or more taps. 16. The non-transitory computer-readable storage medium of claim 1, wherein the instructions further cause the device to:
while nightstand mode is activated:
detect a second input; and
in response to detecting the second input, display a user interface indicating a plurality of notifications. 17. A method comprising:
at an electronic device with a display, a battery, and one or more processors;
detecting that the battery is being charged;
detecting that the device is oriented in a predefined orientation; and
in accordance with the detection that the battery is being charged and the detection that the device is oriented in the predefined orientation, activating a predefined mode of operation. 18. A device comprising:
a display; a battery; one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the device to:
detect that the battery is being charged;
detect that the device is oriented in a predefined orientation; and
in accordance with the detection that the battery is being charged and the detection that the device is oriented in the predefined orientation, activate a predefined mode of operation. 19. A non-transitory computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a portable multifunction device with a hardware button, cause the device to:
display a first user interface object in a first color; at a predetermined time:
display the first user interface object in a second color; and
display an option for dismissing an alarm, wherein the option for dismissing is displayed as a second user interface object located at a portion of the display proximate to the a hardware button 20. The non-transitory computer-readable storage medium of claim 19, further comprising instructions for:
detecting a first input comprising an actuation of the hardware button; and in response to detecting the first input, dismissing the alarm. 21. The non-transitory computer-readable storage medium of claim 19, wherein the instructions further cause the device to:
detect a second input comprising acceleration of the device; and in response to detecting the second input, dismiss the alarm. 22. The non-transitory computer-readable storage medium of claim 19, wherein the instructions further cause the device to:
detect a third input comprising a voice command; and; in response to detecting the third input, dismiss the alarm. 23. The non-transitory computer-readable storage medium of claim 19, wherein the instructions further cause the device to:
detect a fourth input comprising a disconnection of the device from a charging connector; and in response to detecting the fourth input, dismiss the alarm. 24. The non-transitory computer-readable storage medium of claim 19, wherein the device comprises a second hardware button, wherein the instructions further cause the device to:
at the predetermined time:
display an option for snoozing the alarm, wherein the option for snoozing is displayed as a third user interface object located at a portion of the display proximate to the second hardware button. 25. The non-transitory computer-readable storage medium of claim 24, wherein the instructions further cause the device to:
detect a fifth input comprising actuation of the second hardware button; and in response to detecting the fifth input, snooze the alarm. 26. The non-transitory computer-readable storage medium of claim 24, wherein the instructions further cause the device to:
detect a sixth input comprising acceleration of the device; and in response to detecting the sixth input, snooze the alarm. 27. The non-transitory computer-readable storage medium of claim 24, wherein the instructions further cause the device to:
detect a seventh input comprising a voice command; and in response to detecting the seventh input, snooze the alarm. 28. The non-transitory computer-readable storage medium of claim 24, wherein the instructions further cause the device to:
after snoozing the alarm, display an indication that the alarm has been snoozed, wherein the indication is displayed in the second color. 29. The non-transitory computer-readable storage medium of claim 24, wherein:
displaying an option for dismissing the alarm comprises displaying an animation of the second user interface object moving across the display from an edge of the display proximate to the first hardware button; and displaying an option for snoozing the alarm comprises displaying an animation of the third user interface object moving across the display from an edge of the display proximate to the second hardware button. 30. The non-transitory computer-readable storage medium of claim 20, wherein the instructions further cause the device to:
upon dismissing the alarm, display a user interface indicating a plurality of notifications. 31. The non-transitory computer-readable storage medium of claim 30, wherein the instructions further cause the device to:
detect an eighth input comprising a disconnection of the device from a charging connector; and in response to detecting the eighth input, cease to display the user interface indicating the plurality of notifications. 32. A method comprising:
at an electronic device with a display, a hardware button, and one or more processors;
displaying a first user interface object in a first color;
at a predetermined time:
displaying the first user interface object in a second color; and
displaying an option for dismissing an alarm, wherein the option for dismissing is displayed as a second user interface object located at a portion of the display proximate to the hardware button. 33. A device comprising:
a display; a hardware button; one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the device to:
display a first user interface object in a first color;
at a predetermined time:
display the first user interface object in a second color; and
display an option for dismissing an alarm, wherein the option for dismissing is displayed as a second user interface object located at a portion of the display proximate to the hardware button. | 2,100 |
6,179 | 6,179 | 15,995,040 | 2,143 | The disclosed embodiments are directed to a media capture lock affordance for a graphical user interface displayed by a media capture device. The media capture lock affordance allows a user to lock and unlock a capture state of the media capture device using a simple and intuitive touch gesture that can be applied by the user's finger (e.g., the user's thumb) while holding the media capture device in one hand. | 1. A method of capturing media comprising:
detecting, by a media capture device, a tap and hold gesture input directed to a media capture affordance displayed at a first location on a graphical user interface presented on a display screen of the media capture device; responsive to the tap and hold gesture input, initiating, by the image capture device, a media capture session on the media capture device in an unlocked media capture session state; responsive to the media capture device detecting a first lift gesture in which the tap and hold gesture input lifts from the first location on the graphical user interface during the media capture session, terminating, by the image capture device, the media capture session; responsive to the media capture device detecting a slide gesture input in which the media capture affordance slides from the first location to a second location on the graphical user interface during the media capture session, changing, by the media capture device, the media capture affordance to a media capture lock affordance; and responsive to the media capture device detecting a second lift gesture in which the slide gesture input lifts from the graphical user interface at the second location during the media capture session, transitioning, by the media capture device, the media capture session into a locked media capture session state. 2. The method of claim 1, wherein:
responsive to a tap gesture input directed to the media capture lock affordance, terminating the locked state or media capture session. 3. The method of claim 1, wherein changing the media capture affordance to the media capture lock affordance includes changing a size of the media capture affordance. 4. The method of claim 1, wherein changing the media capture affordance to the media capture lock affordance includes changing the size and a shape of the media capture affordance. 5. The method of claim 1, wherein changing the media capture affordance to the media capture lock affordance includes animating the media capture affordance to morph into the media capture lock affordance. 6. The method of claim 1, further comprising:
causing to display on the GUI a visual indicator indicating a direction for the slide gesture input on the GUI. 7. The method of claim 1, further comprising:
causing to display a first text message on the GUI before the slide gesture input, and displaying a second text message, different than the first text message, after the second lift gesture. 8. A media capture device comprising:
a touch screen; one or more processors; memory coupled to the one or more processors and configured to store instructions, which, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
detecting, by the touch screen, a tap and hold gesture input directed to a media capture affordance displayed at a first location on a graphical user interface presented on the touch screen of the media capture device;
responsive to the tap and hold gesture input, initiating a media capture session on the media capture device in an unlocked media capture session state;
responsive to the touch screen detecting a first lift gesture in which the tap and hold gesture input lifts from the first location on the graphical user interface during the media capture session, terminating the media capture session;
responsive to the touch screen detecting a slide gesture input in which the media capture affordance slides from the first location to a second location on the graphical user interface during the media capture session, changing the media capture affordance to a media capture lock affordance; and
responsive to the touch screen detecting a second lift gesture in which the slide gesture input lifts from the graphical user interface at the second location during the media capture session, transitioning the media capture session into a locked media capture session state. 9. The media capture device of claim 8, wherein:
responsive to a tap gesture input directed to the media capture lock affordance, terminating the locked media capture session state. 10. The media capture device of claim 8, wherein changing the media capture affordance to the media capture lock affordance includes changing an appearance of the media capture affordance. 11. The media capture device of claim 8, wherein changing the media capture affordance to the media capture lock affordance includes changing the size and a shape of the media capture affordance. 12. The media capture device of claim 8, wherein changing the media capture affordance to the media capture lock affordance includes animating the media capture affordance to morph into the media capture lock affordance. 13. The media capture device of claim 8, the operations further comprising:
causing to display on the GUI a visual indicator indicating a direction for the slide gesture input on the GUI. 14. The media capture device of claim 8, the operations further comprising:
causing to display a first text message on the GUI before the slide gesture input, and displaying a second text message, different than the first text message, after the second lift gesture. 15. A non-transitory, computer-readable storage medium having instructions stored thereon that when executed by a media capture device, causes the media capture device to perform operations comprising:
detecting, by the media capture device, a tap and hold gesture input directed to a media capture affordance displayed at a first location on a graphical user interface presented on a display screen of the media capture device; responsive to the tap and hold gesture input, initiating, by the image capture device, a media capture session on the media capture device in an unlocked media session capture state; responsive to the media capture device detecting a first lift gesture in which the tap and hold gesture input lifts from the first location on the graphical user interface during the media capture session, terminating, by the image capture device, the media capture session; responsive to the media capture device detecting a slide gesture input in which the media capture affordance slides from the first location to a second location on the graphical user interface during the media capture session, changing, by the media capture device, the media capture affordance to a media capture lock affordance; and responsive to the media capture device detecting a second lift gesture in which the slide gesture input lifts from the graphical user interface at the second location during the media capture session, transitioning, by the media capture device, the media capture session into a locked media capture session state. 16. The non-transitory, computer-readable storage medium of claim 15, wherein:
responsive to a tap gesture input directed to the media capture lock affordance, terminating the locked state or media capture session. 17. The non-transitory, computer-readable storage medium of claim 15, wherein changing the media capture affordance to the media capture lock affordance includes changing an appearance of the media capture affordance. 18. The non-transitory, computer-readable storage medium of claim 15, wherein changing the media capture affordance to the media capture lock affordance includes animating the media capture affordance to morph into the media capture lock affordance. 19. The non-transitory, computer-readable storage medium of claim 15, further comprising:
causing to display on the GUI a visual indicator indicating a direction for the slide gesture input on the GUI. 20. The non-transitory, computer-readable storage medium of claim 15, further comprising:
causing to display a first text message on the GUI before the slide gesture input, and displaying a second text message, different than the first text message, after the second lift gesture. | The disclosed embodiments are directed to a media capture lock affordance for a graphical user interface displayed by a media capture device. The media capture lock affordance allows a user to lock and unlock a capture state of the media capture device using a simple and intuitive touch gesture that can be applied by the user's finger (e.g., the user's thumb) while holding the media capture device in one hand.1. A method of capturing media comprising:
detecting, by a media capture device, a tap and hold gesture input directed to a media capture affordance displayed at a first location on a graphical user interface presented on a display screen of the media capture device; responsive to the tap and hold gesture input, initiating, by the image capture device, a media capture session on the media capture device in an unlocked media capture session state; responsive to the media capture device detecting a first lift gesture in which the tap and hold gesture input lifts from the first location on the graphical user interface during the media capture session, terminating, by the image capture device, the media capture session; responsive to the media capture device detecting a slide gesture input in which the media capture affordance slides from the first location to a second location on the graphical user interface during the media capture session, changing, by the media capture device, the media capture affordance to a media capture lock affordance; and responsive to the media capture device detecting a second lift gesture in which the slide gesture input lifts from the graphical user interface at the second location during the media capture session, transitioning, by the media capture device, the media capture session into a locked media capture session state. 2. The method of claim 1, wherein:
responsive to a tap gesture input directed to the media capture lock affordance, terminating the locked state or media capture session. 3. The method of claim 1, wherein changing the media capture affordance to the media capture lock affordance includes changing a size of the media capture affordance. 4. The method of claim 1, wherein changing the media capture affordance to the media capture lock affordance includes changing the size and a shape of the media capture affordance. 5. The method of claim 1, wherein changing the media capture affordance to the media capture lock affordance includes animating the media capture affordance to morph into the media capture lock affordance. 6. The method of claim 1, further comprising:
causing to display on the GUI a visual indicator indicating a direction for the slide gesture input on the GUI. 7. The method of claim 1, further comprising:
causing to display a first text message on the GUI before the slide gesture input, and displaying a second text message, different than the first text message, after the second lift gesture. 8. A media capture device comprising:
a touch screen; one or more processors; memory coupled to the one or more processors and configured to store instructions, which, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
detecting, by the touch screen, a tap and hold gesture input directed to a media capture affordance displayed at a first location on a graphical user interface presented on the touch screen of the media capture device;
responsive to the tap and hold gesture input, initiating a media capture session on the media capture device in an unlocked media capture session state;
responsive to the touch screen detecting a first lift gesture in which the tap and hold gesture input lifts from the first location on the graphical user interface during the media capture session, terminating the media capture session;
responsive to the touch screen detecting a slide gesture input in which the media capture affordance slides from the first location to a second location on the graphical user interface during the media capture session, changing the media capture affordance to a media capture lock affordance; and
responsive to the touch screen detecting a second lift gesture in which the slide gesture input lifts from the graphical user interface at the second location during the media capture session, transitioning the media capture session into a locked media capture session state. 9. The media capture device of claim 8, wherein:
responsive to a tap gesture input directed to the media capture lock affordance, terminating the locked media capture session state. 10. The media capture device of claim 8, wherein changing the media capture affordance to the media capture lock affordance includes changing an appearance of the media capture affordance. 11. The media capture device of claim 8, wherein changing the media capture affordance to the media capture lock affordance includes changing the size and a shape of the media capture affordance. 12. The media capture device of claim 8, wherein changing the media capture affordance to the media capture lock affordance includes animating the media capture affordance to morph into the media capture lock affordance. 13. The media capture device of claim 8, the operations further comprising:
causing to display on the GUI a visual indicator indicating a direction for the slide gesture input on the GUI. 14. The media capture device of claim 8, the operations further comprising:
causing to display a first text message on the GUI before the slide gesture input, and displaying a second text message, different than the first text message, after the second lift gesture. 15. A non-transitory, computer-readable storage medium having instructions stored thereon that when executed by a media capture device, causes the media capture device to perform operations comprising:
detecting, by the media capture device, a tap and hold gesture input directed to a media capture affordance displayed at a first location on a graphical user interface presented on a display screen of the media capture device; responsive to the tap and hold gesture input, initiating, by the image capture device, a media capture session on the media capture device in an unlocked media session capture state; responsive to the media capture device detecting a first lift gesture in which the tap and hold gesture input lifts from the first location on the graphical user interface during the media capture session, terminating, by the image capture device, the media capture session; responsive to the media capture device detecting a slide gesture input in which the media capture affordance slides from the first location to a second location on the graphical user interface during the media capture session, changing, by the media capture device, the media capture affordance to a media capture lock affordance; and responsive to the media capture device detecting a second lift gesture in which the slide gesture input lifts from the graphical user interface at the second location during the media capture session, transitioning, by the media capture device, the media capture session into a locked media capture session state. 16. The non-transitory, computer-readable storage medium of claim 15, wherein:
responsive to a tap gesture input directed to the media capture lock affordance, terminating the locked state or media capture session. 17. The non-transitory, computer-readable storage medium of claim 15, wherein changing the media capture affordance to the media capture lock affordance includes changing an appearance of the media capture affordance. 18. The non-transitory, computer-readable storage medium of claim 15, wherein changing the media capture affordance to the media capture lock affordance includes animating the media capture affordance to morph into the media capture lock affordance. 19. The non-transitory, computer-readable storage medium of claim 15, further comprising:
causing to display on the GUI a visual indicator indicating a direction for the slide gesture input on the GUI. 20. The non-transitory, computer-readable storage medium of claim 15, further comprising:
causing to display a first text message on the GUI before the slide gesture input, and displaying a second text message, different than the first text message, after the second lift gesture. | 2,100 |
6,180 | 6,180 | 13,767,687 | 2,121 | According to one aspect of the present disclosure, a method and technique for discovering a grouping related computing resources using machine learning is disclosed. The method includes: receiving, by a discovery engine executing on a processor unit, a grouped unit of at least two configuration items of a computing environment; analyzing, by the discovery engine, the grouped unit to determine a correlation between the configuration items of the grouped unit; automatically creating a rule, by the discovery engine, based on the determined correlation; applying the rule, by the discovery engine, to automatically identify another configuration item of the computing environment related to the configuration items of the grouped unit; and responsive to identifying another configuration item of the computing environment based on application of the rule, including the identified configuration item in the grouped unit. | 1. A method, comprising:
receiving, by a discovery engine executing on a processor unit, a grouped unit of at least two configuration items of a computing environment; analyzing, by the discovery engine, the grouped unit to determine a correlation between the configuration items of the grouped unit; automatically creating a rule, by the discovery engine, based on the determined correlation; applying the rule, by the discovery engine, to automatically identify another configuration item of the computing environment related to the configuration items of the grouped unit; and responsive to identifying another configuration item of the computing environment based on application of the rule, including the identified configuration item in the grouped unit. 2. The method of claim 1, further comprising creating the rule based on text metadata of at least one of the configuration items of the grouped unit. 3. The method of claim 1, further comprising creating the rule based on a network pattern associated with at least one of the configuration items of the grouped unit. 4. The method of claim 1, further comprising creating the rule based on a data flow pattern corresponding to at least one of the configuration items of the grouped unit. 5. The method of claim 1, further comprising:
displaying the grouped unit with the identified configuration item based on the rule application; receiving an acceptance or rejection of the identified configuration item for the grouped unit; and responsive to receiving the acceptance or rejection, modifying the rule based on the acceptance or rejection. 6. The method of claim 1, wherein applying the rule comprises querying a repository of configuration items associated with the computing environment. 7. The method of claim 1, further comprising:
displaying the rule to a user; receiving a modification to the rule from the user; and applying the modified rule to the computing environment. 8. A method, comprising:
storing in a repository a plurality of configuration items associated with a computing environment; receiving, by a discovery engine executing on a processing unit, a grouped unit of at least two configuration items stored in the repository; analyzing, by the discovery engine, the grouped unit to determine a correlation between the configuration items of the grouped unit; automatically generating a query by the discovery engine based on the determined correlation and submitting the query to the repository to automatically identify another configuration item of the computing environment related to the configuration items of the grouped unit; and responsive to identifying another configuration item of the computing environment based on a response to the query, including the identified configuration item in the grouped unit. 9. The method of claim 8, wherein analyzing the grouped unit comprises:
analyzing text metadata associated with at least one of the configuration items of the grouped unit; analyzing a network pattern associated with at least one of the configuration items of the grouped unit; and analyzing a data flow pattern corresponding to at least one of the configuration items of the grouped unit. 10. The method of claim 9, further comprising:
displaying the query to a user; receiving by the discovery engine a modification to the query from the user; and submitting the modified query to the repository. 11. The method of claim 8, further comprising:
displaying the grouped unit with the identified configuration item based on the response to the query; receiving an acceptance or rejection of the identified configuration item for the grouped unit; responsive to receiving the acceptance or rejection, automatically modifying, by the discovery engine, the query based on the acceptance or rejection; and submitting the modified query to the repository. 12. The method of claim 9, further comprising querying the repository to identify another configuration item having metadata corresponding to metadata of at least one of the configuration items of the grouped unit. 13. The method of claim 12, further comprising, responsive to identifying another configuration item having metadata corresponding to metadata of at least on the configuration items of the grouped unit, determining whether the identified configuration item is related to at least on the configuration items of the grouped unit based on a data flow pattern. | According to one aspect of the present disclosure, a method and technique for discovering a grouping related computing resources using machine learning is disclosed. The method includes: receiving, by a discovery engine executing on a processor unit, a grouped unit of at least two configuration items of a computing environment; analyzing, by the discovery engine, the grouped unit to determine a correlation between the configuration items of the grouped unit; automatically creating a rule, by the discovery engine, based on the determined correlation; applying the rule, by the discovery engine, to automatically identify another configuration item of the computing environment related to the configuration items of the grouped unit; and responsive to identifying another configuration item of the computing environment based on application of the rule, including the identified configuration item in the grouped unit.1. A method, comprising:
receiving, by a discovery engine executing on a processor unit, a grouped unit of at least two configuration items of a computing environment; analyzing, by the discovery engine, the grouped unit to determine a correlation between the configuration items of the grouped unit; automatically creating a rule, by the discovery engine, based on the determined correlation; applying the rule, by the discovery engine, to automatically identify another configuration item of the computing environment related to the configuration items of the grouped unit; and responsive to identifying another configuration item of the computing environment based on application of the rule, including the identified configuration item in the grouped unit. 2. The method of claim 1, further comprising creating the rule based on text metadata of at least one of the configuration items of the grouped unit. 3. The method of claim 1, further comprising creating the rule based on a network pattern associated with at least one of the configuration items of the grouped unit. 4. The method of claim 1, further comprising creating the rule based on a data flow pattern corresponding to at least one of the configuration items of the grouped unit. 5. The method of claim 1, further comprising:
displaying the grouped unit with the identified configuration item based on the rule application; receiving an acceptance or rejection of the identified configuration item for the grouped unit; and responsive to receiving the acceptance or rejection, modifying the rule based on the acceptance or rejection. 6. The method of claim 1, wherein applying the rule comprises querying a repository of configuration items associated with the computing environment. 7. The method of claim 1, further comprising:
displaying the rule to a user; receiving a modification to the rule from the user; and applying the modified rule to the computing environment. 8. A method, comprising:
storing in a repository a plurality of configuration items associated with a computing environment; receiving, by a discovery engine executing on a processing unit, a grouped unit of at least two configuration items stored in the repository; analyzing, by the discovery engine, the grouped unit to determine a correlation between the configuration items of the grouped unit; automatically generating a query by the discovery engine based on the determined correlation and submitting the query to the repository to automatically identify another configuration item of the computing environment related to the configuration items of the grouped unit; and responsive to identifying another configuration item of the computing environment based on a response to the query, including the identified configuration item in the grouped unit. 9. The method of claim 8, wherein analyzing the grouped unit comprises:
analyzing text metadata associated with at least one of the configuration items of the grouped unit; analyzing a network pattern associated with at least one of the configuration items of the grouped unit; and analyzing a data flow pattern corresponding to at least one of the configuration items of the grouped unit. 10. The method of claim 9, further comprising:
displaying the query to a user; receiving by the discovery engine a modification to the query from the user; and submitting the modified query to the repository. 11. The method of claim 8, further comprising:
displaying the grouped unit with the identified configuration item based on the response to the query; receiving an acceptance or rejection of the identified configuration item for the grouped unit; responsive to receiving the acceptance or rejection, automatically modifying, by the discovery engine, the query based on the acceptance or rejection; and submitting the modified query to the repository. 12. The method of claim 9, further comprising querying the repository to identify another configuration item having metadata corresponding to metadata of at least one of the configuration items of the grouped unit. 13. The method of claim 12, further comprising, responsive to identifying another configuration item having metadata corresponding to metadata of at least on the configuration items of the grouped unit, determining whether the identified configuration item is related to at least on the configuration items of the grouped unit based on a data flow pattern. | 2,100 |
6,181 | 6,181 | 13,458,281 | 2,121 | According to one aspect of the present disclosure a system and technique discovering and grouping related computing resources using machine learning is disclosed. The system includes a processor unit and logic executable by the processor unit to: receive a grouped unit of at least two configuration items of a computing environment; analyze the grouped unit to determine a correlation between the configuration items of the grouped unit; create a rule based on the determined correlation; apply the rule to the computing environment to identify another configuration item of the computing environment related to the configuration items of the grouped unit; and responsive to identifying another configuration item of the computing environment based on application of the rule, include the identified configuration item in the grouped unit. | 1-7. (canceled) 8. A system, comprising:
a processor unit; logic executable by the processor unit to: receive a grouped unit of at least two configuration items of a computing environment; analyze the grouped unit to determine a correlation between the configuration items of the grouped unit; create a rule based on the determined correlation; apply the rule to the computing environment to identify another configuration item of the computing environment related to the configuration items of the grouped unit; and responsive to identifying another configuration item of the computing environment based on application of the rule, include the identified configuration item in the grouped unit. 9. The system of claim 8, wherein the logic is executable to create the rule based on text metadata of at least one of the configuration items of the grouped unit. 10. The system of claim 8, wherein the logic is executable to create the rule based on a network pattern associated with at least one of the configuration items of the grouped unit. 11. The system of claim 8, wherein the logic is executable to create the rule based on a data flow pattern corresponding to at least one of the configuration items of the grouped unit. 12. The system of claim 8, wherein the logic is executable to:
display the grouped unit with the identified configuration item based on the rule application; receive an acceptance or rejection of the identified configuration item for the grouped unit; and responsive to receiving the acceptance or rejection, modify the rule based on the acceptance or rejection. 13. The system of claim 8, wherein the logic is executable to apply the rule by querying a repository of configuration items associated with the computing environment. 14. The system of claim 8, wherein the logic is executable to:
display the rule to a user; receive a modification to the rule from the user; and apply the modified rule to the computing environment. 15. A computer program product for identifying and grouping computing resources, the computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising computer readable program code configured to:
receive a grouped unit of at least two configuration items of a computing environment;
analyze the grouped unit to determine a correlation between the configuration items of the grouped unit;
create a rule based on the determined correlation;
apply the rule to the computing environment to identify another configuration item of the computing environment related to the configuration items of the grouped unit; and
responsive to identifying another configuration item of the computing environment based on application of the rule, include the identified configuration item in the grouped unit. 16. The computer program product of claim 15, wherein the computer readable program code is configured to create the rule based on text metadata of at least one of the configuration items of the grouped unit. 17. The computer program product of claim 16, wherein the computer readable program code is configured to create the rule further based on a network pattern associated with at least one of the configuration items of the grouped unit. 18. The computer program product of claim 17, wherein the computer readable program code is configured to further create the rule based on a data flow pattern corresponding to at least one of the configuration items of the grouped unit. 19. The computer program product of claim 15, wherein the computer readable program code is configured to:
display the grouped unit with the identified configuration item based on the rule application; receive an acceptance or rejection of the identified configuration item for the grouped unit; and responsive to receiving the acceptance or rejection, modify the rule based on the acceptance or rejection. 20-25. (canceled) | According to one aspect of the present disclosure a system and technique discovering and grouping related computing resources using machine learning is disclosed. The system includes a processor unit and logic executable by the processor unit to: receive a grouped unit of at least two configuration items of a computing environment; analyze the grouped unit to determine a correlation between the configuration items of the grouped unit; create a rule based on the determined correlation; apply the rule to the computing environment to identify another configuration item of the computing environment related to the configuration items of the grouped unit; and responsive to identifying another configuration item of the computing environment based on application of the rule, include the identified configuration item in the grouped unit.1-7. (canceled) 8. A system, comprising:
a processor unit; logic executable by the processor unit to: receive a grouped unit of at least two configuration items of a computing environment; analyze the grouped unit to determine a correlation between the configuration items of the grouped unit; create a rule based on the determined correlation; apply the rule to the computing environment to identify another configuration item of the computing environment related to the configuration items of the grouped unit; and responsive to identifying another configuration item of the computing environment based on application of the rule, include the identified configuration item in the grouped unit. 9. The system of claim 8, wherein the logic is executable to create the rule based on text metadata of at least one of the configuration items of the grouped unit. 10. The system of claim 8, wherein the logic is executable to create the rule based on a network pattern associated with at least one of the configuration items of the grouped unit. 11. The system of claim 8, wherein the logic is executable to create the rule based on a data flow pattern corresponding to at least one of the configuration items of the grouped unit. 12. The system of claim 8, wherein the logic is executable to:
display the grouped unit with the identified configuration item based on the rule application; receive an acceptance or rejection of the identified configuration item for the grouped unit; and responsive to receiving the acceptance or rejection, modify the rule based on the acceptance or rejection. 13. The system of claim 8, wherein the logic is executable to apply the rule by querying a repository of configuration items associated with the computing environment. 14. The system of claim 8, wherein the logic is executable to:
display the rule to a user; receive a modification to the rule from the user; and apply the modified rule to the computing environment. 15. A computer program product for identifying and grouping computing resources, the computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising computer readable program code configured to:
receive a grouped unit of at least two configuration items of a computing environment;
analyze the grouped unit to determine a correlation between the configuration items of the grouped unit;
create a rule based on the determined correlation;
apply the rule to the computing environment to identify another configuration item of the computing environment related to the configuration items of the grouped unit; and
responsive to identifying another configuration item of the computing environment based on application of the rule, include the identified configuration item in the grouped unit. 16. The computer program product of claim 15, wherein the computer readable program code is configured to create the rule based on text metadata of at least one of the configuration items of the grouped unit. 17. The computer program product of claim 16, wherein the computer readable program code is configured to create the rule further based on a network pattern associated with at least one of the configuration items of the grouped unit. 18. The computer program product of claim 17, wherein the computer readable program code is configured to further create the rule based on a data flow pattern corresponding to at least one of the configuration items of the grouped unit. 19. The computer program product of claim 15, wherein the computer readable program code is configured to:
display the grouped unit with the identified configuration item based on the rule application; receive an acceptance or rejection of the identified configuration item for the grouped unit; and responsive to receiving the acceptance or rejection, modify the rule based on the acceptance or rejection. 20-25. (canceled) | 2,100 |
6,182 | 6,182 | 15,155,416 | 2,173 | Techniques are described for providing normalized object exposure in a collaborative platform. Implementations provide a collaborative platform to enable multiple users to collaborate to address an issue collectively. The platform enables a user to create a work routine in which objects may be added and manipulated by multiple users. The objects may be normalized through use of a normalized object contract. Tools may be added to the work routine, and linked to objects to apply functionality to the object data of the objects. The tools may also comply with the normalized object contract to be consumable within the platform. Through the contract, objects may exhibit a shared common state such that multiple users and/or processes access the same state for a particular object at any given time in a work routine. | 1. A computer-implemented method performed by at least one processor, the method comprising:
determining, by the at least one processor, one or more normalized data objects for consumption in an application executed by the at least one processor, the one or more normalized data objects complying with a normalized object contract that at least specifies one or more perspectives supported by the one or more normalized data objects, each of the one or more perspectives providing access to a set of data attributes of the one or more normalized data objects; determining, by the at least one processor, a perspective of the one or more perspectives supported by the one or more normalized data objects; and employing, by the at least one processor, the perspective to present, in a user interface (UI) of the application, the set of data attributes that correspond to the perspective for the one or more normalized data objects. 2. The method of claim 1, wherein the one or more perspectives include one or more of a Headerinfo perspective, an Identification perspective, a Lineltem perspective, and a SearchScope perspective. 3. The method of claim 1, wherein the normalized object contract further specifies that the one or more normalized data objects each includes a self-reference that comprises an instance key and a path to an object type. 4. The method of claim 1, wherein the normalized object contract further specifies that the one or more normalized data objects each provide a shared common state to a plurality of accessors. 5. The method of claim 1, wherein the normalized object contract further specifies that the one or more normalized data objects each have a type. 6. The method of claim 5, wherein each of the one or more normalized data objects support one or more other perspectives according to the type. 7. The method of claim 1, further comprising:
in response to a change in at least one of the set of data attributes, dynamically updating the presentation of the set of data attributes in the UI. 8. A system, comprising:
at least one processor; and a memory communicatively coupled to the at least one processor, the memory storing instructions which, when executed by the at least one processor, cause the at least one processor to perform operations comprising:
determining one or more normalized data objects for consumption in an application executed by the at least one processor, the one or more normalized data objects complying with a normalized object contract that at least specifies one or more perspectives supported by the one or more normalized data objects, each of the one or more perspectives providing access to a set of data attributes of the one or more normalized data objects;
determining a perspective of the one or more perspectives supported by the one or more normalized data objects; and
employing the perspective to present, in a user interface (UI) of the application, the set of data attributes that correspond to the perspective for the one or more normalized data objects. 9. The system of claim 8, wherein the one or more perspectives include one or more of a Headerinfo perspective, an Identification perspective, a Lineltem perspective, and a SearchScope perspective. 10. The system of claim 8, wherein the normalized object contract further specifies that the one or more normalized data objects each includes a self-reference that comprises an instance key and a path to an object type. 11. The system of claim 8, wherein the normalized object contract further specifies that the one or more normalized data objects each provide a shared common state to a plurality of accessors. 12. The system of claim 8, wherein the normalized object contract further specifies that the one or more normalized data objects each have a type. 13. The system of claim 12, wherein each of the one or more normalized data objects support one or more other perspectives according to the type. 14. The system of claim 8, the operations further comprising:
in response to a change in at least one of the set of data attributes, dynamically updating the presentation of the set of data attributes in the UI. 15. One or more computer-readable media storing instructions which, when executed by at least one processor, cause the at least one processor to perform operations comprising:
determining one or more normalized data objects for consumption in an application executed by the at least one processor, the one or more normalized data objects complying with a normalized object contract that at least specifies one or more perspectives supported by the one or more normalized data objects, each of the one or more perspectives providing access to a set of data attributes of the one or more normalized data objects; determining a perspective of the one or more perspectives supported by the one or more normalized data objects; and employing the perspective to present, in a user interface (UI) of the application, the set of data attributes that correspond to the perspective for the one or more normalized data objects. 16. The one or more computer-readable media of claim 15, wherein the normalized object contract further specifies that the one or more normalized data objects each includes a self-reference that comprises an instance key and a path to an object type. 17. The one or more computer-readable media of claim 15, wherein the normalized object contract further specifies that the one or more normalized data objects each provide a shared common state to a plurality of accessors. 18. The one or more computer-readable media of claim 15, wherein the normalized object contract further specifies that the one or more normalized data objects each have a type. 19. The one or more computer-readable media of claim 18, wherein each of the one or more normalized data objects support one or more other perspectives according to the type. 20. The one or more computer-readable media of claim 15, the operations further comprising:
in response to a change in at least one of the set of data attributes, dynamically updating the presentation of the set of data attributes in the UI. | Techniques are described for providing normalized object exposure in a collaborative platform. Implementations provide a collaborative platform to enable multiple users to collaborate to address an issue collectively. The platform enables a user to create a work routine in which objects may be added and manipulated by multiple users. The objects may be normalized through use of a normalized object contract. Tools may be added to the work routine, and linked to objects to apply functionality to the object data of the objects. The tools may also comply with the normalized object contract to be consumable within the platform. Through the contract, objects may exhibit a shared common state such that multiple users and/or processes access the same state for a particular object at any given time in a work routine.1. A computer-implemented method performed by at least one processor, the method comprising:
determining, by the at least one processor, one or more normalized data objects for consumption in an application executed by the at least one processor, the one or more normalized data objects complying with a normalized object contract that at least specifies one or more perspectives supported by the one or more normalized data objects, each of the one or more perspectives providing access to a set of data attributes of the one or more normalized data objects; determining, by the at least one processor, a perspective of the one or more perspectives supported by the one or more normalized data objects; and employing, by the at least one processor, the perspective to present, in a user interface (UI) of the application, the set of data attributes that correspond to the perspective for the one or more normalized data objects. 2. The method of claim 1, wherein the one or more perspectives include one or more of a Headerinfo perspective, an Identification perspective, a Lineltem perspective, and a SearchScope perspective. 3. The method of claim 1, wherein the normalized object contract further specifies that the one or more normalized data objects each includes a self-reference that comprises an instance key and a path to an object type. 4. The method of claim 1, wherein the normalized object contract further specifies that the one or more normalized data objects each provide a shared common state to a plurality of accessors. 5. The method of claim 1, wherein the normalized object contract further specifies that the one or more normalized data objects each have a type. 6. The method of claim 5, wherein each of the one or more normalized data objects support one or more other perspectives according to the type. 7. The method of claim 1, further comprising:
in response to a change in at least one of the set of data attributes, dynamically updating the presentation of the set of data attributes in the UI. 8. A system, comprising:
at least one processor; and a memory communicatively coupled to the at least one processor, the memory storing instructions which, when executed by the at least one processor, cause the at least one processor to perform operations comprising:
determining one or more normalized data objects for consumption in an application executed by the at least one processor, the one or more normalized data objects complying with a normalized object contract that at least specifies one or more perspectives supported by the one or more normalized data objects, each of the one or more perspectives providing access to a set of data attributes of the one or more normalized data objects;
determining a perspective of the one or more perspectives supported by the one or more normalized data objects; and
employing the perspective to present, in a user interface (UI) of the application, the set of data attributes that correspond to the perspective for the one or more normalized data objects. 9. The system of claim 8, wherein the one or more perspectives include one or more of a Headerinfo perspective, an Identification perspective, a Lineltem perspective, and a SearchScope perspective. 10. The system of claim 8, wherein the normalized object contract further specifies that the one or more normalized data objects each includes a self-reference that comprises an instance key and a path to an object type. 11. The system of claim 8, wherein the normalized object contract further specifies that the one or more normalized data objects each provide a shared common state to a plurality of accessors. 12. The system of claim 8, wherein the normalized object contract further specifies that the one or more normalized data objects each have a type. 13. The system of claim 12, wherein each of the one or more normalized data objects support one or more other perspectives according to the type. 14. The system of claim 8, the operations further comprising:
in response to a change in at least one of the set of data attributes, dynamically updating the presentation of the set of data attributes in the UI. 15. One or more computer-readable media storing instructions which, when executed by at least one processor, cause the at least one processor to perform operations comprising:
determining one or more normalized data objects for consumption in an application executed by the at least one processor, the one or more normalized data objects complying with a normalized object contract that at least specifies one or more perspectives supported by the one or more normalized data objects, each of the one or more perspectives providing access to a set of data attributes of the one or more normalized data objects; determining a perspective of the one or more perspectives supported by the one or more normalized data objects; and employing the perspective to present, in a user interface (UI) of the application, the set of data attributes that correspond to the perspective for the one or more normalized data objects. 16. The one or more computer-readable media of claim 15, wherein the normalized object contract further specifies that the one or more normalized data objects each includes a self-reference that comprises an instance key and a path to an object type. 17. The one or more computer-readable media of claim 15, wherein the normalized object contract further specifies that the one or more normalized data objects each provide a shared common state to a plurality of accessors. 18. The one or more computer-readable media of claim 15, wherein the normalized object contract further specifies that the one or more normalized data objects each have a type. 19. The one or more computer-readable media of claim 18, wherein each of the one or more normalized data objects support one or more other perspectives according to the type. 20. The one or more computer-readable media of claim 15, the operations further comprising:
in response to a change in at least one of the set of data attributes, dynamically updating the presentation of the set of data attributes in the UI. | 2,100 |
6,183 | 6,183 | 16,654,978 | 2,128 | Methods, systems, apparatus and computer program products for implementing machine learning within control systems are disclosed. An industrial facility setting slate can be received from a machine learning system and a determination can be made as to whether to adopt the settings in the industrial facility setting slate. The machine learning model can be a neural network, e.g., a deep neural network, that has been trained, e.g., using reinforcement learning to predict a data setting slate that is predicted to optimize an efficiency of a data center. | 1. A method comprising:
receiving, from a machine learning system, an industrial facility setting slate that the machine learning system predicts will optimize an efficiency of an industrial facility, wherein the industrial facility settings slate defines a respective setting for each of a plurality of industrial facility controls; determining whether industrial facility settings defined by the industrial facility setting slate can safely be adopted by the industrial facility; and in response to determining that the industrial facility settings defined by the industrial facility setting slate can safely be adopted, adopting the industrial facility settings defined by the industrial facility setting slate. 2. The method of claim 1, further comprising:
in response to determining that the industrial facility settings cannot safely be adopted by the industrial facility, adopting settings provided by a default control system for the industrial facility. 3. The method of claim 2, wherein the default control system is a rule-based control system. 4. The method of claim 1, wherein determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted comprises:
determining whether each of the industrial facility settings defined by the industrial facility setting slate falls within an acceptable range for the industrial facility setting. 5. The method of claim 1, wherein determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted further comprises:
determining whether predictions received from the machine learning system have become unstable. 6. The method of claim 5, wherein determining whether predictions received from the machine learning system have become unstable comprises:
determining, for each of the industrial facility controls, whether a rate of change of recently predicted settings for the industrial facility control has satisfied a threshold. 7. The method of claim 5, wherein determining whether predictions received from the machine learning system have become unstable comprises:
determining, for each of the industrial facility controls, whether a variance of recently predicted settings for the industrial facility control has satisfied a threshold. 8. The method of claim 1, further comprising:
prior to adopting the industrial facility settings, receiving state data characterizing a current state of the industrial facility; and wherein determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted comprises:
determining whether the current state of the industrial facility is suitable for adopting the industrial facility settings. 9. The method of claim 8, wherein determining whether the current state of the industrial facility is suitable for adopting the industrial facility settings comprises determining whether any sensor readings by a sensor identified in the state data fall outside of an acceptable range for the sensor. 10. The method of claim 1, further comprising:
determining that no communications have been received from the machine learning system for more than a threshold amount of time; and in response, controlling the industrial facility using a default control system for the industrial facility. 11. The method of claim 1, further comprising:
sending state data characterizing an updated state of the industrial facility to the machine learning system after the industrial facility settings have been adopted for use in generating a new predicted data setting slate. 12. The method of claim 1, wherein the machine learning system includes a machine learning model that is a neural network. 13. The method of claim 12, wherein the machine learning model is a deep neural network. 14. The method of claim 12, wherein the neural network has been trained using reinforcement learning based on measured or calculated efficiency of the industrial facility. 15. A system comprising:
one or more computers; and one or more storage devices storing instructions that are operable, when executed on one or more computers, to cause the one or more computers to perform operations comprising: receiving, from a machine learning system, an industrial facility setting slate that the machine learning system predicts will optimize an efficiency of an industrial facility, wherein the industrial facility settings slate defines a respective setting for each of a plurality of industrial facility controls; determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted by the industrial facility; and in response to determining that the industrial facility settings defined by the industrial facility setting slate can safely be adopted, adopting the industrial facility settings defined by the industrial facility setting slate. 16. The system of claim 15, the operations further comprising:
in response to determining that the industrial facility settings cannot safely be adopted by the industrial facility, adopting settings provided by a default control system for the industrial facility. 17. The system of claim 15, wherein determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted further comprises:
determining whether predictions received from the machine learning system have become unstable. 18. A computer program product comprising instructions that are executable by a processing device and upon such execution cause the processing device to perform operations of:
receiving, from a machine learning system, an industrial facility setting slate that the machine learning system predicts will optimize an efficiency of an industrial facility, wherein the industrial facility settings slate defines a respective setting for each of a plurality of industrial facility controls; determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted by the industrial facility; and in response to determining that the industrial facility settings defined by the industrial facility setting slate can safely be adopted, adopting the industrial facility settings defined by the industrial facility setting slate. 19. The computer program product of claim 18, the operations further comprising:
in response to determining that the industrial facility settings cannot safely be adopted by the industrial facility, adopting settings provided by a default control system for the industrial facility. 20. A device for controlling physical infrastructure in an industrial facility, the device comprising:
a controller that performs operations comprising:
receiving, from a machine learning system, an industrial facility setting slate that the machine learning system predicts will optimize an efficiency of an industrial facility, wherein the industrial facility settings slate defines a respective setting for each of a plurality of industrial facility controls;
determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted by the industrial facility; and
in response to determining that the industrial facility settings defined by the industrial facility setting slate can safely be adopted, adopting the industrial facility settings defined by the industrial facility setting slate. | Methods, systems, apparatus and computer program products for implementing machine learning within control systems are disclosed. An industrial facility setting slate can be received from a machine learning system and a determination can be made as to whether to adopt the settings in the industrial facility setting slate. The machine learning model can be a neural network, e.g., a deep neural network, that has been trained, e.g., using reinforcement learning to predict a data setting slate that is predicted to optimize an efficiency of a data center.1. A method comprising:
receiving, from a machine learning system, an industrial facility setting slate that the machine learning system predicts will optimize an efficiency of an industrial facility, wherein the industrial facility settings slate defines a respective setting for each of a plurality of industrial facility controls; determining whether industrial facility settings defined by the industrial facility setting slate can safely be adopted by the industrial facility; and in response to determining that the industrial facility settings defined by the industrial facility setting slate can safely be adopted, adopting the industrial facility settings defined by the industrial facility setting slate. 2. The method of claim 1, further comprising:
in response to determining that the industrial facility settings cannot safely be adopted by the industrial facility, adopting settings provided by a default control system for the industrial facility. 3. The method of claim 2, wherein the default control system is a rule-based control system. 4. The method of claim 1, wherein determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted comprises:
determining whether each of the industrial facility settings defined by the industrial facility setting slate falls within an acceptable range for the industrial facility setting. 5. The method of claim 1, wherein determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted further comprises:
determining whether predictions received from the machine learning system have become unstable. 6. The method of claim 5, wherein determining whether predictions received from the machine learning system have become unstable comprises:
determining, for each of the industrial facility controls, whether a rate of change of recently predicted settings for the industrial facility control has satisfied a threshold. 7. The method of claim 5, wherein determining whether predictions received from the machine learning system have become unstable comprises:
determining, for each of the industrial facility controls, whether a variance of recently predicted settings for the industrial facility control has satisfied a threshold. 8. The method of claim 1, further comprising:
prior to adopting the industrial facility settings, receiving state data characterizing a current state of the industrial facility; and wherein determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted comprises:
determining whether the current state of the industrial facility is suitable for adopting the industrial facility settings. 9. The method of claim 8, wherein determining whether the current state of the industrial facility is suitable for adopting the industrial facility settings comprises determining whether any sensor readings by a sensor identified in the state data fall outside of an acceptable range for the sensor. 10. The method of claim 1, further comprising:
determining that no communications have been received from the machine learning system for more than a threshold amount of time; and in response, controlling the industrial facility using a default control system for the industrial facility. 11. The method of claim 1, further comprising:
sending state data characterizing an updated state of the industrial facility to the machine learning system after the industrial facility settings have been adopted for use in generating a new predicted data setting slate. 12. The method of claim 1, wherein the machine learning system includes a machine learning model that is a neural network. 13. The method of claim 12, wherein the machine learning model is a deep neural network. 14. The method of claim 12, wherein the neural network has been trained using reinforcement learning based on measured or calculated efficiency of the industrial facility. 15. A system comprising:
one or more computers; and one or more storage devices storing instructions that are operable, when executed on one or more computers, to cause the one or more computers to perform operations comprising: receiving, from a machine learning system, an industrial facility setting slate that the machine learning system predicts will optimize an efficiency of an industrial facility, wherein the industrial facility settings slate defines a respective setting for each of a plurality of industrial facility controls; determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted by the industrial facility; and in response to determining that the industrial facility settings defined by the industrial facility setting slate can safely be adopted, adopting the industrial facility settings defined by the industrial facility setting slate. 16. The system of claim 15, the operations further comprising:
in response to determining that the industrial facility settings cannot safely be adopted by the industrial facility, adopting settings provided by a default control system for the industrial facility. 17. The system of claim 15, wherein determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted further comprises:
determining whether predictions received from the machine learning system have become unstable. 18. A computer program product comprising instructions that are executable by a processing device and upon such execution cause the processing device to perform operations of:
receiving, from a machine learning system, an industrial facility setting slate that the machine learning system predicts will optimize an efficiency of an industrial facility, wherein the industrial facility settings slate defines a respective setting for each of a plurality of industrial facility controls; determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted by the industrial facility; and in response to determining that the industrial facility settings defined by the industrial facility setting slate can safely be adopted, adopting the industrial facility settings defined by the industrial facility setting slate. 19. The computer program product of claim 18, the operations further comprising:
in response to determining that the industrial facility settings cannot safely be adopted by the industrial facility, adopting settings provided by a default control system for the industrial facility. 20. A device for controlling physical infrastructure in an industrial facility, the device comprising:
a controller that performs operations comprising:
receiving, from a machine learning system, an industrial facility setting slate that the machine learning system predicts will optimize an efficiency of an industrial facility, wherein the industrial facility settings slate defines a respective setting for each of a plurality of industrial facility controls;
determining whether the industrial facility settings defined by the industrial facility setting slate can safely be adopted by the industrial facility; and
in response to determining that the industrial facility settings defined by the industrial facility setting slate can safely be adopted, adopting the industrial facility settings defined by the industrial facility setting slate. | 2,100 |
6,184 | 6,184 | 15,018,833 | 2,159 | A bidirectional mapping is established between network content and application programs, based on declarations at both the network content and at the application. Additionally, bidirectional mapping can provide for deep links, which can associate specific network content with a specific presentation of data in an application program. The identification format for such deep links can conform to a predetermined standard or it can be custom implemented according to a format declared either as part of the network content or the application program. The bidirectional mapping is then utilized by a lookup service to provide functionality to a third-party entity. The lookup service can identify, to the entity, application programs associated with network content specified by that entity and network content associated with application programs specified by that entity. | 1-20. (canceled) 21. A computing device comprising:
one or more processing units; and one or more computer-readable storage media comprising computer-executable instructions, which, when executed by the processing units, cause the computing device to:
obtain, from network content, an application mapping document identifying an application corresponding to the network content; and
generate a mapping between the network content and the application based at least in part on the obtained application mapping document[VMV1]. 22. The computing device of claim 21, wherein the application mapping document comprises HTML meta tags specifying both a property and content for that property, the content comprising an identification of the application. 23. The computing device of claim 21, wherein the one or more computer-readable storage media comprise further computer-executable instructions, which, when executed by the processing units, cause the computing device to:
receive a request for the network content; invoke, based on the mapping, and in response to the request, the application to execute on the computing device instead of presenting the network content. 25. The computing device of claim 23, wherein the one or more computer-readable storage media comprise further computer-executable instructions, which, when executed by the processing units, cause the computing device to:
determine, prior to the invoking, if the application is installed on the computing device. 25. The computing device of claim 24, wherein the one or more computer-readable storage media comprise further computer-executable instructions, which, when executed by the processing units, cause the computing device to:
automatically download and install the application, prior to the invoking, if the determining reveals that the application is not already installed on the computing device. 26. The computing device of claim 24, wherein the one or more computer-readable storage media comprise further computer-executable instructions, which, when executed by the processing units, cause the computing device to:
present the network content, in response to the request, instead of invoking the application, if the determining reveals that the application is not already installed on the computing device; wherein the invoking the application is only performed if the application was already installed on the computing device. 27. The computing device of claim 21, wherein the network content is a website; and wherein further the computer-executable instructions causing the computing device to obtain the application mapping document from the network content comprise computer-executable instructions which, when executed by the processing units, cause the computing device to obtain the application mapping document from a root level of a server hosting the website, the application mapping document comprising textual declarations identifying both the application and paths from the website that should be mapped to the application.[VMV2] 28. A method of enabling a local application to be invoked on a computing device in response to a request for a web page, the method comprising:
obtaining, from a website comprising the web page, an application mapping document identifying the application as corresponding to the website; and generating a mapping between the website and the application based at least in part on the obtained application mapping document.[VMV3] 29. The method of claim 28, wherein the application mapping document comprises HTML meta tags specifying both a property and content for that property, the content comprising an identification of the application. 30. The method of claim 28, further comprising the steps of:
receiving the request for the web page; invoking, based on the mapping, and in response to the request, the application to execute on the computing device instead of presenting the web page. 31. The method of claim 30, further comprising the steps of:
determining, prior to the invoking, if the application is installed on the computing device. 32. The method of claim 31, further comprising the steps of:
automatically downloading and installing the application, prior to the invoking, if the determining reveals that the application is not already installed on the computing device. 33. The method of claim 31, further comprising the steps of:
presenting the network content, in response to the request, instead of invoking the application, if the determining reveals that the application is not already installed on the computing device; wherein the invoking the application is only performed if the application was already installed on the computing device. 34. The method of claim 28, wherein the application mapping document comprises a specification of a protocol identifier by which deep links into the application are identified. 35. The method of claim 34, wherein a first URI, comprising an HTTP protocol identifier, identifies a first page of the network content and a second URI, comprising the protocol identifier specified by the application mapping document, identifies a first content of the application associated with the first page; and wherein further the first URI and second URI differ only in their protocol identifiers.[VMV4] 36. A method of generating a mapping between a website and an application program executable on a mobile computing device, the method comprising:
obtaining, from network content, an application mapping document that comprises an identification of the application, the application mapping document being indicative of a correspondence between the application and the network content; and generating a mapping between the network content and the application based at least in part on the obtained application mapping document[VMV5]. 37. The method of claim 36, wherein the application mapping document comprises HTML meta tags specifying both a property and content for that property, the content comprising an identification of the application. 38. The method of claim 36, wherein the obtaining the application mapping document from the network content comprises obtaining the application mapping document from a root level of a web server hosting the website, the application mapping document comprising textual declarations identifying both the application and paths from the website that should be mapped to the application. 39. The method of claim 36, wherein the application mapping document comprises a specification of a protocol identifier by which deep links into the application are identified. 40. The method of claim 39, wherein a first URI, comprising an HTTP protocol identifier, identifies a first page of the network content and a second URI, comprising the protocol identifier specified by the application mapping document, identifies a first content of the application associated with the first page; and wherein further the first URI and second URI differ only in their protocol identifiers. | A bidirectional mapping is established between network content and application programs, based on declarations at both the network content and at the application. Additionally, bidirectional mapping can provide for deep links, which can associate specific network content with a specific presentation of data in an application program. The identification format for such deep links can conform to a predetermined standard or it can be custom implemented according to a format declared either as part of the network content or the application program. The bidirectional mapping is then utilized by a lookup service to provide functionality to a third-party entity. The lookup service can identify, to the entity, application programs associated with network content specified by that entity and network content associated with application programs specified by that entity.1-20. (canceled) 21. A computing device comprising:
one or more processing units; and one or more computer-readable storage media comprising computer-executable instructions, which, when executed by the processing units, cause the computing device to:
obtain, from network content, an application mapping document identifying an application corresponding to the network content; and
generate a mapping between the network content and the application based at least in part on the obtained application mapping document[VMV1]. 22. The computing device of claim 21, wherein the application mapping document comprises HTML meta tags specifying both a property and content for that property, the content comprising an identification of the application. 23. The computing device of claim 21, wherein the one or more computer-readable storage media comprise further computer-executable instructions, which, when executed by the processing units, cause the computing device to:
receive a request for the network content; invoke, based on the mapping, and in response to the request, the application to execute on the computing device instead of presenting the network content. 25. The computing device of claim 23, wherein the one or more computer-readable storage media comprise further computer-executable instructions, which, when executed by the processing units, cause the computing device to:
determine, prior to the invoking, if the application is installed on the computing device. 25. The computing device of claim 24, wherein the one or more computer-readable storage media comprise further computer-executable instructions, which, when executed by the processing units, cause the computing device to:
automatically download and install the application, prior to the invoking, if the determining reveals that the application is not already installed on the computing device. 26. The computing device of claim 24, wherein the one or more computer-readable storage media comprise further computer-executable instructions, which, when executed by the processing units, cause the computing device to:
present the network content, in response to the request, instead of invoking the application, if the determining reveals that the application is not already installed on the computing device; wherein the invoking the application is only performed if the application was already installed on the computing device. 27. The computing device of claim 21, wherein the network content is a website; and wherein further the computer-executable instructions causing the computing device to obtain the application mapping document from the network content comprise computer-executable instructions which, when executed by the processing units, cause the computing device to obtain the application mapping document from a root level of a server hosting the website, the application mapping document comprising textual declarations identifying both the application and paths from the website that should be mapped to the application.[VMV2] 28. A method of enabling a local application to be invoked on a computing device in response to a request for a web page, the method comprising:
obtaining, from a website comprising the web page, an application mapping document identifying the application as corresponding to the website; and generating a mapping between the website and the application based at least in part on the obtained application mapping document.[VMV3] 29. The method of claim 28, wherein the application mapping document comprises HTML meta tags specifying both a property and content for that property, the content comprising an identification of the application. 30. The method of claim 28, further comprising the steps of:
receiving the request for the web page; invoking, based on the mapping, and in response to the request, the application to execute on the computing device instead of presenting the web page. 31. The method of claim 30, further comprising the steps of:
determining, prior to the invoking, if the application is installed on the computing device. 32. The method of claim 31, further comprising the steps of:
automatically downloading and installing the application, prior to the invoking, if the determining reveals that the application is not already installed on the computing device. 33. The method of claim 31, further comprising the steps of:
presenting the network content, in response to the request, instead of invoking the application, if the determining reveals that the application is not already installed on the computing device; wherein the invoking the application is only performed if the application was already installed on the computing device. 34. The method of claim 28, wherein the application mapping document comprises a specification of a protocol identifier by which deep links into the application are identified. 35. The method of claim 34, wherein a first URI, comprising an HTTP protocol identifier, identifies a first page of the network content and a second URI, comprising the protocol identifier specified by the application mapping document, identifies a first content of the application associated with the first page; and wherein further the first URI and second URI differ only in their protocol identifiers.[VMV4] 36. A method of generating a mapping between a website and an application program executable on a mobile computing device, the method comprising:
obtaining, from network content, an application mapping document that comprises an identification of the application, the application mapping document being indicative of a correspondence between the application and the network content; and generating a mapping between the network content and the application based at least in part on the obtained application mapping document[VMV5]. 37. The method of claim 36, wherein the application mapping document comprises HTML meta tags specifying both a property and content for that property, the content comprising an identification of the application. 38. The method of claim 36, wherein the obtaining the application mapping document from the network content comprises obtaining the application mapping document from a root level of a web server hosting the website, the application mapping document comprising textual declarations identifying both the application and paths from the website that should be mapped to the application. 39. The method of claim 36, wherein the application mapping document comprises a specification of a protocol identifier by which deep links into the application are identified. 40. The method of claim 39, wherein a first URI, comprising an HTTP protocol identifier, identifies a first page of the network content and a second URI, comprising the protocol identifier specified by the application mapping document, identifies a first content of the application associated with the first page; and wherein further the first URI and second URI differ only in their protocol identifiers. | 2,100 |
6,185 | 6,185 | 15,142,984 | 2,162 | System and methods for performing automatic identification and contextual reformulation of implicit device-related queries are described. In some examples, a query server may receive a query from an electronic device, receive data associated with the electronic device, determine that the query is related to the electronic device, generate a new query based at least in part on the query and the data associated with the electronic device, retrieve results related to the new query, and send the results related to the new query to the electronic device. In some examples, determining that the query is related to the electronic device includes determining that the query is a semi-implicit device query or a fully implicit device query. The data associated with the electronic device can include a model name of the electronic device, an operating platform for the electronic device, and/or additional data related to the electronic device. | 1. A system comprising:
one or more processors; and one or more computer-readable media storing computer-executable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising:
receiving a query from an electronic device;
receiving, from the electronic device, data associated with the electronic device;
determining that the query is related to the electronic device;
generating a new query based at least in part on the query and the data associated with the electronic device;
retrieving results related to the new query; and
sending, to the electronic device, the results related to the new query. 2. A system as claim 1 recites, wherein the data associated with the electronic device includes at least one of:
a model name of the electronic device,
an operating platform of the electronic device,
a configuration setting associated with the electronic device,
a network associated with the electronic device,
a manifest of stored software applications, or
a physical characteristic of the electronic device. 3. A system as claim 1 recites, wherein determining that the query is related to the electronic device comprises at least one of:
determining that the query is a semi-implicit device query;
determining that the query is a fully implicit device query; or
determining that the query includes information related to the electronic device. 4. A system as claim 1 recites, the acts further comprising:
identifying that the query includes an indicator phrase associated with the electronic device,
and wherein determining that the query is related to the electronic device includes determining, based at least in part on the query including the indicatory phrase, that the query is a semi-implicit device query. 5. A system as claim 4 recites, wherein the data includes information associated with the electronic device, and wherein generating the new query includes replacing the indicator phrase within query with the information associated with the electronic device. 6. A system as claim 1 recites, the acts further comprising:
searching a database using the query, wherein the database includes a plurality of implicit device related queries; and
determining that the query is similar to at least one query from the database;
and wherein determining that the query is related to the electronic device includes determining, based least in part on determining that the query is similar to the at least one query, that the query is a fully implicit device query. 7. A system as claim 1 recites, wherein the data includes information associated with the electronic device, and wherein generating the new query includes adding the information to the query. 8. A method comprising:
receiving a query from an electronic device; determining that the query is related to the electronic device; based at least in part on determining that the query being related to the electronic device, determining a search strategy that is based at least in part on the query and data associated with the electronic device; performing a search using the search strategy; and sending search results associated with the search to the electronic device. 9. A method as claim 8 recites, wherein the data associated with the electronic device includes at least one of:
a model name of the electronic device,
an operating platform of the electronic device,
a configuration setting associated with the electronic device,
a network associated with the electronic device,
a manifest of stored software applications, or
a physical characteristic of the electronic device. 10. A method as claim 8 recites, wherein performing the search using the search strategy comprises:
generating a new query based at least in part on the query and the data associated with the electronic device; and
retrieving the search results using the new query, wherein the search results are relevant to the electronic device. 11. A method as claim 10 recites, wherein the data includes information associated with the electronic device, and wherein generating the new query includes at least one of:
replacing an indicator phrase within the query with the information associated with the electronic device; or
adding the information associated with the electronic device to the query. 12. A method as claim 8 recites, wherein performing the search using the search strategy comprises at least one of:
ranking initial search results that are related to the query;
re-ranking the initial results based at least in part on the data associated with the electronic device; or
re-ranking the initial results based at least in part on the data associated with the electronic device and an analysis of content within the initial search results. 13. A method as claim 8 recites, wherein performing the search using the search strategy comprises:
generating a first new query based at least in part on the query and first data associated with the electronic device;
performing a first search using the first new query in order to retrieve first search results related to the electronic device;
generating a second new query based at least in part on the query and second data associated with the electronic device;
performing a second search using the second new query in order to retrieve second search results related to the electronic device; and
identifying the search results based at least in part on the first search results and the second searches results. 14. A method as claim 8 recites, wherein performing the search using the search strategy comprises:
performing a first search using the query in order to retrieve initial search results;
generating a new query based at least in part on the query and the data associated with the electronic device;
performing a second search using the new query in order to retrieve additional search results; and
identifying the search results based at least in part on the initial search results and the additional search results. 15. A method as claim 8 recites, wherein determining that the query is related to the electronic device comprises at least one of:
identifying that the query includes an indicator phrase associated with the electronic device; or
determining that the query is similar to at least one query included in a query database, wherein the database includes a plurality of implicit device related queries. 16. One or more computer-readable media storing instructions that, when executed on one or more processors, cause the one or more processor to perform operations comprising:
receiving a query; determining that the query is related to an electronic device; generating a new query based at least in part on the query and data associated with the electronic device: performing a search using the new query. 17. One or more computer-readable media as recited in claim 16, wherein the information related to the electronic device includes at least one of:
a model name of the electronic device, an operating platform of the electronic device, a configuration setting associated with the electronic device, a network associated with the electronic device, a manifest of stored software applications, or a physical characteristic of the electronic device. 18. One or more computer-readable media as recited in claim 16, wherein the query is received from the electronic device, and wherein the operations further comprise:
receiving, from the electronic device, data associated with the electronic device, the data including the information related to the electronic device; retrieving, based at least in part on performing the search, search results related to the new query; and sending, to the electronic device, the search results. 19. One or more computer-readable media as recited in claim 16, wherein performing the search using the new query comprises:
sending the new query to a server; receiving, from the server, search results related to the new query; and causing a display of the search results. 20. One or more computer-readable media as recited in claim 16, wherein determining that the query is related to the electronic device comprises at least one of:
determining that the query is a semi-implicit device query; or determining that the query is a fully implicit device query. | System and methods for performing automatic identification and contextual reformulation of implicit device-related queries are described. In some examples, a query server may receive a query from an electronic device, receive data associated with the electronic device, determine that the query is related to the electronic device, generate a new query based at least in part on the query and the data associated with the electronic device, retrieve results related to the new query, and send the results related to the new query to the electronic device. In some examples, determining that the query is related to the electronic device includes determining that the query is a semi-implicit device query or a fully implicit device query. The data associated with the electronic device can include a model name of the electronic device, an operating platform for the electronic device, and/or additional data related to the electronic device.1. A system comprising:
one or more processors; and one or more computer-readable media storing computer-executable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising:
receiving a query from an electronic device;
receiving, from the electronic device, data associated with the electronic device;
determining that the query is related to the electronic device;
generating a new query based at least in part on the query and the data associated with the electronic device;
retrieving results related to the new query; and
sending, to the electronic device, the results related to the new query. 2. A system as claim 1 recites, wherein the data associated with the electronic device includes at least one of:
a model name of the electronic device,
an operating platform of the electronic device,
a configuration setting associated with the electronic device,
a network associated with the electronic device,
a manifest of stored software applications, or
a physical characteristic of the electronic device. 3. A system as claim 1 recites, wherein determining that the query is related to the electronic device comprises at least one of:
determining that the query is a semi-implicit device query;
determining that the query is a fully implicit device query; or
determining that the query includes information related to the electronic device. 4. A system as claim 1 recites, the acts further comprising:
identifying that the query includes an indicator phrase associated with the electronic device,
and wherein determining that the query is related to the electronic device includes determining, based at least in part on the query including the indicatory phrase, that the query is a semi-implicit device query. 5. A system as claim 4 recites, wherein the data includes information associated with the electronic device, and wherein generating the new query includes replacing the indicator phrase within query with the information associated with the electronic device. 6. A system as claim 1 recites, the acts further comprising:
searching a database using the query, wherein the database includes a plurality of implicit device related queries; and
determining that the query is similar to at least one query from the database;
and wherein determining that the query is related to the electronic device includes determining, based least in part on determining that the query is similar to the at least one query, that the query is a fully implicit device query. 7. A system as claim 1 recites, wherein the data includes information associated with the electronic device, and wherein generating the new query includes adding the information to the query. 8. A method comprising:
receiving a query from an electronic device; determining that the query is related to the electronic device; based at least in part on determining that the query being related to the electronic device, determining a search strategy that is based at least in part on the query and data associated with the electronic device; performing a search using the search strategy; and sending search results associated with the search to the electronic device. 9. A method as claim 8 recites, wherein the data associated with the electronic device includes at least one of:
a model name of the electronic device,
an operating platform of the electronic device,
a configuration setting associated with the electronic device,
a network associated with the electronic device,
a manifest of stored software applications, or
a physical characteristic of the electronic device. 10. A method as claim 8 recites, wherein performing the search using the search strategy comprises:
generating a new query based at least in part on the query and the data associated with the electronic device; and
retrieving the search results using the new query, wherein the search results are relevant to the electronic device. 11. A method as claim 10 recites, wherein the data includes information associated with the electronic device, and wherein generating the new query includes at least one of:
replacing an indicator phrase within the query with the information associated with the electronic device; or
adding the information associated with the electronic device to the query. 12. A method as claim 8 recites, wherein performing the search using the search strategy comprises at least one of:
ranking initial search results that are related to the query;
re-ranking the initial results based at least in part on the data associated with the electronic device; or
re-ranking the initial results based at least in part on the data associated with the electronic device and an analysis of content within the initial search results. 13. A method as claim 8 recites, wherein performing the search using the search strategy comprises:
generating a first new query based at least in part on the query and first data associated with the electronic device;
performing a first search using the first new query in order to retrieve first search results related to the electronic device;
generating a second new query based at least in part on the query and second data associated with the electronic device;
performing a second search using the second new query in order to retrieve second search results related to the electronic device; and
identifying the search results based at least in part on the first search results and the second searches results. 14. A method as claim 8 recites, wherein performing the search using the search strategy comprises:
performing a first search using the query in order to retrieve initial search results;
generating a new query based at least in part on the query and the data associated with the electronic device;
performing a second search using the new query in order to retrieve additional search results; and
identifying the search results based at least in part on the initial search results and the additional search results. 15. A method as claim 8 recites, wherein determining that the query is related to the electronic device comprises at least one of:
identifying that the query includes an indicator phrase associated with the electronic device; or
determining that the query is similar to at least one query included in a query database, wherein the database includes a plurality of implicit device related queries. 16. One or more computer-readable media storing instructions that, when executed on one or more processors, cause the one or more processor to perform operations comprising:
receiving a query; determining that the query is related to an electronic device; generating a new query based at least in part on the query and data associated with the electronic device: performing a search using the new query. 17. One or more computer-readable media as recited in claim 16, wherein the information related to the electronic device includes at least one of:
a model name of the electronic device, an operating platform of the electronic device, a configuration setting associated with the electronic device, a network associated with the electronic device, a manifest of stored software applications, or a physical characteristic of the electronic device. 18. One or more computer-readable media as recited in claim 16, wherein the query is received from the electronic device, and wherein the operations further comprise:
receiving, from the electronic device, data associated with the electronic device, the data including the information related to the electronic device; retrieving, based at least in part on performing the search, search results related to the new query; and sending, to the electronic device, the search results. 19. One or more computer-readable media as recited in claim 16, wherein performing the search using the new query comprises:
sending the new query to a server; receiving, from the server, search results related to the new query; and causing a display of the search results. 20. One or more computer-readable media as recited in claim 16, wherein determining that the query is related to the electronic device comprises at least one of:
determining that the query is a semi-implicit device query; or determining that the query is a fully implicit device query. | 2,100 |
6,186 | 6,186 | 14,079,507 | 2,166 | A database server stores compressed units in data blocks of a database. A table (or data from a plurality of rows thereof) is first compressed into a “compression unit” using any of a wide variety of compression techniques. The compression unit is then stored in one or more data block rows across one or more data blocks. As a result, a single data block row may comprise compressed data for a plurality of table rows, as encoded within the compression unit. Storage of compression units in data blocks maintains compatibility with existing data block-based databases, thus allowing the use of compression units in preexisting databases without modification to the underlying format of the database. The compression units may, for example, co-exist with uncompressed tables. Various techniques allow a database server to optimize access to data in the compression unit, so that the compression is virtually transparent to the user. | 1. A method comprising:
generating compression units for in which to store a database table, each particular compression unit of said compression units storing respective table rows from said database table, wherein generating each particular compression unit comprises:
compressing at least a first column of the respective table rows in a first subunit of the compression unit;
compressing at least a second column of the respective table rows in a second subunit of the compression unit;
storing the compression units in data blocks by, for each particular compression unit of said compression units, storing said particular compression unit in a data block row chain that spans multiple data blocks of said data blocks; wherein the method is performed by one or more computing devices. 2. The method of claim 1, wherein the database table is a first database table in a database, wherein the data blocks are a first set of data blocks within a plurality of data blocks that store the database, wherein the plurality of data blocks include a second set of data blocks that store, in row major format, uncompressed data for second database table in the database. 3. The method of claim 1, further comprising:
receiving a request that requires access to at least a first table row of the database table; based on an index entry corresponding to the first table row, determining that the first table row is stored in at least a first data block; retrieving the first data block; determining that the first data block stores a portion of a first compression unit; retrieving a second set of data blocks that store other portions of the first compression unit; decompressing the compression unit; further based on the index entry corresponding to the first table row, identifying the first table row within the decompressed compression unit. 4. The method of claim 1, wherein generating the compression unit further comprises generating a compression unit header, the compression unit header comprising metadata that indicates how the first column and the second column are compressed. 5. The method of claim 1, wherein the first column and the second column are compressed with different compression schemes. 6. The method of claim 1, further comprising:
for each particular compression unit of said compression units, generating a header that at least indicates across how many of the data blocks the particular compression unit is stored; storing the header in front of the compression unit in the data block row chain; prefetching one or more data blocks in which the compression unit is stored based on the header. 7. The method of claim 1, further comprising:
for each particular compression unit of said compression units, generating metadata that at least indicates a location within the particular compression unit at which compressed data for the second column begins; based on the metadata, responsive to a request for which the first column is not needed, decompressing a particular second subunit of a particular compression unit without decompressing a particular first subunit of the particular compression unit. 8. The method of claim 1, further comprising:
for each particular compression unit of said compression units, generating metadata that at least indicates a location within the particular compression unit at which compressed data for the second column begins; based on the metadata, responsive to a request for which the first column is not needed, retrieving second data blocks in which a particular second subunit of a particular compression unit is stored without retrieving one or more first data blocks in which a particular first subunit is stored. 9. The method of claim 1, further comprising:
responsive to a first database request:
retrieving a first set of data blocks in which a first compression unit is stored;
decompressing the first compression unit;
temporarily storing the decompressed first compression unit in a buffer;
servicing a second database request using the decompressed first compression unit in the buffer, without re-retrieving the first set of data blocks. 10. The method of claim 1, further comprising:
dividing the database table into multiple groups of rows, each of the groups corresponding to a different one of the compression units; dividing each particular compression unit into portions based on a default data block size, so that each portion of the particular compression unit fits into a different one of the data blocks. 11. One or more non-transitory computer-readable media storing instructions that, when executed by one or more computing devices, cause:
generating compression units for in which to store a database table, each particular compression unit of said compression units storing respective table rows from said database table, wherein generating each particular compression unit comprises:
compressing at least a first column of the respective table rows in a first subunit of the compression unit;
compressing at least a second column of the respective table rows in a second subunit of the compression unit;
storing the compression units in data blocks by, for each particular compression unit of said compression units, storing said particular compression unit in a data block row chain that spans multiple data blocks of said data blocks. 12. The one or more non-transitory computer-readable media of claim 11, wherein the database table is a first database table in a database, wherein the data blocks are a first set of data blocks within a plurality of data blocks that store the database, wherein the plurality of data blocks include a second set of data blocks that store, in row major format, uncompressed data for second database table in the database. 13. The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the one or more computing devices, further cause:
receiving a request that requires access to at least a first table row of the database table; based on an index entry corresponding to the first table row, determining that the first table row is stored in at least a first data block; retrieving the first data block; determining that the first data block stores a portion of a first compression unit; retrieving a second set of data blocks that store other portions of the first compression unit; decompressing the compression unit; further based on the index entry corresponding to the first table row, identifying the first table row within the decompressed compression unit. 14. The one or more non-transitory computer-readable media of claim 11, wherein generating the compression unit further comprises generating a compression unit header, the compression unit header comprising metadata that indicates how the first column and the second column are compressed. 15. The one or more non-transitory computer-readable media of claim 11, wherein the first column and the second column are compressed with different compression schemes. 16. The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the one or more computing devices, further cause:
for each particular compression unit of said compression units, generating a header that at least indicates across how many of the data blocks the particular compression unit is stored; storing the header in front of the compression unit in the data block row chain; prefetching one or more data blocks in which the compression unit is stored based on the header. 17. The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the one or more computing devices, further cause:
for each particular compression unit of said compression units, generating metadata that at least indicates a location within the particular compression unit at which compressed data for the second column begins; based on the metadata, responsive to a request for which the first column is not needed, decompressing a particular second subunit of a particular compression unit without decompressing a particular first subunit of the particular compression unit. 18. The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the one or more computing devices, further cause:
for each particular compression unit of said compression units, generating metadata that at least indicates a location within the particular compression unit at which compressed data for the second column begins; based on the metadata, responsive to a request for which the first column is not needed, retrieving second data blocks in which a particular second subunit of a particular compression unit is stored without retrieving one or more first data blocks in which a particular first subunit is stored. 19. The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the one or more computing devices, further cause:
responsive to a first database request:
retrieving a first set of data blocks in which a first compression unit is stored;
decompressing the first compression unit;
temporarily storing the decompressed first compression unit in a buffer;
servicing a second database request using the decompressed first compression unit in the buffer, without re-retrieving the first set of data blocks. 20. The one or more non-transitory computer-readable media of claim 1, wherein the instructions, when executed by the one or more computing devices, further cause:
dividing the database table into multiple groups of rows, each of the groups corresponding to a different one of the compression units;
dividing each particular compression unit into portions based on a default data block size, so that each portion of the particular compression unit fits into a different one of the data blocks. | A database server stores compressed units in data blocks of a database. A table (or data from a plurality of rows thereof) is first compressed into a “compression unit” using any of a wide variety of compression techniques. The compression unit is then stored in one or more data block rows across one or more data blocks. As a result, a single data block row may comprise compressed data for a plurality of table rows, as encoded within the compression unit. Storage of compression units in data blocks maintains compatibility with existing data block-based databases, thus allowing the use of compression units in preexisting databases without modification to the underlying format of the database. The compression units may, for example, co-exist with uncompressed tables. Various techniques allow a database server to optimize access to data in the compression unit, so that the compression is virtually transparent to the user.1. A method comprising:
generating compression units for in which to store a database table, each particular compression unit of said compression units storing respective table rows from said database table, wherein generating each particular compression unit comprises:
compressing at least a first column of the respective table rows in a first subunit of the compression unit;
compressing at least a second column of the respective table rows in a second subunit of the compression unit;
storing the compression units in data blocks by, for each particular compression unit of said compression units, storing said particular compression unit in a data block row chain that spans multiple data blocks of said data blocks; wherein the method is performed by one or more computing devices. 2. The method of claim 1, wherein the database table is a first database table in a database, wherein the data blocks are a first set of data blocks within a plurality of data blocks that store the database, wherein the plurality of data blocks include a second set of data blocks that store, in row major format, uncompressed data for second database table in the database. 3. The method of claim 1, further comprising:
receiving a request that requires access to at least a first table row of the database table; based on an index entry corresponding to the first table row, determining that the first table row is stored in at least a first data block; retrieving the first data block; determining that the first data block stores a portion of a first compression unit; retrieving a second set of data blocks that store other portions of the first compression unit; decompressing the compression unit; further based on the index entry corresponding to the first table row, identifying the first table row within the decompressed compression unit. 4. The method of claim 1, wherein generating the compression unit further comprises generating a compression unit header, the compression unit header comprising metadata that indicates how the first column and the second column are compressed. 5. The method of claim 1, wherein the first column and the second column are compressed with different compression schemes. 6. The method of claim 1, further comprising:
for each particular compression unit of said compression units, generating a header that at least indicates across how many of the data blocks the particular compression unit is stored; storing the header in front of the compression unit in the data block row chain; prefetching one or more data blocks in which the compression unit is stored based on the header. 7. The method of claim 1, further comprising:
for each particular compression unit of said compression units, generating metadata that at least indicates a location within the particular compression unit at which compressed data for the second column begins; based on the metadata, responsive to a request for which the first column is not needed, decompressing a particular second subunit of a particular compression unit without decompressing a particular first subunit of the particular compression unit. 8. The method of claim 1, further comprising:
for each particular compression unit of said compression units, generating metadata that at least indicates a location within the particular compression unit at which compressed data for the second column begins; based on the metadata, responsive to a request for which the first column is not needed, retrieving second data blocks in which a particular second subunit of a particular compression unit is stored without retrieving one or more first data blocks in which a particular first subunit is stored. 9. The method of claim 1, further comprising:
responsive to a first database request:
retrieving a first set of data blocks in which a first compression unit is stored;
decompressing the first compression unit;
temporarily storing the decompressed first compression unit in a buffer;
servicing a second database request using the decompressed first compression unit in the buffer, without re-retrieving the first set of data blocks. 10. The method of claim 1, further comprising:
dividing the database table into multiple groups of rows, each of the groups corresponding to a different one of the compression units; dividing each particular compression unit into portions based on a default data block size, so that each portion of the particular compression unit fits into a different one of the data blocks. 11. One or more non-transitory computer-readable media storing instructions that, when executed by one or more computing devices, cause:
generating compression units for in which to store a database table, each particular compression unit of said compression units storing respective table rows from said database table, wherein generating each particular compression unit comprises:
compressing at least a first column of the respective table rows in a first subunit of the compression unit;
compressing at least a second column of the respective table rows in a second subunit of the compression unit;
storing the compression units in data blocks by, for each particular compression unit of said compression units, storing said particular compression unit in a data block row chain that spans multiple data blocks of said data blocks. 12. The one or more non-transitory computer-readable media of claim 11, wherein the database table is a first database table in a database, wherein the data blocks are a first set of data blocks within a plurality of data blocks that store the database, wherein the plurality of data blocks include a second set of data blocks that store, in row major format, uncompressed data for second database table in the database. 13. The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the one or more computing devices, further cause:
receiving a request that requires access to at least a first table row of the database table; based on an index entry corresponding to the first table row, determining that the first table row is stored in at least a first data block; retrieving the first data block; determining that the first data block stores a portion of a first compression unit; retrieving a second set of data blocks that store other portions of the first compression unit; decompressing the compression unit; further based on the index entry corresponding to the first table row, identifying the first table row within the decompressed compression unit. 14. The one or more non-transitory computer-readable media of claim 11, wherein generating the compression unit further comprises generating a compression unit header, the compression unit header comprising metadata that indicates how the first column and the second column are compressed. 15. The one or more non-transitory computer-readable media of claim 11, wherein the first column and the second column are compressed with different compression schemes. 16. The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the one or more computing devices, further cause:
for each particular compression unit of said compression units, generating a header that at least indicates across how many of the data blocks the particular compression unit is stored; storing the header in front of the compression unit in the data block row chain; prefetching one or more data blocks in which the compression unit is stored based on the header. 17. The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the one or more computing devices, further cause:
for each particular compression unit of said compression units, generating metadata that at least indicates a location within the particular compression unit at which compressed data for the second column begins; based on the metadata, responsive to a request for which the first column is not needed, decompressing a particular second subunit of a particular compression unit without decompressing a particular first subunit of the particular compression unit. 18. The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the one or more computing devices, further cause:
for each particular compression unit of said compression units, generating metadata that at least indicates a location within the particular compression unit at which compressed data for the second column begins; based on the metadata, responsive to a request for which the first column is not needed, retrieving second data blocks in which a particular second subunit of a particular compression unit is stored without retrieving one or more first data blocks in which a particular first subunit is stored. 19. The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the one or more computing devices, further cause:
responsive to a first database request:
retrieving a first set of data blocks in which a first compression unit is stored;
decompressing the first compression unit;
temporarily storing the decompressed first compression unit in a buffer;
servicing a second database request using the decompressed first compression unit in the buffer, without re-retrieving the first set of data blocks. 20. The one or more non-transitory computer-readable media of claim 1, wherein the instructions, when executed by the one or more computing devices, further cause:
dividing the database table into multiple groups of rows, each of the groups corresponding to a different one of the compression units;
dividing each particular compression unit into portions based on a default data block size, so that each portion of the particular compression unit fits into a different one of the data blocks. | 2,100 |
6,187 | 6,187 | 13,911,182 | 2,175 | A method for defining a working area of a rock drilling rig including the steps of determining at least one current input parameter, determining a working area that defines a reach of the drilling unit in a control unit on the basis of the at least one current input parameter and at least one fixed reach parameter, displaying a graphical representation of the working area on a display, and re-determining the working area and updating the graphical representation of the working area dynamically in response to a change in the input parameters. The current input parameter may be, for example, an orientation of the rock drilling rig or a hole parameter. | 1. A method for defining a working area of a rock drilling rig, the rock drilling rig including a movable carrier; at least one boom pivoted to the carrier; a drilling unit arranged on the boom; at least one control unit and at least one display device connected to the control unit, the method comprising the steps of:
determining at least one of the following current input parameters: an orientation of the rock drilling rig and a hole parameter; determining a working area that defines a reach of the drilling unit in the control unit on the basis of said at least one current input parameter and at least one fixed reach parameter; displaying a graphical representation of said working area on the display; and re-determining said working area and updating said graphical representation of said working area dynamically in response to a change in said at least one current input parameter, wherein the at least one display is configured to display the working area by indicating one or more holes that can be drilled from a current position of the rock drilling rig. 2. The method of claim 1, further comprising the step of determining the position of the rock drilling rig and using it as a further input parameter for determining said working area. 3. The method of claim 1, wherein the at least one hole parameter comprises at least one of the following: a hole inclination, a hole direction and a hole position; and wherein the working area is displayed by indicating one or more holes that can be drilled from a current position without moving the rock drilling rig. 4. The method of claim 1, further comprising the step of storing a kinematic model of a boom as a fixed reach parameter, the kinematic model including information of at least the dimensions, joints and movement ranges of the joints of the boom that affects its reach, and using the kinematic model information as a basis for determining said working area. 5. The method of claim 1, further comprising the step of determining the movement range of at least one joint of the boom and using the movement range as the at least one fixed reach parameter for determining said working area. 6. The method of claim 1, wherein the drilling unit comprises at least one rock drilling machine and a tool, and further comprising the step of determining the orientation of the tool and using it as a current input parameter for determining said working area, wherein said graphical representation of said working area comprises displaying the position of the tool in relation to the working area. 7. An arrangement for a rock drilling rig, the arrangement comprising
means for determining at least one of the following current input parameters: an orientation of the rock drilling rig and a hole parameter; at least one control unit configured to determine a working area defining a reach of the drilling unit in the control unit on the basis of said at least one current input parameter and at least one fixed reach parameter and to re-determine said working area and to update said graphical representation of said working area dynamically in response to a change in said at least one current input parameter; and at least one display configured to display said working area of the rock drilling rig as a graphical representation, wherein the at least one display is configured to display the working area by indicating one or more holes that can be drilled from a current position of the rock drilling rig. 8. The arrangement of claim 6, further comprising means for storing a kinematic model of a boom as a fixed reach parameter, the kinematic model including at least the dimensions, joints and movement ranges of the joints of the boom that affects its reach, and using the kinematic model information as a basis for determining said working area. 9. The arrangement of claim 7, wherein the drilling unit includes at least one rock drilling machine and a tool, wherein the arrangement further comprises means for determining the orientation of the tool and using it as a current input parameter for determining said working area; and wherein the display is configured to display said graphical representation of said working area by displaying the position of the tool in relation to the working area. 10. The arrangement of claim 7, wherein the at least one hole parameter comprises at least one of the following: a hole inclination, a hole direction and a hole position. 11. The arrangement of claim 7, wherein the means for determining the orientation of the rock drilling rig comprise at least one of the following: an inclination sensor, an angle sensor and/or a linear movement sensor. 12. The arrangement of claim 7, wherein at least one of the control unit and the display is located remotely from the rock drilling rig. 13. A user interface of a rock drilling rig comprising at least one display, wherein the display is configured to display a working area of a rock drilling rig as a graphical representation determined on the basis of at least one of the following current input parameters: an orientation of the rock drilling rig and a hole parameter, and to update said graphical representation of said working area dynamically in response to a change in said at least one current input parameter. | A method for defining a working area of a rock drilling rig including the steps of determining at least one current input parameter, determining a working area that defines a reach of the drilling unit in a control unit on the basis of the at least one current input parameter and at least one fixed reach parameter, displaying a graphical representation of the working area on a display, and re-determining the working area and updating the graphical representation of the working area dynamically in response to a change in the input parameters. The current input parameter may be, for example, an orientation of the rock drilling rig or a hole parameter.1. A method for defining a working area of a rock drilling rig, the rock drilling rig including a movable carrier; at least one boom pivoted to the carrier; a drilling unit arranged on the boom; at least one control unit and at least one display device connected to the control unit, the method comprising the steps of:
determining at least one of the following current input parameters: an orientation of the rock drilling rig and a hole parameter; determining a working area that defines a reach of the drilling unit in the control unit on the basis of said at least one current input parameter and at least one fixed reach parameter; displaying a graphical representation of said working area on the display; and re-determining said working area and updating said graphical representation of said working area dynamically in response to a change in said at least one current input parameter, wherein the at least one display is configured to display the working area by indicating one or more holes that can be drilled from a current position of the rock drilling rig. 2. The method of claim 1, further comprising the step of determining the position of the rock drilling rig and using it as a further input parameter for determining said working area. 3. The method of claim 1, wherein the at least one hole parameter comprises at least one of the following: a hole inclination, a hole direction and a hole position; and wherein the working area is displayed by indicating one or more holes that can be drilled from a current position without moving the rock drilling rig. 4. The method of claim 1, further comprising the step of storing a kinematic model of a boom as a fixed reach parameter, the kinematic model including information of at least the dimensions, joints and movement ranges of the joints of the boom that affects its reach, and using the kinematic model information as a basis for determining said working area. 5. The method of claim 1, further comprising the step of determining the movement range of at least one joint of the boom and using the movement range as the at least one fixed reach parameter for determining said working area. 6. The method of claim 1, wherein the drilling unit comprises at least one rock drilling machine and a tool, and further comprising the step of determining the orientation of the tool and using it as a current input parameter for determining said working area, wherein said graphical representation of said working area comprises displaying the position of the tool in relation to the working area. 7. An arrangement for a rock drilling rig, the arrangement comprising
means for determining at least one of the following current input parameters: an orientation of the rock drilling rig and a hole parameter; at least one control unit configured to determine a working area defining a reach of the drilling unit in the control unit on the basis of said at least one current input parameter and at least one fixed reach parameter and to re-determine said working area and to update said graphical representation of said working area dynamically in response to a change in said at least one current input parameter; and at least one display configured to display said working area of the rock drilling rig as a graphical representation, wherein the at least one display is configured to display the working area by indicating one or more holes that can be drilled from a current position of the rock drilling rig. 8. The arrangement of claim 6, further comprising means for storing a kinematic model of a boom as a fixed reach parameter, the kinematic model including at least the dimensions, joints and movement ranges of the joints of the boom that affects its reach, and using the kinematic model information as a basis for determining said working area. 9. The arrangement of claim 7, wherein the drilling unit includes at least one rock drilling machine and a tool, wherein the arrangement further comprises means for determining the orientation of the tool and using it as a current input parameter for determining said working area; and wherein the display is configured to display said graphical representation of said working area by displaying the position of the tool in relation to the working area. 10. The arrangement of claim 7, wherein the at least one hole parameter comprises at least one of the following: a hole inclination, a hole direction and a hole position. 11. The arrangement of claim 7, wherein the means for determining the orientation of the rock drilling rig comprise at least one of the following: an inclination sensor, an angle sensor and/or a linear movement sensor. 12. The arrangement of claim 7, wherein at least one of the control unit and the display is located remotely from the rock drilling rig. 13. A user interface of a rock drilling rig comprising at least one display, wherein the display is configured to display a working area of a rock drilling rig as a graphical representation determined on the basis of at least one of the following current input parameters: an orientation of the rock drilling rig and a hole parameter, and to update said graphical representation of said working area dynamically in response to a change in said at least one current input parameter. | 2,100 |
6,188 | 6,188 | 14,298,627 | 2,147 | Example embodiments provide methods, mediums, and systems for making and evaluating changes to a model. According to example embodiments, checkpoints may be created as a user changes components in the model. The checkpoints may store changed components in the model that have been changed since a previous checkpoint, and a reference (e.g., a pointer) to the previous checkpoint. A user may freely create new checkpoints, revert to previous checkpoints, and select a checkpointed version of the model to be used as an official working version of the model. Upon activating an existing checkpoint, parametric relationships in the model assembly may be automatically updated in order to make components in the model consistent with each other. Thus, the user can readily change the model and evaluate variations of a design, while at the same time saving storage space by avoiding the need to repeatedly save different versions of the model. | 1. A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause the processor to:
receive a request to create a checkpoint for one or more models; identify a previous saved state of the models; identify one or more components that were changed in the models since the previous saved state of the models; and create a checkpoint, the checkpoint comprising:
a reference to the previous saved state of the models, and
a list of the one or more components that were changed in the models since the previous saved state of the model. 1a. The medium of claim 1, wherein the checkpoint further comprises content system cache information that includes the previous saved state of the models and parameters relating to the models. 2. The medium of claim 1, wherein the instructions further cause the processor to:
enter a design session; identify a base model to be used as an unmodified model for the design session; and create an entry checkpoint consisting of the base model. 3. The medium of claim 2, wherein the checkpoints are represented as a tree structure, and the entry checkpoint represents a root of the tree structure. 4. The medium of claim 2, further storing instructions for:
saving the base model and the checkpoint into a design session file on a first computer. 5. The medium of claim 4, further comprising instructions for:
opening the design session file on a second computer; and creating a model consistent with the checkpoint on the second computer. 6. The medium of claim 1, further storing instructions for:
receiving an instruction to change a first component of the model; modifying the model based on the instruction to result in an explicit change to the model; identifying a derived change to a second component of the model, the derived change being derived from the explicit change and not resulting from a user instruction to change the second component; and storing a reference to the first component and the second component in the list of the one or more components that were changed in the models since the previous saved state of the model. 7. The medium of claim 6, wherein the derived change is based on a parametric relationship between the first component and the second component. 8. The medium of claim 1, wherein the reference to the previous saved state of the model comprises a pointer to a second checkpoint. 9. A method comprising:
receiving a request to revert a model to a saved state, wherein the model comprises a component; retrieving a checkpoint associated with the saved state, the checkpoint comprising a reference to a prior checkpoint and a list of changed components in the model that were changed since the prior checkpoint; processing the prior checkpoint to compare the prior checkpoint with a current state of the model, the processing comprising identifying that the component of the model is present in the list of changed components; and changing the component in the model based on list of changed components to revert the model to the saved state, the applying performed using a processor of a computing device. 10. The method of claim 9, wherein reverting the model to the saved state comprises replacing only those components of the model which have been changed since the prior checkpoint, while preserving any components of the model which have not been changed since the prior checkpoint. 11. The method of claim 9, wherein the prior checkpoint is an entry checkpoint associated with a base model, and the base model is used as the prior version of the model. 12. The method of claim 9, wherein processing the prior checkpoint comprises retrieving a second prior checkpoint and a list of components changed in the model between the prior checkpoint and the second prior checkpoint. 13. The method of claim 9, wherein reverting the model to the saved state comprises:
retrieving a base model associated with an entry checkpoint, retrieving a series of one or more checkpoints between the entry checkpoint and the checkpoint associated with the saved state, the series of checkpoints comprising a set of one or more changed components, identifying components in the model corresponding to the changed components, and replacing the identified components with the changed components to the base model. 15. The method of claim 9, wherein the list of changed components comprises:
a first component changed by an explicit change made to the model by an express instruction to change the model, and a second component changed by a derived change made to the model as a result of the explicit change in order to satisfy one or more parametric constraints on the model. 16. A system comprising:
a non-transitory computer-readable storage medium storing a model in a first state, the model in the first state comprising a first component; a processor programmed to:
track one or more changes made to a first state the model, wherein tracking the one or more changes comprises:
identifying an instruction to cause an explicit change to the first component,
logging the explicit change in a list of changes,
identifying an associated component that is associated with the first component based on a derived change to the associated component that is caused by the explicit change;
receive a request to create a checkpoint for the model; and
create the checkpoint, the checkpoint comprising:
a reference to a previous saved state of the model, and
a list of changed components comprising the first component and the associated component. 17. The system of claim 16, wherein identifying the associated component comprises examining parametric constraints associated with the model. 18. The system of claim 16, wherein tracking the one or more changes comprises storing an identity of the associated component with the list of changed components. 19. The system of claim 16, wherein the first component is stored with a list of the associated components. 20. The system of claim 16, wherein identifying the associated component comprises analyzing the first component for connections to other features. | Example embodiments provide methods, mediums, and systems for making and evaluating changes to a model. According to example embodiments, checkpoints may be created as a user changes components in the model. The checkpoints may store changed components in the model that have been changed since a previous checkpoint, and a reference (e.g., a pointer) to the previous checkpoint. A user may freely create new checkpoints, revert to previous checkpoints, and select a checkpointed version of the model to be used as an official working version of the model. Upon activating an existing checkpoint, parametric relationships in the model assembly may be automatically updated in order to make components in the model consistent with each other. Thus, the user can readily change the model and evaluate variations of a design, while at the same time saving storage space by avoiding the need to repeatedly save different versions of the model.1. A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause the processor to:
receive a request to create a checkpoint for one or more models; identify a previous saved state of the models; identify one or more components that were changed in the models since the previous saved state of the models; and create a checkpoint, the checkpoint comprising:
a reference to the previous saved state of the models, and
a list of the one or more components that were changed in the models since the previous saved state of the model. 1a. The medium of claim 1, wherein the checkpoint further comprises content system cache information that includes the previous saved state of the models and parameters relating to the models. 2. The medium of claim 1, wherein the instructions further cause the processor to:
enter a design session; identify a base model to be used as an unmodified model for the design session; and create an entry checkpoint consisting of the base model. 3. The medium of claim 2, wherein the checkpoints are represented as a tree structure, and the entry checkpoint represents a root of the tree structure. 4. The medium of claim 2, further storing instructions for:
saving the base model and the checkpoint into a design session file on a first computer. 5. The medium of claim 4, further comprising instructions for:
opening the design session file on a second computer; and creating a model consistent with the checkpoint on the second computer. 6. The medium of claim 1, further storing instructions for:
receiving an instruction to change a first component of the model; modifying the model based on the instruction to result in an explicit change to the model; identifying a derived change to a second component of the model, the derived change being derived from the explicit change and not resulting from a user instruction to change the second component; and storing a reference to the first component and the second component in the list of the one or more components that were changed in the models since the previous saved state of the model. 7. The medium of claim 6, wherein the derived change is based on a parametric relationship between the first component and the second component. 8. The medium of claim 1, wherein the reference to the previous saved state of the model comprises a pointer to a second checkpoint. 9. A method comprising:
receiving a request to revert a model to a saved state, wherein the model comprises a component; retrieving a checkpoint associated with the saved state, the checkpoint comprising a reference to a prior checkpoint and a list of changed components in the model that were changed since the prior checkpoint; processing the prior checkpoint to compare the prior checkpoint with a current state of the model, the processing comprising identifying that the component of the model is present in the list of changed components; and changing the component in the model based on list of changed components to revert the model to the saved state, the applying performed using a processor of a computing device. 10. The method of claim 9, wherein reverting the model to the saved state comprises replacing only those components of the model which have been changed since the prior checkpoint, while preserving any components of the model which have not been changed since the prior checkpoint. 11. The method of claim 9, wherein the prior checkpoint is an entry checkpoint associated with a base model, and the base model is used as the prior version of the model. 12. The method of claim 9, wherein processing the prior checkpoint comprises retrieving a second prior checkpoint and a list of components changed in the model between the prior checkpoint and the second prior checkpoint. 13. The method of claim 9, wherein reverting the model to the saved state comprises:
retrieving a base model associated with an entry checkpoint, retrieving a series of one or more checkpoints between the entry checkpoint and the checkpoint associated with the saved state, the series of checkpoints comprising a set of one or more changed components, identifying components in the model corresponding to the changed components, and replacing the identified components with the changed components to the base model. 15. The method of claim 9, wherein the list of changed components comprises:
a first component changed by an explicit change made to the model by an express instruction to change the model, and a second component changed by a derived change made to the model as a result of the explicit change in order to satisfy one or more parametric constraints on the model. 16. A system comprising:
a non-transitory computer-readable storage medium storing a model in a first state, the model in the first state comprising a first component; a processor programmed to:
track one or more changes made to a first state the model, wherein tracking the one or more changes comprises:
identifying an instruction to cause an explicit change to the first component,
logging the explicit change in a list of changes,
identifying an associated component that is associated with the first component based on a derived change to the associated component that is caused by the explicit change;
receive a request to create a checkpoint for the model; and
create the checkpoint, the checkpoint comprising:
a reference to a previous saved state of the model, and
a list of changed components comprising the first component and the associated component. 17. The system of claim 16, wherein identifying the associated component comprises examining parametric constraints associated with the model. 18. The system of claim 16, wherein tracking the one or more changes comprises storing an identity of the associated component with the list of changed components. 19. The system of claim 16, wherein the first component is stored with a list of the associated components. 20. The system of claim 16, wherein identifying the associated component comprises analyzing the first component for connections to other features. | 2,100 |
6,189 | 6,189 | 16,181,205 | 2,177 | A device with a display and, optionally, a touch-sensitive surface detects a first input corresponding to a request to share first content from a first application while displaying the first application on the display. In response to detecting the first input, the device displays a sharing interface that includes a plurality of options for sharing the first content. While displaying the sharing interface, the device detects selection of an affordance in the sharing interface. In accordance with a determination that the affordance is a respective user-first sharing option for a respective user, the device initiates a process for sharing the first content with the respective user. In accordance with a determination that the affordance is a protocol-first sharing option for a respective protocol, the device initiates a process for sharing the first content using the respective protocol. | 1. A method, comprising:
at an electronic device with a display and one or more input devices:
displaying, on the display, an application user interface for a first application that includes a sharing affordance that is associated with sharing respective content from the first application;
while displaying the application user interface for the first application on the display, detecting, via the one or more input devices, a first input that corresponds to selection of the sharing affordance;
in response to detecting the first input, displaying, on the display, a sharing interface that includes:
a first predefined region including one or more user affordances corresponding to one or more users that satisfy proximity criteria to the electronic device; and
a second predefined region separate from the first predefined region, the second predefined region including a plurality of protocol affordances corresponding to a plurality of other applications on the electronic device that are distinct from the first application, wherein the plurality of other applications are available for sharing the respective content from the first application. 2. The method of claim 1, wherein the sharing user interface is displayed over at least a portion of the application user interface for the first application. 3. The method of claim 1, wherein the sharing interface further includes a third predefined region separate from the first predefined region and the second predefined region, the third predefined region including a plurality of functionality affordances corresponding to a plurality of functionalities available for performing to the respective content. 4. The method of claim 3, wherein the plurality of functionality affordances displayed in the third predefined region are selected based on a type of the respective content from the first application for sharing. 5. The method of claim 1, wherein the sharing interface is available for displaying in response to detecting requests for sharing content from different applications respectively. 6. The method of claim 1, wherein the sharing interface further includes a cancel affordance, and wherein the method further comprises:
while displaying the sharing interface on the display, detecting, via the one or more input devices, a second input that corresponds to selection of the cancel affordance; and in response to detecting the second input:
causing the electronic device to dismiss the sharing interface; and
redisplaying the application user interface for the first application. 7. The method of claim 1, wherein the proximity criteria include one or more wireless communication ranges for respective wireless communication protocols used between the electronic device and one or more other devices associated with the one or more users respectively. 8. The method of claim 7, wherein the wireless communication protocols include one or more selected from the group consisting of Bluetooth, Wireless Fidelity (Wi-Fi), and near field communication (NFC). 9. The method of claim 1, including:
while displaying the sharing interface, detecting selection of an affordance in the sharing interface; in accordance with a determination that the affordance is a respective user affordance for a respective user, initiating a process for directly sharing the respective content with the respective user. 10. The method of claim 1, further comprising:
while displaying the sharing interface, detecting selection of an affordance in the sharing interface; in accordance with a determination that the affordance is a respective protocol affordance for a respective application distinct from the first application, initiating a process for sharing the respective content using the respective application, wherein the process for sharing the respective content using the respective application includes:
after the respective protocol affordance has been selected, providing options for selecting a set of one or more users to share the respective content with using the respective application; and
after receiving a selection of the set of one or more users to share the respective content with, sharing the respective content with the set of one or more users using the respective application. 11. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display, cause the device to:
display, on the display, an application user interface for a first application that includes a sharing affordance that is associated with sharing respective content from the first application; while displaying the application user interface for the first application on the display, detect, via the one or more input devices, a first input that corresponds to selection of the sharing affordance; in response to detecting the first input, display, on the display, a sharing interface that includes:
a first predefined region including one or more user affordances corresponding to one or more users that satisfy proximity criteria to the electronic device; and
a second predefined region separate from the first predefined region, the second predefined region including a plurality of protocol affordances corresponding to a plurality of other applications on the electronic device that are distinct from the first application, wherein the plurality of other applications are available for sharing the respective content from the first application. 12. The non-transitory computer readable storage medium of claim 11, wherein the sharing user interface is displayed over at least a portion of the application user interface for the first application. 13. The non-transitory computer readable storage medium of claim 11, wherein the sharing interface further includes a third predefined region separate from the first predefined region and the second predefined region, the third predefined region including a plurality of functionality affordances corresponding to a plurality of functionalities available for performing to the respective content. 14. The non-transitory computer readable storage medium of claim 13, wherein the plurality of functionality affordances displayed in the third predefined region are selected based on a type of the respective content from the first application for sharing. 15. The non-transitory computer readable storage medium of claim 11, wherein the sharing interface is available for displaying in response to detecting requests for sharing content from different applications respectively. 16. 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:
displaying, on the display, an application user interface for a first application that includes a sharing affordance that is associated with sharing respective content from the first application;
while displaying the application user interface for the first application on the display, detecting, via the one or more input devices, a first input that corresponds to selection of the sharing affordance;
in response to detecting the first input, displaying, on the display, a sharing interface that includes:
a first predefined region including one or more user affordances corresponding to one or more users that satisfy proximity criteria to the electronic device; and
a second predefined region separate from the first predefined region, the second predefined region including a plurality of protocol affordances corresponding to a plurality of other applications on the electronic device that are distinct from the first application, wherein the plurality of other applications are available for sharing the respective content from the first application. 17. The electronic device of claim 16, wherein the sharing user interface is displayed over at least a portion of the application user interface for the first application. 18. The electronic device of claim 16, wherein the sharing interface further includes a third predefined region separate from the first predefined region and the second predefined region, the third predefined region including a plurality of functionality affordances corresponding to a plurality of functionalities available for performing to the respective content. 19. The electronic device of claim 18, wherein the plurality of functionality affordances displayed in the third predefined region are selected based on a type of the respective content from the first application for sharing. 20. The electronic device of claim 16, wherein the sharing interface is available for displaying in response to detecting requests for sharing content from different applications respectively. | A device with a display and, optionally, a touch-sensitive surface detects a first input corresponding to a request to share first content from a first application while displaying the first application on the display. In response to detecting the first input, the device displays a sharing interface that includes a plurality of options for sharing the first content. While displaying the sharing interface, the device detects selection of an affordance in the sharing interface. In accordance with a determination that the affordance is a respective user-first sharing option for a respective user, the device initiates a process for sharing the first content with the respective user. In accordance with a determination that the affordance is a protocol-first sharing option for a respective protocol, the device initiates a process for sharing the first content using the respective protocol.1. A method, comprising:
at an electronic device with a display and one or more input devices:
displaying, on the display, an application user interface for a first application that includes a sharing affordance that is associated with sharing respective content from the first application;
while displaying the application user interface for the first application on the display, detecting, via the one or more input devices, a first input that corresponds to selection of the sharing affordance;
in response to detecting the first input, displaying, on the display, a sharing interface that includes:
a first predefined region including one or more user affordances corresponding to one or more users that satisfy proximity criteria to the electronic device; and
a second predefined region separate from the first predefined region, the second predefined region including a plurality of protocol affordances corresponding to a plurality of other applications on the electronic device that are distinct from the first application, wherein the plurality of other applications are available for sharing the respective content from the first application. 2. The method of claim 1, wherein the sharing user interface is displayed over at least a portion of the application user interface for the first application. 3. The method of claim 1, wherein the sharing interface further includes a third predefined region separate from the first predefined region and the second predefined region, the third predefined region including a plurality of functionality affordances corresponding to a plurality of functionalities available for performing to the respective content. 4. The method of claim 3, wherein the plurality of functionality affordances displayed in the third predefined region are selected based on a type of the respective content from the first application for sharing. 5. The method of claim 1, wherein the sharing interface is available for displaying in response to detecting requests for sharing content from different applications respectively. 6. The method of claim 1, wherein the sharing interface further includes a cancel affordance, and wherein the method further comprises:
while displaying the sharing interface on the display, detecting, via the one or more input devices, a second input that corresponds to selection of the cancel affordance; and in response to detecting the second input:
causing the electronic device to dismiss the sharing interface; and
redisplaying the application user interface for the first application. 7. The method of claim 1, wherein the proximity criteria include one or more wireless communication ranges for respective wireless communication protocols used between the electronic device and one or more other devices associated with the one or more users respectively. 8. The method of claim 7, wherein the wireless communication protocols include one or more selected from the group consisting of Bluetooth, Wireless Fidelity (Wi-Fi), and near field communication (NFC). 9. The method of claim 1, including:
while displaying the sharing interface, detecting selection of an affordance in the sharing interface; in accordance with a determination that the affordance is a respective user affordance for a respective user, initiating a process for directly sharing the respective content with the respective user. 10. The method of claim 1, further comprising:
while displaying the sharing interface, detecting selection of an affordance in the sharing interface; in accordance with a determination that the affordance is a respective protocol affordance for a respective application distinct from the first application, initiating a process for sharing the respective content using the respective application, wherein the process for sharing the respective content using the respective application includes:
after the respective protocol affordance has been selected, providing options for selecting a set of one or more users to share the respective content with using the respective application; and
after receiving a selection of the set of one or more users to share the respective content with, sharing the respective content with the set of one or more users using the respective application. 11. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display, cause the device to:
display, on the display, an application user interface for a first application that includes a sharing affordance that is associated with sharing respective content from the first application; while displaying the application user interface for the first application on the display, detect, via the one or more input devices, a first input that corresponds to selection of the sharing affordance; in response to detecting the first input, display, on the display, a sharing interface that includes:
a first predefined region including one or more user affordances corresponding to one or more users that satisfy proximity criteria to the electronic device; and
a second predefined region separate from the first predefined region, the second predefined region including a plurality of protocol affordances corresponding to a plurality of other applications on the electronic device that are distinct from the first application, wherein the plurality of other applications are available for sharing the respective content from the first application. 12. The non-transitory computer readable storage medium of claim 11, wherein the sharing user interface is displayed over at least a portion of the application user interface for the first application. 13. The non-transitory computer readable storage medium of claim 11, wherein the sharing interface further includes a third predefined region separate from the first predefined region and the second predefined region, the third predefined region including a plurality of functionality affordances corresponding to a plurality of functionalities available for performing to the respective content. 14. The non-transitory computer readable storage medium of claim 13, wherein the plurality of functionality affordances displayed in the third predefined region are selected based on a type of the respective content from the first application for sharing. 15. The non-transitory computer readable storage medium of claim 11, wherein the sharing interface is available for displaying in response to detecting requests for sharing content from different applications respectively. 16. 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:
displaying, on the display, an application user interface for a first application that includes a sharing affordance that is associated with sharing respective content from the first application;
while displaying the application user interface for the first application on the display, detecting, via the one or more input devices, a first input that corresponds to selection of the sharing affordance;
in response to detecting the first input, displaying, on the display, a sharing interface that includes:
a first predefined region including one or more user affordances corresponding to one or more users that satisfy proximity criteria to the electronic device; and
a second predefined region separate from the first predefined region, the second predefined region including a plurality of protocol affordances corresponding to a plurality of other applications on the electronic device that are distinct from the first application, wherein the plurality of other applications are available for sharing the respective content from the first application. 17. The electronic device of claim 16, wherein the sharing user interface is displayed over at least a portion of the application user interface for the first application. 18. The electronic device of claim 16, wherein the sharing interface further includes a third predefined region separate from the first predefined region and the second predefined region, the third predefined region including a plurality of functionality affordances corresponding to a plurality of functionalities available for performing to the respective content. 19. The electronic device of claim 18, wherein the plurality of functionality affordances displayed in the third predefined region are selected based on a type of the respective content from the first application for sharing. 20. The electronic device of claim 16, wherein the sharing interface is available for displaying in response to detecting requests for sharing content from different applications respectively. | 2,100 |
6,190 | 6,190 | 14,524,694 | 2,176 | A method of governing content presentation includes creating a document file including content presented to a user in sequential units on a display device. A current version of the consent is presented in which fewer than all of the units are viewable. After the user performs a predetermined action, a subsequent version of the content is presented. Unviewable units of content in the current version are viewable in the subsequent version. Alternatively, a delimiter is inserted in the document file and after passing the delimiter while viewing content, the subsequent version is presented. An integrated device includes a microprocessor device, an electronic display device, and a storage medium that includes intransient instructions in a variable computer-readable document file that can be implemented by the microprocessor device to cause a document to be displayed to a user on the electronic display device according to instructions included in a program file. | 1. A method of governing content presentation, comprising:
creating a document file, wherein the document file is a variable computer-readable file that includes content, wherein the content is presented to a user in discrete units in sequence on an electronic display device; presenting a current version of the content, in which fewer than all of the units of the content are viewable by the user, wherein at least some units of unviewable content are interspersed between units of viewable content; performing, by the user, a predetermined action; and in response to performance of the predetermined action, presenting a subsequent version of the content, such that at least some of the unviewable units of content in the current version of the content are viewable in the subsequent version of the content. 2. The method of claim 1, further comprising redirecting presentation of the content to a different unit of content when the predetermined action or another predetermined action is performed by the user. 3. The method of claim 2, wherein redirecting presentation of the content to a different unit of content includes returning presentation of the content to a previous unit of the content. 4. The method of claim 2, wherein the different unit of content is a unit of content that was unviewable in the current version. 5. The method of claim 1, wherein the subsequent version of the content is not presented on performance of the predetermined action unless a predetermined number of units of content has been viewed by the user prior to performance of the predetermined action. 6. The method of claim 1, further comprising associating a monetary charge with a performance of the predetermined action. 7. The method of claim 6, further comprising increasing a total monetary charge each time the predetermined action is performed. 8. The method of claim 7, further comprising notifying the user each time the total monetary charge is increased. 9. The method of claim 7, further comprising providing indicia to the user showing the total monetary charge. 10. The method of claim 1, wherein the predetermined action is movement of an action key, wherein the action key is an element of an input device in communication with a microprocessor device that is in communication with the electronic display device. 11. The method of claim 1, wherein at least some of the unviewable content is textual content. 12. The method of claim 11, wherein the unviewable content includes annotation content. 13. The method of claim 1, wherein the electronic display device defines a size of a unit of content. 14. The method of claim 1, wherein the electronic display device is a dedicated content reader. 15. The method of claim 1, wherein creating a document file does not include writing programming code. 16. The method of claim 1, wherein the content farther includes at least one data tag. 17. The method of claim 16, wherein the at least one object tag includes at least one of formatting tags, hyperlink tags, image source tags, sound source tags, video source tags, table tags, form tags, frame tags, style tags, div tags, class tags, embed tags, object elements, JavaScript, and Java applets. 18. The method of claim 1, wherein presenting the content includes reading the document file using a network interface. 19. The method of claim 1, wherein the network interface is a Web browser. 20. The method of claim 1, wherein the document file is one of a plaintext file, an HTML file, and an XHTML file. 21. The method of claim 20, wherein the unviewable content includes advertising content. 22. The method of claim 1, wherein the document file incorporates Javascript. 23. The method of claim 1, wherein the predetermined action is providing a correct response to a query. 24. The method of claim 1, wherein the document file includes at least a textual portion, the method further comprising:
inserting at least one delimiter at a selected position of the textual portion of the document file, defining delimited content; and tracking predetermined events and/or actions that occur while the user views units of content. 25. The method of claim 24, wherein the selected position is occupied by a particular character combination including the at least one delimiter. 26. The method of claim 24, wherein the at least one of:
stopping advancement of content until further action is taken by the user; pausing presentation of content for a selectable, discrete number of time units; and automatically redirecting presentation of the document file to a different location in the document file occurs when the at least one delimiter is reached as the user views units of content. 27. The method of claim 24, wherein tracking predetermined events and/or actions that occur while the user views units of content includes tracking a number of the delimiters passed by the user while viewing units of content, and/or tracking a number of units of content passed by the user while viewing. 28. The method of claim 27, further comprising associating a monetary charge with the tracked number of delimiters passed by the user and/or the tracked number of units of content passed by the user while viewing. 29. The method of claim 27, wherein the delimiters are present in the viewable units of content of the current version of the content. 30. The method of claim 25, further comprising increasing a total monetary charge each time a delimiter is passed by the user and/or each time the number of units of content is passed while viewing. 31. The method of claim 30, further comprising notifying the user each time the total monetary charge is increased. 32. The method of claim 30, further comprising providing an indication to the user showing the total monetary charge. 33. The method of claim 27, wherein the unit of content is a string. 34. The method of claim 1, further comprising modifying at least one of a browser, a jump drive operating system, and the document file, wherein the modification to the document file includes a designated extension. 35. The method of claim 34, wherein the modifications conjointly render the modified document file unable to be modified. 36. The method of claim 34, wherein the designated extension renders the modified document file unable to be stored except on the modified jump drive. 37. The method of claim 34, further comprising:
storing a container ID and an operating executable file on a jump drive associated with the modified jump drive operating system: assigning a filename to the modified document file, wherein the filename includes a designated filename code; assigning a designated browser code to the modified browser; storing the modified document file on the jump drive; using an operating program associated with the operating executable file to determine if the filename code is valid, based on a predetermined criterion; using the operating program associated with the operating executable file to determine if the browser code is valid, based on a predetermined criterion; opening the modified document file in a browser window by the modified browser only if the filename code and the browser code are both determined to be valid; and refraining from opening the modified document file if one or both of the filename code and the browser code is determined not to be valid. 38. The method of claim 37, further comprising:
registering the container ID with a publisher; and preventing storage of the modified document file on any jump drive having an unregistered container ID. 39. A method of governing content presentation, comprising:
creating a document file, wherein the document file is a variable computer-readable file that includes content, wherein the content is presented to a user in discrete units in sequence on a display device; presenting a current version of the content, in which fewer than all of the units of the contents are viewable by the user, wherein at least some units of unviewable content are interspersed between units of viewable content; inserting at least one delimiter at a selected position of the document file; viewing units of content sequentially by the user, in response to passing the selected position by the user while viewing content, presenting a subsequent version of the content, such that at least some of the unviewable units of content in the current version of the content are viewable in the subsequent version of the content. 40. An integrated device comprising a storage medium, a microprocessor device, and an electronic display device;
wherein the storage medium comprises intransient instructions in a variable computer-readable document file that can be implemented by the microprocessor device to cause a document to be displayed to a user on the electronic display device according to instructions included in a program file, wherein the instructions in the document file include:
allowing an author to create variable computer-readable content as a portion of the document file, wherein the content is presentable on the electronic display device in sequential, discrete units;
presenting on the electronic display device a current version of the content in which fewer than all of the units of the contents are viewable by the user, wherein at least some units of unviewable content are interspersed between units of viewable content;
recognizing when a predetermined action is performed by the user; and
in response to recognition of performance of the predetermined action, presenting a subsequent version of the content, such that at least some of the unviewable units of content in the current version of the content are viewable in the subsequent version of the content; and
wherein the instructions included in the program file are a computer-readable instructions that are largely unvarying and include previously programmed computer code allowing the document file to be executed. | A method of governing content presentation includes creating a document file including content presented to a user in sequential units on a display device. A current version of the consent is presented in which fewer than all of the units are viewable. After the user performs a predetermined action, a subsequent version of the content is presented. Unviewable units of content in the current version are viewable in the subsequent version. Alternatively, a delimiter is inserted in the document file and after passing the delimiter while viewing content, the subsequent version is presented. An integrated device includes a microprocessor device, an electronic display device, and a storage medium that includes intransient instructions in a variable computer-readable document file that can be implemented by the microprocessor device to cause a document to be displayed to a user on the electronic display device according to instructions included in a program file.1. A method of governing content presentation, comprising:
creating a document file, wherein the document file is a variable computer-readable file that includes content, wherein the content is presented to a user in discrete units in sequence on an electronic display device; presenting a current version of the content, in which fewer than all of the units of the content are viewable by the user, wherein at least some units of unviewable content are interspersed between units of viewable content; performing, by the user, a predetermined action; and in response to performance of the predetermined action, presenting a subsequent version of the content, such that at least some of the unviewable units of content in the current version of the content are viewable in the subsequent version of the content. 2. The method of claim 1, further comprising redirecting presentation of the content to a different unit of content when the predetermined action or another predetermined action is performed by the user. 3. The method of claim 2, wherein redirecting presentation of the content to a different unit of content includes returning presentation of the content to a previous unit of the content. 4. The method of claim 2, wherein the different unit of content is a unit of content that was unviewable in the current version. 5. The method of claim 1, wherein the subsequent version of the content is not presented on performance of the predetermined action unless a predetermined number of units of content has been viewed by the user prior to performance of the predetermined action. 6. The method of claim 1, further comprising associating a monetary charge with a performance of the predetermined action. 7. The method of claim 6, further comprising increasing a total monetary charge each time the predetermined action is performed. 8. The method of claim 7, further comprising notifying the user each time the total monetary charge is increased. 9. The method of claim 7, further comprising providing indicia to the user showing the total monetary charge. 10. The method of claim 1, wherein the predetermined action is movement of an action key, wherein the action key is an element of an input device in communication with a microprocessor device that is in communication with the electronic display device. 11. The method of claim 1, wherein at least some of the unviewable content is textual content. 12. The method of claim 11, wherein the unviewable content includes annotation content. 13. The method of claim 1, wherein the electronic display device defines a size of a unit of content. 14. The method of claim 1, wherein the electronic display device is a dedicated content reader. 15. The method of claim 1, wherein creating a document file does not include writing programming code. 16. The method of claim 1, wherein the content farther includes at least one data tag. 17. The method of claim 16, wherein the at least one object tag includes at least one of formatting tags, hyperlink tags, image source tags, sound source tags, video source tags, table tags, form tags, frame tags, style tags, div tags, class tags, embed tags, object elements, JavaScript, and Java applets. 18. The method of claim 1, wherein presenting the content includes reading the document file using a network interface. 19. The method of claim 1, wherein the network interface is a Web browser. 20. The method of claim 1, wherein the document file is one of a plaintext file, an HTML file, and an XHTML file. 21. The method of claim 20, wherein the unviewable content includes advertising content. 22. The method of claim 1, wherein the document file incorporates Javascript. 23. The method of claim 1, wherein the predetermined action is providing a correct response to a query. 24. The method of claim 1, wherein the document file includes at least a textual portion, the method further comprising:
inserting at least one delimiter at a selected position of the textual portion of the document file, defining delimited content; and tracking predetermined events and/or actions that occur while the user views units of content. 25. The method of claim 24, wherein the selected position is occupied by a particular character combination including the at least one delimiter. 26. The method of claim 24, wherein the at least one of:
stopping advancement of content until further action is taken by the user; pausing presentation of content for a selectable, discrete number of time units; and automatically redirecting presentation of the document file to a different location in the document file occurs when the at least one delimiter is reached as the user views units of content. 27. The method of claim 24, wherein tracking predetermined events and/or actions that occur while the user views units of content includes tracking a number of the delimiters passed by the user while viewing units of content, and/or tracking a number of units of content passed by the user while viewing. 28. The method of claim 27, further comprising associating a monetary charge with the tracked number of delimiters passed by the user and/or the tracked number of units of content passed by the user while viewing. 29. The method of claim 27, wherein the delimiters are present in the viewable units of content of the current version of the content. 30. The method of claim 25, further comprising increasing a total monetary charge each time a delimiter is passed by the user and/or each time the number of units of content is passed while viewing. 31. The method of claim 30, further comprising notifying the user each time the total monetary charge is increased. 32. The method of claim 30, further comprising providing an indication to the user showing the total monetary charge. 33. The method of claim 27, wherein the unit of content is a string. 34. The method of claim 1, further comprising modifying at least one of a browser, a jump drive operating system, and the document file, wherein the modification to the document file includes a designated extension. 35. The method of claim 34, wherein the modifications conjointly render the modified document file unable to be modified. 36. The method of claim 34, wherein the designated extension renders the modified document file unable to be stored except on the modified jump drive. 37. The method of claim 34, further comprising:
storing a container ID and an operating executable file on a jump drive associated with the modified jump drive operating system: assigning a filename to the modified document file, wherein the filename includes a designated filename code; assigning a designated browser code to the modified browser; storing the modified document file on the jump drive; using an operating program associated with the operating executable file to determine if the filename code is valid, based on a predetermined criterion; using the operating program associated with the operating executable file to determine if the browser code is valid, based on a predetermined criterion; opening the modified document file in a browser window by the modified browser only if the filename code and the browser code are both determined to be valid; and refraining from opening the modified document file if one or both of the filename code and the browser code is determined not to be valid. 38. The method of claim 37, further comprising:
registering the container ID with a publisher; and preventing storage of the modified document file on any jump drive having an unregistered container ID. 39. A method of governing content presentation, comprising:
creating a document file, wherein the document file is a variable computer-readable file that includes content, wherein the content is presented to a user in discrete units in sequence on a display device; presenting a current version of the content, in which fewer than all of the units of the contents are viewable by the user, wherein at least some units of unviewable content are interspersed between units of viewable content; inserting at least one delimiter at a selected position of the document file; viewing units of content sequentially by the user, in response to passing the selected position by the user while viewing content, presenting a subsequent version of the content, such that at least some of the unviewable units of content in the current version of the content are viewable in the subsequent version of the content. 40. An integrated device comprising a storage medium, a microprocessor device, and an electronic display device;
wherein the storage medium comprises intransient instructions in a variable computer-readable document file that can be implemented by the microprocessor device to cause a document to be displayed to a user on the electronic display device according to instructions included in a program file, wherein the instructions in the document file include:
allowing an author to create variable computer-readable content as a portion of the document file, wherein the content is presentable on the electronic display device in sequential, discrete units;
presenting on the electronic display device a current version of the content in which fewer than all of the units of the contents are viewable by the user, wherein at least some units of unviewable content are interspersed between units of viewable content;
recognizing when a predetermined action is performed by the user; and
in response to recognition of performance of the predetermined action, presenting a subsequent version of the content, such that at least some of the unviewable units of content in the current version of the content are viewable in the subsequent version of the content; and
wherein the instructions included in the program file are a computer-readable instructions that are largely unvarying and include previously programmed computer code allowing the document file to be executed. | 2,100 |
6,191 | 6,191 | 15,299,245 | 2,153 | Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives from a client device a query for geo-enriched data and a map extent. The program further identifies a plurality of geo-enriched data based on the query. The program also stores the plurality of geo-enriched data. The program further determines a subset of the plurality of geo-enriched data based on the map extent. The program also provides the client device the subset of the plurality of geo-enriched data in order for the client device to render the map extent of a map that includes the subset of the plurality of geo-enriched data. | 1. A non-transitory machine-readable medium storing a program executable by at least one processing unit of a computing device, the program comprising sets of instructions for:
receiving from a client device a query for geo-enriched data and a map extent; identifying a plurality of geo-enriched data based on the query; storing the plurality of geo-enriched data; determining a subset of the plurality of geo-enriched data based on the map extent; and providing the client device the subset of the plurality of geo-enriched data in order for the client device to render the map extent of a map comprising the subset of the plurality of geo-enriched data. 2. The non-transitory machine-readable medium of claim 1, wherein the program further comprises sets of instructions for:
receiving from the client device a clustering option for the geo-enriched data; upon determining that the clustering option indicates to cluster the geo-enriched data:
generating a set of spatial clusters, each spatial cluster representing a portion of geo-enriched data in the subset of the plurality of geo-enriched data; and
providing the client device the set of spatial clusters instead of the portions of geo-enriched data in the subset of the plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the set of spatial clusters and geo-enriched data other than the portions of geo-enriched data in the subset of the plurality of geo-enriched data. 3. The non-transitory machine-readable medium of claim 2, wherein providing the client device the subset of the plurality of geo-enriched data comprises providing the client device the subset of the plurality of geo-enriched data upon determining that the clustering option indicates not to cluster the geo-enriched data. 4. The non-transitory machine-readable medium of claim 2, wherein the clustering option specifies a threshold number of data points, wherein the program further comprises a set of instructions for determining a number of geo-enriched data in the subset of the plurality of geo-enriched data, wherein generating the set of spatial clusters and providing the client device the set of spatial clusters are performed when the number of geo-enriched data in the subset of the plurality of geo-enriched data is greater than the threshold number of data points. 5. The non-transitory machine-readable medium of claim 1, wherein determining the subset of the plurality of geo-enriched data comprises performing a set of spatial operations on the plurality of geo-enriched data and the map extent. 6. The non-transitory machine-readable medium of claim 1, wherein the query is a first query, wherein the plurality of geo-enriched data is a first plurality of geo-enriched data, wherein the program further comprises sets of instructions for:
receiving from the client device a second, different query for geo-enriched data and the map extent; identifying a second plurality of geo-enriched data based on the second query; storing the second plurality of geo-enriched data; determining a subset of the second plurality of geo-enriched data based on the map extent; and providing the client device the subset of the second plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the subset of the second plurality of geo-enriched data. 7. The non-transitory machine-readable medium of claim 1, wherein the map extent is a first map extent, wherein the subset of the plurality of geo-enriched data is a first subset of the plurality of geo-enriched data, wherein the program further comprises sets of instructions for:
receiving from the client device the query for geo-enriched data and a second, different map extent; determining a second subset of the plurality of geo-enriched data based on the second map extent; and providing the client device the second subset of the plurality of geo-enriched data in order for the client device to render the second map extent of the map comprising the second subset of the plurality of geo-enriched data. 8. A method comprising:
receiving from a client device a query for geo-enriched data and a map extent; identifying a plurality of geo-enriched data based on the query; storing the plurality of geo-enriched data; determining a subset of the plurality of geo-enriched data based on the map extent; and providing the client device the subset of the plurality of geo-enriched data in order for the client device to render the map extent of a map comprising the subset of the plurality of geo-enriched data. 9. The method of claim 8 further comprising:
receiving from the client device a clustering option for the geo-enriched data;
upon determining that the clustering option indicates to cluster the geo-enriched data:
generating a set of spatial clusters, each spatial cluster representing a portion of geo-enriched data in the subset of the plurality of geo-enriched data; and
providing the client device the set of spatial clusters instead of the portions of geo-enriched data in the subset of the plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the set of spatial clusters and geo-enriched data other than the portions of geo-enriched data in the subset of the plurality of geo-enriched data. 10. The method of claim 9, wherein providing the client device the subset of the plurality of geo-enriched data comprises providing the client device the subset of the plurality of geo-enriched data upon determining that the clustering option indicates not to cluster the geo-enriched data. 11. The method of claim 9, wherein the clustering option specifies a threshold number of data points, wherein the method further comprises determining a number of geo-enriched data in the subset of the plurality of geo-enriched data, wherein generating the set of spatial clusters and providing the client device the set of spatial clusters are performed when the number of geo-enriched data in the subset of the plurality of geo-enriched data is greater than the threshold number of data points. 12. The method of claim 8, wherein determining the subset of the plurality of geo-enriched data comprises performing a set of spatial operations on the plurality of geo-enriched data and the map extent. 13. The method of claim 8, wherein the query is a first query, wherein the plurality of geo-enriched data is a first plurality of geo-enriched data, wherein the method further comprises:
receiving from the client device a second, different query for geo-enriched data and the map extent; identifying a second plurality of geo-enriched data based on the second query; storing the second plurality of geo-enriched data; determining a subset of the second plurality of geo-enriched data based on the map extent; and providing the client device the subset of the second plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the subset of the second plurality of geo-enriched data. 14. The method of claim 8, wherein the map extent is a first map extent, wherein the subset of the plurality of geo-enriched data is a first subset of the plurality of geo-enriched data, wherein the method further comprises:
receiving from the client device the query for geo-enriched data and a second, different map extent; determining a second subset of the plurality of geo-enriched data based on the second map extent; and providing the client device the second subset of the plurality of geo-enriched data in order for the client device to render the second map extent of the map comprising the second subset of the plurality of geo-enriched data. 15. A system comprising:
a set of processing units; and a non-transitory computer-readable medium storing instructions that when executed by at least one processing unit in the set of processing units cause the at least one processing unit to: receive from a client device a query for geo-enriched data and a map extent; identify a plurality of geo-enriched data based on the query; store the plurality of geo-enriched data; determine a subset of the plurality of geo-enriched data based on the map extent; and provide the client device the subset of the plurality of geo-enriched data in order for the client device to render the map extent of a map comprising the subset of the plurality of geo-enriched data. 16. The system of claim 15, wherein the instructions further cause the at least one processing unit to:
receive from the client device a clustering option for the geo-enriched data; upon determining that the clustering option indicates to cluster the geo-enriched data:
generate a set of spatial clusters, each spatial cluster representing a portion of geo-enriched data in the subset of the plurality of geo-enriched data; and
provide the client device the set of spatial clusters instead of the portions of geo-enriched data in the subset of the plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the set of spatial clusters and geo-enriched data other than the portions of geo-enriched data in the subset of the plurality of geo-enriched data,
wherein providing the client device the subset of the plurality of geo-enriched data comprises providing the client device the subset of the plurality of geo-enriched data upon determining that the clustering option indicates not to cluster the geo-enriched data. 17. The system of claim 16, wherein the clustering option specifies a threshold number of data points, wherein the instructions further cause the at least one processing unit to determine a number of geo-enriched data in the subset of the plurality of geo-enriched data, wherein generating the set of spatial clusters and providing the client device the set of spatial clusters are performed when the number of geo-enriched data in the subset of the plurality of geo-enriched data is greater than the threshold number of data points. 18. The system of claim 15, wherein determining the subset of the plurality of geo-enriched data comprises performing a set of spatial operations on the plurality of geo-enriched data and the map extent. 19. The system of claim 15, wherein the query is a first query, wherein the plurality of geo-enriched data is a first plurality of geo-enriched data, wherein the instructions further cause the at least one processing unit to:
receive from the client device a second, different query for geo-enriched data and the map extent; identify a second plurality of geo-enriched data based on the second query; store the second plurality of geo-enriched data; determine a subset of the second plurality of geo-enriched data based on the map extent; and provide the client device the subset of the second plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the subset of the second plurality of geo-enriched data. 20. The system of claim 15, wherein the map extent is a first map extent, wherein the subset of the plurality of geo-enriched data is a first subset of the plurality of geo-enriched data, wherein the instructions further cause the at least one processing unit to:
receive from the client device the query for geo-enriched data and a second, different map extent; determine a second subset of the plurality of geo-enriched data based on the second map extent; and provide the client device the second subset of the plurality of geo-enriched data in order for the client device to render the second map extent of the map comprising the second subset of the plurality of geo-enriched data. | Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives from a client device a query for geo-enriched data and a map extent. The program further identifies a plurality of geo-enriched data based on the query. The program also stores the plurality of geo-enriched data. The program further determines a subset of the plurality of geo-enriched data based on the map extent. The program also provides the client device the subset of the plurality of geo-enriched data in order for the client device to render the map extent of a map that includes the subset of the plurality of geo-enriched data.1. A non-transitory machine-readable medium storing a program executable by at least one processing unit of a computing device, the program comprising sets of instructions for:
receiving from a client device a query for geo-enriched data and a map extent; identifying a plurality of geo-enriched data based on the query; storing the plurality of geo-enriched data; determining a subset of the plurality of geo-enriched data based on the map extent; and providing the client device the subset of the plurality of geo-enriched data in order for the client device to render the map extent of a map comprising the subset of the plurality of geo-enriched data. 2. The non-transitory machine-readable medium of claim 1, wherein the program further comprises sets of instructions for:
receiving from the client device a clustering option for the geo-enriched data; upon determining that the clustering option indicates to cluster the geo-enriched data:
generating a set of spatial clusters, each spatial cluster representing a portion of geo-enriched data in the subset of the plurality of geo-enriched data; and
providing the client device the set of spatial clusters instead of the portions of geo-enriched data in the subset of the plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the set of spatial clusters and geo-enriched data other than the portions of geo-enriched data in the subset of the plurality of geo-enriched data. 3. The non-transitory machine-readable medium of claim 2, wherein providing the client device the subset of the plurality of geo-enriched data comprises providing the client device the subset of the plurality of geo-enriched data upon determining that the clustering option indicates not to cluster the geo-enriched data. 4. The non-transitory machine-readable medium of claim 2, wherein the clustering option specifies a threshold number of data points, wherein the program further comprises a set of instructions for determining a number of geo-enriched data in the subset of the plurality of geo-enriched data, wherein generating the set of spatial clusters and providing the client device the set of spatial clusters are performed when the number of geo-enriched data in the subset of the plurality of geo-enriched data is greater than the threshold number of data points. 5. The non-transitory machine-readable medium of claim 1, wherein determining the subset of the plurality of geo-enriched data comprises performing a set of spatial operations on the plurality of geo-enriched data and the map extent. 6. The non-transitory machine-readable medium of claim 1, wherein the query is a first query, wherein the plurality of geo-enriched data is a first plurality of geo-enriched data, wherein the program further comprises sets of instructions for:
receiving from the client device a second, different query for geo-enriched data and the map extent; identifying a second plurality of geo-enriched data based on the second query; storing the second plurality of geo-enriched data; determining a subset of the second plurality of geo-enriched data based on the map extent; and providing the client device the subset of the second plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the subset of the second plurality of geo-enriched data. 7. The non-transitory machine-readable medium of claim 1, wherein the map extent is a first map extent, wherein the subset of the plurality of geo-enriched data is a first subset of the plurality of geo-enriched data, wherein the program further comprises sets of instructions for:
receiving from the client device the query for geo-enriched data and a second, different map extent; determining a second subset of the plurality of geo-enriched data based on the second map extent; and providing the client device the second subset of the plurality of geo-enriched data in order for the client device to render the second map extent of the map comprising the second subset of the plurality of geo-enriched data. 8. A method comprising:
receiving from a client device a query for geo-enriched data and a map extent; identifying a plurality of geo-enriched data based on the query; storing the plurality of geo-enriched data; determining a subset of the plurality of geo-enriched data based on the map extent; and providing the client device the subset of the plurality of geo-enriched data in order for the client device to render the map extent of a map comprising the subset of the plurality of geo-enriched data. 9. The method of claim 8 further comprising:
receiving from the client device a clustering option for the geo-enriched data;
upon determining that the clustering option indicates to cluster the geo-enriched data:
generating a set of spatial clusters, each spatial cluster representing a portion of geo-enriched data in the subset of the plurality of geo-enriched data; and
providing the client device the set of spatial clusters instead of the portions of geo-enriched data in the subset of the plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the set of spatial clusters and geo-enriched data other than the portions of geo-enriched data in the subset of the plurality of geo-enriched data. 10. The method of claim 9, wherein providing the client device the subset of the plurality of geo-enriched data comprises providing the client device the subset of the plurality of geo-enriched data upon determining that the clustering option indicates not to cluster the geo-enriched data. 11. The method of claim 9, wherein the clustering option specifies a threshold number of data points, wherein the method further comprises determining a number of geo-enriched data in the subset of the plurality of geo-enriched data, wherein generating the set of spatial clusters and providing the client device the set of spatial clusters are performed when the number of geo-enriched data in the subset of the plurality of geo-enriched data is greater than the threshold number of data points. 12. The method of claim 8, wherein determining the subset of the plurality of geo-enriched data comprises performing a set of spatial operations on the plurality of geo-enriched data and the map extent. 13. The method of claim 8, wherein the query is a first query, wherein the plurality of geo-enriched data is a first plurality of geo-enriched data, wherein the method further comprises:
receiving from the client device a second, different query for geo-enriched data and the map extent; identifying a second plurality of geo-enriched data based on the second query; storing the second plurality of geo-enriched data; determining a subset of the second plurality of geo-enriched data based on the map extent; and providing the client device the subset of the second plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the subset of the second plurality of geo-enriched data. 14. The method of claim 8, wherein the map extent is a first map extent, wherein the subset of the plurality of geo-enriched data is a first subset of the plurality of geo-enriched data, wherein the method further comprises:
receiving from the client device the query for geo-enriched data and a second, different map extent; determining a second subset of the plurality of geo-enriched data based on the second map extent; and providing the client device the second subset of the plurality of geo-enriched data in order for the client device to render the second map extent of the map comprising the second subset of the plurality of geo-enriched data. 15. A system comprising:
a set of processing units; and a non-transitory computer-readable medium storing instructions that when executed by at least one processing unit in the set of processing units cause the at least one processing unit to: receive from a client device a query for geo-enriched data and a map extent; identify a plurality of geo-enriched data based on the query; store the plurality of geo-enriched data; determine a subset of the plurality of geo-enriched data based on the map extent; and provide the client device the subset of the plurality of geo-enriched data in order for the client device to render the map extent of a map comprising the subset of the plurality of geo-enriched data. 16. The system of claim 15, wherein the instructions further cause the at least one processing unit to:
receive from the client device a clustering option for the geo-enriched data; upon determining that the clustering option indicates to cluster the geo-enriched data:
generate a set of spatial clusters, each spatial cluster representing a portion of geo-enriched data in the subset of the plurality of geo-enriched data; and
provide the client device the set of spatial clusters instead of the portions of geo-enriched data in the subset of the plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the set of spatial clusters and geo-enriched data other than the portions of geo-enriched data in the subset of the plurality of geo-enriched data,
wherein providing the client device the subset of the plurality of geo-enriched data comprises providing the client device the subset of the plurality of geo-enriched data upon determining that the clustering option indicates not to cluster the geo-enriched data. 17. The system of claim 16, wherein the clustering option specifies a threshold number of data points, wherein the instructions further cause the at least one processing unit to determine a number of geo-enriched data in the subset of the plurality of geo-enriched data, wherein generating the set of spatial clusters and providing the client device the set of spatial clusters are performed when the number of geo-enriched data in the subset of the plurality of geo-enriched data is greater than the threshold number of data points. 18. The system of claim 15, wherein determining the subset of the plurality of geo-enriched data comprises performing a set of spatial operations on the plurality of geo-enriched data and the map extent. 19. The system of claim 15, wherein the query is a first query, wherein the plurality of geo-enriched data is a first plurality of geo-enriched data, wherein the instructions further cause the at least one processing unit to:
receive from the client device a second, different query for geo-enriched data and the map extent; identify a second plurality of geo-enriched data based on the second query; store the second plurality of geo-enriched data; determine a subset of the second plurality of geo-enriched data based on the map extent; and provide the client device the subset of the second plurality of geo-enriched data in order for the client device to render the map extent of the map comprising the subset of the second plurality of geo-enriched data. 20. The system of claim 15, wherein the map extent is a first map extent, wherein the subset of the plurality of geo-enriched data is a first subset of the plurality of geo-enriched data, wherein the instructions further cause the at least one processing unit to:
receive from the client device the query for geo-enriched data and a second, different map extent; determine a second subset of the plurality of geo-enriched data based on the second map extent; and provide the client device the second subset of the plurality of geo-enriched data in order for the client device to render the second map extent of the map comprising the second subset of the plurality of geo-enriched data. | 2,100 |
6,192 | 6,192 | 15,182,118 | 2,153 | A system including an electronic document inspection device that identifies a set of electronic documents using a search query; a composite page generator that generates a composite page that i) is hosted by a different domain than at least some electronic documents in the set of electronic documents and ii) includes electronic documents from the set of electronic documents; an asset package generator that generates digital content asset packages, each digital content asset package including i) digital content assets and ii) instructions that specify a configuration of the digital content assets for the respective digital content asset package; and an asset package list generator that generates a digital content asset package list specifying an order of presentation of the digital content asset packages, wherein the composite page, the digital content asset packages, and the digital content asset package list are transmitted to a user device that provides the search query. | 1. A system comprising:
an electronic document inspection device that identifies a set of electronic documents using a search query; a composite page generator that generates a composite page that i) is hosted by a different domain than at least some electronic documents in the set of electronic documents and ii) includes various electronic documents from the set of electronic documents; an asset package generator that generates one or more digital content asset packages, each digital content asset package including i) digital content assets and ii) one or more instructions that specify a configuration of the digital content assets for the respective digital content asset package; and an asset package list generator that generates a digital content asset package list that specifies an order of presentation of the one or more digital content asset packages, wherein the composite page, the one or more digital content asset packages, and the digital content asset package list are transmitted to a given user device that provides the search query. 2. The system of claim 1, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets are based on a size, a location, or both, of a digital content slot of a particular electronic document of the set of electronic documents that includes a composite digital content that is based on one or more of the respective digital content assets. 3. The system of claim 1, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets include a set of one or more presentation sizes that a composite digital content based one or more of the respective digital content assets is available for inclusion within a digital content slot of a particular electronic document of the set of electronic documents. 4. The system of claim 1, wherein each digital content asset package further includes an identifying element that uniquely identifies a composite digital content that is based on one or more of the respective digital content assets. 5. A method comprising:
receiving, by one or more servers and from a given client device, a search query; identifying, by the one or more servers, a set of electronic documents using the search query; generating, by the one or more servers, a composite page that i) is hosted by a different domain than at least some electronic documents in the set of electronic documents and ii) includes various electronic documents from the set of electronic documents; generating, by the one or more servers, one or more digital content asset packages, each digital content asset package including i) digital content assets and ii) one or more instructions that specify a configuration of the digital content assets for the respective digital content asset package; generating, by the one or more servers, a digital content asset package list that specifies an order of presentation of the one or more digital content asset packages; and in response to the search query, transmitting, by the one or more servers and to the given client device, the composite page, the one or more digital content asset packages, and the digital content asset package list. 6. The method of claim 5, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets are based on a size, a location, or both, of a digital content slot of a particular electronic document of the set of electronic documents that includes a composite digital content that is based on one or more of the respective digital content assets. 7. The method of claim 5, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets include a set of one or more presentation sizes that a composite digital content based one or more of the respective digital content assets is available for inclusion within a digital content slot of a particular electronic document of the set of electronic documents. 8. The method of claim 5, wherein each digital content asset package further includes an identifying element that uniquely identifies a composite digital content that is based on one or more of the respective digital content assets. 9. The method of claim 8, further comprising:
receiving, by the one or more servers and from the given client device, data indicating i) the identifying element and ii) one or more properties of a particular electronic document of the set of electronic documents associated with a display of the composite digital content. 10. The method of claim 9, wherein the one or more properties include a size, location, or both, of the composite digital content that is included within a digital content slot of the particular electronic document. 11. The method of claim 9, further comprising modifying a log based on receiving the data indicating i) the identifying element and ii) the one or more properties of the particular electronic document associated with the display of the composite digital content. 12. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising:
receiving, by one or more servers and from a given client device, a search query; identifying, by the one or more servers, a set of electronic documents using the search query; generating, by the one or more servers, a composite page that i) is hosted by a different domain than at least some electronic documents in the set of electronic documents and ii) includes various electronic documents from the set of electronic documents; generating, by the one or more servers, one or more digital content asset packages, each digital content asset package including i) digital content assets and ii) one or more instructions that specify a configuration of the digital content assets for the respective digital content asset package; generating, by the one or more servers, a digital content asset package list that specifies an order of presentation of the one or more digital content asset packages; and in response to the search query, transmitting, by the one or more servers and to the given client device, the composite page, the one or more digital content asset packages, and the digital content asset package list. 13. The computer-readable medium of claim 12, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets are based on a size, a location, or both, of a digital content slot of a particular electronic document of the set of electronic documents that includes a composite digital content that is based on one or more of the respective digital content assets. 14. The computer-readable medium of claim 12, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets include a set of one or more presentation sizes that a composite digital content based one or more of the respective digital content assets is available for inclusion within a digital content slot of a particular electronic document of the set of electronic documents. 15. The computer-readable medium of claim 12, wherein each digital content asset package further includes an identifying element that uniquely identifies a composite digital content that is based on one or more of the respective digital content assets. 16. The computer-readable medium of claim 15, the operations further comprising:
receiving, by the one or more servers and from the given client device, data indicating i) the identifying element and ii) one or more properties of a particular electronic document of the set of electronic documents associated with a display of the composite digital content. 17. The computer-readable medium of claim 16, wherein the one or more properties include a size, location, or both, of the composite digital content that is included within a digital content slot of the particular electronic document. 18. The computer-readable medium of claim 16, the operations further comprising modifying a log based on receiving the data indicating i) the identifying element and ii) the one or more properties of the particular electronic document associated with the display of the composite digital content. | A system including an electronic document inspection device that identifies a set of electronic documents using a search query; a composite page generator that generates a composite page that i) is hosted by a different domain than at least some electronic documents in the set of electronic documents and ii) includes electronic documents from the set of electronic documents; an asset package generator that generates digital content asset packages, each digital content asset package including i) digital content assets and ii) instructions that specify a configuration of the digital content assets for the respective digital content asset package; and an asset package list generator that generates a digital content asset package list specifying an order of presentation of the digital content asset packages, wherein the composite page, the digital content asset packages, and the digital content asset package list are transmitted to a user device that provides the search query.1. A system comprising:
an electronic document inspection device that identifies a set of electronic documents using a search query; a composite page generator that generates a composite page that i) is hosted by a different domain than at least some electronic documents in the set of electronic documents and ii) includes various electronic documents from the set of electronic documents; an asset package generator that generates one or more digital content asset packages, each digital content asset package including i) digital content assets and ii) one or more instructions that specify a configuration of the digital content assets for the respective digital content asset package; and an asset package list generator that generates a digital content asset package list that specifies an order of presentation of the one or more digital content asset packages, wherein the composite page, the one or more digital content asset packages, and the digital content asset package list are transmitted to a given user device that provides the search query. 2. The system of claim 1, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets are based on a size, a location, or both, of a digital content slot of a particular electronic document of the set of electronic documents that includes a composite digital content that is based on one or more of the respective digital content assets. 3. The system of claim 1, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets include a set of one or more presentation sizes that a composite digital content based one or more of the respective digital content assets is available for inclusion within a digital content slot of a particular electronic document of the set of electronic documents. 4. The system of claim 1, wherein each digital content asset package further includes an identifying element that uniquely identifies a composite digital content that is based on one or more of the respective digital content assets. 5. A method comprising:
receiving, by one or more servers and from a given client device, a search query; identifying, by the one or more servers, a set of electronic documents using the search query; generating, by the one or more servers, a composite page that i) is hosted by a different domain than at least some electronic documents in the set of electronic documents and ii) includes various electronic documents from the set of electronic documents; generating, by the one or more servers, one or more digital content asset packages, each digital content asset package including i) digital content assets and ii) one or more instructions that specify a configuration of the digital content assets for the respective digital content asset package; generating, by the one or more servers, a digital content asset package list that specifies an order of presentation of the one or more digital content asset packages; and in response to the search query, transmitting, by the one or more servers and to the given client device, the composite page, the one or more digital content asset packages, and the digital content asset package list. 6. The method of claim 5, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets are based on a size, a location, or both, of a digital content slot of a particular electronic document of the set of electronic documents that includes a composite digital content that is based on one or more of the respective digital content assets. 7. The method of claim 5, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets include a set of one or more presentation sizes that a composite digital content based one or more of the respective digital content assets is available for inclusion within a digital content slot of a particular electronic document of the set of electronic documents. 8. The method of claim 5, wherein each digital content asset package further includes an identifying element that uniquely identifies a composite digital content that is based on one or more of the respective digital content assets. 9. The method of claim 8, further comprising:
receiving, by the one or more servers and from the given client device, data indicating i) the identifying element and ii) one or more properties of a particular electronic document of the set of electronic documents associated with a display of the composite digital content. 10. The method of claim 9, wherein the one or more properties include a size, location, or both, of the composite digital content that is included within a digital content slot of the particular electronic document. 11. The method of claim 9, further comprising modifying a log based on receiving the data indicating i) the identifying element and ii) the one or more properties of the particular electronic document associated with the display of the composite digital content. 12. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising:
receiving, by one or more servers and from a given client device, a search query; identifying, by the one or more servers, a set of electronic documents using the search query; generating, by the one or more servers, a composite page that i) is hosted by a different domain than at least some electronic documents in the set of electronic documents and ii) includes various electronic documents from the set of electronic documents; generating, by the one or more servers, one or more digital content asset packages, each digital content asset package including i) digital content assets and ii) one or more instructions that specify a configuration of the digital content assets for the respective digital content asset package; generating, by the one or more servers, a digital content asset package list that specifies an order of presentation of the one or more digital content asset packages; and in response to the search query, transmitting, by the one or more servers and to the given client device, the composite page, the one or more digital content asset packages, and the digital content asset package list. 13. The computer-readable medium of claim 12, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets are based on a size, a location, or both, of a digital content slot of a particular electronic document of the set of electronic documents that includes a composite digital content that is based on one or more of the respective digital content assets. 14. The computer-readable medium of claim 12, wherein, for each digital content asset package, the one or more instructions that specify the configuration of the digital content assets include a set of one or more presentation sizes that a composite digital content based one or more of the respective digital content assets is available for inclusion within a digital content slot of a particular electronic document of the set of electronic documents. 15. The computer-readable medium of claim 12, wherein each digital content asset package further includes an identifying element that uniquely identifies a composite digital content that is based on one or more of the respective digital content assets. 16. The computer-readable medium of claim 15, the operations further comprising:
receiving, by the one or more servers and from the given client device, data indicating i) the identifying element and ii) one or more properties of a particular electronic document of the set of electronic documents associated with a display of the composite digital content. 17. The computer-readable medium of claim 16, wherein the one or more properties include a size, location, or both, of the composite digital content that is included within a digital content slot of the particular electronic document. 18. The computer-readable medium of claim 16, the operations further comprising modifying a log based on receiving the data indicating i) the identifying element and ii) the one or more properties of the particular electronic document associated with the display of the composite digital content. | 2,100 |
6,193 | 6,193 | 14,709,730 | 2,183 | A computer processor comprising a vector unit is disclosed. The vector unit may comprise a vector register file comprising at least one register to hold a varying number of elements. The vector unit may further comprise a vector length register file comprising at least one register to specify the number of operations of a vector instruction to be performed on the varying number of elements in the at least one register of the vector register file. The computer processor may be implemented as a monolithic integrated circuit. | 1. A computer processor, comprising:
a vector unit comprising:
a vector register file comprising at least one register to hold a varying number of elements; and
a length register file comprising one or more vector length registers to specify the number of operations of a vector instruction to be performed on the varying number of elements in one or more length registers of the vector register file,
wherein the computer processor is implemented as a monolithic integrated circuit. 2. The computer processor of claim 1, wherein the vector instruction comprises an explicit length field specifying the number of operations to be performed on the varying number of element. 3. The computer processor of claim 1, wherein the number of operations is derived from one or more of a target register, one or more source registers, or an opcode of the vector instruction. 4. The computer processor of claim 3, wherein the number of operations is derived from the one or more vector length registers. 5. The computer processor of claim 1, wherein the vector length register file further comprises an active length register configured to provide the number of operations of subsequent vector instructions. 6. The computer processor of claim 1, wherein the vector unit further comprises a vector accumulator register file that holds scalar values resulting from operations. 7. The computer processor of claim 1, wherein the vector unit further comprises a vector mask register file that holds single bit values to control the execution of vector operations. 8. The computer processor of claim 1, wherein the vector unit further comprises logic to support precise exceptions for vector instructions, wherein an an exception is raised for a vector instruction that cannot be executed directly by the computer processor. 9. The computer processor of claim 8, wherein the vector instruction specifies vectors of length larger than supported on the computer processor, wherein the computer processor is operable to trap the instruction and emulate the instruction in software. 10. The computer processor of claim 1, wherein the vector unit further comprises logic comprising a control bit to suppress or take interrupts when an exception is encountered and a status bit to record the occurrence of an unsuppressed floating point-exception. 11. The computer processor of claim 1, wherein the vector unit further comprises load/store logic to move blocks of memory comprising a varying number of elements to or from the one or more registers of the vector register file. 12. The computer processor of claim 11, wherein the varying number of elements moved is determined in part by the one or more length registers. 13. The computer processor of claim 11, wherein the memory moved is non-contiguous. 14. The computer processor of claim 13, wherein addresses for memory locations of the non-contiguous blocks of memory accessed are separated by identical amounts specified by a register. 15. The computer processor of claim 13, wherein addresses for memory locations of the non-contiguous blocks of memory accessed are dependent on the contents of a vector register. 16. The computer processor of claim 1, wherein the types of the elements of vectors read by and produced by all vector instructions are specified. 17. The computer processor of claim 1, wherein the types of the elements of vectors read by and produced by vector instructions are recorded dynamically, wherein every time a vector is written, the type of the elements is recorded, and wherein when a vector instruction is executed, the recorded type of each input is compared against the expected type, wherein when the recorded type differs from the expected type, the input is implicitly converted to the expected input type using a set of rules. 18. The computer processor of claim 1, wherein the types of the elements of vectors read by and produced by vector instructions are recorded dynamically, wherein every time a vector is written, the type of the elements is recorded, and wherein when a vector instruction is executed, the recorded type of each input is compared against the expected type, and wherein when the recorded type differs from the expected type, the processor takes an exception. 19. The computer processor of claim 1, wherein the computer processor is configured to operate on vector instructions, wherein input vector registers are read in their entirety along with the vector length register, and further comprising an execution unit to execute instructions over multiple cycles, operating on subsets of the inputs, producing the corresponding results, and then writing the result to an output register. 20. The computer processor of claim 1, wherein the computer processor is configured to operate on vector instructions, wherein input vector registers are not read in their entirety along with the one or more vector length registers, but are read over multiple cycles. 21. The computer processor of claim 20, wherein the one or more vector register files are implemented using one or more memory arrays. 22. A method, comprising:
holding, by a vector register file comprising at least one register of a computer processor, a varying number of elements; and specifying, by a length register file comprising one or more vector length registers of the computer processor, the number of operations of a vector instruction to be performed on the varying number of elements in the one or more length registers of the vector register file; and implementing the computer processor as a monolithic integrated circuit. 23. The method of claim 22, wherein the vector instruction comprises an explicit length field specifying the number of operations to be performed on the varying number of element. 24. The method of claim 22, wherein the number of operations is derived from one or more of a target register, one or more source registers, or an opcode of the vector instruction. 25. The method of claim 24, wherein the number of operations is derived from the one or more vector length registers. 26. The method of claim 22, wherein the length register file further comprises an active length register to provide the number of operations of subsequent vector instructions. 27. The method of claim 22, further comprising holding, by a vector accumulator register file, scalar values resulting from operations. 28. The method of claim 22, further comprising holding, by a vector mask register file single bit values to control the execution of vector operations. 29. The method of claim 22, further comprising supporting precise exceptions for vector instructions, wherein an an exception is raised for a vector instruction that cannot be executed directly by the computer processor. 30. The method of claim 29, wherein the vector instruction specifies vectors of length larger than supported on the computer processor, wherein the computer processor is operable to trap the instruction and emulate the instruction in software. 31. The method of claim 22, further comprising suppressing or taking interrupts, by a control bit, such that when an exception is encountered, a status bit records the occurrence of an unsuppressed floating point-exception. 32. The method of claim 22, further comprising moving blocks of memory comprising a varying number of elements to or from the one or more registers of the vector register file. 33. The method of claim 32, wherein the varying number of elements moved is determined in part by the one or more length registers. 34. The method of claim 32, wherein the memory moved is non-contiguous. 35. The method of claim 34, wherein addresses for memory locations of the non-contiguous blocks of memory accessed are separated by identical amounts specified by a register. 36. The method of claim 34, wherein addresses for memory locations of the non-contiguous blocks of memory accessed are dependent on the contents of a vector register. 37. The method of claim 22, wherein the types of the elements of vectors read by and produced by all vector instructions are specified. 38. The method of claim 22, wherein the types of the elements of vectors read by and produced by vector instructions are recorded dynamically, wherein every time a vector is written, the type of the elements is recorded, and wherein when a vector instruction is executed, the recorded type of each input is compared against the expected type, wherein when the recorded type differs from the expected type, the input is implicitly converted to the expected input type using a set of rules. 39. The method of claim 22, wherein the types of the elements of vectors read by and produced by vector instructions are recorded dynamically, wherein every time a vector is written, the type of the elements is recorded, and wherein when a vector instruction is executed, the recorded type of each input is compared against the expected type, and wherein when the recorded type differs from the expected type, the processor takes an exception. 40. The method of claim 22, further comprising operating on vector instructions, wherein input vector registers are read in their entirety along with the vector length register, and further comprising an execution unit to execute instructions over multiple cycles, operating on subsets of the inputs, producing the corresponding results, and then writing the result to an output register. 41. The method of claim 22, further comprising operating on vector instructions, wherein input vector registers are not read in their entirety along with the one or more vector length registers, but are read over multiple cycles. 42. The method of claim 22, wherein the one or more vector register files are implemented using one or more memory arrays. | A computer processor comprising a vector unit is disclosed. The vector unit may comprise a vector register file comprising at least one register to hold a varying number of elements. The vector unit may further comprise a vector length register file comprising at least one register to specify the number of operations of a vector instruction to be performed on the varying number of elements in the at least one register of the vector register file. The computer processor may be implemented as a monolithic integrated circuit.1. A computer processor, comprising:
a vector unit comprising:
a vector register file comprising at least one register to hold a varying number of elements; and
a length register file comprising one or more vector length registers to specify the number of operations of a vector instruction to be performed on the varying number of elements in one or more length registers of the vector register file,
wherein the computer processor is implemented as a monolithic integrated circuit. 2. The computer processor of claim 1, wherein the vector instruction comprises an explicit length field specifying the number of operations to be performed on the varying number of element. 3. The computer processor of claim 1, wherein the number of operations is derived from one or more of a target register, one or more source registers, or an opcode of the vector instruction. 4. The computer processor of claim 3, wherein the number of operations is derived from the one or more vector length registers. 5. The computer processor of claim 1, wherein the vector length register file further comprises an active length register configured to provide the number of operations of subsequent vector instructions. 6. The computer processor of claim 1, wherein the vector unit further comprises a vector accumulator register file that holds scalar values resulting from operations. 7. The computer processor of claim 1, wherein the vector unit further comprises a vector mask register file that holds single bit values to control the execution of vector operations. 8. The computer processor of claim 1, wherein the vector unit further comprises logic to support precise exceptions for vector instructions, wherein an an exception is raised for a vector instruction that cannot be executed directly by the computer processor. 9. The computer processor of claim 8, wherein the vector instruction specifies vectors of length larger than supported on the computer processor, wherein the computer processor is operable to trap the instruction and emulate the instruction in software. 10. The computer processor of claim 1, wherein the vector unit further comprises logic comprising a control bit to suppress or take interrupts when an exception is encountered and a status bit to record the occurrence of an unsuppressed floating point-exception. 11. The computer processor of claim 1, wherein the vector unit further comprises load/store logic to move blocks of memory comprising a varying number of elements to or from the one or more registers of the vector register file. 12. The computer processor of claim 11, wherein the varying number of elements moved is determined in part by the one or more length registers. 13. The computer processor of claim 11, wherein the memory moved is non-contiguous. 14. The computer processor of claim 13, wherein addresses for memory locations of the non-contiguous blocks of memory accessed are separated by identical amounts specified by a register. 15. The computer processor of claim 13, wherein addresses for memory locations of the non-contiguous blocks of memory accessed are dependent on the contents of a vector register. 16. The computer processor of claim 1, wherein the types of the elements of vectors read by and produced by all vector instructions are specified. 17. The computer processor of claim 1, wherein the types of the elements of vectors read by and produced by vector instructions are recorded dynamically, wherein every time a vector is written, the type of the elements is recorded, and wherein when a vector instruction is executed, the recorded type of each input is compared against the expected type, wherein when the recorded type differs from the expected type, the input is implicitly converted to the expected input type using a set of rules. 18. The computer processor of claim 1, wherein the types of the elements of vectors read by and produced by vector instructions are recorded dynamically, wherein every time a vector is written, the type of the elements is recorded, and wherein when a vector instruction is executed, the recorded type of each input is compared against the expected type, and wherein when the recorded type differs from the expected type, the processor takes an exception. 19. The computer processor of claim 1, wherein the computer processor is configured to operate on vector instructions, wherein input vector registers are read in their entirety along with the vector length register, and further comprising an execution unit to execute instructions over multiple cycles, operating on subsets of the inputs, producing the corresponding results, and then writing the result to an output register. 20. The computer processor of claim 1, wherein the computer processor is configured to operate on vector instructions, wherein input vector registers are not read in their entirety along with the one or more vector length registers, but are read over multiple cycles. 21. The computer processor of claim 20, wherein the one or more vector register files are implemented using one or more memory arrays. 22. A method, comprising:
holding, by a vector register file comprising at least one register of a computer processor, a varying number of elements; and specifying, by a length register file comprising one or more vector length registers of the computer processor, the number of operations of a vector instruction to be performed on the varying number of elements in the one or more length registers of the vector register file; and implementing the computer processor as a monolithic integrated circuit. 23. The method of claim 22, wherein the vector instruction comprises an explicit length field specifying the number of operations to be performed on the varying number of element. 24. The method of claim 22, wherein the number of operations is derived from one or more of a target register, one or more source registers, or an opcode of the vector instruction. 25. The method of claim 24, wherein the number of operations is derived from the one or more vector length registers. 26. The method of claim 22, wherein the length register file further comprises an active length register to provide the number of operations of subsequent vector instructions. 27. The method of claim 22, further comprising holding, by a vector accumulator register file, scalar values resulting from operations. 28. The method of claim 22, further comprising holding, by a vector mask register file single bit values to control the execution of vector operations. 29. The method of claim 22, further comprising supporting precise exceptions for vector instructions, wherein an an exception is raised for a vector instruction that cannot be executed directly by the computer processor. 30. The method of claim 29, wherein the vector instruction specifies vectors of length larger than supported on the computer processor, wherein the computer processor is operable to trap the instruction and emulate the instruction in software. 31. The method of claim 22, further comprising suppressing or taking interrupts, by a control bit, such that when an exception is encountered, a status bit records the occurrence of an unsuppressed floating point-exception. 32. The method of claim 22, further comprising moving blocks of memory comprising a varying number of elements to or from the one or more registers of the vector register file. 33. The method of claim 32, wherein the varying number of elements moved is determined in part by the one or more length registers. 34. The method of claim 32, wherein the memory moved is non-contiguous. 35. The method of claim 34, wherein addresses for memory locations of the non-contiguous blocks of memory accessed are separated by identical amounts specified by a register. 36. The method of claim 34, wherein addresses for memory locations of the non-contiguous blocks of memory accessed are dependent on the contents of a vector register. 37. The method of claim 22, wherein the types of the elements of vectors read by and produced by all vector instructions are specified. 38. The method of claim 22, wherein the types of the elements of vectors read by and produced by vector instructions are recorded dynamically, wherein every time a vector is written, the type of the elements is recorded, and wherein when a vector instruction is executed, the recorded type of each input is compared against the expected type, wherein when the recorded type differs from the expected type, the input is implicitly converted to the expected input type using a set of rules. 39. The method of claim 22, wherein the types of the elements of vectors read by and produced by vector instructions are recorded dynamically, wherein every time a vector is written, the type of the elements is recorded, and wherein when a vector instruction is executed, the recorded type of each input is compared against the expected type, and wherein when the recorded type differs from the expected type, the processor takes an exception. 40. The method of claim 22, further comprising operating on vector instructions, wherein input vector registers are read in their entirety along with the vector length register, and further comprising an execution unit to execute instructions over multiple cycles, operating on subsets of the inputs, producing the corresponding results, and then writing the result to an output register. 41. The method of claim 22, further comprising operating on vector instructions, wherein input vector registers are not read in their entirety along with the one or more vector length registers, but are read over multiple cycles. 42. The method of claim 22, wherein the one or more vector register files are implemented using one or more memory arrays. | 2,100 |
6,194 | 6,194 | 15,044,285 | 2,199 | Methods, apparatuses, and computer program products for instruction weighting for performance profiling in a group dispatch processor are described. In a particular embodiment, a post processing profiler retrieves an execution sample including an instruction address of a youngest instruction in a dispatch group that has completed execution in a group dispatch processor and a number of instructions in the dispatch group. In the particular embodiment, the post processing profiler identifies, based on the instruction address of the youngest instruction and the number of instructions in the dispatch group, all of the instructions that are in the dispatch group at the time that the dispatch group completes execution. In the particular embodiment, the post processing profiler applies within an execution profile, the result of the execution sample, equally to all of the identified instructions that are in the dispatch group. | 1. A method of instruction weighting for performance profiling in a group dispatch processor, the method comprising:
retrieving, by a post processing profiler, an execution sample, wherein the execution sample includes:
an instruction address of a youngest instruction in a dispatch group that has completed execution in a group dispatch processor; and
a number of instructions in the dispatch group; and
based on the instruction address of the youngest instruction and the number of instructions in the dispatch group, identifying, by the post processing profiler, all of the instructions that are in the dispatch group at the time that the dispatch group completes execution; and applying within an execution profile, by the post processing profiler, the result of the execution sample, equally to all of the identified instructions that are in the dispatch group. 2. The method of claim 1 wherein the number of instructions in the dispatch group is determined by the group dispatch processor. 3. The method of claim 1 wherein the instruction address of the youngest instruction in the dispatch group is captured by the group dispatch processor in response to an interrupt. 4. The method of claim 3 wherein the interrupt is triggered by the group dispatch processor in response to one of: a first predetermined number of instructions completing execution and a second predetermined number of clock cycles completing. 5. The method of claim 1, wherein retrieving the execution sample includes receiving the execution sample from the group dispatch processor. 6. The method of claim 1 wherein the number of instructions in the dispatch group is the number of instructions in the dispatch group at the time that the dispatch group completes execution. 7. The method of claim 1 further comprising presenting the execution profile to a user. 8-20. (canceled) | Methods, apparatuses, and computer program products for instruction weighting for performance profiling in a group dispatch processor are described. In a particular embodiment, a post processing profiler retrieves an execution sample including an instruction address of a youngest instruction in a dispatch group that has completed execution in a group dispatch processor and a number of instructions in the dispatch group. In the particular embodiment, the post processing profiler identifies, based on the instruction address of the youngest instruction and the number of instructions in the dispatch group, all of the instructions that are in the dispatch group at the time that the dispatch group completes execution. In the particular embodiment, the post processing profiler applies within an execution profile, the result of the execution sample, equally to all of the identified instructions that are in the dispatch group.1. A method of instruction weighting for performance profiling in a group dispatch processor, the method comprising:
retrieving, by a post processing profiler, an execution sample, wherein the execution sample includes:
an instruction address of a youngest instruction in a dispatch group that has completed execution in a group dispatch processor; and
a number of instructions in the dispatch group; and
based on the instruction address of the youngest instruction and the number of instructions in the dispatch group, identifying, by the post processing profiler, all of the instructions that are in the dispatch group at the time that the dispatch group completes execution; and applying within an execution profile, by the post processing profiler, the result of the execution sample, equally to all of the identified instructions that are in the dispatch group. 2. The method of claim 1 wherein the number of instructions in the dispatch group is determined by the group dispatch processor. 3. The method of claim 1 wherein the instruction address of the youngest instruction in the dispatch group is captured by the group dispatch processor in response to an interrupt. 4. The method of claim 3 wherein the interrupt is triggered by the group dispatch processor in response to one of: a first predetermined number of instructions completing execution and a second predetermined number of clock cycles completing. 5. The method of claim 1, wherein retrieving the execution sample includes receiving the execution sample from the group dispatch processor. 6. The method of claim 1 wherein the number of instructions in the dispatch group is the number of instructions in the dispatch group at the time that the dispatch group completes execution. 7. The method of claim 1 further comprising presenting the execution profile to a user. 8-20. (canceled) | 2,100 |
6,195 | 6,195 | 15,159,048 | 2,156 | Described are natural language web browsers configured to provide a natural language interface to an existing web browser or a newly created web browser. That is, users interact with the web browser employing speech (or text) as input and output instead of using a mouse and keyboard as input and an electronic display screen as output. Embodiments of a natural language web browser converts user questions, statements, and/or commands into actions, reads the resulting HTML and converts the HTML into natural language descriptions to provide to the user. | 1. A natural language web browsing method comprising:
accepting by a web browser a natural language input, the web browser configured to browse a computer network including a plurality of websites having web pages; parsing the natural language input into at least one of a question, a statement, and a command; operating the web browser in accordance with the parsed natural language input; and returning results of the natural language web browsing, wherein the web browsing is accomplished by use of at least a digital processing device. 2. The method of claim 1 further including:
determining if the natural language input is ambiguous;
generating a query asking what was meant by the natural language input when the natural language input is determined to be ambiguous; and
accepting by the web browser, a same or conceptually similar natural language input as the previously accepted natural language input and parsing the same or conceptually similar natural language input into at least one of a question, a statement, and a command of the same or conceptually similar natural language input, when the natural language input was determined to be ambiguous. 3. The method according to claim 1 further including providing information related to actions of the web browser that occurred during the natural language web browsing. 4. The method according to claim 3 further including providing information when a current focus of the web browsing has changed. 5. The method according to claim 2 wherein the operating of the web browser in accordance with at least one of the determined and parsed natural language input and the same or conceptually similar natural language input, without the method limiting access to web sites on the world wide web. 6. The method according to claim 5 wherein the operating includes navigating directly to a particular web page on the world wide web not restricted by the method to a preset number of web sites. 7. The method according to claim 1 wherein the parsing includes:
enumerating web elements of a current web page that has been identified in a current web browsing session;
generating potential references for each enumerated web element;
finding a best match between segments of the natural language input and the generated potential references;
finding a best match between the segments of the natural language input and known question, statement, and command types; and
creating an ambiguity when more than one best match of the finding steps is possible. 8. The method according to claim 7 wherein the enumerated web elements include at least one of a header section, a first section, and a second section. 9. The method according to claim 1 wherein the natural language input includes one of a navigation command, a read command, a summarize command, a describe command, a click command, a type command, a find command, and a search command. 10. The method according to claim 9 wherein the navigation command is performed by:
directing the web browser to visit a destination named by a universal resource locator (URL) when the destination of the navigation command is a URL destination;
setting a focus to the URL destination; and
describing the focus to a user. 11. The method according to claim 10 wherein visiting the URL destination includes:
giving the URL destination to the web browser;
loading a selected web page corresponding to the URL destination; and
restructuring the selected web page to improve an ability to describe the selected web page. 12. The method according to claim 11 wherein the restructuring of the web page includes:
creating a tree structure, having tree elements, for the loaded web page based the HTML of the tree structure;
finding labels for tree elements in the HTML of the loaded web page;
replacing unlabeled HTML document division element, (<div>), with their children; and
for a tree element having more than N children, creating a “more” element with the remainder of children elements. 13. The method according to claim 9 wherein the describe command further includes:
enumerating children of a given web element;
generating a simple reference for each child;
generating a reference for the given web element;
identifying that the given web element reference has a generated list of references; and
when the given web element is a URL, identifying a title of the web page. 14. The method according to claim 13 wherein if two or more adjacent children have a same reference, replace them with a group reference. 15. The method according to claim 9 wherein the read command further includes:
recursively describing a web element; and including the text of any web element encountered that has a text associated with it. 16. The method according to claim 9 wherein the click command further includes:
directing the web browser to click on a web element;
performing a navigation operation if the web element is a link; and
otherwise identifying how the web page changed. 17. The method of claim 1 wherein the natural language input includes a question, statement, or command that is specific to the web site currently being visited. 18. A system for performing natural language web browsing, the system comprising:
a communication arrangement including, at least one digital processing device, an electronic storage and an input/output device configured to communicate with a computer network including a plurality of websites having web pages the communication arrangement configured to: accept by a web browser a natural language input, the web browser configured to browse the computer network; parse the natural language input into at least one of a question, a statement, and a command; operate the web browser in accordance with at least one of the parsed natural language inputs; and return results of the natural language web browsing. 19. The system according to claim 18, the system comprising:
determining if the natural language input is ambiguous; generating a query asking what was meant by the natural language input when the natural language input is determined to be ambiguous; accepting by the web browser, a same or conceptually similar natural language input as the previously accepted natural language input and parse the same or conceptually similar natural language input into at least one of a question, a statement, and a command of the same or conceptually similar natural language input, when the natural language style input was determined to be ambiguous. | Described are natural language web browsers configured to provide a natural language interface to an existing web browser or a newly created web browser. That is, users interact with the web browser employing speech (or text) as input and output instead of using a mouse and keyboard as input and an electronic display screen as output. Embodiments of a natural language web browser converts user questions, statements, and/or commands into actions, reads the resulting HTML and converts the HTML into natural language descriptions to provide to the user.1. A natural language web browsing method comprising:
accepting by a web browser a natural language input, the web browser configured to browse a computer network including a plurality of websites having web pages; parsing the natural language input into at least one of a question, a statement, and a command; operating the web browser in accordance with the parsed natural language input; and returning results of the natural language web browsing, wherein the web browsing is accomplished by use of at least a digital processing device. 2. The method of claim 1 further including:
determining if the natural language input is ambiguous;
generating a query asking what was meant by the natural language input when the natural language input is determined to be ambiguous; and
accepting by the web browser, a same or conceptually similar natural language input as the previously accepted natural language input and parsing the same or conceptually similar natural language input into at least one of a question, a statement, and a command of the same or conceptually similar natural language input, when the natural language input was determined to be ambiguous. 3. The method according to claim 1 further including providing information related to actions of the web browser that occurred during the natural language web browsing. 4. The method according to claim 3 further including providing information when a current focus of the web browsing has changed. 5. The method according to claim 2 wherein the operating of the web browser in accordance with at least one of the determined and parsed natural language input and the same or conceptually similar natural language input, without the method limiting access to web sites on the world wide web. 6. The method according to claim 5 wherein the operating includes navigating directly to a particular web page on the world wide web not restricted by the method to a preset number of web sites. 7. The method according to claim 1 wherein the parsing includes:
enumerating web elements of a current web page that has been identified in a current web browsing session;
generating potential references for each enumerated web element;
finding a best match between segments of the natural language input and the generated potential references;
finding a best match between the segments of the natural language input and known question, statement, and command types; and
creating an ambiguity when more than one best match of the finding steps is possible. 8. The method according to claim 7 wherein the enumerated web elements include at least one of a header section, a first section, and a second section. 9. The method according to claim 1 wherein the natural language input includes one of a navigation command, a read command, a summarize command, a describe command, a click command, a type command, a find command, and a search command. 10. The method according to claim 9 wherein the navigation command is performed by:
directing the web browser to visit a destination named by a universal resource locator (URL) when the destination of the navigation command is a URL destination;
setting a focus to the URL destination; and
describing the focus to a user. 11. The method according to claim 10 wherein visiting the URL destination includes:
giving the URL destination to the web browser;
loading a selected web page corresponding to the URL destination; and
restructuring the selected web page to improve an ability to describe the selected web page. 12. The method according to claim 11 wherein the restructuring of the web page includes:
creating a tree structure, having tree elements, for the loaded web page based the HTML of the tree structure;
finding labels for tree elements in the HTML of the loaded web page;
replacing unlabeled HTML document division element, (<div>), with their children; and
for a tree element having more than N children, creating a “more” element with the remainder of children elements. 13. The method according to claim 9 wherein the describe command further includes:
enumerating children of a given web element;
generating a simple reference for each child;
generating a reference for the given web element;
identifying that the given web element reference has a generated list of references; and
when the given web element is a URL, identifying a title of the web page. 14. The method according to claim 13 wherein if two or more adjacent children have a same reference, replace them with a group reference. 15. The method according to claim 9 wherein the read command further includes:
recursively describing a web element; and including the text of any web element encountered that has a text associated with it. 16. The method according to claim 9 wherein the click command further includes:
directing the web browser to click on a web element;
performing a navigation operation if the web element is a link; and
otherwise identifying how the web page changed. 17. The method of claim 1 wherein the natural language input includes a question, statement, or command that is specific to the web site currently being visited. 18. A system for performing natural language web browsing, the system comprising:
a communication arrangement including, at least one digital processing device, an electronic storage and an input/output device configured to communicate with a computer network including a plurality of websites having web pages the communication arrangement configured to: accept by a web browser a natural language input, the web browser configured to browse the computer network; parse the natural language input into at least one of a question, a statement, and a command; operate the web browser in accordance with at least one of the parsed natural language inputs; and return results of the natural language web browsing. 19. The system according to claim 18, the system comprising:
determining if the natural language input is ambiguous; generating a query asking what was meant by the natural language input when the natural language input is determined to be ambiguous; accepting by the web browser, a same or conceptually similar natural language input as the previously accepted natural language input and parse the same or conceptually similar natural language input into at least one of a question, a statement, and a command of the same or conceptually similar natural language input, when the natural language style input was determined to be ambiguous. | 2,100 |
6,196 | 6,196 | 15,818,050 | 2,132 | Maintaining agent inclusivity within a distributed memory management unit (MMU) including receiving, from an agent, a translation checkout request comprising an effective address (EA) and an effective address to real address table (ERAT) index; translating the EA to a real address (RA) using an entry in a translation lookaside buffer (TLB) within the MMU, wherein the TLB within the MMU comprises an RA for each EA in the ERAT within the agent; flagging the entry in the TLB as in use by the agent, wherein the entry in the TLB comprises a TLB index; storing the EA index and the TLB index in an in-use scoreboard (IUSB), wherein the IUSB maps TLB indexes identifying entries in the TLB within the MMU to ERAT indexes identifying entries in the ERAT within the agent; and sending, to the agent, a translation checkout response comprising the RA. | 1. A method of maintaining agent inclusivity within a distributed memory management unit (MMU), the method comprising:
receiving, from an agent, a translation checkout request comprising an effective address (EA) and an effective address to real address table (ERAT) index, wherein the agent comprises an ERAT, and wherein the EA index identifies an entry in the ERAT within the agent; translating the EA to a real address (RA) using an entry in a translation lookaside buffer (TLB) within the MMU, wherein the TLB within the MMU comprises an RA for each EA in the ERAT within the agent; flagging the entry in the TLB as in use by the agent, wherein the entry in the TLB comprises a TLB index, and wherein the TLB index identifies the entry in the TLB; storing the EA index and the TLB index in an in-use scoreboard (IUSB), wherein the IUSB maps TLB indexes identifying entries in the TLB within the MMU to ERAT indexes identifying entries in the ERAT within the agent; and sending, to the agent, a translation checkout response comprising the RA. 2. The method of claim 1, further comprising:
receiving, from the agent, a translation checkin request comprising the ERAT index; removing, from the IUSB, an entry in the IUSB mapping the ERAT index to the TLB index; removing a flag from the entry in the TLB indicating the entry in the TLB is in use by the agent; and sending, to the agent, a translation checkin response instructing the agent to remove the ERAT entry identified by the ERAT index. 3. The method of claim 1, further comprising:
determining, by the MMU, that the entry in the TLB will be removed; sending, to the agent, a raise barrier request instructing the agent to quiesce an interface between the agent and the MMU; sending, to the agent, an invalidation request comprising the ERAT index; receiving, from the agent, an invalidation response indicating that pending translations targeting the entry in the ERAT identified by the ERAT index have completed; removing an entry in the IUSB mapping the ERAT index to the TLB index; removing the entry in the TLB from the TLB; and sending, to the agent, a lower barrier request instructing the agent to resume sending translation checkout requests to the MMU. 4. The method of claim 3, wherein instructing the agent to quiesce the interface between the agent and the MMU comprises instructing the agent to halt translation checkout requests and send, to the MMU, a raise barrier response after all pending translation operations have completed. 5. The method of claim 1, wherein the IUSB maps, to TLB indexes, ERAT indexes identifying entries in a plurality of ERATs of a plurality of agents. 6. The method of claim 1, wherein translating the EA to the RA further uses a segment lookaside buffer (SLB), wherein flagging the entry in the TLB as in use by the agent further comprises flagging an entry in the SLB as in use by the agent, and wherein storing the EA index and the TLB index in the IUSB comprises storing a SLB index identifying the entry in the SLB with the EA index and the TLB index in the IUSB. 7. The method of claim 1, wherein the translation checkout response further comprises a page size and an indication of whether the agent has permission to write data to a memory location identified by the RA. 8-20. (canceled) | Maintaining agent inclusivity within a distributed memory management unit (MMU) including receiving, from an agent, a translation checkout request comprising an effective address (EA) and an effective address to real address table (ERAT) index; translating the EA to a real address (RA) using an entry in a translation lookaside buffer (TLB) within the MMU, wherein the TLB within the MMU comprises an RA for each EA in the ERAT within the agent; flagging the entry in the TLB as in use by the agent, wherein the entry in the TLB comprises a TLB index; storing the EA index and the TLB index in an in-use scoreboard (IUSB), wherein the IUSB maps TLB indexes identifying entries in the TLB within the MMU to ERAT indexes identifying entries in the ERAT within the agent; and sending, to the agent, a translation checkout response comprising the RA.1. A method of maintaining agent inclusivity within a distributed memory management unit (MMU), the method comprising:
receiving, from an agent, a translation checkout request comprising an effective address (EA) and an effective address to real address table (ERAT) index, wherein the agent comprises an ERAT, and wherein the EA index identifies an entry in the ERAT within the agent; translating the EA to a real address (RA) using an entry in a translation lookaside buffer (TLB) within the MMU, wherein the TLB within the MMU comprises an RA for each EA in the ERAT within the agent; flagging the entry in the TLB as in use by the agent, wherein the entry in the TLB comprises a TLB index, and wherein the TLB index identifies the entry in the TLB; storing the EA index and the TLB index in an in-use scoreboard (IUSB), wherein the IUSB maps TLB indexes identifying entries in the TLB within the MMU to ERAT indexes identifying entries in the ERAT within the agent; and sending, to the agent, a translation checkout response comprising the RA. 2. The method of claim 1, further comprising:
receiving, from the agent, a translation checkin request comprising the ERAT index; removing, from the IUSB, an entry in the IUSB mapping the ERAT index to the TLB index; removing a flag from the entry in the TLB indicating the entry in the TLB is in use by the agent; and sending, to the agent, a translation checkin response instructing the agent to remove the ERAT entry identified by the ERAT index. 3. The method of claim 1, further comprising:
determining, by the MMU, that the entry in the TLB will be removed; sending, to the agent, a raise barrier request instructing the agent to quiesce an interface between the agent and the MMU; sending, to the agent, an invalidation request comprising the ERAT index; receiving, from the agent, an invalidation response indicating that pending translations targeting the entry in the ERAT identified by the ERAT index have completed; removing an entry in the IUSB mapping the ERAT index to the TLB index; removing the entry in the TLB from the TLB; and sending, to the agent, a lower barrier request instructing the agent to resume sending translation checkout requests to the MMU. 4. The method of claim 3, wherein instructing the agent to quiesce the interface between the agent and the MMU comprises instructing the agent to halt translation checkout requests and send, to the MMU, a raise barrier response after all pending translation operations have completed. 5. The method of claim 1, wherein the IUSB maps, to TLB indexes, ERAT indexes identifying entries in a plurality of ERATs of a plurality of agents. 6. The method of claim 1, wherein translating the EA to the RA further uses a segment lookaside buffer (SLB), wherein flagging the entry in the TLB as in use by the agent further comprises flagging an entry in the SLB as in use by the agent, and wherein storing the EA index and the TLB index in the IUSB comprises storing a SLB index identifying the entry in the SLB with the EA index and the TLB index in the IUSB. 7. The method of claim 1, wherein the translation checkout response further comprises a page size and an indication of whether the agent has permission to write data to a memory location identified by the RA. 8-20. (canceled) | 2,100 |
6,197 | 6,197 | 14,751,194 | 2,199 | Techniques for facilitating parallelized configuration of multiple virtual machines. The techniques include duplicating commands received from an administrator and controlling the multiple virtual machines with those commands in a parallel manner. Different types of commands are treated differently. More specifically, commands for controlling software executing in the virtual machines are replicated and sent to each virtual machine. By contrast, commands for managing virtual machines themselves are provided to virtualization software like a hypervisor to be executed. Duplication of the commands for controlling software executing in the virtual machines is performed by an input/output multiplexer, which also has the function of combining display output from each of the virtual machines. More specifically, the input/output multiplexer displays a common display output to the administrator, where the common display output is the screen that is shown on each of the virtual machines. | 1. A method for parallelizing execution of configuration operations for a plurality of virtual machines, the method comprising:
identifying a first command for the plurality of virtual machines; determining that the first command comprises an input/output command for execution by each virtual machine in the plurality of virtual machines; replicating the first command for each of the virtual machines in the plurality of virtual machines to generate first replicated commands; and controlling each virtual machine of the plurality of virtual machines according to the first replicated commands via an input/output multiplexer. 2. The method of claim 1, wherein:
the input/output multiplexer is configured to interface with a virtual machine remote console application programming interface. 3. The method of claim 1, further comprising:
identifying a second command for the plurality of virtual machines; determining that the second command comprises a virtual machine management command for managing the plurality of virtual machines; and controlling each virtualization platform associated with the plurality of virtual machines according to the second command. 4. The method of claim 3, wherein controlling each virtualization platform comprises:
generating a set of translated commands based on the second command via one or more virtualized platform application programming interfaces; and controlling the plurality of virtual machines based on the set of translated commands. 5. The method of claim 1, further comprising:
prior to identifying the first command, determining that a parallelized configuration operation is initiated; in response to determining that the parallelized configuration operation is initiated, causing the virtual machines of the plurality of virtual machines to execute at a single geographic location. 6. The method of claim 5, wherein causing the virtual machines to execute at a single geographic location comprises:
identifying virtual machines of the plurality of virtual machines that are executing in an off-premise location; and migrating the identified virtual machines to an on-premise location. 7. The method of claim 1, further comprising:
receiving display information from each of the virtual machines; and combining the received display information to generate a consensus display. 8. The method of claim 7, wherein:
a script includes a conditional statement configured to cause a second command to be executed conditionally based on a state associated with the consensus display, and the method further comprises: analyzing the consensus display based on the conditional statement; and based on the analyzing, determining whether to replicate the second command to generate second replicated commands and control each virtual machine of the plurality of virtual machines according to the second replicated commands. 9. The method of claim 1, further comprising:
identifying a second command configured to access input media coupled to the input/output multiplexer; attaching the input media to the plurality of virtual machines as a virtual media; accessing data in the input media according to the second command; and transmitting the data to each virtual machine of the plurality of virtual machines. 10. A method for parallelizing execution of operations for a plurality of virtual machines, the method comprising:
in response to receiving a command for mapping one or more virtual machines to an input/output multiplexer, mapping the one or more virtual machines to an input/output multiplexer; combining, via the input/output multiplexer, display data that are output from virtual machines mapped to the input/output multiplexer to generate combined display data; displaying the combined display data; in response to receiving an input/output command, duplicating the input/output command to generate duplicated input/output commands; and providing the duplicated input/output commands to the virtual machines mapped to the input/output multiplexer. 11. The method of claim 10, wherein:
the display data that is combined to generate the combined display data excludes display data from virtual machines not mapped to the input/output multiplexer; and the duplicated input/output commands do not include commands for virtual machines not attached to the input/output multiplexer. 12. The method of claim 10, wherein:
a first subset of the virtual machines mapped to the input/output multiplexer are included in an on-premise data center and a second subset of the virtual machines mapped to the input/output multiplexer and included in an off-premise data center. 13. The method of claim 12, further comprising:
migrating the virtual machines mapped to the input/output multiplexer and included in the off-premise data center to the on-premise data center prior to combining the display data and duplicating the input/output command. 14. The method of claim 13, further comprising:
migrating the virtual machines that are migrated to the on-premise data center back to the off-premise data center after parallelized execution of operations is complete. 15. The method of claim 10, wherein:
the input/output command is included, within a script; and the method further comprises:
duplicating commands included in the script to generate duplicated script commands; and
transmitting the duplicated script commands to the virtual machines attached to the input/output multiplexer for processing. 16. The method of claim 10, further comprising:
receiving a command to read data stored in input media attached to the input/output multiplexer; and transmitting data stored in the input media to the virtual machines attached to the input/output multiplexer. 17. A system for parallelized execution of configuration operations for a plurality of virtual machines, the system comprising:
a central virtual machine console management module comprising:
a configuration manager, and
a virtual machine console display; and
an input/output multiplexer coupled to the configuration manager, and to the virtual machine console display, wherein the input/output multiplexer is configured to:
in response to receiving a command for mapping one or more virtual machines to an input/output multiplexer, map the one or more virtual machines,
combine display data that are output from virtual machines mapped to the input/output multiplexer to generate combined display data,
in response to receiving an input/output command from the configuration manager, duplicate the input/output command to generate duplicated input/output commands, and
provide the duplicated input/output commands to the virtual machines mapped to the input/output multiplexer. 18. The system of claim 17, wherein:
the display data that is combined to generate the combined display data excludes display data from virtual machines not mapped to the input/output multiplexer; and the duplicated input/output commands do not include commands for virtual machines not attached to the input/output multiplexer. 19. The system of claim 17, wherein:
a first subset of the virtual machines mapped to the input/output multiplexer are included in an on-premise data center and a second subset of the virtual machines mapped to the input/output multiplexer and included in an off-premise data center; and the central virtual machine console management module includes a virtual machine operations module configured to migrate the virtual machines mapped to the input/output multiplexer and included in the off-premise data center to the on-premise data center prior to combining the display data and duplicating the input/output command. 20. The system of claim 17, wherein:
the input/output command is included within a script; and the input/output multiplexer is further configured to:
duplicate commands included in the script to generate duplicated script commands; and
transmit the duplicated script commands to the virtual machines attached to the input/output multiplexer for processing. | Techniques for facilitating parallelized configuration of multiple virtual machines. The techniques include duplicating commands received from an administrator and controlling the multiple virtual machines with those commands in a parallel manner. Different types of commands are treated differently. More specifically, commands for controlling software executing in the virtual machines are replicated and sent to each virtual machine. By contrast, commands for managing virtual machines themselves are provided to virtualization software like a hypervisor to be executed. Duplication of the commands for controlling software executing in the virtual machines is performed by an input/output multiplexer, which also has the function of combining display output from each of the virtual machines. More specifically, the input/output multiplexer displays a common display output to the administrator, where the common display output is the screen that is shown on each of the virtual machines.1. A method for parallelizing execution of configuration operations for a plurality of virtual machines, the method comprising:
identifying a first command for the plurality of virtual machines; determining that the first command comprises an input/output command for execution by each virtual machine in the plurality of virtual machines; replicating the first command for each of the virtual machines in the plurality of virtual machines to generate first replicated commands; and controlling each virtual machine of the plurality of virtual machines according to the first replicated commands via an input/output multiplexer. 2. The method of claim 1, wherein:
the input/output multiplexer is configured to interface with a virtual machine remote console application programming interface. 3. The method of claim 1, further comprising:
identifying a second command for the plurality of virtual machines; determining that the second command comprises a virtual machine management command for managing the plurality of virtual machines; and controlling each virtualization platform associated with the plurality of virtual machines according to the second command. 4. The method of claim 3, wherein controlling each virtualization platform comprises:
generating a set of translated commands based on the second command via one or more virtualized platform application programming interfaces; and controlling the plurality of virtual machines based on the set of translated commands. 5. The method of claim 1, further comprising:
prior to identifying the first command, determining that a parallelized configuration operation is initiated; in response to determining that the parallelized configuration operation is initiated, causing the virtual machines of the plurality of virtual machines to execute at a single geographic location. 6. The method of claim 5, wherein causing the virtual machines to execute at a single geographic location comprises:
identifying virtual machines of the plurality of virtual machines that are executing in an off-premise location; and migrating the identified virtual machines to an on-premise location. 7. The method of claim 1, further comprising:
receiving display information from each of the virtual machines; and combining the received display information to generate a consensus display. 8. The method of claim 7, wherein:
a script includes a conditional statement configured to cause a second command to be executed conditionally based on a state associated with the consensus display, and the method further comprises: analyzing the consensus display based on the conditional statement; and based on the analyzing, determining whether to replicate the second command to generate second replicated commands and control each virtual machine of the plurality of virtual machines according to the second replicated commands. 9. The method of claim 1, further comprising:
identifying a second command configured to access input media coupled to the input/output multiplexer; attaching the input media to the plurality of virtual machines as a virtual media; accessing data in the input media according to the second command; and transmitting the data to each virtual machine of the plurality of virtual machines. 10. A method for parallelizing execution of operations for a plurality of virtual machines, the method comprising:
in response to receiving a command for mapping one or more virtual machines to an input/output multiplexer, mapping the one or more virtual machines to an input/output multiplexer; combining, via the input/output multiplexer, display data that are output from virtual machines mapped to the input/output multiplexer to generate combined display data; displaying the combined display data; in response to receiving an input/output command, duplicating the input/output command to generate duplicated input/output commands; and providing the duplicated input/output commands to the virtual machines mapped to the input/output multiplexer. 11. The method of claim 10, wherein:
the display data that is combined to generate the combined display data excludes display data from virtual machines not mapped to the input/output multiplexer; and the duplicated input/output commands do not include commands for virtual machines not attached to the input/output multiplexer. 12. The method of claim 10, wherein:
a first subset of the virtual machines mapped to the input/output multiplexer are included in an on-premise data center and a second subset of the virtual machines mapped to the input/output multiplexer and included in an off-premise data center. 13. The method of claim 12, further comprising:
migrating the virtual machines mapped to the input/output multiplexer and included in the off-premise data center to the on-premise data center prior to combining the display data and duplicating the input/output command. 14. The method of claim 13, further comprising:
migrating the virtual machines that are migrated to the on-premise data center back to the off-premise data center after parallelized execution of operations is complete. 15. The method of claim 10, wherein:
the input/output command is included, within a script; and the method further comprises:
duplicating commands included in the script to generate duplicated script commands; and
transmitting the duplicated script commands to the virtual machines attached to the input/output multiplexer for processing. 16. The method of claim 10, further comprising:
receiving a command to read data stored in input media attached to the input/output multiplexer; and transmitting data stored in the input media to the virtual machines attached to the input/output multiplexer. 17. A system for parallelized execution of configuration operations for a plurality of virtual machines, the system comprising:
a central virtual machine console management module comprising:
a configuration manager, and
a virtual machine console display; and
an input/output multiplexer coupled to the configuration manager, and to the virtual machine console display, wherein the input/output multiplexer is configured to:
in response to receiving a command for mapping one or more virtual machines to an input/output multiplexer, map the one or more virtual machines,
combine display data that are output from virtual machines mapped to the input/output multiplexer to generate combined display data,
in response to receiving an input/output command from the configuration manager, duplicate the input/output command to generate duplicated input/output commands, and
provide the duplicated input/output commands to the virtual machines mapped to the input/output multiplexer. 18. The system of claim 17, wherein:
the display data that is combined to generate the combined display data excludes display data from virtual machines not mapped to the input/output multiplexer; and the duplicated input/output commands do not include commands for virtual machines not attached to the input/output multiplexer. 19. The system of claim 17, wherein:
a first subset of the virtual machines mapped to the input/output multiplexer are included in an on-premise data center and a second subset of the virtual machines mapped to the input/output multiplexer and included in an off-premise data center; and the central virtual machine console management module includes a virtual machine operations module configured to migrate the virtual machines mapped to the input/output multiplexer and included in the off-premise data center to the on-premise data center prior to combining the display data and duplicating the input/output command. 20. The system of claim 17, wherein:
the input/output command is included within a script; and the input/output multiplexer is further configured to:
duplicate commands included in the script to generate duplicated script commands; and
transmit the duplicated script commands to the virtual machines attached to the input/output multiplexer for processing. | 2,100 |
6,198 | 6,198 | 15,670,454 | 2,193 | A test suite is executed to test a computer program for a plurality of variables. A variable value is generated for each variable of the plurality of variables at a predetermined location of the computer program. Whether a test included in the test suite is successful is determined. If the test is successful, the variable value is recorded as part of a success value set. If the test is not successful, the variable value is recorded as part of a failure value set. A confidence metric is calculated for the variable value. A relevance metric for each variable of the plurality of variables is measured, based on a Jaccard distance between the success value set and the failure value set. The failure value set, the success value set, the confidence metric for the variable value, and the relevance metric for each variable of the plurality of variables are presented. | 1. 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 execute a test suite to test a computer program for a plurality of variables; program instructions to generate a variable value for each variable of the plurality of variables at a predetermined location of the computer program; program instructions to determine whether a test included in the test suite is successful; responsive to determining that the test is successful, program instructions to record the variable value as part of a success value set; responsive to determining the test is not successful, program instructions to record the variable value as part of a failure value set; program instructions to calculate a confidence metric for the variable value, wherein the confidence metric indicates a level of certainty in the correctness of the variable value; program instructions to measure a relevance metric for each variable of the plurality of variables; and program instructions to present the failure value set, the success value set, the confidence metric for the variable value, and the relevance metric for each variable of the plurality of variables. 2. The computer program product of claim 1, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to the computer program undergoing an unexpected operational termination at a first location of the computer program, program instructions to identify a second variable associated with a second location of the computer program and a second variable value associated with the second location of the computer program, wherein the second location of the computer program is a program location immediately preceding the first location; program instructions to compare the second variable value with the variable value recorded in the success value set or the failure value set; and program instructions to flag the second variable. 3. The computer program product of claim 2, wherein the program instructions to flag the second variable comprise:
program instructions to determine a likelihood the second variable caused the computer program to not operate as intended, based on a condition selected from the group of conditions consisting of: whether the failure value set includes the second variable value, whether the success value set does not include the second variable value, and whether one variable value included in the success value set having a low normalized occurrence is equal to the second variable value. 4. The computer program product of claim 1, wherein the program instructions to calculate the confidence metric comprises:
responsive to encountering an assertion statement during the testing of the computer program, program instructions to execute the assertion statement; responsive to determining that an expression of the assertion statement evaluates to true, program instructions to identify a first variable associated with the expression of the assertion statement and identify a first variable value of the first variable; responsive to determining that the expression of the assertion statement evaluates to false, program instructions to transform the expression of the assertion statement to its logical negation, identify the first variable associated with the logical negation of the expression of the assertion statement, and identify the first variable value; responsive to encountering a function exit during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function exit; responsive to determining that the first variable is within the scope of the function exit, program instructions to increment a confidence counter assigned to the first variable value; and responsive to determining that a write statement is encountered during the testing of the computer program, program instructions to no longer increment the confidence counter assigned to the first variable value. 5. The computer program product of claim 4, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to encountering a function entry during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function entry; responsive to determining that the first variable is within the scope of the function entry, program instructions to increment the confidence counter assigned to the first variable value; responsive to encountering a function exit during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function exit; and responsive to determining that the first variable is within the scope of the function exit, program instructions to increment the confidence counter assigned to the first variable value. 6. The computer program product of claim 4, wherein the program instructions to calculate the confidence metric comprises:
program instructions to sum the value of the confidence counter for the first variable value with a number of occurrences associated with the first variable value. 7. The computer program product of claim 1, wherein the relevance metric is calculated based on a Jaccard distance between the success value set and the failure value set, and wherein a value of 0 for the relevance metric indicates that the success value set and the failure value set are completely disjoint, and a value of 1 for the relevance metric indicates that the success value set and the failure value set are completely intersecting. 8. The computer program product of claim 1, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to determining, that one variable value is not included in the success value set, program instructions to identify the one variable value as potentially causing the computer program to not operate as intended, wherein the one variable value is either excluded from the success value set and the failure value set, or the one variable value is part of the failure value set. 9. The computer program product of claim 8, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to determining that the one variable value is included in the success value set and has a relatively low number of occurrences, program instructions to identify the one variable value as having a relatively lower likelihood for causing the computer program to not operate as intended. 10. The computer program product of claim 8, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to determining that the one variable value is included in the failure value set and the success value set that completely intersect, program instructions to identify the one variable value as having a low relevance. 11. A computer system comprising:
one or more computer processors; one or more computer readable storage media; program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to execute a test suite to test a computer program for a plurality of variables; program instructions to generate a variable value for each variable of the plurality of variables at a predetermined location of the computer program; program instructions to determine whether a test included in the test suite is successful; responsive to determining that the test is successful, program instructions to record the variable value as part of a success value set; responsive to determining the test is not successful, program instructions to record the variable value as part of a failure value set; program instructions to calculate a confidence metric for the variable value, wherein the confidence metric indicates a level of certainty in the correctness of the variable value; program instructions to measure a relevance metric for each variable of the plurality of variables; and program instructions to present the failure value set, the success value set, the confidence metric for the variable value, and the relevance metric for each variable of the plurality of variables. 12. The computer system of claim 11, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to the computer program undergoing an unexpected operational termination at a first location of the computer program, program instructions to identify a second variable associated with a second location of the computer program and a second variable value associated with the second location of the computer program, wherein the second location of the computer program is a program location immediately preceding the first location; program instructions to compare the second variable value with the variable value recorded in the success value set or the failure value set; and program instructions to flag the second variable. 13. The computer system of claim 12, wherein the program instructions to flag the second variable comprise:
program instructions to determine a likelihood the second variable caused the computer program to not operate as intended, based on a condition selected from the group of conditions consisting of: whether the failure value set includes the second variable value, whether the success value set does not include the second variable value, and whether one variable value included in the success value set having a low normalized occurrence is equal to the second variable value. 14. The computer system of claim 11, wherein the program instructions to calculate the confidence metric comprises:
responsive to encountering an assertion statement during the testing of the computer program, program instructions to execute the assertion statement; responsive to determining that an expression of the assertion statement evaluates to true, program instructions to identify a first variable associated with the expression of the assertion statement and identify a first variable value of the first variable; responsive to determining that the expression of the assertion statement evaluates to false, program instructions to transform the expression of the assertion statement to its logical negation, identify the first variable associated with the logical negation of the expression of the assertion statement, and identify the first variable value; responsive to encountering a function exit during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function exit; responsive to determining that the first variable is within the scope of the function exit, program instructions to increment a confidence counter assigned to the first variable value; and responsive to determining that a write statement is encountered during the testing of the computer program, program instructions to no longer increment the confidence counter assigned to the first variable value. 15. The computer system of claim 14, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to encountering a function entry during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function entry; responsive to determining that the first variable is within the scope of the function entry, program instructions to increment the confidence counter assigned to the first variable value; responsive to encountering a function exit during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function exit; and responsive to determining that the first variable is within the scope of the function exit, program instructions to increment the confidence counter assigned to the first variable value. | A test suite is executed to test a computer program for a plurality of variables. A variable value is generated for each variable of the plurality of variables at a predetermined location of the computer program. Whether a test included in the test suite is successful is determined. If the test is successful, the variable value is recorded as part of a success value set. If the test is not successful, the variable value is recorded as part of a failure value set. A confidence metric is calculated for the variable value. A relevance metric for each variable of the plurality of variables is measured, based on a Jaccard distance between the success value set and the failure value set. The failure value set, the success value set, the confidence metric for the variable value, and the relevance metric for each variable of the plurality of variables are presented.1. 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 execute a test suite to test a computer program for a plurality of variables; program instructions to generate a variable value for each variable of the plurality of variables at a predetermined location of the computer program; program instructions to determine whether a test included in the test suite is successful; responsive to determining that the test is successful, program instructions to record the variable value as part of a success value set; responsive to determining the test is not successful, program instructions to record the variable value as part of a failure value set; program instructions to calculate a confidence metric for the variable value, wherein the confidence metric indicates a level of certainty in the correctness of the variable value; program instructions to measure a relevance metric for each variable of the plurality of variables; and program instructions to present the failure value set, the success value set, the confidence metric for the variable value, and the relevance metric for each variable of the plurality of variables. 2. The computer program product of claim 1, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to the computer program undergoing an unexpected operational termination at a first location of the computer program, program instructions to identify a second variable associated with a second location of the computer program and a second variable value associated with the second location of the computer program, wherein the second location of the computer program is a program location immediately preceding the first location; program instructions to compare the second variable value with the variable value recorded in the success value set or the failure value set; and program instructions to flag the second variable. 3. The computer program product of claim 2, wherein the program instructions to flag the second variable comprise:
program instructions to determine a likelihood the second variable caused the computer program to not operate as intended, based on a condition selected from the group of conditions consisting of: whether the failure value set includes the second variable value, whether the success value set does not include the second variable value, and whether one variable value included in the success value set having a low normalized occurrence is equal to the second variable value. 4. The computer program product of claim 1, wherein the program instructions to calculate the confidence metric comprises:
responsive to encountering an assertion statement during the testing of the computer program, program instructions to execute the assertion statement; responsive to determining that an expression of the assertion statement evaluates to true, program instructions to identify a first variable associated with the expression of the assertion statement and identify a first variable value of the first variable; responsive to determining that the expression of the assertion statement evaluates to false, program instructions to transform the expression of the assertion statement to its logical negation, identify the first variable associated with the logical negation of the expression of the assertion statement, and identify the first variable value; responsive to encountering a function exit during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function exit; responsive to determining that the first variable is within the scope of the function exit, program instructions to increment a confidence counter assigned to the first variable value; and responsive to determining that a write statement is encountered during the testing of the computer program, program instructions to no longer increment the confidence counter assigned to the first variable value. 5. The computer program product of claim 4, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to encountering a function entry during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function entry; responsive to determining that the first variable is within the scope of the function entry, program instructions to increment the confidence counter assigned to the first variable value; responsive to encountering a function exit during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function exit; and responsive to determining that the first variable is within the scope of the function exit, program instructions to increment the confidence counter assigned to the first variable value. 6. The computer program product of claim 4, wherein the program instructions to calculate the confidence metric comprises:
program instructions to sum the value of the confidence counter for the first variable value with a number of occurrences associated with the first variable value. 7. The computer program product of claim 1, wherein the relevance metric is calculated based on a Jaccard distance between the success value set and the failure value set, and wherein a value of 0 for the relevance metric indicates that the success value set and the failure value set are completely disjoint, and a value of 1 for the relevance metric indicates that the success value set and the failure value set are completely intersecting. 8. The computer program product of claim 1, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to determining, that one variable value is not included in the success value set, program instructions to identify the one variable value as potentially causing the computer program to not operate as intended, wherein the one variable value is either excluded from the success value set and the failure value set, or the one variable value is part of the failure value set. 9. The computer program product of claim 8, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to determining that the one variable value is included in the success value set and has a relatively low number of occurrences, program instructions to identify the one variable value as having a relatively lower likelihood for causing the computer program to not operate as intended. 10. The computer program product of claim 8, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to determining that the one variable value is included in the failure value set and the success value set that completely intersect, program instructions to identify the one variable value as having a low relevance. 11. A computer system comprising:
one or more computer processors; one or more computer readable storage media; program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to execute a test suite to test a computer program for a plurality of variables; program instructions to generate a variable value for each variable of the plurality of variables at a predetermined location of the computer program; program instructions to determine whether a test included in the test suite is successful; responsive to determining that the test is successful, program instructions to record the variable value as part of a success value set; responsive to determining the test is not successful, program instructions to record the variable value as part of a failure value set; program instructions to calculate a confidence metric for the variable value, wherein the confidence metric indicates a level of certainty in the correctness of the variable value; program instructions to measure a relevance metric for each variable of the plurality of variables; and program instructions to present the failure value set, the success value set, the confidence metric for the variable value, and the relevance metric for each variable of the plurality of variables. 12. The computer system of claim 11, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to the computer program undergoing an unexpected operational termination at a first location of the computer program, program instructions to identify a second variable associated with a second location of the computer program and a second variable value associated with the second location of the computer program, wherein the second location of the computer program is a program location immediately preceding the first location; program instructions to compare the second variable value with the variable value recorded in the success value set or the failure value set; and program instructions to flag the second variable. 13. The computer system of claim 12, wherein the program instructions to flag the second variable comprise:
program instructions to determine a likelihood the second variable caused the computer program to not operate as intended, based on a condition selected from the group of conditions consisting of: whether the failure value set includes the second variable value, whether the success value set does not include the second variable value, and whether one variable value included in the success value set having a low normalized occurrence is equal to the second variable value. 14. The computer system of claim 11, wherein the program instructions to calculate the confidence metric comprises:
responsive to encountering an assertion statement during the testing of the computer program, program instructions to execute the assertion statement; responsive to determining that an expression of the assertion statement evaluates to true, program instructions to identify a first variable associated with the expression of the assertion statement and identify a first variable value of the first variable; responsive to determining that the expression of the assertion statement evaluates to false, program instructions to transform the expression of the assertion statement to its logical negation, identify the first variable associated with the logical negation of the expression of the assertion statement, and identify the first variable value; responsive to encountering a function exit during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function exit; responsive to determining that the first variable is within the scope of the function exit, program instructions to increment a confidence counter assigned to the first variable value; and responsive to determining that a write statement is encountered during the testing of the computer program, program instructions to no longer increment the confidence counter assigned to the first variable value. 15. The computer system of claim 14, wherein the program instructions stored on the one or more computer readable storage media further comprise:
responsive to encountering a function entry during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function entry; responsive to determining that the first variable is within the scope of the function entry, program instructions to increment the confidence counter assigned to the first variable value; responsive to encountering a function exit during the testing of the computer program, program instructions to determine whether the first variable is within a scope of the function exit; and responsive to determining that the first variable is within the scope of the function exit, program instructions to increment the confidence counter assigned to the first variable value. | 2,100 |
6,199 | 6,199 | 15,345,550 | 2,193 | A test suite is executed to test a computer program for a plurality of variables. A variable value is generated for each variable of the plurality of variables at a predetermined location of the computer program. Whether a test included in the test suite is successful is determined. If the test is successful, the variable value is recorded as part of a success value set. If the test is not successful, the variable value is recorded as part of a failure value set. A confidence metric is calculated for the variable value. A relevance metric for each variable of the plurality of variables is measured, based on a Jaccard distance between the success value set and the failure value set. The failure value set, the success value set, the confidence metric for the variable value, and the relevance metric for each variable of the plurality of variables are presented. | 1. A method comprising:
executing, by one or more computer processors, a test suite to test a computer program for a plurality of variables; generating, by the one or more computer processors, a variable value for each variable of the plurality of variables at a predetermined location of the computer program; determining, by the one or more computer processors, whether a test included in the test suite is successful; responsive to determining that the test is successful, recording, by the one or more computer processors, the variable value as part of a success value set; responsive to determining the test is not successful, recording, by the one or more computer processors, the variable value as part of a failure value set; calculating, by the one or more computer processors, a confidence metric for the variable value, wherein the confidence metric indicates a level of certainty in the correctness of the variable value; measuring, by the one or more computer processors, a relevance metric for each variable of the plurality of variables; and presenting, by the one or more computer processors, the failure value set, the success value set, the confidence metric for the variable value, and the relevance metric for each variable of the plurality of variables. 2. The method of claim 1, further comprising:
responsive to the computer program undergoing an unexpected operational termination at a first location of the computer program, identifying, by the one or more computer processors, a second variable associated with a second location of the computer program and a second variable value associated with the second location of the computer program, wherein the second location of the computer program is a program location immediately preceding the first location; comparing, by the one or more computer processors, the second variable value with the variable value recorded in the success value set or the failure value set; and flagging, by the one or more computer processors, the second variable. 3. The method of claim 2, wherein the step of flagging the second variable comprises:
determining, by the one or more computer processors, a likelihood the second variable caused the computer program to not operate as intended, based on a condition selected from the group of conditions consisting of: whether the failure value set includes the second variable value, whether the success value set does not include the second variable value, and whether one variable value included in the success value set having a low normalized occurrence is equal to the second variable value. 4. The method of claim 1, wherein the step of calculating the confidence metric comprises:
responsive to encountering an assertion statement during the testing of the computer program, executing, by the one or more computer processors, the assertion statement; responsive to determining that an expression of the assertion statement evaluates to true, identifying, by the one or more computer processors, a first variable associated with the expression of the assertion statement and identifying a first variable value of the first variable; responsive to determining that the expression of the assertion statement evaluates to false, transforming, by the one or more computer processors, the expression of the assertion statement to its logical negation, identifying the first variable associated with the logical negation of the expression of the assertion statement, and identifying the first variable value; responsive to encountering a function exit during the testing of the computer program, determining, by the one or more computer processors, whether the first variable is within a scope of the function exit; responsive to determining that the first variable is within the scope of the function exit, incrementing, by the one or more computer processors, a confidence counter assigned to the first variable value; and responsive to determining that a write statement is encountered during the testing of the computer program, no longer incrementing, by the one or more computer processors, the confidence counter assigned to the first variable value. 5. The method of claim 4, further comprising:
responsive to encountering a function entry during the testing of the computer program, determining, by the one or more computer processors, whether the first variable is within a scope of the function entry; responsive to determining that the first variable is within the scope of the function entry, incrementing, by the one or more computer processors, the confidence counter assigned to the first variable value; responsive to encountering a function exit during the testing of the computer program, determining, by the one or more computer processors, whether the first variable is within a scope of the function exit; and responsive to determining that the first variable is within the scope of the function exit, incrementing, by the one or more computer processors, the confidence counter assigned to the first variable value. 6. The method of claim 4, wherein the step of calculating the confidence metric comprises:
summing, by the one or more computer processors, the value of the confidence counter for the first variable value with a number of occurrences associated with the first variable value. 7. The method of claim 1, wherein the relevance metric is calculated based on a Jaccard distance between the success value set and the failure value set, and wherein a value of 0 for the relevance metric indicates that the success value set and the failure value set are completely disjoint, and a value of 1 for the relevance metric indicates that the success value set and the failure value set are completely intersecting. 8. The method of claim 1, further comprising:
responsive to determining, that one variable value is not included in the success value set, identifying, by the one or more computer processors, the one variable value as potentially causing the computer program to not operate as intended, wherein the one variable value is either excluded from the success value set and the failure value set, or the one variable value is part of the failure value set. 9. The method of claim 8, further comprising:
responsive to determining that the one variable value is included in the success value set and has a relatively low number of occurrences, identifying, by the one or more computer processors, the one variable value as having a relatively lower likelihood for causing the computer program to not operate as intended. 10. The method of claim 8, further comprising:
responsive to determining that the one variable value is included in the failure value set and the success value set that completely intersect, identifying, by the one or more computer processors, the one variable value as having a low relevance. 11.-25. (canceled) | A test suite is executed to test a computer program for a plurality of variables. A variable value is generated for each variable of the plurality of variables at a predetermined location of the computer program. Whether a test included in the test suite is successful is determined. If the test is successful, the variable value is recorded as part of a success value set. If the test is not successful, the variable value is recorded as part of a failure value set. A confidence metric is calculated for the variable value. A relevance metric for each variable of the plurality of variables is measured, based on a Jaccard distance between the success value set and the failure value set. The failure value set, the success value set, the confidence metric for the variable value, and the relevance metric for each variable of the plurality of variables are presented.1. A method comprising:
executing, by one or more computer processors, a test suite to test a computer program for a plurality of variables; generating, by the one or more computer processors, a variable value for each variable of the plurality of variables at a predetermined location of the computer program; determining, by the one or more computer processors, whether a test included in the test suite is successful; responsive to determining that the test is successful, recording, by the one or more computer processors, the variable value as part of a success value set; responsive to determining the test is not successful, recording, by the one or more computer processors, the variable value as part of a failure value set; calculating, by the one or more computer processors, a confidence metric for the variable value, wherein the confidence metric indicates a level of certainty in the correctness of the variable value; measuring, by the one or more computer processors, a relevance metric for each variable of the plurality of variables; and presenting, by the one or more computer processors, the failure value set, the success value set, the confidence metric for the variable value, and the relevance metric for each variable of the plurality of variables. 2. The method of claim 1, further comprising:
responsive to the computer program undergoing an unexpected operational termination at a first location of the computer program, identifying, by the one or more computer processors, a second variable associated with a second location of the computer program and a second variable value associated with the second location of the computer program, wherein the second location of the computer program is a program location immediately preceding the first location; comparing, by the one or more computer processors, the second variable value with the variable value recorded in the success value set or the failure value set; and flagging, by the one or more computer processors, the second variable. 3. The method of claim 2, wherein the step of flagging the second variable comprises:
determining, by the one or more computer processors, a likelihood the second variable caused the computer program to not operate as intended, based on a condition selected from the group of conditions consisting of: whether the failure value set includes the second variable value, whether the success value set does not include the second variable value, and whether one variable value included in the success value set having a low normalized occurrence is equal to the second variable value. 4. The method of claim 1, wherein the step of calculating the confidence metric comprises:
responsive to encountering an assertion statement during the testing of the computer program, executing, by the one or more computer processors, the assertion statement; responsive to determining that an expression of the assertion statement evaluates to true, identifying, by the one or more computer processors, a first variable associated with the expression of the assertion statement and identifying a first variable value of the first variable; responsive to determining that the expression of the assertion statement evaluates to false, transforming, by the one or more computer processors, the expression of the assertion statement to its logical negation, identifying the first variable associated with the logical negation of the expression of the assertion statement, and identifying the first variable value; responsive to encountering a function exit during the testing of the computer program, determining, by the one or more computer processors, whether the first variable is within a scope of the function exit; responsive to determining that the first variable is within the scope of the function exit, incrementing, by the one or more computer processors, a confidence counter assigned to the first variable value; and responsive to determining that a write statement is encountered during the testing of the computer program, no longer incrementing, by the one or more computer processors, the confidence counter assigned to the first variable value. 5. The method of claim 4, further comprising:
responsive to encountering a function entry during the testing of the computer program, determining, by the one or more computer processors, whether the first variable is within a scope of the function entry; responsive to determining that the first variable is within the scope of the function entry, incrementing, by the one or more computer processors, the confidence counter assigned to the first variable value; responsive to encountering a function exit during the testing of the computer program, determining, by the one or more computer processors, whether the first variable is within a scope of the function exit; and responsive to determining that the first variable is within the scope of the function exit, incrementing, by the one or more computer processors, the confidence counter assigned to the first variable value. 6. The method of claim 4, wherein the step of calculating the confidence metric comprises:
summing, by the one or more computer processors, the value of the confidence counter for the first variable value with a number of occurrences associated with the first variable value. 7. The method of claim 1, wherein the relevance metric is calculated based on a Jaccard distance between the success value set and the failure value set, and wherein a value of 0 for the relevance metric indicates that the success value set and the failure value set are completely disjoint, and a value of 1 for the relevance metric indicates that the success value set and the failure value set are completely intersecting. 8. The method of claim 1, further comprising:
responsive to determining, that one variable value is not included in the success value set, identifying, by the one or more computer processors, the one variable value as potentially causing the computer program to not operate as intended, wherein the one variable value is either excluded from the success value set and the failure value set, or the one variable value is part of the failure value set. 9. The method of claim 8, further comprising:
responsive to determining that the one variable value is included in the success value set and has a relatively low number of occurrences, identifying, by the one or more computer processors, the one variable value as having a relatively lower likelihood for causing the computer program to not operate as intended. 10. The method of claim 8, further comprising:
responsive to determining that the one variable value is included in the failure value set and the success value set that completely intersect, identifying, by the one or more computer processors, the one variable value as having a low relevance. 11.-25. (canceled) | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.