Unnamed: 0
int64 0
350k
| ApplicationNumber
int64 9.75M
96.1M
| ArtUnit
int64 1.6k
3.99k
| Abstract
stringlengths 7
8.37k
| Claims
stringlengths 3
292k
| abstract-claims
stringlengths 68
293k
| TechCenter
int64 1.6k
3.9k
|
|---|---|---|---|---|---|---|
4,500 | 14,109,118 | 2,176 | Certain example embodiments described herein relate to techniques for processing XML documents of potentially very large sizes. For instance, certain example embodiments parse a potentially large XML document, store the parsed data and some associated metadata in multiple independent blocks or partitions, and instantiate only the particular object model object requested by a program. By including logical references rather than physical memory addresses in such pre-parsed partitions, certain example embodiments make it possible to move the partitions through a caching storage hierarchy without necessarily having to adjust or encode memory references, thereby advantageously enabling dynamic usage of the created partitions and making it possible to cache an arbitrarily large document while consuming a limited amount of program memory. Additionally, certain example embodiments relate to, in addition to delaying the instantiation of nodes, delaying the encoding of respective segments of the XML document until associated nodes are referenced. | 1. A system for processing XML documents, comprising
processing resources including at least one processor and a memory, wherein the processing resources are configured to perform operations comprising:
pre-parsing an XML document to generate a plurality of XML segments and metadata for each generated XML segment, the XML document including a plurality of objects representable in accordance with an object model; and
in response to a request received for an object from a user program:
identifying at least one of the generated XML segments having the requested object;
parsing the identified at least one XML segment into one or more constituent nodes; and
instantiating said requested object using the one or more constituent nodes in accordance with the object model. 2. The system of claim 1, wherein parsing the identified at least one XML segment comprises parsing only the identified at least one XML segment in response to the request. 3. The system of claim 1, wherein instantiating said requested object comprises instantiating only said requested object in response to the request. 4. The system of claim 1, wherein identifying at least one of the generated XML segments comprises identifying the at least one of the generated XML segments using the generated metadata. 5. The system of claim 1, wherein pre-parsing an XML document comprises dividing the XML document into the plurality of XML segments, wherein each XML segment includes raw XML source code. 6. The system of claim 5, wherein pre-parsing an XML document further comprises:
for each XML segment from the plurality of the XML segments, determining a range of node identifiers representing nodes included in the XML segment; and storing an indication of the determined range in the metadata associated with the XML segment. 7. The system of claim 5, wherein pre-parsing an XML document further comprises:
for each XML segment from the plurality of the XML segments, determining a state before beginning the pre-parsing of the XML segment; and storing the determined state as at least part of the metadata associated with the XML segment. 8. The system of claim 1, wherein the processing resources are further configured to store the generated XML segments in one or more partitions. 9. The system of claim 8, wherein the processing resources are further configured to, in response to the request, store the one or more constituent nodes in the partition having the associated generated XML segment. 10. The system of claim 8, wherein each said partition includes a locator array, a properties array, and a character array, wherein:
the locator array is configured to identify starting positions of nodes encoded in the properties array; and the properties array is configured to store encoded nodes, as well as, for each said encoded node: metadata including a respective node type, reference(s) to any familial nodes thereof, and offset(s) into the character array for any attribute and/or text value(s) associated therewith. 11. The system of claim 10, wherein each said reference is an allocation identifier. 12. The system of claim 1, wherein the processing resources are further configured to remove partitions of the parsed document from the memory and/or the non-transitory computer readable storage medium when the user program no longer includes any references to the document or any objects thereof. 13. The system of claim 1, wherein the XML document is pre-parsed by executing a pre-parsing initialization that includes:
creating a cacheable document node that corresponds to the starting point for user program access to the XML document; allocating a name dictionary that includes an indexed entry for each unique XML tag name included in the XML document; allocating a namespace dictionary that includes an index entry for each unique XML namespace included in the XML document; and allocating a partition table that includes a list of cacheable partitions, XML segments, and an allocation array that allows a node's allocation identifier to be resolved to a specific cacheable partition, each said cacheable partition including metadata from the pre-parsing initialization. 14. The system of claim 13, wherein the pre-parsing initialization further includes allocating an attribute value dictionary that stores unique occurrences of attribute values included in the XML document, and/or a text value dictionary that stores unique occurrences of text values included in the XML document. 15. The system of claim 1, wherein said parsing the identified at least one XML segment comprises:
recognizing parsing events of predefined parsing event types within the XML segment; creating nodes for the recognized parsing events; adding the created nodes to a current partition while there is sufficient space therein; and creating a new partition when there is insufficient space in the current partition for adding created nodes, updating the partition table, and continuing with the adding by treating the newly created partition as the current partition. 16. The system according to claim 15, wherein the partitions and the partition table are movable from the memory to the non-transitory computer readable storage medium when moving the XML document from session to session. 17. A method of processing an XML document, comprising:
pre-parsing, using at least one processor, an XML document to generate a plurality of XML segments and metadata for each generated XML segment, the XML document including a plurality of objects representable in accordance with an object model; and in response to a request received for an object from a user program:
identifying at least one of the generated XML segments having the requested object;
parsing the identified at least one XML segment into one or more constituent nodes; and
instantiating said requested object using the one or more constituent nodes in accordance with the object model. 18. The method of claim 17, further comprising storing the generated XML segments in one or more partitions. 19. The method of claim 18, wherein each said partition includes a locator array, a properties array, and a character array, and wherein:
the locator array is configured to identify starting positions of nodes encoded in the properties array; and the properties array is configured to store encoded nodes, as well as, for each said encoded node: metadata including a respective node type, reference(s) to any familial nodes thereof, and offset(s) into the character array for any attribute and/or text value(s) associated therewith. 20. A non-transitory computer readable storage medium having instructions stored thereon that, when executed by a computer, cause the computer to perform operations comprising:
pre-parsing an XML document to generate a plurality of XML segments and metadata for each generated XML segment, the XML document including a plurality of objects representable in accordance with an object model; and in response to a request received for an object from a user program:
identifying at least one of the generated XML segments having the requested object;
parsing the identified at least one XML segment into one or more constituent nodes; and
instantiating said requested object using the one or more constituent nodes in accordance with the object model. | Certain example embodiments described herein relate to techniques for processing XML documents of potentially very large sizes. For instance, certain example embodiments parse a potentially large XML document, store the parsed data and some associated metadata in multiple independent blocks or partitions, and instantiate only the particular object model object requested by a program. By including logical references rather than physical memory addresses in such pre-parsed partitions, certain example embodiments make it possible to move the partitions through a caching storage hierarchy without necessarily having to adjust or encode memory references, thereby advantageously enabling dynamic usage of the created partitions and making it possible to cache an arbitrarily large document while consuming a limited amount of program memory. Additionally, certain example embodiments relate to, in addition to delaying the instantiation of nodes, delaying the encoding of respective segments of the XML document until associated nodes are referenced.1. A system for processing XML documents, comprising
processing resources including at least one processor and a memory, wherein the processing resources are configured to perform operations comprising:
pre-parsing an XML document to generate a plurality of XML segments and metadata for each generated XML segment, the XML document including a plurality of objects representable in accordance with an object model; and
in response to a request received for an object from a user program:
identifying at least one of the generated XML segments having the requested object;
parsing the identified at least one XML segment into one or more constituent nodes; and
instantiating said requested object using the one or more constituent nodes in accordance with the object model. 2. The system of claim 1, wherein parsing the identified at least one XML segment comprises parsing only the identified at least one XML segment in response to the request. 3. The system of claim 1, wherein instantiating said requested object comprises instantiating only said requested object in response to the request. 4. The system of claim 1, wherein identifying at least one of the generated XML segments comprises identifying the at least one of the generated XML segments using the generated metadata. 5. The system of claim 1, wherein pre-parsing an XML document comprises dividing the XML document into the plurality of XML segments, wherein each XML segment includes raw XML source code. 6. The system of claim 5, wherein pre-parsing an XML document further comprises:
for each XML segment from the plurality of the XML segments, determining a range of node identifiers representing nodes included in the XML segment; and storing an indication of the determined range in the metadata associated with the XML segment. 7. The system of claim 5, wherein pre-parsing an XML document further comprises:
for each XML segment from the plurality of the XML segments, determining a state before beginning the pre-parsing of the XML segment; and storing the determined state as at least part of the metadata associated with the XML segment. 8. The system of claim 1, wherein the processing resources are further configured to store the generated XML segments in one or more partitions. 9. The system of claim 8, wherein the processing resources are further configured to, in response to the request, store the one or more constituent nodes in the partition having the associated generated XML segment. 10. The system of claim 8, wherein each said partition includes a locator array, a properties array, and a character array, wherein:
the locator array is configured to identify starting positions of nodes encoded in the properties array; and the properties array is configured to store encoded nodes, as well as, for each said encoded node: metadata including a respective node type, reference(s) to any familial nodes thereof, and offset(s) into the character array for any attribute and/or text value(s) associated therewith. 11. The system of claim 10, wherein each said reference is an allocation identifier. 12. The system of claim 1, wherein the processing resources are further configured to remove partitions of the parsed document from the memory and/or the non-transitory computer readable storage medium when the user program no longer includes any references to the document or any objects thereof. 13. The system of claim 1, wherein the XML document is pre-parsed by executing a pre-parsing initialization that includes:
creating a cacheable document node that corresponds to the starting point for user program access to the XML document; allocating a name dictionary that includes an indexed entry for each unique XML tag name included in the XML document; allocating a namespace dictionary that includes an index entry for each unique XML namespace included in the XML document; and allocating a partition table that includes a list of cacheable partitions, XML segments, and an allocation array that allows a node's allocation identifier to be resolved to a specific cacheable partition, each said cacheable partition including metadata from the pre-parsing initialization. 14. The system of claim 13, wherein the pre-parsing initialization further includes allocating an attribute value dictionary that stores unique occurrences of attribute values included in the XML document, and/or a text value dictionary that stores unique occurrences of text values included in the XML document. 15. The system of claim 1, wherein said parsing the identified at least one XML segment comprises:
recognizing parsing events of predefined parsing event types within the XML segment; creating nodes for the recognized parsing events; adding the created nodes to a current partition while there is sufficient space therein; and creating a new partition when there is insufficient space in the current partition for adding created nodes, updating the partition table, and continuing with the adding by treating the newly created partition as the current partition. 16. The system according to claim 15, wherein the partitions and the partition table are movable from the memory to the non-transitory computer readable storage medium when moving the XML document from session to session. 17. A method of processing an XML document, comprising:
pre-parsing, using at least one processor, an XML document to generate a plurality of XML segments and metadata for each generated XML segment, the XML document including a plurality of objects representable in accordance with an object model; and in response to a request received for an object from a user program:
identifying at least one of the generated XML segments having the requested object;
parsing the identified at least one XML segment into one or more constituent nodes; and
instantiating said requested object using the one or more constituent nodes in accordance with the object model. 18. The method of claim 17, further comprising storing the generated XML segments in one or more partitions. 19. The method of claim 18, wherein each said partition includes a locator array, a properties array, and a character array, and wherein:
the locator array is configured to identify starting positions of nodes encoded in the properties array; and the properties array is configured to store encoded nodes, as well as, for each said encoded node: metadata including a respective node type, reference(s) to any familial nodes thereof, and offset(s) into the character array for any attribute and/or text value(s) associated therewith. 20. A non-transitory computer readable storage medium having instructions stored thereon that, when executed by a computer, cause the computer to perform operations comprising:
pre-parsing an XML document to generate a plurality of XML segments and metadata for each generated XML segment, the XML document including a plurality of objects representable in accordance with an object model; and in response to a request received for an object from a user program:
identifying at least one of the generated XML segments having the requested object;
parsing the identified at least one XML segment into one or more constituent nodes; and
instantiating said requested object using the one or more constituent nodes in accordance with the object model. | 2,100 |
4,501 | 11,691,245 | 2,141 | A system comprises a display unit rendering a document in a user interface, a selection tool receiving information selecting an arrangement of invocable actions, and an association unit associating the document with the selected arrangement. | 1-7. (canceled) 8. A computer-implemented method, comprising:
displaying a selection tool for selecting one of a plurality of toolbars to be associated with a document, each toolbar corresponding to a document state specific to a stage of finality of the document or a user role for the document; receiving input via said selection tool specifying a toolbar of the toolbars; and associating the toolbar with said document by saving data indicating the corresponding document state. 9. The method of claim 8, wherein associating comprises:
saving the data indicating the corresponding document state in said document. 10. The method of claim 8, wherein associating comprises:
saving the data indicating the corresponding document state in a file separate from said document. 11. The method of claim 8, further comprising:
displaying the toolbar in an initial view of said document based on accessing, when the document is opened, the saved data indicating the document state. 12. (canceled) 13. The method of claim 8, wherein the saving comprises saving the data indicating that the corresponding document state is one of:
a creation state; an editing state; a review state; a blank, prepared to be filed state; or a posted state. 14. (canceled) 15. A computer program product having a tangible, nontransitory computer readable medium embodying computer program logic, said computer program product comprising:
code which, when executed by a computing system, causes the computing system to display a utility for selecting, from a plurality of tool configurations, a tool configuration to be associated with a document; code which, when executed by the computing system, causes the computing system to receive a selected tool configuration and determine a document state corresponding to the selected tool configuration, the document state specific to a stage of finality of the document; and code which, when executed by the computing system, causes the computing system to create an association between said document and said selected tool configuration by saving data identifying the document state corresponding to the selected tool configuration. 16. The computer program product of claim 15 wherein said tool configuration comprises a toolbar. 17. The computer program product of claim 15, wherein saving data identifying the document state corresponding to the selected tool configuration comprises saving the data identifying the document state in the document. 18. The computer program product of claim 17, further comprising:
code which, when executed by the computing system, causes the computing system to send a file with said document and said saved data to another computer over a network. 19. (canceled) 20. The computer program product of claim 15, further comprising:
code which, when executed by the computing system, causes the computing system to open said document and display said selected tool configuration in an initial view of said document based on the data identifying the document state. 21-22. (canceled) 23. A computer-implemented method comprising:
receiving a request to open a document using an application; in response to said request, accessing information associated with the document to determine an arrangement of tools to be displayed by the application; opening said document with the application; and displaying the arrangement of tools with said document, wherein determining the arrangement of tools to be displayed comprises accessing data associated with the document and identifying a document state specific to a user role for the document, the arrangement of tools comprising an arrangement of tools that corresponds to the identified document state. 24. The method of claim 23, wherein the data associated with said document and identifying the document state is included in said document. 25. The method of claim 23, wherein the data associated with the document indicates a state of the document during an access previous to said opening. 26. The method of claim 23 further comprising:
receiving a request for another tool arrangement; and
displaying said other tool arrangement, 27. A computer program product having a tangible, nontransitory computer readable medium embodying computer program logic, said computer program product comprising:
code which, when executed by a computing system, causes the computing system to access a file including a document; code which, when executed by the computing system, causes the computing system to read information in said document file, said information specifying a document state specific to a stage of finality of the document or a user role for the document; and code which, when executed by the computing system, causes the computing system to determine the document state, determine an arrangement of tools corresponding to the document state from a plurality of potential arrangements of tools, each potential arrangement corresponding to a particular document state, and open said document, wherein opening the document comprises displaying the determined arrangement of tools. 28. The computer program product of claim 27, wherein the arrangement of tools represents an arrangement corresponding to a state that was set when the document was last accessed. 29. The computer program product of claim 27, wherein said arrangement of tools comprises a toolbar. 30. The computer program product of claim 28, further comprising:
code which, when executed by the computing system, causes the computing system to display a utility for selecting, from a plurality of arrangements of tools, another tool arrangement to be associated with said document. 31-35. (canceled) 36. The method set forth in claim 8, wherein the saved data indicating the corresponding document state associates the state with the entire document. 37. The computer program product set forth in claim 15, wherein the data identifying the document state identifies the document state as applying to the entire document. 38. The method set forth in claim 23, wherein the data associated with the document and identifying the document state associates the state with the entire document. 39. The computer program product set forth in claim 27, wherein the document state is associated with the entire document. 40-49. (canceled) | A system comprises a display unit rendering a document in a user interface, a selection tool receiving information selecting an arrangement of invocable actions, and an association unit associating the document with the selected arrangement.1-7. (canceled) 8. A computer-implemented method, comprising:
displaying a selection tool for selecting one of a plurality of toolbars to be associated with a document, each toolbar corresponding to a document state specific to a stage of finality of the document or a user role for the document; receiving input via said selection tool specifying a toolbar of the toolbars; and associating the toolbar with said document by saving data indicating the corresponding document state. 9. The method of claim 8, wherein associating comprises:
saving the data indicating the corresponding document state in said document. 10. The method of claim 8, wherein associating comprises:
saving the data indicating the corresponding document state in a file separate from said document. 11. The method of claim 8, further comprising:
displaying the toolbar in an initial view of said document based on accessing, when the document is opened, the saved data indicating the document state. 12. (canceled) 13. The method of claim 8, wherein the saving comprises saving the data indicating that the corresponding document state is one of:
a creation state; an editing state; a review state; a blank, prepared to be filed state; or a posted state. 14. (canceled) 15. A computer program product having a tangible, nontransitory computer readable medium embodying computer program logic, said computer program product comprising:
code which, when executed by a computing system, causes the computing system to display a utility for selecting, from a plurality of tool configurations, a tool configuration to be associated with a document; code which, when executed by the computing system, causes the computing system to receive a selected tool configuration and determine a document state corresponding to the selected tool configuration, the document state specific to a stage of finality of the document; and code which, when executed by the computing system, causes the computing system to create an association between said document and said selected tool configuration by saving data identifying the document state corresponding to the selected tool configuration. 16. The computer program product of claim 15 wherein said tool configuration comprises a toolbar. 17. The computer program product of claim 15, wherein saving data identifying the document state corresponding to the selected tool configuration comprises saving the data identifying the document state in the document. 18. The computer program product of claim 17, further comprising:
code which, when executed by the computing system, causes the computing system to send a file with said document and said saved data to another computer over a network. 19. (canceled) 20. The computer program product of claim 15, further comprising:
code which, when executed by the computing system, causes the computing system to open said document and display said selected tool configuration in an initial view of said document based on the data identifying the document state. 21-22. (canceled) 23. A computer-implemented method comprising:
receiving a request to open a document using an application; in response to said request, accessing information associated with the document to determine an arrangement of tools to be displayed by the application; opening said document with the application; and displaying the arrangement of tools with said document, wherein determining the arrangement of tools to be displayed comprises accessing data associated with the document and identifying a document state specific to a user role for the document, the arrangement of tools comprising an arrangement of tools that corresponds to the identified document state. 24. The method of claim 23, wherein the data associated with said document and identifying the document state is included in said document. 25. The method of claim 23, wherein the data associated with the document indicates a state of the document during an access previous to said opening. 26. The method of claim 23 further comprising:
receiving a request for another tool arrangement; and
displaying said other tool arrangement, 27. A computer program product having a tangible, nontransitory computer readable medium embodying computer program logic, said computer program product comprising:
code which, when executed by a computing system, causes the computing system to access a file including a document; code which, when executed by the computing system, causes the computing system to read information in said document file, said information specifying a document state specific to a stage of finality of the document or a user role for the document; and code which, when executed by the computing system, causes the computing system to determine the document state, determine an arrangement of tools corresponding to the document state from a plurality of potential arrangements of tools, each potential arrangement corresponding to a particular document state, and open said document, wherein opening the document comprises displaying the determined arrangement of tools. 28. The computer program product of claim 27, wherein the arrangement of tools represents an arrangement corresponding to a state that was set when the document was last accessed. 29. The computer program product of claim 27, wherein said arrangement of tools comprises a toolbar. 30. The computer program product of claim 28, further comprising:
code which, when executed by the computing system, causes the computing system to display a utility for selecting, from a plurality of arrangements of tools, another tool arrangement to be associated with said document. 31-35. (canceled) 36. The method set forth in claim 8, wherein the saved data indicating the corresponding document state associates the state with the entire document. 37. The computer program product set forth in claim 15, wherein the data identifying the document state identifies the document state as applying to the entire document. 38. The method set forth in claim 23, wherein the data associated with the document and identifying the document state associates the state with the entire document. 39. The computer program product set forth in claim 27, wherein the document state is associated with the entire document. 40-49. (canceled) | 2,100 |
4,502 | 14,479,846 | 2,192 | Disclosed are a method and the device for updating a ventilation device that has a memory for an operating program. The memory is at least partially designed as a variable memory and is connected with an input device for a current operating program. The memory and the input device are connected to control devices, which have testing means for evaluating at least one code. At least one function of the apparatus is released only when the code agrees with a reference value. | 1. A method for updating an electronic ventilation device, wherein the method comprises, while performing an update, at least partially replacing an operating program which is at least partially stored in a variable memory of the ventilation device by a new operating program. 2. The method of claim 1, wherein the new operating program is stored on a data carrier and is transferred to the variable memory by a reading device. 3. The method of claim 1, wherein the new operating program is transferred to the ventilation device online 4. The method of claim 1, wherein a base operating program that cannot be altered by the update is stored in the ventilation device. 5. The method of claim 1, wherein testing elements of the ventilation device compare an input code with a reference value, at least one function of the ventilation device being released only when the code is in agreement with the reference value. 6. The method of claim 1, wherein a hardware component present in the ventilation device is activated by the new operating program. 7. The method of claim 1, wherein a functionality of a hardware component present in the ventilation device is altered by the new operating program. 8. The method of claim 1, wherein a code is input or transmitted to an input device of the ventilation device by a data carrier with patient-related, practice-related, or physician-related data or by a reading device designed for this purpose. 9. The method of claim 1, wherein a code is input or transmitted to an input device of the ventilation device by a device that is internally or externally associated, at least temporarily, with a medicinal, medical, or health-related apparatus or acts as an interface to connect several medicinal, medical, or health-related apparatuses by at least temporary data or program exchange. 10. An updatable electronic ventilation device, wherein the ventilation device comprises a memory for an operating program, which memory is at least partially designed as a variable memory and is connected to an input device for updating a current operating program, the memory and the input device being connected to a control device which comprises testing elements for evaluating at least one code, and wherein at least one function of the ventilation device is released only when the at least one code is in agreement with a reference value. 11. An electronic ventilation device, wherein the ventilation device comprises a control unit comprising (i) an internal or external input device for data input or reception, (ii) a memory device which comprises one or more memories and is at least indirectly connected with said input device, data or computing and/or counting algorithms being stored in the one or memories of the memory device and testing elements automatically comparing input or received data in the form of one or more codes with data stored in the one or more memories of the memory device, and (iii) a control device which, based on a comparison result provided by the testing elements automatically causes the ventilation device to at least temporarily be able to perform one or more functions associated with the one or more codes only if the one or more codes are in agreement with data stored in the one or more memories of the memory device, and causes performance of one or more functions associated with the one or more codes to be disabled by the control device or other elements if the one or more codes are not in agreement with data stored in the one or more memories of the memory device. 12. An electronic ventilation device, wherein the ventilation device comprises a control unit comprising (i) an internal or external input device for data and/or computer program input or reception, (ii) a memory device which comprises one or more memories and is at least indirectly connected to said input device, data or computing and/or counting algorithms being stored in the one or more memories of the memory device and testing elements automatically comparing input or received data and/or computer programs in the form of an update with data stored in the one or more memories of the memory device, and (iii) a control device which, based on a comparison result determined by the testing elements, automatically causes the ventilation device to permanently or temporarily apply the input or received data and/or programs or data and/or programs computed therefrom to one or more hardware functions which are associated with the update only if the update is well-defined, and causes performance of one or more hardware functions associated with the update to be disabled by the control device or other elements if the update is not well-defined. 13. The ventilation device of claim 12, wherein the ventilation device further comprises a permanent memory which comprises instructions that are executed after receipt or input of the update, whereupon a rewritable memory unit is searched for updated software and/or firmware, which is then loaded and executed. 14. The ventilation device of claim 12, wherein the ventilation device further comprises (i) a housing comprising an operating panel, a display, and an interface for data transmission, (ii) a respiratory gas pump installed inside the housing, and (iii) a connecting hose attached to the housing by a coupling. 15. The ventilation device of claim 14, wherein the ventilation device further comprises a humidifier. 16. The ventilation device of claim 14, wherein the ventilation device further comprises one or more interfaces for adaptable accessory devices. 17. The ventilation device of claim 16, wherein the adaptable accessory devices comprise at least one of a pulse oximeter and storage media. 18. The ventilation device of claim 14, wherein the ventilation device further comprises one or more interfaces or modems for transmitting recorded data to a physician and/or for transmitting other types of recorded data to maintenance/customer service personnel. 19. The ventilation device of claim 14, wherein the ventilation device further comprises one or more interfaces for adapting one or more sensors for determining one or more bodily parameters. 20. The ventilation device of claim 19, wherein the one or more bodily parameters can be displayed in the display of the housing of the ventilation device. 21. The ventilation device of claim 20, wherein one or more areas of the display are reserved for displaying the one or more bodily parameters and are activated only when a corresponding sensor has been adapted. 22. An electronic ventilation device, wherein the ventilation device comprises a control unit comprising (i) an internal or external input device for data input or reception, (ii) a memory device which comprises one or more memories and is at least indirectly connected with the input device, data or computing and/or counting algorithms being stored in the one or more memories of the memory device and testing elements automatically comparing input or received data in the form of one or more codes with data stored in the one or more memories of the memory device, and (iii) a control device which, based on a comparison result determined by the testing elements automatically causes the ventilation device to cooperate permanently or temporarily with an additional internal or external hardware component associated with the one or more codes only if the one or more codes are well-defined, and causes cooperation of the ventilation device with a hardware component associated with the one or more codes to be disabled by the control device or by other elements without a well-defined code. 23. A method for updating software or firmware in an electronic ventilation device that has a rewritable memory unit for storing an updated and/or a previous version of the software or firmware, wherein the method comprises:
(a) providing the software or firmware for updating by an updating device; (b) communication of the ventilation device with the updating device; (c) when communication has been established, transmission of the update from the updating device to the ventilation device; (d) writing the update into the rewritable memory unit; (e) verification of the update as a valid version and identification of the previous version as invalid; and (f) execution of the updated software or firmware. 24. The method of claim 23, wherein the ventilation device comprises a microcontroller with a memory unit. 25. The method of claim 24, wherein the microcontroller is driven via a date link as follows:
(i) transmission of a signal to the microcontroller to effect a reset of the microcontroller; (ii) providing a flash program with new firmware for writing the new firmware onto the microcontroller; (iii) writing a program entry point in a defined location of the microcontroller, which is read out first for the first time after completion of the reset. 26. The method of claim 23, wherein the previous version of the software or firmware is overwritten by the updated version of the software or firmware. 27. The method of claim 23, wherein the previous version of the software is moved to a restore memory. 28. The method of claim 23, wherein after the update, instructions present in a permanent memory are executed, whereupon a rewritable memory unit is searched for updated software or firmware, which is then loaded and executed. 29. The method of claim 23, wherein a software update or firmware update is input via an interface. 30. The method of claim 29, wherein the interface comprises at least one of an infrared interface, a Bluetooth interface, a USB or a cable-connected form. | Disclosed are a method and the device for updating a ventilation device that has a memory for an operating program. The memory is at least partially designed as a variable memory and is connected with an input device for a current operating program. The memory and the input device are connected to control devices, which have testing means for evaluating at least one code. At least one function of the apparatus is released only when the code agrees with a reference value.1. A method for updating an electronic ventilation device, wherein the method comprises, while performing an update, at least partially replacing an operating program which is at least partially stored in a variable memory of the ventilation device by a new operating program. 2. The method of claim 1, wherein the new operating program is stored on a data carrier and is transferred to the variable memory by a reading device. 3. The method of claim 1, wherein the new operating program is transferred to the ventilation device online 4. The method of claim 1, wherein a base operating program that cannot be altered by the update is stored in the ventilation device. 5. The method of claim 1, wherein testing elements of the ventilation device compare an input code with a reference value, at least one function of the ventilation device being released only when the code is in agreement with the reference value. 6. The method of claim 1, wherein a hardware component present in the ventilation device is activated by the new operating program. 7. The method of claim 1, wherein a functionality of a hardware component present in the ventilation device is altered by the new operating program. 8. The method of claim 1, wherein a code is input or transmitted to an input device of the ventilation device by a data carrier with patient-related, practice-related, or physician-related data or by a reading device designed for this purpose. 9. The method of claim 1, wherein a code is input or transmitted to an input device of the ventilation device by a device that is internally or externally associated, at least temporarily, with a medicinal, medical, or health-related apparatus or acts as an interface to connect several medicinal, medical, or health-related apparatuses by at least temporary data or program exchange. 10. An updatable electronic ventilation device, wherein the ventilation device comprises a memory for an operating program, which memory is at least partially designed as a variable memory and is connected to an input device for updating a current operating program, the memory and the input device being connected to a control device which comprises testing elements for evaluating at least one code, and wherein at least one function of the ventilation device is released only when the at least one code is in agreement with a reference value. 11. An electronic ventilation device, wherein the ventilation device comprises a control unit comprising (i) an internal or external input device for data input or reception, (ii) a memory device which comprises one or more memories and is at least indirectly connected with said input device, data or computing and/or counting algorithms being stored in the one or memories of the memory device and testing elements automatically comparing input or received data in the form of one or more codes with data stored in the one or more memories of the memory device, and (iii) a control device which, based on a comparison result provided by the testing elements automatically causes the ventilation device to at least temporarily be able to perform one or more functions associated with the one or more codes only if the one or more codes are in agreement with data stored in the one or more memories of the memory device, and causes performance of one or more functions associated with the one or more codes to be disabled by the control device or other elements if the one or more codes are not in agreement with data stored in the one or more memories of the memory device. 12. An electronic ventilation device, wherein the ventilation device comprises a control unit comprising (i) an internal or external input device for data and/or computer program input or reception, (ii) a memory device which comprises one or more memories and is at least indirectly connected to said input device, data or computing and/or counting algorithms being stored in the one or more memories of the memory device and testing elements automatically comparing input or received data and/or computer programs in the form of an update with data stored in the one or more memories of the memory device, and (iii) a control device which, based on a comparison result determined by the testing elements, automatically causes the ventilation device to permanently or temporarily apply the input or received data and/or programs or data and/or programs computed therefrom to one or more hardware functions which are associated with the update only if the update is well-defined, and causes performance of one or more hardware functions associated with the update to be disabled by the control device or other elements if the update is not well-defined. 13. The ventilation device of claim 12, wherein the ventilation device further comprises a permanent memory which comprises instructions that are executed after receipt or input of the update, whereupon a rewritable memory unit is searched for updated software and/or firmware, which is then loaded and executed. 14. The ventilation device of claim 12, wherein the ventilation device further comprises (i) a housing comprising an operating panel, a display, and an interface for data transmission, (ii) a respiratory gas pump installed inside the housing, and (iii) a connecting hose attached to the housing by a coupling. 15. The ventilation device of claim 14, wherein the ventilation device further comprises a humidifier. 16. The ventilation device of claim 14, wherein the ventilation device further comprises one or more interfaces for adaptable accessory devices. 17. The ventilation device of claim 16, wherein the adaptable accessory devices comprise at least one of a pulse oximeter and storage media. 18. The ventilation device of claim 14, wherein the ventilation device further comprises one or more interfaces or modems for transmitting recorded data to a physician and/or for transmitting other types of recorded data to maintenance/customer service personnel. 19. The ventilation device of claim 14, wherein the ventilation device further comprises one or more interfaces for adapting one or more sensors for determining one or more bodily parameters. 20. The ventilation device of claim 19, wherein the one or more bodily parameters can be displayed in the display of the housing of the ventilation device. 21. The ventilation device of claim 20, wherein one or more areas of the display are reserved for displaying the one or more bodily parameters and are activated only when a corresponding sensor has been adapted. 22. An electronic ventilation device, wherein the ventilation device comprises a control unit comprising (i) an internal or external input device for data input or reception, (ii) a memory device which comprises one or more memories and is at least indirectly connected with the input device, data or computing and/or counting algorithms being stored in the one or more memories of the memory device and testing elements automatically comparing input or received data in the form of one or more codes with data stored in the one or more memories of the memory device, and (iii) a control device which, based on a comparison result determined by the testing elements automatically causes the ventilation device to cooperate permanently or temporarily with an additional internal or external hardware component associated with the one or more codes only if the one or more codes are well-defined, and causes cooperation of the ventilation device with a hardware component associated with the one or more codes to be disabled by the control device or by other elements without a well-defined code. 23. A method for updating software or firmware in an electronic ventilation device that has a rewritable memory unit for storing an updated and/or a previous version of the software or firmware, wherein the method comprises:
(a) providing the software or firmware for updating by an updating device; (b) communication of the ventilation device with the updating device; (c) when communication has been established, transmission of the update from the updating device to the ventilation device; (d) writing the update into the rewritable memory unit; (e) verification of the update as a valid version and identification of the previous version as invalid; and (f) execution of the updated software or firmware. 24. The method of claim 23, wherein the ventilation device comprises a microcontroller with a memory unit. 25. The method of claim 24, wherein the microcontroller is driven via a date link as follows:
(i) transmission of a signal to the microcontroller to effect a reset of the microcontroller; (ii) providing a flash program with new firmware for writing the new firmware onto the microcontroller; (iii) writing a program entry point in a defined location of the microcontroller, which is read out first for the first time after completion of the reset. 26. The method of claim 23, wherein the previous version of the software or firmware is overwritten by the updated version of the software or firmware. 27. The method of claim 23, wherein the previous version of the software is moved to a restore memory. 28. The method of claim 23, wherein after the update, instructions present in a permanent memory are executed, whereupon a rewritable memory unit is searched for updated software or firmware, which is then loaded and executed. 29. The method of claim 23, wherein a software update or firmware update is input via an interface. 30. The method of claim 29, wherein the interface comprises at least one of an infrared interface, a Bluetooth interface, a USB or a cable-connected form. | 2,100 |
4,503 | 14,538,742 | 2,139 | Redo logs are used to facilitate efficient cloning of virtual machines. When a virtual machine with a virtual hard disk is to be cloned, two redo logs are created, both of which are linked to the virtual hard disk. The virtual machine being cloned is then linked to one redo log, and a newly created virtual machine is linked to the other. Each time an additional virtual machine is created, two new redo logs are created and linked to the end of the disk chain. The parent and newly created virtual machine are each linked to one of the new redo logs. | 1-30. (canceled) 31. A method comprising:
determining that a virtual machine (VM) satisfies a set of requirements, the VM being linked to a base virtual disk; based on the determining, identifying the VM as a template VM; receiving a request to clone the template VM to produce a second VM; creating a redo disk for the second VM without copying contents of the base virtual disk to the redo disk; and linking the redo disk to the base virtual disk. 32. The method of claim 31, wherein identifying the VM as a template VM further comprises capturing the VM into a library of VMs. 33. The method of claim 32, further comprising:
receiving a request to revert the VM to a state of the template VM captured in the library of VMs: creating a second redo disk for the template VM without copying contents of the base virtual disk to the second redo disk; and linking the second redo disk to the base virtual disk. 34. The method of claim 31, wherein the set of requirements include the VM reaching a desired state. 35. The method of claim 34, wherein the desired state is associated with an environment for application installation. 36. The method of claim 31, further comprising:
receiving a request to clone the second VM to produce a third VM; determining that the redo disk exceeds a threshold size; and responsive to determining that the redo disk exceeds the threshold size, creating a third redo disk for the third VM and linking the third redo disk to the redo disk. 37. The method of claim 31, further comprising:
receiving a request to clone the second VM to produce a third VM; determining that the redo disk does not exceed a threshold size; and responsive to determining that the redo disk does not exceed the threshold size, creating a third redo disk for the third VM by copying contents of the redo disk to the third redo disk and linking the third redo disk to the base virtual disk. 38. A non-transitory computer readable medium storing a computer program that when executed causes one or more processors to perform the steps of:
determining that a virtual machine (VM) satisfies a set of requirements, the VM being linked to a base virtual disk; based on the determining, identifying the VM as a template VM; receiving a request to clone the template VM to produce a second VM; creating a redo disk for the second VM without copying contents of the base virtual disk to the redo disk; and linking the redo disk to the base virtual disk. 39. The non-transitory computer readable medium of claim 38, wherein identifying the VM as a template VM further comprises capturing the VM into a library of VMs. 40. The non-transitory computer readable medium of claim 39, wherein the one or more processors further perform the steps of:
receiving a request to revert the VM to a state of the template VM captured in the library of VMs: creating a second redo disk for the template VM without copying contents of the base virtual disk to the second redo disk; and linking the second redo disk to the base virtual disk. 41. The non-transitory computer readable medium of claim 38, wherein the set of requirements include the VM reaching a desired state. 42. The non-transitory computer readable medium of claim 41, wherein the desired state is associated with an environment for application installation. 43. The non-transitory computer readable medium of claim 38, wherein the one or more processors further perform the steps of:
receiving a request to clone the second VM to produce a third VM; determining that the redo disk exceeds a threshold size; and responsive to determining that the redo disk exceeds the threshold size, creating a third redo disk for the third VM and linking the third redo disk to the redo disk. 44. The non-transitory computer readable medium of claim 38, wherein the one or more processors further perform the steps of:
receiving a request to clone the second VM to produce a third VM; determining that the redo disk does not exceed a threshold size; and responsive to determining that the redo disk does not exceed the threshold size, creating a third redo disk for the third VM by copying contents of the redo disk to the third redo disk and linking the third redo disk to the base virtual disk. 45. A system comprising:
a memory area comprising a library of a plurality of template virtual machines (VM); and a processor programmed to:
determine that a VM satisfies a set of requirements, the VM being linked to a base virtual disk;
based on the determining, identify the VM as a template VM;
capture the template VM into the library;
receive a request to clone the template VM to produce a second VM;
create a redo disk for the second VM without copying contents of the base virtual disk to the redo disk; and
link the redo disk to the base virtual disk. 46. The system of claim 45, wherein identifying the VM as a template VM further comprises capturing the VM into a library of VMs. 47. The system of claim 46, wherein the processor is further programmed to:
receive a request to revert the VM to a state of the template VM captured in the library of VMs: create a second redo disk for the template VM without copying contents of the base virtual disk to the second redo disk; and link the second redo disk to the base virtual disk. 48. The system of claim 45, wherein the set of requirements include the VM reaching a desired state. 49. The system of claim 48, wherein the desired state is associated with an environment for application installation. 50. The system of claim 15, wherein the processor is further programmed to:
receive a request to clone the second VM to produce a third VM; determine whether the redo disk exceeds a threshold size; and responsive to determining that the redo disk exceeds the threshold size, creating a third redo disk for the third VM and linking the third redo disk to the redo disk; or responsive to determining that the redo disk does not exceed the threshold size, creating a third redo disk for the third VM by copying contents of the redo disk to the third redo disk and linking the third redo disk to the base virtual disk. | Redo logs are used to facilitate efficient cloning of virtual machines. When a virtual machine with a virtual hard disk is to be cloned, two redo logs are created, both of which are linked to the virtual hard disk. The virtual machine being cloned is then linked to one redo log, and a newly created virtual machine is linked to the other. Each time an additional virtual machine is created, two new redo logs are created and linked to the end of the disk chain. The parent and newly created virtual machine are each linked to one of the new redo logs.1-30. (canceled) 31. A method comprising:
determining that a virtual machine (VM) satisfies a set of requirements, the VM being linked to a base virtual disk; based on the determining, identifying the VM as a template VM; receiving a request to clone the template VM to produce a second VM; creating a redo disk for the second VM without copying contents of the base virtual disk to the redo disk; and linking the redo disk to the base virtual disk. 32. The method of claim 31, wherein identifying the VM as a template VM further comprises capturing the VM into a library of VMs. 33. The method of claim 32, further comprising:
receiving a request to revert the VM to a state of the template VM captured in the library of VMs: creating a second redo disk for the template VM without copying contents of the base virtual disk to the second redo disk; and linking the second redo disk to the base virtual disk. 34. The method of claim 31, wherein the set of requirements include the VM reaching a desired state. 35. The method of claim 34, wherein the desired state is associated with an environment for application installation. 36. The method of claim 31, further comprising:
receiving a request to clone the second VM to produce a third VM; determining that the redo disk exceeds a threshold size; and responsive to determining that the redo disk exceeds the threshold size, creating a third redo disk for the third VM and linking the third redo disk to the redo disk. 37. The method of claim 31, further comprising:
receiving a request to clone the second VM to produce a third VM; determining that the redo disk does not exceed a threshold size; and responsive to determining that the redo disk does not exceed the threshold size, creating a third redo disk for the third VM by copying contents of the redo disk to the third redo disk and linking the third redo disk to the base virtual disk. 38. A non-transitory computer readable medium storing a computer program that when executed causes one or more processors to perform the steps of:
determining that a virtual machine (VM) satisfies a set of requirements, the VM being linked to a base virtual disk; based on the determining, identifying the VM as a template VM; receiving a request to clone the template VM to produce a second VM; creating a redo disk for the second VM without copying contents of the base virtual disk to the redo disk; and linking the redo disk to the base virtual disk. 39. The non-transitory computer readable medium of claim 38, wherein identifying the VM as a template VM further comprises capturing the VM into a library of VMs. 40. The non-transitory computer readable medium of claim 39, wherein the one or more processors further perform the steps of:
receiving a request to revert the VM to a state of the template VM captured in the library of VMs: creating a second redo disk for the template VM without copying contents of the base virtual disk to the second redo disk; and linking the second redo disk to the base virtual disk. 41. The non-transitory computer readable medium of claim 38, wherein the set of requirements include the VM reaching a desired state. 42. The non-transitory computer readable medium of claim 41, wherein the desired state is associated with an environment for application installation. 43. The non-transitory computer readable medium of claim 38, wherein the one or more processors further perform the steps of:
receiving a request to clone the second VM to produce a third VM; determining that the redo disk exceeds a threshold size; and responsive to determining that the redo disk exceeds the threshold size, creating a third redo disk for the third VM and linking the third redo disk to the redo disk. 44. The non-transitory computer readable medium of claim 38, wherein the one or more processors further perform the steps of:
receiving a request to clone the second VM to produce a third VM; determining that the redo disk does not exceed a threshold size; and responsive to determining that the redo disk does not exceed the threshold size, creating a third redo disk for the third VM by copying contents of the redo disk to the third redo disk and linking the third redo disk to the base virtual disk. 45. A system comprising:
a memory area comprising a library of a plurality of template virtual machines (VM); and a processor programmed to:
determine that a VM satisfies a set of requirements, the VM being linked to a base virtual disk;
based on the determining, identify the VM as a template VM;
capture the template VM into the library;
receive a request to clone the template VM to produce a second VM;
create a redo disk for the second VM without copying contents of the base virtual disk to the redo disk; and
link the redo disk to the base virtual disk. 46. The system of claim 45, wherein identifying the VM as a template VM further comprises capturing the VM into a library of VMs. 47. The system of claim 46, wherein the processor is further programmed to:
receive a request to revert the VM to a state of the template VM captured in the library of VMs: create a second redo disk for the template VM without copying contents of the base virtual disk to the second redo disk; and link the second redo disk to the base virtual disk. 48. The system of claim 45, wherein the set of requirements include the VM reaching a desired state. 49. The system of claim 48, wherein the desired state is associated with an environment for application installation. 50. The system of claim 15, wherein the processor is further programmed to:
receive a request to clone the second VM to produce a third VM; determine whether the redo disk exceeds a threshold size; and responsive to determining that the redo disk exceeds the threshold size, creating a third redo disk for the third VM and linking the third redo disk to the redo disk; or responsive to determining that the redo disk does not exceed the threshold size, creating a third redo disk for the third VM by copying contents of the redo disk to the third redo disk and linking the third redo disk to the base virtual disk. | 2,100 |
4,504 | 12,418,336 | 2,125 | A system for dynamically generating a timeout value based on a customer runtime environment for use with a manufacturer update package. More specifically, the system for dynamically generating a timeout value decomposes calculation of a timeout value based upon the major steps contained within the update service and dynamically calculates the timeout value based upon processor load. In certain embodiments the system uses a heuristic algorithm to perform the calculation. | 1. A method for dynamically generating a timeout value based on a customer runtime environment for use with a manufacturer update package comprising:
decomposing calculation of a timeout value based upon a plurality of major steps contained within an update service; and, dynamically calculating the timeout value based upon processor load. 2. The method of claim 1 further comprising:
using a heuristic algorithm to perform the dynamically calculating. 3. The method of claim 1 wherein:
the major steps comprise an inventory collection step, a payload comparison step and an update execution step. These steps are generally performed in order and are not performed in parallel. 4. The method of claim 3 wherein:
the major steps are performed in order and are not performed in parallel. 5. The method of claim 1 wherein:
the dynamically calculating further comprises calculating a first function value, a second function value, a third function value and a time value, the time value being based upon the first function value, the second function value and the third function value. 6. The method of claim 5 wherein:
the first function value is based upon inventory collection information, the second function value is based upon payload comparison information and the third function value is based upon update execution information. 7. An apparatus for dynamically generating a timeout value based on a customer runtime environment for use with a manufacturer update package comprising:
means for decomposing calculation of a timeout value based upon a plurality of major steps contained within an update service; and, means for dynamically calculating the timeout value based upon processor load. 8. The apparatus of claim 7 further comprising:
means for using a heuristic algorithm to perform the dynamically calculating. 9. The apparatus of claim 7 wherein:
the major steps comprise an inventory collection step, a payload comparison step and an update execution step. These steps are generally performed in order and are not performed in parallel. 10. The apparatus of claim 9 wherein:
the major steps are performed in order and are not performed in parallel. 11. The apparatus of claim 7 wherein:
the dynamically calculating further comprises calculating a first function value, a second function value, a third function value and a time value, the time value being based upon the first function value, the second function value and the third function value. 12. The apparatus of claim 11 wherein:
the first function value is based upon inventory collection information, the second function value is based upon payload comparison information and the third function value is based upon update execution information. 13. An information handling system comprising:
a processor; memory coupled to the processor, the memory storing a system for dynamically generating a timeout value based on a customer runtime environment for use with a manufacturer update package, the system comprising instructions executable by the processor for:
decomposing calculation of a timeout value based upon a plurality of major steps contained within an update service; and,
dynamically calculating the timeout value based upon processor load. 14. The information handling system of claim 7 wherein the instructions further comprise instructions for:
using a heuristic algorithm to perform the dynamically calculating. 15. The information handling system of claim 7 wherein:
the major steps comprise an inventory collection step, a payload comparison step and an update execution step. These steps are generally performed in order and are not performed in parallel. 16. The information handling system of claim 15 wherein:
the major steps are performed in order and are not performed in parallel. 17. The information handling system of claim 13 wherein:
the dynamically calculating further comprises calculating a first function value, a second function value, a third function value and a time value, the time value being based upon the first function value, the second function value and the third function value. 18. The information handling system of claim 17 wherein:
the first function value is based upon inventory collection information, the second function value is based upon payload comparison information and the third function value is based upon update execution information. | A system for dynamically generating a timeout value based on a customer runtime environment for use with a manufacturer update package. More specifically, the system for dynamically generating a timeout value decomposes calculation of a timeout value based upon the major steps contained within the update service and dynamically calculates the timeout value based upon processor load. In certain embodiments the system uses a heuristic algorithm to perform the calculation.1. A method for dynamically generating a timeout value based on a customer runtime environment for use with a manufacturer update package comprising:
decomposing calculation of a timeout value based upon a plurality of major steps contained within an update service; and, dynamically calculating the timeout value based upon processor load. 2. The method of claim 1 further comprising:
using a heuristic algorithm to perform the dynamically calculating. 3. The method of claim 1 wherein:
the major steps comprise an inventory collection step, a payload comparison step and an update execution step. These steps are generally performed in order and are not performed in parallel. 4. The method of claim 3 wherein:
the major steps are performed in order and are not performed in parallel. 5. The method of claim 1 wherein:
the dynamically calculating further comprises calculating a first function value, a second function value, a third function value and a time value, the time value being based upon the first function value, the second function value and the third function value. 6. The method of claim 5 wherein:
the first function value is based upon inventory collection information, the second function value is based upon payload comparison information and the third function value is based upon update execution information. 7. An apparatus for dynamically generating a timeout value based on a customer runtime environment for use with a manufacturer update package comprising:
means for decomposing calculation of a timeout value based upon a plurality of major steps contained within an update service; and, means for dynamically calculating the timeout value based upon processor load. 8. The apparatus of claim 7 further comprising:
means for using a heuristic algorithm to perform the dynamically calculating. 9. The apparatus of claim 7 wherein:
the major steps comprise an inventory collection step, a payload comparison step and an update execution step. These steps are generally performed in order and are not performed in parallel. 10. The apparatus of claim 9 wherein:
the major steps are performed in order and are not performed in parallel. 11. The apparatus of claim 7 wherein:
the dynamically calculating further comprises calculating a first function value, a second function value, a third function value and a time value, the time value being based upon the first function value, the second function value and the third function value. 12. The apparatus of claim 11 wherein:
the first function value is based upon inventory collection information, the second function value is based upon payload comparison information and the third function value is based upon update execution information. 13. An information handling system comprising:
a processor; memory coupled to the processor, the memory storing a system for dynamically generating a timeout value based on a customer runtime environment for use with a manufacturer update package, the system comprising instructions executable by the processor for:
decomposing calculation of a timeout value based upon a plurality of major steps contained within an update service; and,
dynamically calculating the timeout value based upon processor load. 14. The information handling system of claim 7 wherein the instructions further comprise instructions for:
using a heuristic algorithm to perform the dynamically calculating. 15. The information handling system of claim 7 wherein:
the major steps comprise an inventory collection step, a payload comparison step and an update execution step. These steps are generally performed in order and are not performed in parallel. 16. The information handling system of claim 15 wherein:
the major steps are performed in order and are not performed in parallel. 17. The information handling system of claim 13 wherein:
the dynamically calculating further comprises calculating a first function value, a second function value, a third function value and a time value, the time value being based upon the first function value, the second function value and the third function value. 18. The information handling system of claim 17 wherein:
the first function value is based upon inventory collection information, the second function value is based upon payload comparison information and the third function value is based upon update execution information. | 2,100 |
4,505 | 13,355,925 | 2,143 | A plurality of icons are displayed on a companion device having a touch screen interface; the icons can be manipulated by the touch screen interface, and each of the plurality of icons represents a different one of a plurality of audiovisual assets which can be viewed on an external audiovisual device. An input gesture on the touch screen interface is obtained from a user of the companion device, wherein a given one of the icons is flicked in a manner associated with the external audiovisual device. Responsive to the obtaining of the gesture, a signal is dispatched from the companion device. The signal causes the external audiovisual device to access a given one of the plurality of audiovisual assets associated with the given one of the icons. Techniques for other than touch screen devices, and techniques to obtain programs on the companion device, are also provided. | 1. A method comprising the steps of:
displaying, on a companion device having a touch screen interface, a plurality of icons, which can be manipulated by said touch screen interface, each of said plurality of icons representing a different one of a plurality of audiovisual assets which can be viewed on an external audiovisual device; obtaining, from a user of said companion device, an input gesture on said touch screen interface, wherein a given one of said icons is flicked in a manner associated with said external audiovisual device; and responsive to said obtaining of said gesture, dispatching a signal from said companion device, said signal causing said external audiovisual device to access a given one of said plurality of audiovisual assets associated with said given one of said icons. 2. The method of claim 1, further comprising downloading an application onto said companion device, wherein said displaying, obtaining, and dispatching step are carried out, at least in part, by executing said application on said companion device. 3. The method of claim 2, wherein said downloading comprises downloading from an on-line application store maintained by a manufacturer of said companion device, and wherein said application comprises a native application. 4. The method of claim 2, wherein:
said external audiovisual device accesses said given one of said plurality of audiovisual assets associated with said given one of said icons over a hybrid fiber coaxial network via a radio frequency quadrature amplitude modulation scheme; said user of said companion device has a data subscription over said hybrid fiber coaxial network; and said downloading comprises downloading from a web application server via said data subscription of said user, said application comprising a web application. 5. The method of claim 1, further comprising:
obtaining, from said user of said companion device, an indication, on said touch screen interface, that said user wishes to focus on said given one of said icons; and responsive to said indication that said user wishes to focus on said given one of said icons, displaying on said companion device a screen with additional details regarding said given one of said plurality of audiovisual assets associated with said given one of said icons; wherein said input gesture is obtained from said screen with said additional details. 6. The method of claim 1, wherein said input gesture is obtained from a screen showing said plurality of icons. 7. The method of claim 1, further comprising obtaining, at said companion device, from a network address resolver at a remote location, a network address of said external audiovisual device. 8. The method of claim 7, wherein said dispatching of said signal from said companion device comprises dispatching from said companion device to said external audiovisual device over a premises network. 9. The method of claim 1, wherein said plurality of icons comprises a first plurality of icons and said external audiovisual device is one of a plurality of external audiovisual devices, further comprising:
displaying, on said companion device, a second plurality of icons, each of said second plurality of icons representing a different one of said plurality of external audiovisual devices with which said companion device can be associated; and obtaining, at said companion device, a selection from said user, said selection specifying a given one of said plurality of external audiovisual devices to be currently associated with said companion device; wherein said signal is dispatched to said given one of said plurality of external audiovisual devices selected to be currently associated with said companion device. 10. The method of claim 9, wherein in said displaying step, said external audiovisual devices are collocated with said companion device. 11. A method comprising the steps of:
displaying, on a companion device, a plurality of icons, each of said plurality of icons representing a different one of a plurality of audiovisual assets which can be viewed on an external audiovisual device; obtaining, at said companion device, from a network address resolver at a remote location, a network address of said external audiovisual device; obtaining, from a user of said companion device, a selection of a given one of said icons; and responsive to said selection, dispatching a signal from said companion device, to said network address of said external audiovisual device, to cause said external audiovisual device to access a given one of said plurality of audiovisual assets associated with said given one of said icons. 12. The method of claim 11, wherein in said displaying step, said external audiovisual device is collocated with said companion device and wherein, in said dispatching step, said signal is dispatched over a premises network. 13. The method of claim 12, further comprising downloading an application onto said companion device, wherein said displaying step, said obtaining steps, and said dispatching step are carried out, at least in part, by executing said application on said companion device. 14. The method of claim 13, wherein said downloading comprises downloading from an on-line application store maintained by a manufacturer of said companion device, and wherein said application comprises a native application. 15. The method of claim 13, wherein:
said external audiovisual device accesses said given one of said plurality of audiovisual assets associated with said given one of said icons over a hybrid fiber coaxial network via a radio frequency quadrature amplitude modulation scheme; said user of said companion device has a data subscription over said hybrid fiber coaxial network; and said downloading comprises downloading from a web application server via said data subscription of said user, said application comprising a web application. 16. The method of claim 12, further comprising:
obtaining, at said companion device, from a network address resolver at a remote location, a network address of said external audiovisual device; wherein: said dispatching of said signal from said companion device comprises dispatching from said companion device to said external audiovisual device over said premises network. 17. The method of claim 12, wherein said plurality of icons comprises a first plurality of icons and said external audiovisual device is one of a plurality of external audiovisual devices, further comprising:
displaying, on said companion device, a second plurality of icons, each of said second plurality of icons representing a different one of said plurality of external audiovisual devices with which said companion device can be associated, said external audiovisual devices being collocated with said companion device; and obtaining, at said companion device, a selection from said user, said selection specifying a given one of said plurality of external audiovisual devices to be currently associated with said companion device; wherein said signal is dispatched to said given one of said plurality of external audiovisual devices selected to be currently associated with said companion device. 18. A method comprising the steps of:
displaying, on a companion device, a plurality of icons, each of said plurality of icons representing a different one of a plurality of external audiovisual devices with which said companion device can be associated; obtaining, at said companion device, a selection from a user thereof, said selection specifying a given one of said plurality of external audiovisual devices to be currently associated with said companion device; displaying, on said companion device, data about a program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device; obtaining, at said companion device, an indication from a user thereof, that said user desires to watch, on said companion device, said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device; and responsive to said indication, playing, on said companion device, said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device. 19. The method of claim 18, wherein, in said step of displaying said plurality of icons, said external audiovisual devices are collocated with said companion device. 20. The method of claim 19, further comprising:
obtaining, at said companion device, from a network address resolver at a remote location, a network address of at least said given one of said external audiovisual devices that is currently associated with said companion device; wherein said displaying, on said companion device, of said data about said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device, comprises:
said companion device communicating with a web service on at least said given one of said external audiovisual devices that is currently associated with said companion device to determine an identity of said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device; and
said companion device communicating with a remote metadata service to obtain enhanced data about said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device, said enhanced data not being available on said given one of said external audiovisual devices that is currently associated with said companion device; and
wherein said playing, on said companion device, of said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device comprises said companion device requesting, via a data connection to an external content data network, streaming of said program currently playing on said given one of said external audiovisual devices in a form for display on said companion device. 21. The method of claim 19, further comprising downloading an application onto said companion device, wherein said displaying steps and said obtaining steps are carried out, at least in part, by executing said application on said companion device. 22. The method of claim 21, wherein said downloading comprises downloading from an on-line application store maintained by a manufacturer of said companion device. 23. The method of claim 21, wherein:
said external audiovisual device accesses said given one of said plurality of audiovisual assets associated with said given one of said icons over a hybrid fiber coaxial network via a radio frequency quadrature amplitude modulation scheme; said user of said companion device has a data subscription over said hybrid fiber coaxial network; and said downloading comprises downloading from a web application server via said data subscription of said user. 24. An article of manufacture comprising a computer program product, said computer program product comprising:
a tangible computer-readable recordable storage medium, storing in a non-transitory manner computer readable program code, the computer readable program code comprising: computer readable program code configured to display, on a companion device having a touch screen interface, a plurality of icons, which can be manipulated by said touch screen interface, each of said plurality of icons representing a different one of a plurality of audiovisual assets which can be viewed on an external audiovisual device; computer readable program code configured to obtain, from a user of said companion device, an input gesture on said touch screen interface, wherein a given one of said icons is flicked in a manner associated with said external audiovisual device; and computer readable program code configured to, responsive to said obtaining of said gesture, dispatch a signal from said companion device, said signal causing said external audiovisual device to access a given one of said plurality of audiovisual assets associated with said given one of said icons. 25. An article of manufacture comprising a computer program product, said computer program product comprising:
a tangible computer-readable recordable storage medium, storing in a non-transitory manner computer readable program code, the computer readable program code comprising: computer readable program code configured to display, on a companion device, a plurality of icons, each of said plurality of icons representing a different one of a plurality of audiovisual assets which can be viewed on an external audiovisual device; computer readable program code configured to obtain, at said companion device, from a network address resolver at a remote location, a network address of said external audiovisual device; computer readable program code configured to obtain, from a user of said companion device, a selection of a given one of said icons; and computer readable program code configured to, responsive to said selection, dispatch a signal from said companion device, to said network address of said external audiovisual device, to cause said external audiovisual device to access a given one of said plurality of audiovisual assets associated with said given one of said icons. 26. An article of manufacture comprising a computer program product, said computer program product comprising:
a tangible computer-readable recordable storage medium, storing in a non-transitory manner computer readable program code, the computer readable program code comprising: computer readable program code configured to display, on a companion device, a plurality of icons, each of said plurality of icons representing a different one of a plurality of external audiovisual devices with which said companion device can be associated; computer readable program code configured to obtain, at said companion device, a selection from a user thereof, said selection specifying a given one of said plurality of external audiovisual devices to be currently associated with said companion device; computer readable program code configured to display, on said companion device, data about a program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device; computer readable program code configured to obtain, at said companion device, an indication from a user thereof, that said user desires to watch, on said companion device, said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device; and computer readable program code configured to, responsive to said indication, play, on said companion device, said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device. 27. A method comprising the steps of:
providing, to a companion device, from a web service executing on an external audiovisual device, an identity of a program currently playing on said external audiovisual device; obtaining, from said companion device, at said external audiovisual device, an indication that said program currently playing on said external audiovisual device is to be streamed to said companion device; and responsive to said indication, streaming said program currently playing on said external audiovisual device to said companion device. | A plurality of icons are displayed on a companion device having a touch screen interface; the icons can be manipulated by the touch screen interface, and each of the plurality of icons represents a different one of a plurality of audiovisual assets which can be viewed on an external audiovisual device. An input gesture on the touch screen interface is obtained from a user of the companion device, wherein a given one of the icons is flicked in a manner associated with the external audiovisual device. Responsive to the obtaining of the gesture, a signal is dispatched from the companion device. The signal causes the external audiovisual device to access a given one of the plurality of audiovisual assets associated with the given one of the icons. Techniques for other than touch screen devices, and techniques to obtain programs on the companion device, are also provided.1. A method comprising the steps of:
displaying, on a companion device having a touch screen interface, a plurality of icons, which can be manipulated by said touch screen interface, each of said plurality of icons representing a different one of a plurality of audiovisual assets which can be viewed on an external audiovisual device; obtaining, from a user of said companion device, an input gesture on said touch screen interface, wherein a given one of said icons is flicked in a manner associated with said external audiovisual device; and responsive to said obtaining of said gesture, dispatching a signal from said companion device, said signal causing said external audiovisual device to access a given one of said plurality of audiovisual assets associated with said given one of said icons. 2. The method of claim 1, further comprising downloading an application onto said companion device, wherein said displaying, obtaining, and dispatching step are carried out, at least in part, by executing said application on said companion device. 3. The method of claim 2, wherein said downloading comprises downloading from an on-line application store maintained by a manufacturer of said companion device, and wherein said application comprises a native application. 4. The method of claim 2, wherein:
said external audiovisual device accesses said given one of said plurality of audiovisual assets associated with said given one of said icons over a hybrid fiber coaxial network via a radio frequency quadrature amplitude modulation scheme; said user of said companion device has a data subscription over said hybrid fiber coaxial network; and said downloading comprises downloading from a web application server via said data subscription of said user, said application comprising a web application. 5. The method of claim 1, further comprising:
obtaining, from said user of said companion device, an indication, on said touch screen interface, that said user wishes to focus on said given one of said icons; and responsive to said indication that said user wishes to focus on said given one of said icons, displaying on said companion device a screen with additional details regarding said given one of said plurality of audiovisual assets associated with said given one of said icons; wherein said input gesture is obtained from said screen with said additional details. 6. The method of claim 1, wherein said input gesture is obtained from a screen showing said plurality of icons. 7. The method of claim 1, further comprising obtaining, at said companion device, from a network address resolver at a remote location, a network address of said external audiovisual device. 8. The method of claim 7, wherein said dispatching of said signal from said companion device comprises dispatching from said companion device to said external audiovisual device over a premises network. 9. The method of claim 1, wherein said plurality of icons comprises a first plurality of icons and said external audiovisual device is one of a plurality of external audiovisual devices, further comprising:
displaying, on said companion device, a second plurality of icons, each of said second plurality of icons representing a different one of said plurality of external audiovisual devices with which said companion device can be associated; and obtaining, at said companion device, a selection from said user, said selection specifying a given one of said plurality of external audiovisual devices to be currently associated with said companion device; wherein said signal is dispatched to said given one of said plurality of external audiovisual devices selected to be currently associated with said companion device. 10. The method of claim 9, wherein in said displaying step, said external audiovisual devices are collocated with said companion device. 11. A method comprising the steps of:
displaying, on a companion device, a plurality of icons, each of said plurality of icons representing a different one of a plurality of audiovisual assets which can be viewed on an external audiovisual device; obtaining, at said companion device, from a network address resolver at a remote location, a network address of said external audiovisual device; obtaining, from a user of said companion device, a selection of a given one of said icons; and responsive to said selection, dispatching a signal from said companion device, to said network address of said external audiovisual device, to cause said external audiovisual device to access a given one of said plurality of audiovisual assets associated with said given one of said icons. 12. The method of claim 11, wherein in said displaying step, said external audiovisual device is collocated with said companion device and wherein, in said dispatching step, said signal is dispatched over a premises network. 13. The method of claim 12, further comprising downloading an application onto said companion device, wherein said displaying step, said obtaining steps, and said dispatching step are carried out, at least in part, by executing said application on said companion device. 14. The method of claim 13, wherein said downloading comprises downloading from an on-line application store maintained by a manufacturer of said companion device, and wherein said application comprises a native application. 15. The method of claim 13, wherein:
said external audiovisual device accesses said given one of said plurality of audiovisual assets associated with said given one of said icons over a hybrid fiber coaxial network via a radio frequency quadrature amplitude modulation scheme; said user of said companion device has a data subscription over said hybrid fiber coaxial network; and said downloading comprises downloading from a web application server via said data subscription of said user, said application comprising a web application. 16. The method of claim 12, further comprising:
obtaining, at said companion device, from a network address resolver at a remote location, a network address of said external audiovisual device; wherein: said dispatching of said signal from said companion device comprises dispatching from said companion device to said external audiovisual device over said premises network. 17. The method of claim 12, wherein said plurality of icons comprises a first plurality of icons and said external audiovisual device is one of a plurality of external audiovisual devices, further comprising:
displaying, on said companion device, a second plurality of icons, each of said second plurality of icons representing a different one of said plurality of external audiovisual devices with which said companion device can be associated, said external audiovisual devices being collocated with said companion device; and obtaining, at said companion device, a selection from said user, said selection specifying a given one of said plurality of external audiovisual devices to be currently associated with said companion device; wherein said signal is dispatched to said given one of said plurality of external audiovisual devices selected to be currently associated with said companion device. 18. A method comprising the steps of:
displaying, on a companion device, a plurality of icons, each of said plurality of icons representing a different one of a plurality of external audiovisual devices with which said companion device can be associated; obtaining, at said companion device, a selection from a user thereof, said selection specifying a given one of said plurality of external audiovisual devices to be currently associated with said companion device; displaying, on said companion device, data about a program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device; obtaining, at said companion device, an indication from a user thereof, that said user desires to watch, on said companion device, said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device; and responsive to said indication, playing, on said companion device, said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device. 19. The method of claim 18, wherein, in said step of displaying said plurality of icons, said external audiovisual devices are collocated with said companion device. 20. The method of claim 19, further comprising:
obtaining, at said companion device, from a network address resolver at a remote location, a network address of at least said given one of said external audiovisual devices that is currently associated with said companion device; wherein said displaying, on said companion device, of said data about said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device, comprises:
said companion device communicating with a web service on at least said given one of said external audiovisual devices that is currently associated with said companion device to determine an identity of said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device; and
said companion device communicating with a remote metadata service to obtain enhanced data about said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device, said enhanced data not being available on said given one of said external audiovisual devices that is currently associated with said companion device; and
wherein said playing, on said companion device, of said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device comprises said companion device requesting, via a data connection to an external content data network, streaming of said program currently playing on said given one of said external audiovisual devices in a form for display on said companion device. 21. The method of claim 19, further comprising downloading an application onto said companion device, wherein said displaying steps and said obtaining steps are carried out, at least in part, by executing said application on said companion device. 22. The method of claim 21, wherein said downloading comprises downloading from an on-line application store maintained by a manufacturer of said companion device. 23. The method of claim 21, wherein:
said external audiovisual device accesses said given one of said plurality of audiovisual assets associated with said given one of said icons over a hybrid fiber coaxial network via a radio frequency quadrature amplitude modulation scheme; said user of said companion device has a data subscription over said hybrid fiber coaxial network; and said downloading comprises downloading from a web application server via said data subscription of said user. 24. An article of manufacture comprising a computer program product, said computer program product comprising:
a tangible computer-readable recordable storage medium, storing in a non-transitory manner computer readable program code, the computer readable program code comprising: computer readable program code configured to display, on a companion device having a touch screen interface, a plurality of icons, which can be manipulated by said touch screen interface, each of said plurality of icons representing a different one of a plurality of audiovisual assets which can be viewed on an external audiovisual device; computer readable program code configured to obtain, from a user of said companion device, an input gesture on said touch screen interface, wherein a given one of said icons is flicked in a manner associated with said external audiovisual device; and computer readable program code configured to, responsive to said obtaining of said gesture, dispatch a signal from said companion device, said signal causing said external audiovisual device to access a given one of said plurality of audiovisual assets associated with said given one of said icons. 25. An article of manufacture comprising a computer program product, said computer program product comprising:
a tangible computer-readable recordable storage medium, storing in a non-transitory manner computer readable program code, the computer readable program code comprising: computer readable program code configured to display, on a companion device, a plurality of icons, each of said plurality of icons representing a different one of a plurality of audiovisual assets which can be viewed on an external audiovisual device; computer readable program code configured to obtain, at said companion device, from a network address resolver at a remote location, a network address of said external audiovisual device; computer readable program code configured to obtain, from a user of said companion device, a selection of a given one of said icons; and computer readable program code configured to, responsive to said selection, dispatch a signal from said companion device, to said network address of said external audiovisual device, to cause said external audiovisual device to access a given one of said plurality of audiovisual assets associated with said given one of said icons. 26. An article of manufacture comprising a computer program product, said computer program product comprising:
a tangible computer-readable recordable storage medium, storing in a non-transitory manner computer readable program code, the computer readable program code comprising: computer readable program code configured to display, on a companion device, a plurality of icons, each of said plurality of icons representing a different one of a plurality of external audiovisual devices with which said companion device can be associated; computer readable program code configured to obtain, at said companion device, a selection from a user thereof, said selection specifying a given one of said plurality of external audiovisual devices to be currently associated with said companion device; computer readable program code configured to display, on said companion device, data about a program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device; computer readable program code configured to obtain, at said companion device, an indication from a user thereof, that said user desires to watch, on said companion device, said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device; and computer readable program code configured to, responsive to said indication, play, on said companion device, said program currently playing on said given one of said external audiovisual devices that is currently associated with said companion device. 27. A method comprising the steps of:
providing, to a companion device, from a web service executing on an external audiovisual device, an identity of a program currently playing on said external audiovisual device; obtaining, from said companion device, at said external audiovisual device, an indication that said program currently playing on said external audiovisual device is to be streamed to said companion device; and responsive to said indication, streaming said program currently playing on said external audiovisual device to said companion device. | 2,100 |
4,506 | 14,015,940 | 2,196 | In one embodiment, an apparatus includes a wearable computing device including one or more processors and a memory. The memory is coupled to the processors and includes instructions executable by the processors. When executing the instructions, the processors analyze a task of an application; analyze one or more characteristics of the wearable computing device; determine to delegate the task based on the analysis of the task and the analysis of the characteristics; delegate the task to be processed by one or more computing devices separate from the wearable computing device; and receive from the computing devices results from processing the delegated task. | 1. An apparatus comprising:
a wearable computing device comprising one or more processors and a memory; wherein the memory is coupled to the processors and comprises instructions executable by the processors, the processors being operable when executing the instructions to:
analyze a task of an application;
analyze one or more characteristics of the wearable computing device;
determine to delegate the task based on the analysis of the task and the analysis of the characteristics;
delegate the task to be processed by one or more computing devices separate from the wearable computing device; and
receive from the computing devices results from processing the delegated task. 2. The apparatus of claim 1, wherein the wearable computing device comprises:
a device body comprising:
one or more of the processors;
the memory;
a display;
a rotatable element about the display; and
a detector configured to detect rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 3. The apparatus of claim 1, wherein the application is running on the wearable computing device. 4. The apparatus of claim 1, the processors being further operable when executing the instructions to:
receive input from a user of the wearable computing device to interact with another application; and automatically delegate the task to be processed by the computing devices. 5. The apparatus of claim 1, wherein the computing devices comprise:
a local computing device paired with the wearable computing device; and one or more remote computing devices available to the wearable computing device via a network-based service. 6. The apparatus of claim 5, wherein the local computing device is paired with the wearable computing device using one or more of the following:
a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 7. The apparatus of claim 1, wherein the analysis of the task comprises analyzing one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 8. The apparatus of claim 1, wherein the characteristics of the wearable computing device comprise one or more of the following:
available memory; CPU capacity; available energy; network connectivity; availability of network-based services; behavior of one or more users; or predicted processing time of the task. 9. The apparatus of claim 1, the processors being further operable when executing the instructions to:
determine not to delegate the task when: the wearable computing device does not have network connectivity; or no computing devices are in a pairable range of the wearable computing device. 10. A method comprising:
analyzing a task of an application; analyzing one or more characteristics of a wearable computing device; by the wearable computing device, determining to delegate the task based on the analysis of the task and the analysis of the characteristics; delegating the task to be processed by one or more computing devices separate from the wearable computing device; and receiving from the computing devices results from processing the delegated task. 11. The method of claim 10, wherein the wearable computing device comprises:
a device body comprising:
one or more processors;
a memory;
a display;
a rotatable element about the display; and
a detector configured to detect rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 12. The method of claim 10, wherein the application is running on the wearable computing device. 13. The method of claim 10, further comprising:
receiving input from a user of the wearable computing device to interact with another application; and automatically delegating the task to be processed by the computing devices. 14. The method of claim 10, wherein the computing devices comprise:
a local computing device paired with the wearable computing device; and one or more remote computing devices available to the wearable computing device via a network-based service. 15. The method of claim 14, wherein the local computing device is paired with the wearable computing device using one or more of the following:
a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 16. The method of claim 10, wherein the analysis of the task comprises analyzing one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 17. The method of claim 10, wherein the characteristics of the wearable computing device comprise one or more of the following:
available memory; CPU capacity; available energy; network connectivity; availability of network-based services; behavior of one or more users; or predicted processing time of the task. 18. The method of claim 10, further comprising:
by the wearable computing device, determining not to delegate the task when: the wearable computing device does not have network connectivity; or no other computing devices are in a pairable range of the wearable computing device. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
analyze a task of an application; analyze one or more characteristics of a wearable computing device; determine to delegate the task based on the analysis of the task and the analysis of the characteristics; delegate the task to be processed by one or more computing devices separate from the wearable computing device; and receive from the computing devices results from processing the delegated task. 20. The media of claim 19, wherein the wearable computing device comprises:
a device body comprising:
one or more processors;
a memory;
a display;
a rotatable element about the display; and
a detector configured to detect rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 21. The media of claim 19, wherein the application is running on the wearable computing device. 22. The media of claim 19, the software being further operable when executed to:
receive input from a user of the wearable computing device to interact with another application; and automatically delegate the task to be processed by the computing devices. 23. The media of claim 19, wherein the computing devices comprise:
a local computing device paired with the wearable computing device; and one or more remote computing devices available to the wearable computing device via a network-based service. 24. The media of claim 23, wherein the local computing device is paired with the wearable computing device using one or more of the following:
a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 25. The media of claim 19, wherein the analysis of the task comprises analyzing one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 26. The media of claim 19 wherein the characteristics of the wearable computing device comprise one or more of the following:
available memory;
CPU capacity;
available energy;
network connectivity;
availability of network-based services;
behavior of one or more users; or
predicted processing time of the task. 27. The media of claim 19 the software being further operable when executed to:
determine not to delegate the task when:
the wearable computing device does not have network connectivity; or
no other computing devices are in a pairable range of the wearable computing device. | In one embodiment, an apparatus includes a wearable computing device including one or more processors and a memory. The memory is coupled to the processors and includes instructions executable by the processors. When executing the instructions, the processors analyze a task of an application; analyze one or more characteristics of the wearable computing device; determine to delegate the task based on the analysis of the task and the analysis of the characteristics; delegate the task to be processed by one or more computing devices separate from the wearable computing device; and receive from the computing devices results from processing the delegated task.1. An apparatus comprising:
a wearable computing device comprising one or more processors and a memory; wherein the memory is coupled to the processors and comprises instructions executable by the processors, the processors being operable when executing the instructions to:
analyze a task of an application;
analyze one or more characteristics of the wearable computing device;
determine to delegate the task based on the analysis of the task and the analysis of the characteristics;
delegate the task to be processed by one or more computing devices separate from the wearable computing device; and
receive from the computing devices results from processing the delegated task. 2. The apparatus of claim 1, wherein the wearable computing device comprises:
a device body comprising:
one or more of the processors;
the memory;
a display;
a rotatable element about the display; and
a detector configured to detect rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 3. The apparatus of claim 1, wherein the application is running on the wearable computing device. 4. The apparatus of claim 1, the processors being further operable when executing the instructions to:
receive input from a user of the wearable computing device to interact with another application; and automatically delegate the task to be processed by the computing devices. 5. The apparatus of claim 1, wherein the computing devices comprise:
a local computing device paired with the wearable computing device; and one or more remote computing devices available to the wearable computing device via a network-based service. 6. The apparatus of claim 5, wherein the local computing device is paired with the wearable computing device using one or more of the following:
a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 7. The apparatus of claim 1, wherein the analysis of the task comprises analyzing one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 8. The apparatus of claim 1, wherein the characteristics of the wearable computing device comprise one or more of the following:
available memory; CPU capacity; available energy; network connectivity; availability of network-based services; behavior of one or more users; or predicted processing time of the task. 9. The apparatus of claim 1, the processors being further operable when executing the instructions to:
determine not to delegate the task when: the wearable computing device does not have network connectivity; or no computing devices are in a pairable range of the wearable computing device. 10. A method comprising:
analyzing a task of an application; analyzing one or more characteristics of a wearable computing device; by the wearable computing device, determining to delegate the task based on the analysis of the task and the analysis of the characteristics; delegating the task to be processed by one or more computing devices separate from the wearable computing device; and receiving from the computing devices results from processing the delegated task. 11. The method of claim 10, wherein the wearable computing device comprises:
a device body comprising:
one or more processors;
a memory;
a display;
a rotatable element about the display; and
a detector configured to detect rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 12. The method of claim 10, wherein the application is running on the wearable computing device. 13. The method of claim 10, further comprising:
receiving input from a user of the wearable computing device to interact with another application; and automatically delegating the task to be processed by the computing devices. 14. The method of claim 10, wherein the computing devices comprise:
a local computing device paired with the wearable computing device; and one or more remote computing devices available to the wearable computing device via a network-based service. 15. The method of claim 14, wherein the local computing device is paired with the wearable computing device using one or more of the following:
a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 16. The method of claim 10, wherein the analysis of the task comprises analyzing one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 17. The method of claim 10, wherein the characteristics of the wearable computing device comprise one or more of the following:
available memory; CPU capacity; available energy; network connectivity; availability of network-based services; behavior of one or more users; or predicted processing time of the task. 18. The method of claim 10, further comprising:
by the wearable computing device, determining not to delegate the task when: the wearable computing device does not have network connectivity; or no other computing devices are in a pairable range of the wearable computing device. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
analyze a task of an application; analyze one or more characteristics of a wearable computing device; determine to delegate the task based on the analysis of the task and the analysis of the characteristics; delegate the task to be processed by one or more computing devices separate from the wearable computing device; and receive from the computing devices results from processing the delegated task. 20. The media of claim 19, wherein the wearable computing device comprises:
a device body comprising:
one or more processors;
a memory;
a display;
a rotatable element about the display; and
a detector configured to detect rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 21. The media of claim 19, wherein the application is running on the wearable computing device. 22. The media of claim 19, the software being further operable when executed to:
receive input from a user of the wearable computing device to interact with another application; and automatically delegate the task to be processed by the computing devices. 23. The media of claim 19, wherein the computing devices comprise:
a local computing device paired with the wearable computing device; and one or more remote computing devices available to the wearable computing device via a network-based service. 24. The media of claim 23, wherein the local computing device is paired with the wearable computing device using one or more of the following:
a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 25. The media of claim 19, wherein the analysis of the task comprises analyzing one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 26. The media of claim 19 wherein the characteristics of the wearable computing device comprise one or more of the following:
available memory;
CPU capacity;
available energy;
network connectivity;
availability of network-based services;
behavior of one or more users; or
predicted processing time of the task. 27. The media of claim 19 the software being further operable when executed to:
determine not to delegate the task when:
the wearable computing device does not have network connectivity; or
no other computing devices are in a pairable range of the wearable computing device. | 2,100 |
4,507 | 14,058,924 | 2,175 | System and method for editing a graphical program. A graphical program is displayed on a display device. Multi-touch input is received to a multi-touch interface, where the multi-touch input specifies an edit operation in the graphical program. The edit operation is performed in the graphical program in response to the multi-touch input, and the edited graphical program is displayed on the display device. | 1. A non-transitory computer-accessible memory medium that stores program instructions executable by a processor to implement:
displaying a graphical program on a display device, wherein the graphical program comprises a plurality of interconnected nodes that visually indicate functionality of the graphical program, including a graphical case/switch node, wherein the graphical case/switch node is not expanded; receiving multi-touch input to a multi-touch interface, the multi-touch input comprising two or more touchpoints applied simultaneously to the graphical case/switch node, wherein the multi-touch input specifies expansion of the graphical case/switch node; in response to the multi-touch input, expanding the graphical case/switch node to an expanded graphical case/switch node; and displaying the graphical program on the display device after said expanding, including displaying the expanded graphical case/switch node, comprising displaying all cases of the graphical case/switch node. 2. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises a two point reverse pinching motion applied to the graphical case/switch node. 3. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises a three point reverse pinching motion applied to the graphical case/switch node. 4. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises a multi-touch swipe or reverse multi-swipe applied to the graphical case/switch node. 5. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises multi-touch tapping of two or more touchpoints on the graphical case/switch node. 6. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises multi-touch double tapping of two or more touchpoints on the graphical case/switch node. 7. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises multi-touch triple tapping of two or more touchpoints on the graphical case/switch node. 8. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises three or more touchpoints applied to the graphical case/switch node. 9. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises a two point press applied to the graphical case/switch node. 10. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises a two point press applied to the graphical case/switch node followed by a two point swipe. 11. The non-transitory computer-accessible memory medium of claim 1, wherein said displaying the graphical case/switch node comprises displaying a top case of the graphical case/switch node. 12. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input is performed in combination with a keyboard key press to form a combination multi-touch input; and
wherein the expansion of the graphical case/switch node invoked by the combination multi-touch input is different from that invoked by the multi-touch input alone. 13. The non-transitory computer-accessible memory medium of claim 1, wherein the program instructions are further executable by the processor to implement:
receiving another multi-touch input to the multi-touch interface, wherein the multi-touch input specifies collapse of the expanded graphical case/switch node; in response to the multi-touch input, collapsing the expanded graphical case/switch node back to the graphical case/switch node that is not expanded; and displaying the graphical program on the display device after said collapsing, including displaying the graphical case/switch node. 14. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises a multi-touch swipe or multi-touch reverse swipe applied to the expanded graphical case/switch node. 15. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises multi-touch tapping of two or more touchpoints on the expanded graphical case/switch node. 16. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises multi-touch double tapping of two or more touchpoints on the expanded graphical case/switch node. 17. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises multi-touch triple tapping of two or more touchpoints on the expanded graphical case/switch node. 18. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises three or more touchpoints applied to the expanded graphical case/switch node. 19. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises a two point press applied to the expanded graphical case/switch node. 20. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises a two point press applied to the expanded graphical case/switch node followed by a multi-touch swipe or multi-touch reverse swipe. 21. The non-transitory computer-accessible memory medium of claim 13, wherein the graphical program comprises a graphical data flow program, wherein during execution of the graphical data flow program the nodes execute whenever their necessary input data are available. 22. A computer-implemented method for creating a graphical program, the method comprising:
utilizing a computer to perform:
displaying a graphical program on a display device, wherein the graphical program comprises a plurality of interconnected nodes that visually indicate functionality of the graphical program, including a graphical case/switch node, wherein the graphical case/switch node is not expanded;
receiving multi-touch input to a multi-touch interface, wherein the multi-touch input specifies expansion of the graphical case/switch node;
in response to the multi-touch input, comprising expanding the graphical case/switch node to an expanded graphical case/switch node; and
displaying the graphical program on the display device after said expanding, including displaying the expanded graphical case/switch node, comprising displaying all cases of the graphical case/switch node. | System and method for editing a graphical program. A graphical program is displayed on a display device. Multi-touch input is received to a multi-touch interface, where the multi-touch input specifies an edit operation in the graphical program. The edit operation is performed in the graphical program in response to the multi-touch input, and the edited graphical program is displayed on the display device.1. A non-transitory computer-accessible memory medium that stores program instructions executable by a processor to implement:
displaying a graphical program on a display device, wherein the graphical program comprises a plurality of interconnected nodes that visually indicate functionality of the graphical program, including a graphical case/switch node, wherein the graphical case/switch node is not expanded; receiving multi-touch input to a multi-touch interface, the multi-touch input comprising two or more touchpoints applied simultaneously to the graphical case/switch node, wherein the multi-touch input specifies expansion of the graphical case/switch node; in response to the multi-touch input, expanding the graphical case/switch node to an expanded graphical case/switch node; and displaying the graphical program on the display device after said expanding, including displaying the expanded graphical case/switch node, comprising displaying all cases of the graphical case/switch node. 2. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises a two point reverse pinching motion applied to the graphical case/switch node. 3. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises a three point reverse pinching motion applied to the graphical case/switch node. 4. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises a multi-touch swipe or reverse multi-swipe applied to the graphical case/switch node. 5. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises multi-touch tapping of two or more touchpoints on the graphical case/switch node. 6. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises multi-touch double tapping of two or more touchpoints on the graphical case/switch node. 7. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises multi-touch triple tapping of two or more touchpoints on the graphical case/switch node. 8. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises three or more touchpoints applied to the graphical case/switch node. 9. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises a two point press applied to the graphical case/switch node. 10. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input comprises a two point press applied to the graphical case/switch node followed by a two point swipe. 11. The non-transitory computer-accessible memory medium of claim 1, wherein said displaying the graphical case/switch node comprises displaying a top case of the graphical case/switch node. 12. The non-transitory computer-accessible memory medium of claim 1, wherein the multi-touch input is performed in combination with a keyboard key press to form a combination multi-touch input; and
wherein the expansion of the graphical case/switch node invoked by the combination multi-touch input is different from that invoked by the multi-touch input alone. 13. The non-transitory computer-accessible memory medium of claim 1, wherein the program instructions are further executable by the processor to implement:
receiving another multi-touch input to the multi-touch interface, wherein the multi-touch input specifies collapse of the expanded graphical case/switch node; in response to the multi-touch input, collapsing the expanded graphical case/switch node back to the graphical case/switch node that is not expanded; and displaying the graphical program on the display device after said collapsing, including displaying the graphical case/switch node. 14. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises a multi-touch swipe or multi-touch reverse swipe applied to the expanded graphical case/switch node. 15. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises multi-touch tapping of two or more touchpoints on the expanded graphical case/switch node. 16. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises multi-touch double tapping of two or more touchpoints on the expanded graphical case/switch node. 17. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises multi-touch triple tapping of two or more touchpoints on the expanded graphical case/switch node. 18. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises three or more touchpoints applied to the expanded graphical case/switch node. 19. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises a two point press applied to the expanded graphical case/switch node. 20. The non-transitory computer-accessible memory medium of claim 13, wherein the other multi-touch input comprises a two point press applied to the expanded graphical case/switch node followed by a multi-touch swipe or multi-touch reverse swipe. 21. The non-transitory computer-accessible memory medium of claim 13, wherein the graphical program comprises a graphical data flow program, wherein during execution of the graphical data flow program the nodes execute whenever their necessary input data are available. 22. A computer-implemented method for creating a graphical program, the method comprising:
utilizing a computer to perform:
displaying a graphical program on a display device, wherein the graphical program comprises a plurality of interconnected nodes that visually indicate functionality of the graphical program, including a graphical case/switch node, wherein the graphical case/switch node is not expanded;
receiving multi-touch input to a multi-touch interface, wherein the multi-touch input specifies expansion of the graphical case/switch node;
in response to the multi-touch input, comprising expanding the graphical case/switch node to an expanded graphical case/switch node; and
displaying the graphical program on the display device after said expanding, including displaying the expanded graphical case/switch node, comprising displaying all cases of the graphical case/switch node. | 2,100 |
4,508 | 13,767,709 | 2,176 | In one embodiment, a method includes selecting one or more second users of a social-networking system based at least in part on activity socially relevant to a first user of the social-networking system by one or more second users. The second users are identified based at least in part on social-graph information associated with the first and second users at least in part from a social graph of the social-networking system. The method also includes selecting one or more interactive elements corresponding to one or more of the selected second users for display on a computing device of the first user; and providing for display on a user interface (UI) of the computing device of the first user one or more of the interactive elements. | 1. A method comprising:
by a computing device, selecting one or more second users of a social-networking system based at least in part on activity socially relevant to a first user of the social-networking system by one or more second users, the second users being identified based at least in part on social-graph information associated with the first and second users at least in part from a social graph of the social-networking system; by the computing device, selecting one or more interactive elements corresponding to one or more of the selected second users for display on a computing device of the first user; and by the computing device, providing for display on a user interface (UI) of the computing device of the first user one or more of the interactive elements. 2. The method of claim 1, further comprising, by the computing device, providing for display one or more notifications on the UI in response to detecting a user input selecting one or more of the interactive elements, each of the notifications comprise information associated with the socially relevant activity by one or more of the second users associated with the selected interactive elements. 3. The method of claim 2, further comprising, by the computing device, receiving data corresponding to an interaction with one or more of the notifications performed without releasing the computing device of the first user from a locked mode. 4. The method of claim 1, wherein:
the social graph comprises a plurality of nodes and edges connecting the nodes, at least one node in the graph corresponding to the first user, at least one node in the graph corresponding to each second user; the social-graph information that the second users are identified based at least in part on comprises at least one of the nodes corresponding to the first user and at least one of the nodes corresponding to each second user being connected to each other by an edge. 5. The method of claim 1, further comprising:
by the computing device, selecting one or more interactive elements corresponding to one or more applications on the computing device of the first user, the selection of one or more of the interactive elements corresponding to the applications being based at least in part on activity socially relevant to the first user by one or more of the second users; and by the computing device, providing for display on the UI one or more of the interactive elements corresponding to the applications. 6. The method of claim 5, further comprising, by the computing device, providing for display one or more visual indicators with one or more of the interactive elements, the visual indicators being indicative of activity associated with one or more of the interactive elements that is socially relevant to the first user. 7. The method of claim 6, further comprising, by the computing device, dynamically updating one or more of the visual indictors based at least in part on current activity that is socially relevant to the first user. 8. The method of claim 1, wherein one or more of the interactive elements are an icon or profile picture corresponding to one or more of the selected second users. 9. One or more computer-readable non-transitory storage media embodying software configured when executed to:
select one or more second users of a social-networking system based at least in part on activity socially relevant to a first user of the social-networking system by one or more second users, the second users being identified based at least in part on social-graph information associated with the first and second users at least in part from a social graph of the social-networking system; select one or more interactive elements corresponding to one or more of the selected second users for display on a computing device of the first user; and provide for display on a user interface (UI) of the computing device of the first user one or more of the interactive elements. 10. The media of claim 9, wherein the software is further configured to provide for display one or more notifications on the UI in response to detecting a user input selecting one or more of the interactive elements, each of the notifications comprise information associated with the socially relevant activity by one or more of the second users associated with the selected interactive elements. 11. The media of claim 10, wherein the software is further configured to receive data corresponding to an interaction with one or more of the notifications performed without releasing the computing device of the first user from a locked mode. 12. The media of claim 9, wherein:
the social graph comprises a plurality of nodes and edges connecting the nodes, at least one node in the graph corresponding to the first user, at least one node in the graph corresponding to each second user; the social-graph information that the second users are identified based at least in part on comprises at least one of the nodes corresponding to the first user and at least one of the nodes corresponding to each second user being connected to each other by an edge. 13. The media of claim 9, wherein the software is further configured to:
select one or more interactive elements corresponding to one or more applications on the computing device of the first user, the selection of one or more of the interactive elements corresponding to the applications being based at least in part on activity socially relevant to the first user by one or more of the second users; and provide for display on the UI one or more of the interactive elements corresponding to the applications. 14. The media of claim 13, wherein the software is further configured to provide for display one or more visual indicators with one or more of the interactive elements, the visual indicators being indicative of activity associated with one or more of the interactive elements that is socially relevant to the first user. 15. The media of claim 14, wherein the software is further configured to dynamically update one or more of the visual indictors based at least in part on current activity that is socially relevant to the first user. 16. The media of claim 9, wherein one or more of the interactive elements are an icon or profile picture corresponding to one or more of the selected second users. 17. A device comprising:
a processor; and one or more computer-readable non-transitory storage media coupled to the processor and embodying software that:
select one or more second users of a social-networking system based at least in part on activity socially relevant to a first user of the social-networking system by one or more second users, the second users being identified based at least in part on social-graph information associated with the first and second users at least in part from a social graph of the social-networking system;
select one or more interactive elements corresponding to one or more of the selected second users for display on a computing device of the first user; and
provide for display on a user interface (UI) of the computing device of the first user one or more of the interactive elements. 18. The device of claim 17, wherein the software is further configured to provide for display one or more notifications on the UI in response to detecting a user input selecting one or more of the interactive elements, each of the notifications comprise information associated with the socially relevant activity by one or more of the second users associated with the selected interactive elements. 19. The device of claim 18, wherein the software is further configured to receive data corresponding to an interaction with one or more of the notifications performed without releasing the computing device of the first user from a locked mode. 20. The device of claim 17, wherein the software is further configured to:
select one or more interactive elements corresponding to one or more applications on the computing device of the first user, the selection of one or more of the interactive elements corresponding to the applications being based at least in part on activity socially relevant to the first user by one or more of the second users; and provide for display on the UI one or more of the interactive elements corresponding to the applications. | In one embodiment, a method includes selecting one or more second users of a social-networking system based at least in part on activity socially relevant to a first user of the social-networking system by one or more second users. The second users are identified based at least in part on social-graph information associated with the first and second users at least in part from a social graph of the social-networking system. The method also includes selecting one or more interactive elements corresponding to one or more of the selected second users for display on a computing device of the first user; and providing for display on a user interface (UI) of the computing device of the first user one or more of the interactive elements.1. A method comprising:
by a computing device, selecting one or more second users of a social-networking system based at least in part on activity socially relevant to a first user of the social-networking system by one or more second users, the second users being identified based at least in part on social-graph information associated with the first and second users at least in part from a social graph of the social-networking system; by the computing device, selecting one or more interactive elements corresponding to one or more of the selected second users for display on a computing device of the first user; and by the computing device, providing for display on a user interface (UI) of the computing device of the first user one or more of the interactive elements. 2. The method of claim 1, further comprising, by the computing device, providing for display one or more notifications on the UI in response to detecting a user input selecting one or more of the interactive elements, each of the notifications comprise information associated with the socially relevant activity by one or more of the second users associated with the selected interactive elements. 3. The method of claim 2, further comprising, by the computing device, receiving data corresponding to an interaction with one or more of the notifications performed without releasing the computing device of the first user from a locked mode. 4. The method of claim 1, wherein:
the social graph comprises a plurality of nodes and edges connecting the nodes, at least one node in the graph corresponding to the first user, at least one node in the graph corresponding to each second user; the social-graph information that the second users are identified based at least in part on comprises at least one of the nodes corresponding to the first user and at least one of the nodes corresponding to each second user being connected to each other by an edge. 5. The method of claim 1, further comprising:
by the computing device, selecting one or more interactive elements corresponding to one or more applications on the computing device of the first user, the selection of one or more of the interactive elements corresponding to the applications being based at least in part on activity socially relevant to the first user by one or more of the second users; and by the computing device, providing for display on the UI one or more of the interactive elements corresponding to the applications. 6. The method of claim 5, further comprising, by the computing device, providing for display one or more visual indicators with one or more of the interactive elements, the visual indicators being indicative of activity associated with one or more of the interactive elements that is socially relevant to the first user. 7. The method of claim 6, further comprising, by the computing device, dynamically updating one or more of the visual indictors based at least in part on current activity that is socially relevant to the first user. 8. The method of claim 1, wherein one or more of the interactive elements are an icon or profile picture corresponding to one or more of the selected second users. 9. One or more computer-readable non-transitory storage media embodying software configured when executed to:
select one or more second users of a social-networking system based at least in part on activity socially relevant to a first user of the social-networking system by one or more second users, the second users being identified based at least in part on social-graph information associated with the first and second users at least in part from a social graph of the social-networking system; select one or more interactive elements corresponding to one or more of the selected second users for display on a computing device of the first user; and provide for display on a user interface (UI) of the computing device of the first user one or more of the interactive elements. 10. The media of claim 9, wherein the software is further configured to provide for display one or more notifications on the UI in response to detecting a user input selecting one or more of the interactive elements, each of the notifications comprise information associated with the socially relevant activity by one or more of the second users associated with the selected interactive elements. 11. The media of claim 10, wherein the software is further configured to receive data corresponding to an interaction with one or more of the notifications performed without releasing the computing device of the first user from a locked mode. 12. The media of claim 9, wherein:
the social graph comprises a plurality of nodes and edges connecting the nodes, at least one node in the graph corresponding to the first user, at least one node in the graph corresponding to each second user; the social-graph information that the second users are identified based at least in part on comprises at least one of the nodes corresponding to the first user and at least one of the nodes corresponding to each second user being connected to each other by an edge. 13. The media of claim 9, wherein the software is further configured to:
select one or more interactive elements corresponding to one or more applications on the computing device of the first user, the selection of one or more of the interactive elements corresponding to the applications being based at least in part on activity socially relevant to the first user by one or more of the second users; and provide for display on the UI one or more of the interactive elements corresponding to the applications. 14. The media of claim 13, wherein the software is further configured to provide for display one or more visual indicators with one or more of the interactive elements, the visual indicators being indicative of activity associated with one or more of the interactive elements that is socially relevant to the first user. 15. The media of claim 14, wherein the software is further configured to dynamically update one or more of the visual indictors based at least in part on current activity that is socially relevant to the first user. 16. The media of claim 9, wherein one or more of the interactive elements are an icon or profile picture corresponding to one or more of the selected second users. 17. A device comprising:
a processor; and one or more computer-readable non-transitory storage media coupled to the processor and embodying software that:
select one or more second users of a social-networking system based at least in part on activity socially relevant to a first user of the social-networking system by one or more second users, the second users being identified based at least in part on social-graph information associated with the first and second users at least in part from a social graph of the social-networking system;
select one or more interactive elements corresponding to one or more of the selected second users for display on a computing device of the first user; and
provide for display on a user interface (UI) of the computing device of the first user one or more of the interactive elements. 18. The device of claim 17, wherein the software is further configured to provide for display one or more notifications on the UI in response to detecting a user input selecting one or more of the interactive elements, each of the notifications comprise information associated with the socially relevant activity by one or more of the second users associated with the selected interactive elements. 19. The device of claim 18, wherein the software is further configured to receive data corresponding to an interaction with one or more of the notifications performed without releasing the computing device of the first user from a locked mode. 20. The device of claim 17, wherein the software is further configured to:
select one or more interactive elements corresponding to one or more applications on the computing device of the first user, the selection of one or more of the interactive elements corresponding to the applications being based at least in part on activity socially relevant to the first user by one or more of the second users; and provide for display on the UI one or more of the interactive elements corresponding to the applications. | 2,100 |
4,509 | 11,866,906 | 2,193 | In one aspect, the invention is directed to a method for shutting down a first instance of an application and starting up a second instance of the application. The first instance of the application has associated therewith at least one first-instance support resource. The second instance of the application has associated therewith at least one second-instance support resource. The method includes:
starting up the at least one second-instance support resource; shutting down the first instance of the application after the at least one second-instance support resource has started up; and starting up the second instance of the application based on at least one condition from a set consisting of: when the at least one second-instance support resource is running, and when the first instance of the application has shut down to a selected degree. | 1. A method for shutting down a first instance of an application and starting up a second instance of the application, wherein the first instance of the application has associated therewith at least one first-instance support resourcehe second instance of the application has associated therewith at least one second-instance support resource, the method comprising:
starting up the at least one second-instance support resource; shutting down the first instance of the application after the at least one second-instance support resource is running; and starting up the second instance of the application based on at least one condition from a set consisting of: when the at least one second-instance support resource is running, and when the first instance of the application has shut down to a selected degree. 2. A method as claimed in claim 1, wherein the second instance of the application is started after the first instance of the application is shut down completely. 3. A method as claimed in claim 1, wherein the first instance of the application is shut down after the second instance of the application is running. 4. A method as claimed in claim 1, wherein the step of shutting down the first instance of the application overlaps with the step of starting up the second instance of the application. 5. A method as claimed in claim 1, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. 6. A method for shutting down a first instance of an application and starting Lip a second instance of the application, the method comprising:
starting up the second instance of the application; and shutting down the first instance of the application after the second instance of the application is running. 7. A method as claimed in claim 6, wherein the first instance of the application has associated therewith at least one first-instance support resourcehe second instance of the application has associated therewith at least one second-instance support resource, and the method further comprises:
starting up the at least one second-instance support resource; and starting up the second instance of the application after the at least one second-instance support resource is running. 8. A method as claimed in claim 6, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. 9. An apparatus configured to manage a shut down of a first instance of an application and a start up of a second instance of the application, wherein the first instance of the application has associated therewith at least one first-instance support resource, and the second instance of the application has associated therewith at least one second-instance support resource, the apparatus comprising:
at least one processor; at least one computer usable medium coupled to the at least one processor, wherein the at least one computer usable medium contains a set of instructions and wherein the at least one processor is adapted to carry out the set of instructions, wherein the set of instructions includes instructions to: start up the at least one second-instance support resource; shut down the first instance of the application after the at least one second-instance support resource is running; and start up the second instance of the application based on at least one condition from a set consisting of: when the at least one second-instance support resource is running, and when the first instance of the application has shut down to a selected degree. 10. An apparatus as claimed in claim 9, wherein the set of instructions includes instructions to start up the second instance of the application after the first instance of the application is shut down completely. 11. An apparatus as claimed in claim 9, wherein the set of instructions includes instructions to shut down the first instance of the application after the second instance of the application is running. 12. An apparatus as claimed in claim 9, wherein the set of instructions includes instructions to shut down of the first instance of the application and start up of the second instance of the application at least partially at the same time. 13. An apparatus as claimed in claim 9, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. 14. An apparatus configured to manage a shut down of a first instance of an application and a start up of a second instance of the application, the apparatus comprising:
at least one processor; at least one computer usable medium coupled to the at least one processor, wherein the at least one computer usable medium contains a set of instructions and wherein the at least one processor is adapted to carry out the set of instructions, wherein the set of instructions includes instructions to: start up the second instance of the application; and shut down the first instance of the application after the second instance of the application is running. 15. An apparatus as claimed in claim 14, wherein the first instance of the application has associated therewith at least one first-instance support resourcehe second instance of the application has associated therewith at least one second-instance support resource, and the set of instructions further includes instructions to:
start up the at least one second-instance support resource; and start up the second instance of the application after the at least one second-instance support resource is running. 16. An apparatus as claimed in claim 14, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. 17. A computer program product comprising at least one computer usable medium including computer-usable program code for shutting down a first instance of an application and starting up a second instance of the application, wherein the first instance of the application has associated therewith at least one first-instance support resourcehe second instance of the application has associated therewith at least one second-instance support resource, the computer program product comprising:
computer-usable program code for starting up the at least one second-instance support resource; computer-usable program code for shutting down the first instance of the application after the at least one second-instance support resource is running; and computer-usable program code for starting up the second instance of the application based on at least one condition from a set consisting of: when the at least one second-instance support resource is running, and when the first instance of the application has shut down to a selected degree. 18. A computer program product as claimed in claim 17, further comprising computer-usable program code for starting up the second instance of the application after the first instance of the application is shut down completely. 19. A computer program product as claimed in claim 17, further comprising computer-usable program code for shutting down the first instance of the application after the second instance of the application is running. 20. A computer program product as claimed in claim 17, further comprising computer-usable program code for shutting down of the first instance of the application and starting up of the second instance of the application at least partially at the same time. 21. A computer program product as claimed in claim 17, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. 22. A computer program product comprising at least one computer usable medium including computer-usable program code for shutting down a first instance of an application and starting up a second instance of the application, the computer program product comprising:
computer-usable program code for starting up the second instance of the application; and computer-usable program code for shutting down the first instance of the application after the second instance of the application is running. 23. A computer program product as claimed in claim 22, wherein the first instance of the application has associated therewith at least one first-instance support resourcehe second instance of the application has associated therewith at least one second-instance support resource, and wherein the computer program product further comprises
computer-usable program code for starting up the at least one second-instance support resource; and computer-usable program code for starting up the second instance of the application after the at least one second-instance support resource is running. 24. A computer program product as claimed in claim 22, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. | In one aspect, the invention is directed to a method for shutting down a first instance of an application and starting up a second instance of the application. The first instance of the application has associated therewith at least one first-instance support resource. The second instance of the application has associated therewith at least one second-instance support resource. The method includes:
starting up the at least one second-instance support resource; shutting down the first instance of the application after the at least one second-instance support resource has started up; and starting up the second instance of the application based on at least one condition from a set consisting of: when the at least one second-instance support resource is running, and when the first instance of the application has shut down to a selected degree.1. A method for shutting down a first instance of an application and starting up a second instance of the application, wherein the first instance of the application has associated therewith at least one first-instance support resourcehe second instance of the application has associated therewith at least one second-instance support resource, the method comprising:
starting up the at least one second-instance support resource; shutting down the first instance of the application after the at least one second-instance support resource is running; and starting up the second instance of the application based on at least one condition from a set consisting of: when the at least one second-instance support resource is running, and when the first instance of the application has shut down to a selected degree. 2. A method as claimed in claim 1, wherein the second instance of the application is started after the first instance of the application is shut down completely. 3. A method as claimed in claim 1, wherein the first instance of the application is shut down after the second instance of the application is running. 4. A method as claimed in claim 1, wherein the step of shutting down the first instance of the application overlaps with the step of starting up the second instance of the application. 5. A method as claimed in claim 1, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. 6. A method for shutting down a first instance of an application and starting Lip a second instance of the application, the method comprising:
starting up the second instance of the application; and shutting down the first instance of the application after the second instance of the application is running. 7. A method as claimed in claim 6, wherein the first instance of the application has associated therewith at least one first-instance support resourcehe second instance of the application has associated therewith at least one second-instance support resource, and the method further comprises:
starting up the at least one second-instance support resource; and starting up the second instance of the application after the at least one second-instance support resource is running. 8. A method as claimed in claim 6, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. 9. An apparatus configured to manage a shut down of a first instance of an application and a start up of a second instance of the application, wherein the first instance of the application has associated therewith at least one first-instance support resource, and the second instance of the application has associated therewith at least one second-instance support resource, the apparatus comprising:
at least one processor; at least one computer usable medium coupled to the at least one processor, wherein the at least one computer usable medium contains a set of instructions and wherein the at least one processor is adapted to carry out the set of instructions, wherein the set of instructions includes instructions to: start up the at least one second-instance support resource; shut down the first instance of the application after the at least one second-instance support resource is running; and start up the second instance of the application based on at least one condition from a set consisting of: when the at least one second-instance support resource is running, and when the first instance of the application has shut down to a selected degree. 10. An apparatus as claimed in claim 9, wherein the set of instructions includes instructions to start up the second instance of the application after the first instance of the application is shut down completely. 11. An apparatus as claimed in claim 9, wherein the set of instructions includes instructions to shut down the first instance of the application after the second instance of the application is running. 12. An apparatus as claimed in claim 9, wherein the set of instructions includes instructions to shut down of the first instance of the application and start up of the second instance of the application at least partially at the same time. 13. An apparatus as claimed in claim 9, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. 14. An apparatus configured to manage a shut down of a first instance of an application and a start up of a second instance of the application, the apparatus comprising:
at least one processor; at least one computer usable medium coupled to the at least one processor, wherein the at least one computer usable medium contains a set of instructions and wherein the at least one processor is adapted to carry out the set of instructions, wherein the set of instructions includes instructions to: start up the second instance of the application; and shut down the first instance of the application after the second instance of the application is running. 15. An apparatus as claimed in claim 14, wherein the first instance of the application has associated therewith at least one first-instance support resourcehe second instance of the application has associated therewith at least one second-instance support resource, and the set of instructions further includes instructions to:
start up the at least one second-instance support resource; and start up the second instance of the application after the at least one second-instance support resource is running. 16. An apparatus as claimed in claim 14, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. 17. A computer program product comprising at least one computer usable medium including computer-usable program code for shutting down a first instance of an application and starting up a second instance of the application, wherein the first instance of the application has associated therewith at least one first-instance support resourcehe second instance of the application has associated therewith at least one second-instance support resource, the computer program product comprising:
computer-usable program code for starting up the at least one second-instance support resource; computer-usable program code for shutting down the first instance of the application after the at least one second-instance support resource is running; and computer-usable program code for starting up the second instance of the application based on at least one condition from a set consisting of: when the at least one second-instance support resource is running, and when the first instance of the application has shut down to a selected degree. 18. A computer program product as claimed in claim 17, further comprising computer-usable program code for starting up the second instance of the application after the first instance of the application is shut down completely. 19. A computer program product as claimed in claim 17, further comprising computer-usable program code for shutting down the first instance of the application after the second instance of the application is running. 20. A computer program product as claimed in claim 17, further comprising computer-usable program code for shutting down of the first instance of the application and starting up of the second instance of the application at least partially at the same time. 21. A computer program product as claimed in claim 17, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. 22. A computer program product comprising at least one computer usable medium including computer-usable program code for shutting down a first instance of an application and starting up a second instance of the application, the computer program product comprising:
computer-usable program code for starting up the second instance of the application; and computer-usable program code for shutting down the first instance of the application after the second instance of the application is running. 23. A computer program product as claimed in claim 22, wherein the first instance of the application has associated therewith at least one first-instance support resourcehe second instance of the application has associated therewith at least one second-instance support resource, and wherein the computer program product further comprises
computer-usable program code for starting up the at least one second-instance support resource; and computer-usable program code for starting up the second instance of the application after the at least one second-instance support resource is running. 24. A computer program product as claimed in claim 22, wherein the first instance of the application is present on a first system in a system cluster and wherein the second instance of the application is present on a second system in the system cluster. | 2,100 |
4,510 | 13,724,104 | 2,167 | Arrangements relate to the management of data items representing intended future conversations. A plurality of first inputs related to a respective intended future conversation can be received. At least one data item representing the respective intended future conversation can be created for each first input. At least one attribute can be received for each of the plurality of intended future conversations associated with-each first input. In response to receiving at least one attribute for each of the plurality of the intended future conversations associated with each first input, the plurality of intended future conversations associated with each first input can be ranked in a particular order based on at least one of the received attributes. A listing of the intended future conversations that is based on the ranking can be generated. | 1-10. (canceled) 11. A system comprising:
a processor programmed to initiate executable operations comprising:
receiving a plurality of first inputs, each first input being related to a respective intended future conversation, each first input creating at least one data item representing the respective intended future conversation;
receiving at least one attribute for each of the plurality of intended future conversations associated with each first input;
responsive to receiving at least one attribute for each of the plurality of the intended future conversations associated with each first input, ranking the plurality of intended future conversations associated with each first input in a particular order based on at least one of the received attributes; and
generating a listing of the intended future conversations that is based on the ranking. 12. The system of claim 11, wherein the processor is further programmed to initiate executable operations including:
receive a second input identifying at least one of the received attributes upon which the ranking of the intended future conversations is based. 13. The system of claim 11, wherein the processor is further programmed to initiate executable operations including:
receive a third input identifying a parameter corresponding to the attributes that are used to determine when reminders for intended future conversations are to be presented to the user; and based on the third input, provide reminders to the user regarding the intended future conversations. 14. The system of claim 11, wherein receive at least one attribute for each of the plurality of intended future conversations associated with each first input includes: automatically acquire at least one attribute for at least one of the plurality of intended future conversations associated with each first input from an external information source. 15. The system of claim 14, wherein the external information source is a social networking website, an electronic communication server or a telecommunication system. 16. The system of claim 11, wherein receive at least one attribute for each of the plurality of the intended future conversations associated with each first input includes:
receive the at least one attribute for at least one of the plurality of intended future conversations associated with each first input by a user input. 17. The system of claim 11, wherein receive a plurality of first inputs includes:
automatically acquire at least one of the plurality of first inputs from an external information source or receive at least one of the plurality of first inputs by a user input. 18. The system of claim 11, wherein the processor is further programmed to initiate executable operations including:
modifying at least one attribute associated with at least one of the plurality of intended future conversations associated with each first input; responsive to modifying at least one attribute associated with at least one of the plurality of intended future conversations associated with each first input, ranking the plurality of intended future conversations associated with each first input in a particular order based on at least one of the received attributes; and generating a listing of the intended future conversations that is based on the ranking. 19. The system of claim 11, wherein the processor is further programmed to initiate executable operations including:
presenting to a user a listing of the intended future conversations that is based on the ranking. 20. A computer program product for managing data items representing intended future conversations, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
receiving, by the processor, a plurality of first inputs, each first input being related to a respective intended future conversation, each first input creating at least one data item representing the respective intended future conversation; receiving, by the processor, at least one attribute for each of the plurality of intended future conversations associated with each first input; responsive to receiving at least one attribute for each of the plurality of the intended future conversations associated with each first input, ranking, by the processor, the plurality of intended future conversations associated with each first input in a particular order based on at least one of the received attributes; and generating a listing of the intended future conversations that is based on the ranking. 21. The computer program product of claim 20, wherein the method further includes:
receiving a second input identifying at least one of the received attributes upon which the ranking of the intended future conversations is based. 22. The computer program product of claim 20, wherein receiving at least one attribute for each of the plurality of intended future conversations associated with each first input includes:
automatically acquiring at least one attribute for at least one of the plurality of intended future conversations associated with each first input from an external information source. 23. The computer program product of claim 20, wherein receiving at least one attribute for each of the plurality of the intended future conversations associated with each first input includes:
receiving the at least one attribute for at least one of the plurality of intended future conversations associated with each first input by a user input, or automatically acquiring at least one of the plurality of first inputs from an external information source or by a user input. 24. The computer program product of claim 20, wherein the method further includes:
modifying at least one attribute associated with at least one of the plurality of intended future conversations associated with each first input; responsive to modifying at least one attribute associated with at least one of the plurality of intended future conversations associated with each first input, ranking the plurality of intended future conversations associated with each first input in a particular order based on at least one of the received attributes; and generating a listing of the intended future conversations that is based on the ranking. 25. The computer program product of claim 20, wherein the method further includes:
presenting to a user at least a subset of the listing of the intended future conversations that is based on the ranking. | Arrangements relate to the management of data items representing intended future conversations. A plurality of first inputs related to a respective intended future conversation can be received. At least one data item representing the respective intended future conversation can be created for each first input. At least one attribute can be received for each of the plurality of intended future conversations associated with-each first input. In response to receiving at least one attribute for each of the plurality of the intended future conversations associated with each first input, the plurality of intended future conversations associated with each first input can be ranked in a particular order based on at least one of the received attributes. A listing of the intended future conversations that is based on the ranking can be generated.1-10. (canceled) 11. A system comprising:
a processor programmed to initiate executable operations comprising:
receiving a plurality of first inputs, each first input being related to a respective intended future conversation, each first input creating at least one data item representing the respective intended future conversation;
receiving at least one attribute for each of the plurality of intended future conversations associated with each first input;
responsive to receiving at least one attribute for each of the plurality of the intended future conversations associated with each first input, ranking the plurality of intended future conversations associated with each first input in a particular order based on at least one of the received attributes; and
generating a listing of the intended future conversations that is based on the ranking. 12. The system of claim 11, wherein the processor is further programmed to initiate executable operations including:
receive a second input identifying at least one of the received attributes upon which the ranking of the intended future conversations is based. 13. The system of claim 11, wherein the processor is further programmed to initiate executable operations including:
receive a third input identifying a parameter corresponding to the attributes that are used to determine when reminders for intended future conversations are to be presented to the user; and based on the third input, provide reminders to the user regarding the intended future conversations. 14. The system of claim 11, wherein receive at least one attribute for each of the plurality of intended future conversations associated with each first input includes: automatically acquire at least one attribute for at least one of the plurality of intended future conversations associated with each first input from an external information source. 15. The system of claim 14, wherein the external information source is a social networking website, an electronic communication server or a telecommunication system. 16. The system of claim 11, wherein receive at least one attribute for each of the plurality of the intended future conversations associated with each first input includes:
receive the at least one attribute for at least one of the plurality of intended future conversations associated with each first input by a user input. 17. The system of claim 11, wherein receive a plurality of first inputs includes:
automatically acquire at least one of the plurality of first inputs from an external information source or receive at least one of the plurality of first inputs by a user input. 18. The system of claim 11, wherein the processor is further programmed to initiate executable operations including:
modifying at least one attribute associated with at least one of the plurality of intended future conversations associated with each first input; responsive to modifying at least one attribute associated with at least one of the plurality of intended future conversations associated with each first input, ranking the plurality of intended future conversations associated with each first input in a particular order based on at least one of the received attributes; and generating a listing of the intended future conversations that is based on the ranking. 19. The system of claim 11, wherein the processor is further programmed to initiate executable operations including:
presenting to a user a listing of the intended future conversations that is based on the ranking. 20. A computer program product for managing data items representing intended future conversations, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
receiving, by the processor, a plurality of first inputs, each first input being related to a respective intended future conversation, each first input creating at least one data item representing the respective intended future conversation; receiving, by the processor, at least one attribute for each of the plurality of intended future conversations associated with each first input; responsive to receiving at least one attribute for each of the plurality of the intended future conversations associated with each first input, ranking, by the processor, the plurality of intended future conversations associated with each first input in a particular order based on at least one of the received attributes; and generating a listing of the intended future conversations that is based on the ranking. 21. The computer program product of claim 20, wherein the method further includes:
receiving a second input identifying at least one of the received attributes upon which the ranking of the intended future conversations is based. 22. The computer program product of claim 20, wherein receiving at least one attribute for each of the plurality of intended future conversations associated with each first input includes:
automatically acquiring at least one attribute for at least one of the plurality of intended future conversations associated with each first input from an external information source. 23. The computer program product of claim 20, wherein receiving at least one attribute for each of the plurality of the intended future conversations associated with each first input includes:
receiving the at least one attribute for at least one of the plurality of intended future conversations associated with each first input by a user input, or automatically acquiring at least one of the plurality of first inputs from an external information source or by a user input. 24. The computer program product of claim 20, wherein the method further includes:
modifying at least one attribute associated with at least one of the plurality of intended future conversations associated with each first input; responsive to modifying at least one attribute associated with at least one of the plurality of intended future conversations associated with each first input, ranking the plurality of intended future conversations associated with each first input in a particular order based on at least one of the received attributes; and generating a listing of the intended future conversations that is based on the ranking. 25. The computer program product of claim 20, wherein the method further includes:
presenting to a user at least a subset of the listing of the intended future conversations that is based on the ranking. | 2,100 |
4,511 | 11,566,734 | 2,169 | A system for and method of managing database workloads. The workload managing system comprises a historical data collector arranged to collect historical data indicative of historical database performance trends, and a current data collector arranged to collect substantially current data indicative of substantially current database performance. The system is arranged to compare the collected historical data with the collected substantially current data and to modify operation of the database based on the comparison. | 1. A system for managing database workloads, said workload managing system comprising:
a historical data collector arranged to collect historical data indicative of historical database performance trends; and a current data collector arranged to collect substantially current data indicative of substantially current database performance; the system being arranged to compare the collected historical data with the collected substantially current data and to modify operation of the database based on the comparison. 2. A system as claimed in claim 1, wherein the system is arranged to modify database settings based on the comparison. 3. A system as claimed in claim 1, wherein the system is arranged to carry out a database action based on the comparison. 4. A system as claimed in claim 2, wherein the database settings modifiable by the system comprise database resource settings. 5. A system as claimed in claim 4, wherein the database resource settings include database throttles, database filters and/or resource weights of one or more workloads. 6. A system as claimed in claim 3, wherein database actions which may be carried out by the system comprise sending a communication to a database administrator (DBA), or aborting a query. 7. A system as claimed in claim 1, wherein the system is arranged to store the collected historical data in summary tables. 8. A system as claimed in claim 1, wherein the historical data corresponds to a System CPU value, an Active Session value, a CPU Usage by Workload value, a Spool Usage value, a Number of Queries Submitted value, a System CPU Trend value, a CPU Growth Trend by Workload Definition value, a Query Growth Trend by Workload Definition value, a CPU Time per Query by Workload Definition or a Disk Throughput value. 9. A system as claimed in claim 1, wherein the historical data collector is arranged to collect a plurality of historical data value types. 10. A system as claimed in claim 9, wherein the system is arranged to modify database operation based on historical data collected from the plurality of data value types. 11. A system as claimed in claim 1, wherein the system is arranged to generate a threshold value for each collected historical value, and to modify one or more database settings only when the collected substantially current value exceeds or is less than the threshold value. 12. A system as claimed in claim 11, wherein the threshold value is set at a predetermined level relative to an average value of the collected historical value. 13. A system as claimed in claim 12, wherein the predetermined level is 15% above or below the average collected historical value. 14. A system as claimed in claim 1, wherein the system is arranged to communicate with a RSS subsystem and a Database Query Log (DBQL) subsystem to collect historical resource usage data and historical DBQL data respectfully from the database. 15. A method of managing database workloads, said method comprising:
collecting historical data indicative of historical database performance trends; collecting current data indicative of substantially current database performance; comparing the collected historical data with the collected substantially current data; and modifying operation of the database based on the comparison. 16. A method as claimed in claim 15, further comprising modifying database settings based on the comparison. 17. A method as claimed in claim 15, further comprising carrying out a database action based on the comparison. 18. A method as claimed in claim 16, further comprising modifying database throttles, database filters and/or resource weights of one or more workloads based on the comparison. 19. A method as claimed in claim 17, further comprising sending a communication to a database administrator (DBA), or aborting a query based on the comparison. 20. A method as claimed in claim 15 further comprising storing the collected historical data in summary tables. 21. A method as claimed in claim 15, wherein the step of collecting historical data comprises collecting a plurality of historical data value types. 22. A method as claimed in claim 21, further comprising modifying database operation based on historical data collected from a plurality of data value types. 23. A method as claimed in claim 15, wherein the historical data value types comprise a System CPU value, an Active Session value, a CPU Usage by Workload value, a Spool Usage value, a Number of Queries Submitted value, a System CPU Trend value, a CPU Growth Trend by Workload Definition value, a Query Growth Trend by Workload Definition value, a CPU Time per Query by Workload Definition or a Disk Throughput value. 24. A method as claimed in claim 15, further comprising generating a threshold value for each collected historical value, and modifying one or more database settings only when the collected substantially current value exceeds or is less than the threshold value. 25. A method as claimed in claim 24, further comprising setting the threshold value at a predetermined level relative to an average value of the collected historical value. 26. A method as claimed in claim 25, wherein the threshold value is set at 15% above or below the average historical data value. 27. A computer program arranged when loaded into a computer to instruct the computer to operate in accordance with a system for managing database workloads, said workload managing system comprising:
a historical data collector arranged to collect historical data indicative of historical database performance trends; a current data collector arranged to collect substantially current data indicative of substantially current database performance; and the system being arranged to compare the collected historical data with the collected substantially current data and to modify operation of the database based on the comparison. | A system for and method of managing database workloads. The workload managing system comprises a historical data collector arranged to collect historical data indicative of historical database performance trends, and a current data collector arranged to collect substantially current data indicative of substantially current database performance. The system is arranged to compare the collected historical data with the collected substantially current data and to modify operation of the database based on the comparison.1. A system for managing database workloads, said workload managing system comprising:
a historical data collector arranged to collect historical data indicative of historical database performance trends; and a current data collector arranged to collect substantially current data indicative of substantially current database performance; the system being arranged to compare the collected historical data with the collected substantially current data and to modify operation of the database based on the comparison. 2. A system as claimed in claim 1, wherein the system is arranged to modify database settings based on the comparison. 3. A system as claimed in claim 1, wherein the system is arranged to carry out a database action based on the comparison. 4. A system as claimed in claim 2, wherein the database settings modifiable by the system comprise database resource settings. 5. A system as claimed in claim 4, wherein the database resource settings include database throttles, database filters and/or resource weights of one or more workloads. 6. A system as claimed in claim 3, wherein database actions which may be carried out by the system comprise sending a communication to a database administrator (DBA), or aborting a query. 7. A system as claimed in claim 1, wherein the system is arranged to store the collected historical data in summary tables. 8. A system as claimed in claim 1, wherein the historical data corresponds to a System CPU value, an Active Session value, a CPU Usage by Workload value, a Spool Usage value, a Number of Queries Submitted value, a System CPU Trend value, a CPU Growth Trend by Workload Definition value, a Query Growth Trend by Workload Definition value, a CPU Time per Query by Workload Definition or a Disk Throughput value. 9. A system as claimed in claim 1, wherein the historical data collector is arranged to collect a plurality of historical data value types. 10. A system as claimed in claim 9, wherein the system is arranged to modify database operation based on historical data collected from the plurality of data value types. 11. A system as claimed in claim 1, wherein the system is arranged to generate a threshold value for each collected historical value, and to modify one or more database settings only when the collected substantially current value exceeds or is less than the threshold value. 12. A system as claimed in claim 11, wherein the threshold value is set at a predetermined level relative to an average value of the collected historical value. 13. A system as claimed in claim 12, wherein the predetermined level is 15% above or below the average collected historical value. 14. A system as claimed in claim 1, wherein the system is arranged to communicate with a RSS subsystem and a Database Query Log (DBQL) subsystem to collect historical resource usage data and historical DBQL data respectfully from the database. 15. A method of managing database workloads, said method comprising:
collecting historical data indicative of historical database performance trends; collecting current data indicative of substantially current database performance; comparing the collected historical data with the collected substantially current data; and modifying operation of the database based on the comparison. 16. A method as claimed in claim 15, further comprising modifying database settings based on the comparison. 17. A method as claimed in claim 15, further comprising carrying out a database action based on the comparison. 18. A method as claimed in claim 16, further comprising modifying database throttles, database filters and/or resource weights of one or more workloads based on the comparison. 19. A method as claimed in claim 17, further comprising sending a communication to a database administrator (DBA), or aborting a query based on the comparison. 20. A method as claimed in claim 15 further comprising storing the collected historical data in summary tables. 21. A method as claimed in claim 15, wherein the step of collecting historical data comprises collecting a plurality of historical data value types. 22. A method as claimed in claim 21, further comprising modifying database operation based on historical data collected from a plurality of data value types. 23. A method as claimed in claim 15, wherein the historical data value types comprise a System CPU value, an Active Session value, a CPU Usage by Workload value, a Spool Usage value, a Number of Queries Submitted value, a System CPU Trend value, a CPU Growth Trend by Workload Definition value, a Query Growth Trend by Workload Definition value, a CPU Time per Query by Workload Definition or a Disk Throughput value. 24. A method as claimed in claim 15, further comprising generating a threshold value for each collected historical value, and modifying one or more database settings only when the collected substantially current value exceeds or is less than the threshold value. 25. A method as claimed in claim 24, further comprising setting the threshold value at a predetermined level relative to an average value of the collected historical value. 26. A method as claimed in claim 25, wherein the threshold value is set at 15% above or below the average historical data value. 27. A computer program arranged when loaded into a computer to instruct the computer to operate in accordance with a system for managing database workloads, said workload managing system comprising:
a historical data collector arranged to collect historical data indicative of historical database performance trends; a current data collector arranged to collect substantially current data indicative of substantially current database performance; and the system being arranged to compare the collected historical data with the collected substantially current data and to modify operation of the database based on the comparison. | 2,100 |
4,512 | 11,449,380 | 2,158 | A hardware and software facility for classifying media content units using keywords from a structured vocabulary. Metadata associated with each media content unit is segmented into a series of descriptive phrases. The descriptive phrases are mapped to keywords in a structured vocabulary, and the identified keywords associated with the media content units. Descriptive phrases that are not found in the structured vocabulary are tracked as candidate phrases for later addition to the structured vocabulary. A keyword index to the media content units may be constructed. The index is used to identify specific media content units that are responsive to search queries in a reliable and accurate fashion. | 1. A method of processing metadata associated with media content units in order to classify the media content units using terms contained in a structured vocabulary, the method comprising:
(a) receiving metadata for association with a media content unit; (b) programmatically segmenting the received metadata to generate one or more descriptive phrases; (c) comparing the one or more descriptive phrases with a structured vocabulary of terms in order to identify one or more terms in the structured vocabulary that are related to the one or more descriptive phrases; and (d) creating an association between the identified one or more terms and the media content unit so that the media content unit is characterized by the one or more terms. 2. The method of claim 1, further comprising the step of processing the metadata to remove a portion of the metadata prior to segmenting the metadata. 3. The method of claim 2, wherein processing the metadata includes removing numbers from the metadata. 4. The method of claim 2, wherein processing the metadata includes removing parentheticals from the metadata. 5. The method of claim 2, wherein processing the metadata includes removing source attributions from the metadata. 6. The method of claim 2, wherein processing the metadata includes removing non-grammatical symbols from the metadata. 7. The method of claim 2, wherein processing the metadata includes removing structured metadata from the metadata. 8. The method of claim 1, wherein the metadata is segmented using statistical processing. 9. The method of claim 1, wherein the metadata is segmented using linguistic processing. 10. The method of claim 1, wherein the metadata is segmented using an application-specific dictionary. 11. The method of claim 10, wherein the application-specific dictionary is a subset of the terms in the structured vocabulary of terms 12. The method of claim 1, wherein the media content unit is visual content. 13. The method of claim 12, wherein the visual content is moving imagery. 14. The method of claim 12, wherein the visual content is an image. 15. The method of claim 1, wherein comparing the one or more descriptive phrases with a structured vocabulary of terms includes identifying one or more descriptive phrases that are not in the structured vocabulary. 16. The method of claim 15, wherein the one or more descriptive phrases that are not in the structured vocabulary are maintained in a list of potential phrases to add to the structured vocabulary. 17. A system for processing metadata associated with media content units in order to classify the media content units using terms contained in a structured vocabulary, the system comprising:
(a) a segmentation component for receiving metadata associated with a plurality of media content units and segmenting the metadata to generate one or more descriptive phrases characterizing the plurality of media content units; (b) a matching component for comparing the one or more descriptive phrases generated by the segmentation component with a structured vocabulary of terms in order to identify one or more terms in the structured vocabulary that are correlated with the one or more descriptive phrases for the plurality of media content units; and (c) a mapping component that, for the plurality of media content units, provides a relationship between the media content unit and the one or more terms in the structured vocabulary that were identified by the matching component. 18. The system of claim 17, wherein the segmentation component further processes the metadata to remove a portion of the metadata prior to segmenting the metadata. 19. The system of claim 18, wherein processing the metadata includes removing numbers from the metadata. 20. The system of claim 18, wherein processing the metadata includes removing parentheticals from the metadata. 21. The system of claim 18, wherein processing the metadata includes removing source attributions from the metadata. 22. The system of claim 18, wherein processing the metadata includes removing non-grammatical symbols from the metadata. 23. The system of claim 18, wherein processing the metadata includes removing structured metadata from the metadata. 24. The system of claim 17, wherein the segmentation component segments the metadata using statistical processing. 25. The system of claim 17, wherein the segmentation component segments the metadata using linguistic processing. 26. The system of claim 17, wherein the segmentation component segments the metadata using an application-specific dictionary. 27. The system of claim 26, wherein the application-specific dictionary is a subset of the terms in the structured vocabulary of terms. 28. The system of claim 17, wherein the media content unit is visual content. 29. The system of claim 28, wherein the visual content is moving imagery. 30. The system of claim 28, wherein the visual content is an image. 31. The system of claim 17, wherein the matching component further identifies one or more descriptive phrases that are not in the structured vocabulary of terms. 32. The system of claim 31, wherein the matching component further adds the identified one or more descriptive phrases that are not in the structured vocabulary to a list of potential phrases to add to the structured vocabulary. 33. A method of processing descriptive text associated with visual content in order to classify the visual content using terms contained in a structured vocabulary, the method comprising:
(a) receiving descriptive text associated with visual content; (b) programmatically segmenting the received descriptive text to identify one or more descriptive phrases; (c) comparing the identified one or more descriptive phrases with a structured vocabulary of terms in order to identify one or more terms in the structured vocabulary that are related to the one or more descriptive phrases; and (d) creating an association between the identified one or more terms and the image so that the visual content is classified by the one or more terms. 34. The method of claim 33, further comprising the step of processing the descriptive text to remove a portion of the descriptive text prior to segmenting the descriptive text. 35. The method of claim 34, wherein processing the descriptive text includes removing numbers from the descriptive text. 36. The method of claim 34, wherein processing the descriptive text includes removing parentheticals from the descriptive text. 37. The method of claim 34, wherein processing the descriptive text includes removing source attributions from the descriptive text. 38. The method of claim 34, wherein processing the metadata includes removing non-grammatical symbols from the metadata. 39. The method of claim 34, wherein processing the metadata includes removing structured metadata from the metadata 40. The method of claim 33, wherein the descriptive text is segmented using statistical processing. 41. The method of claim 33, wherein the descriptive text is segmented using linguistic processing. 42. The method of claim 33, wherein the descriptive text is segmented using an application-specific dictionary. 43. The method of claim 42, wherein the application-specific dictionary is a subset of the terms in the structured vocabulary of terms. 44. The method of claim 33, wherein comparing the one or more descriptive phrases with a structured vocabulary of terms includes identifying one or more descriptive phrases that are not in the structured vocabulary. 45. The method of claim 44, wherein the one or more descriptive phrases that are not in the structured vocabulary are maintained in a list of potential phrases to add to the structured vocabulary. 46. The method of claim 33, wherein the visual content is moving imagery. 47. The method of claim 33, wherein the visual content is an image. 48. A computer-readable medium containing instructions for controlling a computer processor in a computer system to classify media content units using terms contained in a structured vocabulary by:
(a) receiving metadata associated with a media content unit; (b) programmatically segmenting the received metadata to generate one or more descriptive phrases; (c) comparing the one or more descriptive phrases with a structured vocabulary of terms in order to identify one or more terms in the structured vocabulary that are related to the one or more descriptive phrases; and (d) creating an association between the identified one or more terms and the media content unit so that the media content unit is classified by the one or more terms. 49. The computer-readable medium of claim 48, further comprising processing the metadata to remove a portion of the metadata prior to segmenting the metadata. 50. The computer-readable medium of claim 48, wherein the metadata is segmented using an application-specific dictionary. 51. The method of claim 50, wherein the application-specific dictionary is a subset of the terms in the structured vocabulary of terms. 52. A system for segmenting metadata associated with a plurality of media content units, the system comprising:
a structured keyword vocabulary used to classify media content units; and a segmentation component for receiving metadata for association with a plurality of media content units and segmenting the metadata to generate one or more descriptive phrases characterizing the plurality of media content units, wherein the segmentation component utilizes an application-specific dictionary that is a subset of the structured keyword vocabulary to segment the received metadata. 53. The system of claim 52, wherein the application-specific dictionary excludes keywords in the structured keyword vocabulary that primarily relate to editorial functions. 54. A method of segmenting metadata associated with a plurality of media content units, the method comprising:
(a) receiving metadata for association with a plurality of media content units; and (b) programmatically segmenting the received metadata to generate one or more descriptive phrases associated with the plurality of media content units utilizing an application-specific dictionary, wherein the application-specific dictionary is a subset of a structured keyword vocabulary that is used to classify the plurality of media content units. 55. The method of claim 54, wherein the application-specific dictionary excludes keywords in the structured vocabulary that primarily relate to editorial functions. | A hardware and software facility for classifying media content units using keywords from a structured vocabulary. Metadata associated with each media content unit is segmented into a series of descriptive phrases. The descriptive phrases are mapped to keywords in a structured vocabulary, and the identified keywords associated with the media content units. Descriptive phrases that are not found in the structured vocabulary are tracked as candidate phrases for later addition to the structured vocabulary. A keyword index to the media content units may be constructed. The index is used to identify specific media content units that are responsive to search queries in a reliable and accurate fashion.1. A method of processing metadata associated with media content units in order to classify the media content units using terms contained in a structured vocabulary, the method comprising:
(a) receiving metadata for association with a media content unit; (b) programmatically segmenting the received metadata to generate one or more descriptive phrases; (c) comparing the one or more descriptive phrases with a structured vocabulary of terms in order to identify one or more terms in the structured vocabulary that are related to the one or more descriptive phrases; and (d) creating an association between the identified one or more terms and the media content unit so that the media content unit is characterized by the one or more terms. 2. The method of claim 1, further comprising the step of processing the metadata to remove a portion of the metadata prior to segmenting the metadata. 3. The method of claim 2, wherein processing the metadata includes removing numbers from the metadata. 4. The method of claim 2, wherein processing the metadata includes removing parentheticals from the metadata. 5. The method of claim 2, wherein processing the metadata includes removing source attributions from the metadata. 6. The method of claim 2, wherein processing the metadata includes removing non-grammatical symbols from the metadata. 7. The method of claim 2, wherein processing the metadata includes removing structured metadata from the metadata. 8. The method of claim 1, wherein the metadata is segmented using statistical processing. 9. The method of claim 1, wherein the metadata is segmented using linguistic processing. 10. The method of claim 1, wherein the metadata is segmented using an application-specific dictionary. 11. The method of claim 10, wherein the application-specific dictionary is a subset of the terms in the structured vocabulary of terms 12. The method of claim 1, wherein the media content unit is visual content. 13. The method of claim 12, wherein the visual content is moving imagery. 14. The method of claim 12, wherein the visual content is an image. 15. The method of claim 1, wherein comparing the one or more descriptive phrases with a structured vocabulary of terms includes identifying one or more descriptive phrases that are not in the structured vocabulary. 16. The method of claim 15, wherein the one or more descriptive phrases that are not in the structured vocabulary are maintained in a list of potential phrases to add to the structured vocabulary. 17. A system for processing metadata associated with media content units in order to classify the media content units using terms contained in a structured vocabulary, the system comprising:
(a) a segmentation component for receiving metadata associated with a plurality of media content units and segmenting the metadata to generate one or more descriptive phrases characterizing the plurality of media content units; (b) a matching component for comparing the one or more descriptive phrases generated by the segmentation component with a structured vocabulary of terms in order to identify one or more terms in the structured vocabulary that are correlated with the one or more descriptive phrases for the plurality of media content units; and (c) a mapping component that, for the plurality of media content units, provides a relationship between the media content unit and the one or more terms in the structured vocabulary that were identified by the matching component. 18. The system of claim 17, wherein the segmentation component further processes the metadata to remove a portion of the metadata prior to segmenting the metadata. 19. The system of claim 18, wherein processing the metadata includes removing numbers from the metadata. 20. The system of claim 18, wherein processing the metadata includes removing parentheticals from the metadata. 21. The system of claim 18, wherein processing the metadata includes removing source attributions from the metadata. 22. The system of claim 18, wherein processing the metadata includes removing non-grammatical symbols from the metadata. 23. The system of claim 18, wherein processing the metadata includes removing structured metadata from the metadata. 24. The system of claim 17, wherein the segmentation component segments the metadata using statistical processing. 25. The system of claim 17, wherein the segmentation component segments the metadata using linguistic processing. 26. The system of claim 17, wherein the segmentation component segments the metadata using an application-specific dictionary. 27. The system of claim 26, wherein the application-specific dictionary is a subset of the terms in the structured vocabulary of terms. 28. The system of claim 17, wherein the media content unit is visual content. 29. The system of claim 28, wherein the visual content is moving imagery. 30. The system of claim 28, wherein the visual content is an image. 31. The system of claim 17, wherein the matching component further identifies one or more descriptive phrases that are not in the structured vocabulary of terms. 32. The system of claim 31, wherein the matching component further adds the identified one or more descriptive phrases that are not in the structured vocabulary to a list of potential phrases to add to the structured vocabulary. 33. A method of processing descriptive text associated with visual content in order to classify the visual content using terms contained in a structured vocabulary, the method comprising:
(a) receiving descriptive text associated with visual content; (b) programmatically segmenting the received descriptive text to identify one or more descriptive phrases; (c) comparing the identified one or more descriptive phrases with a structured vocabulary of terms in order to identify one or more terms in the structured vocabulary that are related to the one or more descriptive phrases; and (d) creating an association between the identified one or more terms and the image so that the visual content is classified by the one or more terms. 34. The method of claim 33, further comprising the step of processing the descriptive text to remove a portion of the descriptive text prior to segmenting the descriptive text. 35. The method of claim 34, wherein processing the descriptive text includes removing numbers from the descriptive text. 36. The method of claim 34, wherein processing the descriptive text includes removing parentheticals from the descriptive text. 37. The method of claim 34, wherein processing the descriptive text includes removing source attributions from the descriptive text. 38. The method of claim 34, wherein processing the metadata includes removing non-grammatical symbols from the metadata. 39. The method of claim 34, wherein processing the metadata includes removing structured metadata from the metadata 40. The method of claim 33, wherein the descriptive text is segmented using statistical processing. 41. The method of claim 33, wherein the descriptive text is segmented using linguistic processing. 42. The method of claim 33, wherein the descriptive text is segmented using an application-specific dictionary. 43. The method of claim 42, wherein the application-specific dictionary is a subset of the terms in the structured vocabulary of terms. 44. The method of claim 33, wherein comparing the one or more descriptive phrases with a structured vocabulary of terms includes identifying one or more descriptive phrases that are not in the structured vocabulary. 45. The method of claim 44, wherein the one or more descriptive phrases that are not in the structured vocabulary are maintained in a list of potential phrases to add to the structured vocabulary. 46. The method of claim 33, wherein the visual content is moving imagery. 47. The method of claim 33, wherein the visual content is an image. 48. A computer-readable medium containing instructions for controlling a computer processor in a computer system to classify media content units using terms contained in a structured vocabulary by:
(a) receiving metadata associated with a media content unit; (b) programmatically segmenting the received metadata to generate one or more descriptive phrases; (c) comparing the one or more descriptive phrases with a structured vocabulary of terms in order to identify one or more terms in the structured vocabulary that are related to the one or more descriptive phrases; and (d) creating an association between the identified one or more terms and the media content unit so that the media content unit is classified by the one or more terms. 49. The computer-readable medium of claim 48, further comprising processing the metadata to remove a portion of the metadata prior to segmenting the metadata. 50. The computer-readable medium of claim 48, wherein the metadata is segmented using an application-specific dictionary. 51. The method of claim 50, wherein the application-specific dictionary is a subset of the terms in the structured vocabulary of terms. 52. A system for segmenting metadata associated with a plurality of media content units, the system comprising:
a structured keyword vocabulary used to classify media content units; and a segmentation component for receiving metadata for association with a plurality of media content units and segmenting the metadata to generate one or more descriptive phrases characterizing the plurality of media content units, wherein the segmentation component utilizes an application-specific dictionary that is a subset of the structured keyword vocabulary to segment the received metadata. 53. The system of claim 52, wherein the application-specific dictionary excludes keywords in the structured keyword vocabulary that primarily relate to editorial functions. 54. A method of segmenting metadata associated with a plurality of media content units, the method comprising:
(a) receiving metadata for association with a plurality of media content units; and (b) programmatically segmenting the received metadata to generate one or more descriptive phrases associated with the plurality of media content units utilizing an application-specific dictionary, wherein the application-specific dictionary is a subset of a structured keyword vocabulary that is used to classify the plurality of media content units. 55. The method of claim 54, wherein the application-specific dictionary excludes keywords in the structured vocabulary that primarily relate to editorial functions. | 2,100 |
4,513 | 12,095,794 | 2,159 | Assisting a user in locating particular content of interest from a collection of content including associated feature values and corresponding features. A user selects one of the plurality of feature values characterizing the collection of content and filters the content using the selected filtering feature value. The system groups the filtered collection using a grouping feature. The grouping feature may be associated with the user-selected filtering feature value and/or may be determined from the feature values of the filtered collection. The process of filtering/grouping may be repeated as many times as needed to locate the particular content of interest. | 1. A method for assisting a user in locating particular content of interest from a collection of content including associated feature values that correspond to features, the method comprising the acts of:
a) determining, by the user, to filter the collection of content to yield a filtered collection of content using a filtering feature value, b) selecting a grouping feature based on at least one of the filtering feature value and feature values associated with the filtered collection of content, c) grouping the filtered collection of content using the selected grouping feature. 2. The method according to claim 1, wherein the grouping feature is determined as a function of the filtering feature value. 3. The method according to claim 1, wherein the grouping feature is determined as a function of the feature values associated with the filtered collection of content. 4. The method according to claim 1, further comprising repeating acts (a) through (c) in the case where the user is unable to locate the particular content of interest from act (c). 5. The method according to claim 1, further comprising the act of constructing a table, prior to the act (a), the table comprised of a plurality of rows, each of the rows including a filter feature and corresponding filtering feature values and at least one associated group feature having associated grouping feature values. 6. A system for assisting a user in locating particular content of interest from a collection of content including a plurality of associated feature values, the system comprising:
a content locator module configured to manage operations associated with filtering and/or grouping the collection of content, and a feature structure model, operatively coupled to the content locator module, the feature structure model including a filter feature having associated filtering feature values and at least one associated group feature having associated grouping feature values. 7. The system of claim 6, comprising:
a means for accessing the collection of content; a means for receiving a user-selected filtering feature value; a means for performing a filtering operation on the collection of content using the user-selected filtering feature value to produce a filtered collection of content; a means for selecting a grouping feature based on at least one of the user-selected filtering feature value and the plurality of feature values of the filtered collection of content; and a means for performing a grouping operation on the filtered collection of content using the grouping feature. 8. The system according to claim 6, further comprising means for storing the collection of content. 9. The system according to claim 6, further comprising display means for displaying a filtered/grouped collection of content to the user. 10. A computer-readable medium encoded with processing instructions for implementing a method for assisting a user in locating particular content of interest from a collection of content including associated feature values that correspond to features, the method including the acts of:
determining, by the user, to filter the collection of content to yield a filtered collection of content using a filtering feature value from among the feature values, wherein the filtering feature value is user-selected; selecting a grouping feature based on at least one of the user-selected filtering feature value and a feature of the filtered collection of content; and grouping the filtered collection of content using the selected grouping feature. 11. The computer-readable medium of claim 10, wherein the act of determining, by the user, to filter the collection of content comprises the act of presenting to the user at least one of the plurality of feature values for user selection as the filtering feature value. 12. The computer-readable medium of claim 10, wherein the act of selecting the grouping feature comprises the act of analyzing the feature values of the filtered collection of content to determine grouping feature granularity. 13. The computer-readable medium of claim 10, wherein the act of selecting the grouping feature comprises the act of analyzing results of potential groupings using feature values of the filtered collection. | Assisting a user in locating particular content of interest from a collection of content including associated feature values and corresponding features. A user selects one of the plurality of feature values characterizing the collection of content and filters the content using the selected filtering feature value. The system groups the filtered collection using a grouping feature. The grouping feature may be associated with the user-selected filtering feature value and/or may be determined from the feature values of the filtered collection. The process of filtering/grouping may be repeated as many times as needed to locate the particular content of interest.1. A method for assisting a user in locating particular content of interest from a collection of content including associated feature values that correspond to features, the method comprising the acts of:
a) determining, by the user, to filter the collection of content to yield a filtered collection of content using a filtering feature value, b) selecting a grouping feature based on at least one of the filtering feature value and feature values associated with the filtered collection of content, c) grouping the filtered collection of content using the selected grouping feature. 2. The method according to claim 1, wherein the grouping feature is determined as a function of the filtering feature value. 3. The method according to claim 1, wherein the grouping feature is determined as a function of the feature values associated with the filtered collection of content. 4. The method according to claim 1, further comprising repeating acts (a) through (c) in the case where the user is unable to locate the particular content of interest from act (c). 5. The method according to claim 1, further comprising the act of constructing a table, prior to the act (a), the table comprised of a plurality of rows, each of the rows including a filter feature and corresponding filtering feature values and at least one associated group feature having associated grouping feature values. 6. A system for assisting a user in locating particular content of interest from a collection of content including a plurality of associated feature values, the system comprising:
a content locator module configured to manage operations associated with filtering and/or grouping the collection of content, and a feature structure model, operatively coupled to the content locator module, the feature structure model including a filter feature having associated filtering feature values and at least one associated group feature having associated grouping feature values. 7. The system of claim 6, comprising:
a means for accessing the collection of content; a means for receiving a user-selected filtering feature value; a means for performing a filtering operation on the collection of content using the user-selected filtering feature value to produce a filtered collection of content; a means for selecting a grouping feature based on at least one of the user-selected filtering feature value and the plurality of feature values of the filtered collection of content; and a means for performing a grouping operation on the filtered collection of content using the grouping feature. 8. The system according to claim 6, further comprising means for storing the collection of content. 9. The system according to claim 6, further comprising display means for displaying a filtered/grouped collection of content to the user. 10. A computer-readable medium encoded with processing instructions for implementing a method for assisting a user in locating particular content of interest from a collection of content including associated feature values that correspond to features, the method including the acts of:
determining, by the user, to filter the collection of content to yield a filtered collection of content using a filtering feature value from among the feature values, wherein the filtering feature value is user-selected; selecting a grouping feature based on at least one of the user-selected filtering feature value and a feature of the filtered collection of content; and grouping the filtered collection of content using the selected grouping feature. 11. The computer-readable medium of claim 10, wherein the act of determining, by the user, to filter the collection of content comprises the act of presenting to the user at least one of the plurality of feature values for user selection as the filtering feature value. 12. The computer-readable medium of claim 10, wherein the act of selecting the grouping feature comprises the act of analyzing the feature values of the filtered collection of content to determine grouping feature granularity. 13. The computer-readable medium of claim 10, wherein the act of selecting the grouping feature comprises the act of analyzing results of potential groupings using feature values of the filtered collection. | 2,100 |
4,514 | 14,448,081 | 2,165 | One or more processing devices provide a wizard for generating a correlation search, the wizard facilitating user input of (i) one or more search criteria for a search query of the correlation search, (ii) a triggering condition to be applied to a dataset produced by the search query, and (iii) one or more actions to be performed when the dataset produced by the search query satisfies the triggering condition, and causing generation of the correlation search based on the user input. | 1. A method comprising:
causing display of a sequence of graphical user interfaces for facilitating user input for generation of a correlation search, wherein the user input comprises (i) one or more search criteria for a search query of the correlation search, (ii) a triggering condition comprising criteria to evaluate a dataset that the search query produces when applied to a non-tabular data store the triggering condition causing execution of one or more actions when the triggering condition is satisfied, and (iii) the one or more actions that execute when the triggering condition is satisfied; causing generation of the correlation search before execution of the search query by storing in memory the search criteria for the search query, the triggering condition, and the one or more actions; wherein the sequence of graphical user interfaces for generating the correlation search comprises (i) a graphical user interface for selecting the non-tabular data store against which to run the search query to produce the dataset, (ii) a graphical user interface for receiving a time range, the time range defining a scope of data of the non-tabular data store to be searched using the search query, and (iii) a graphical user interface for defining the criteria of the triggering condition; and wherein the method is performed by one or more processing devices. 2. The method of claim 1, wherein causing generation of the correlation search comprises:
receiving the one or more search criteria; causing display of the search query in the sequence of graphical user interfaces; receiving a user request to test an execution of the search query; causing the execution of the search query; and causing display of results from the search query. 3. The method of claim 1, further comprising:
causing display in the sequence of graphical user interfaces of a plurality of statistics types that can be used for producing an aggregate on data; receiving through the sequence of graphical user interfaces input identifying one of the plurality of statistics types; receiving input identifying an evaluation of the aggregate produced by the statistics type; and wherein causing generation of the correlation search comprises including the evaluation of the aggregate produced by the statistics type in the search query. 4. The method of claim 1, further comprising:
causing display in the sequence of graphical user interfaces of a plurality of statistics types that can be used for producing an aggregate on data; receiving through the sequence of graphical user interfaces input identifying one of the plurality of statistics types; receiving input identifying an evaluation of the aggregate produced by the statistics type; and wherein causing generation of the correlation search comprises including the evaluation of the aggregate produced by the statistics type in the triggering condition of the correlation search. 5. The method of claim 1, wherein causing generation of the correlation search comprises:
receiving a user request to test an execution of the search query with the triggering condition; and obtaining, for presentation, the dataset produced based on the execution of the search query with the triggering condition. 6. The method of claim 1, wherein causing generation of the correlation search comprises:
displaying in the sequence of graphical user interfaces options for the one or more actions to be performed when the dataset produced by search query satisfies the triggering condition; receiving input identifying the one or more actions to be performed; and associating the identified one or more actions with the triggering condition. 7. The method of claim 1, wherein causing generation of the correlation search comprises:
causing the search query included in the correlation search to be displayed in the sequence of graphical user interfaces. 8. The method of claim 1, wherein the one or more actions comprise one or more of updating a display with an entry corresponding to satisfaction of the triggering condition, adjusting a score of an object to which data causing satisfaction of the triggering condition pertains, or sending a notification indicating satisfaction of the triggering condition. 9. (canceled) 10. The method of claim 1, wherein the sequence of graphical user interfaces includes an indication of whether the search query parses successfully. 11. The method of claim 1, wherein the search query corresponds to a search language that uses a late binding schema. 12. The method of claim 1, further comprising causing execution of the search query against raw machine data. 13. The method of claim 1, further comprising causing execution of the search query against time-stamped events that each include a portion of raw machine data. 14. The method of claim 1, wherein a calculation of a statistics type is included in the search query. 15. The method of claim 1, wherein an evaluation of a calculation of a statistics type is included in the search query. 16. The method of claim 1, wherein the dataset satisfies the triggering condition each time the dataset includes an indicator that the search criteria of the search query are satisfied. 17. The method of claim 1, wherein the dataset includes a number of times the search criteria of the query are satisfied, and the dataset satisfies the triggering condition when the number of times exceeds a threshold. 18. The method of claim 1, wherein the dataset satisfies the triggering condition when an aggregated statistic pertaining to the dataset exceeds a threshold, is under a threshold, or is within a specified range. 19. A system comprising:
a memory; and a processing device coupled with the memory to: cause display of a sequence of graphical user interfaces for facilitating user input for generation of a correlation search, wherein the user input comprises (i) one or more search criteria for a search query of the correlation search, (ii) a triggering condition comprising criteria to evaluate a dataset that the search query produces when applied to a non-tabular data store, the triggering condition causing execution of one or more actions when the triggering condition is satisfied, and (iii) the one or more actions that execute when the triggering condition is satisfied; cause generation of the correlation search before execution of the search query by storing in memory the search criteria for the search query, the triggering condition, and the one or more actions; and wherein the sequence of graphical user interfaces for generating the correlation search comprises (i) a graphical user interface for selecting the non-tabular data store against which to run the search query to produce the dataset, (ii) a graphical user interface for receiving a time range, the time range defining a scope of data of the non-tabular data store to be searched using the search query, and (iii) a graphical user interface for defining the criteria of the triggering condition. 20. The system of claim 19, wherein to cause generation of the correlation search comprises:
receiving the one or more search criteria; causing display of the search query in the sequence of graphical user interfaces; receiving a user request to test an execution of the search query; causing the execution of the search query; and causing display of results from the search query. 21. The system of claim 19, wherein to cause generation of the correlation search comprises:
receiving a user request to test an execution of the search query with the triggering condition; and obtaining, for presentation, the dataset produced based on the execution of the search query with the triggering condition. 22. The system of claim 19, wherein to cause generation of the correlation search comprises:
displaying in the sequence of graphical user interfaces options for the one or more actions to be performed when the dataset produced by search query satisfies the triggering condition; receiving input identifying the one or more actions to be performed; and associating the identified one or more actions with the triggering condition. 23. The system of claim 19, wherein to cause generation of the correlation search comprises:
causing the search query included in the correlation search to be displayed in the sequence of graphical user interfaces. 24. The system of claim 19, wherein the one or more actions comprise one or more of updating a display with an entry corresponding to satisfaction of the triggering condition, adjusting a score of an object to which data causing satisfaction of the triggering condition pertains, or sending a notification indicating satisfaction of the triggering condition. 25. A non-transitory computer readable storage medium encoding instructions thereon that, in response to execution by one or more processing devices, cause the processing device to perform operations comprising:
causing display of a sequence of graphical user interfaces for facilitating user input for generation of a correlation search, wherein the user input comprises (i) one or more search criteria for a search query of the correlation search, (ii) a triggering condition comprising criteria to evaluate a dataset that the search query produces when applied to a non-tabular data store, the triggering condition causing execution of one or more actions when the triggering condition is satisfied, and (iii) the one or more actions that execute when the triggering condition is satisfied; causing generation of the correlation search before execution of the search query by storing in memory the search criteria for the search query, the triggering condition, and the one or more actions; and wherein the sequence of graphical user interfaces for generating the correlation search comprises (i) a graphical user interface for selecting the non-tabular data store against which to run the search query to produce the dataset, (ii) a graphical user interface for receiving a time range, the time range defining a scope of data of the non-tabular data store to be searched using the search query, and (iii) a graphical user interface for defining the criteria of the triggering condition. 26-30. (canceled) 31. The method of claim 1, wherein causing generation of the correlation search comprises generating search processing language that includes the search query and the criteria for the triggering condition. 32. The method of claim 31, further comprising causing a preview in the wizard of the search processing language forming at least part of the correlation search. 33. The method of claim 31, further comprising:
causing a preview, in the sequence of graphical user interfaces, of search processing language forming the search query of the correlation search; enabling a user to execute, from the preview, the search query against the non-tabular data store to cause display of a sample dataset. 34. The method of claim 31, wherein the correlation search comprises a single textual string having the search query and a processing command for the criteria on which the triggering condition is based. 35. The method of claim 1, wherein the sequence of graphical user interfaces includes a plurality of separate graphical user interfaces comprising a GUI element for requesting a graphical user interface that is next in the sequence of graphical user interfaces. 36. The method of claim 1, wherein the graphical user interface for selection of the non-tabular data store is separate from the graphical user interface for defining the criteria of the triggering condition. | One or more processing devices provide a wizard for generating a correlation search, the wizard facilitating user input of (i) one or more search criteria for a search query of the correlation search, (ii) a triggering condition to be applied to a dataset produced by the search query, and (iii) one or more actions to be performed when the dataset produced by the search query satisfies the triggering condition, and causing generation of the correlation search based on the user input.1. A method comprising:
causing display of a sequence of graphical user interfaces for facilitating user input for generation of a correlation search, wherein the user input comprises (i) one or more search criteria for a search query of the correlation search, (ii) a triggering condition comprising criteria to evaluate a dataset that the search query produces when applied to a non-tabular data store the triggering condition causing execution of one or more actions when the triggering condition is satisfied, and (iii) the one or more actions that execute when the triggering condition is satisfied; causing generation of the correlation search before execution of the search query by storing in memory the search criteria for the search query, the triggering condition, and the one or more actions; wherein the sequence of graphical user interfaces for generating the correlation search comprises (i) a graphical user interface for selecting the non-tabular data store against which to run the search query to produce the dataset, (ii) a graphical user interface for receiving a time range, the time range defining a scope of data of the non-tabular data store to be searched using the search query, and (iii) a graphical user interface for defining the criteria of the triggering condition; and wherein the method is performed by one or more processing devices. 2. The method of claim 1, wherein causing generation of the correlation search comprises:
receiving the one or more search criteria; causing display of the search query in the sequence of graphical user interfaces; receiving a user request to test an execution of the search query; causing the execution of the search query; and causing display of results from the search query. 3. The method of claim 1, further comprising:
causing display in the sequence of graphical user interfaces of a plurality of statistics types that can be used for producing an aggregate on data; receiving through the sequence of graphical user interfaces input identifying one of the plurality of statistics types; receiving input identifying an evaluation of the aggregate produced by the statistics type; and wherein causing generation of the correlation search comprises including the evaluation of the aggregate produced by the statistics type in the search query. 4. The method of claim 1, further comprising:
causing display in the sequence of graphical user interfaces of a plurality of statistics types that can be used for producing an aggregate on data; receiving through the sequence of graphical user interfaces input identifying one of the plurality of statistics types; receiving input identifying an evaluation of the aggregate produced by the statistics type; and wherein causing generation of the correlation search comprises including the evaluation of the aggregate produced by the statistics type in the triggering condition of the correlation search. 5. The method of claim 1, wherein causing generation of the correlation search comprises:
receiving a user request to test an execution of the search query with the triggering condition; and obtaining, for presentation, the dataset produced based on the execution of the search query with the triggering condition. 6. The method of claim 1, wherein causing generation of the correlation search comprises:
displaying in the sequence of graphical user interfaces options for the one or more actions to be performed when the dataset produced by search query satisfies the triggering condition; receiving input identifying the one or more actions to be performed; and associating the identified one or more actions with the triggering condition. 7. The method of claim 1, wherein causing generation of the correlation search comprises:
causing the search query included in the correlation search to be displayed in the sequence of graphical user interfaces. 8. The method of claim 1, wherein the one or more actions comprise one or more of updating a display with an entry corresponding to satisfaction of the triggering condition, adjusting a score of an object to which data causing satisfaction of the triggering condition pertains, or sending a notification indicating satisfaction of the triggering condition. 9. (canceled) 10. The method of claim 1, wherein the sequence of graphical user interfaces includes an indication of whether the search query parses successfully. 11. The method of claim 1, wherein the search query corresponds to a search language that uses a late binding schema. 12. The method of claim 1, further comprising causing execution of the search query against raw machine data. 13. The method of claim 1, further comprising causing execution of the search query against time-stamped events that each include a portion of raw machine data. 14. The method of claim 1, wherein a calculation of a statistics type is included in the search query. 15. The method of claim 1, wherein an evaluation of a calculation of a statistics type is included in the search query. 16. The method of claim 1, wherein the dataset satisfies the triggering condition each time the dataset includes an indicator that the search criteria of the search query are satisfied. 17. The method of claim 1, wherein the dataset includes a number of times the search criteria of the query are satisfied, and the dataset satisfies the triggering condition when the number of times exceeds a threshold. 18. The method of claim 1, wherein the dataset satisfies the triggering condition when an aggregated statistic pertaining to the dataset exceeds a threshold, is under a threshold, or is within a specified range. 19. A system comprising:
a memory; and a processing device coupled with the memory to: cause display of a sequence of graphical user interfaces for facilitating user input for generation of a correlation search, wherein the user input comprises (i) one or more search criteria for a search query of the correlation search, (ii) a triggering condition comprising criteria to evaluate a dataset that the search query produces when applied to a non-tabular data store, the triggering condition causing execution of one or more actions when the triggering condition is satisfied, and (iii) the one or more actions that execute when the triggering condition is satisfied; cause generation of the correlation search before execution of the search query by storing in memory the search criteria for the search query, the triggering condition, and the one or more actions; and wherein the sequence of graphical user interfaces for generating the correlation search comprises (i) a graphical user interface for selecting the non-tabular data store against which to run the search query to produce the dataset, (ii) a graphical user interface for receiving a time range, the time range defining a scope of data of the non-tabular data store to be searched using the search query, and (iii) a graphical user interface for defining the criteria of the triggering condition. 20. The system of claim 19, wherein to cause generation of the correlation search comprises:
receiving the one or more search criteria; causing display of the search query in the sequence of graphical user interfaces; receiving a user request to test an execution of the search query; causing the execution of the search query; and causing display of results from the search query. 21. The system of claim 19, wherein to cause generation of the correlation search comprises:
receiving a user request to test an execution of the search query with the triggering condition; and obtaining, for presentation, the dataset produced based on the execution of the search query with the triggering condition. 22. The system of claim 19, wherein to cause generation of the correlation search comprises:
displaying in the sequence of graphical user interfaces options for the one or more actions to be performed when the dataset produced by search query satisfies the triggering condition; receiving input identifying the one or more actions to be performed; and associating the identified one or more actions with the triggering condition. 23. The system of claim 19, wherein to cause generation of the correlation search comprises:
causing the search query included in the correlation search to be displayed in the sequence of graphical user interfaces. 24. The system of claim 19, wherein the one or more actions comprise one or more of updating a display with an entry corresponding to satisfaction of the triggering condition, adjusting a score of an object to which data causing satisfaction of the triggering condition pertains, or sending a notification indicating satisfaction of the triggering condition. 25. A non-transitory computer readable storage medium encoding instructions thereon that, in response to execution by one or more processing devices, cause the processing device to perform operations comprising:
causing display of a sequence of graphical user interfaces for facilitating user input for generation of a correlation search, wherein the user input comprises (i) one or more search criteria for a search query of the correlation search, (ii) a triggering condition comprising criteria to evaluate a dataset that the search query produces when applied to a non-tabular data store, the triggering condition causing execution of one or more actions when the triggering condition is satisfied, and (iii) the one or more actions that execute when the triggering condition is satisfied; causing generation of the correlation search before execution of the search query by storing in memory the search criteria for the search query, the triggering condition, and the one or more actions; and wherein the sequence of graphical user interfaces for generating the correlation search comprises (i) a graphical user interface for selecting the non-tabular data store against which to run the search query to produce the dataset, (ii) a graphical user interface for receiving a time range, the time range defining a scope of data of the non-tabular data store to be searched using the search query, and (iii) a graphical user interface for defining the criteria of the triggering condition. 26-30. (canceled) 31. The method of claim 1, wherein causing generation of the correlation search comprises generating search processing language that includes the search query and the criteria for the triggering condition. 32. The method of claim 31, further comprising causing a preview in the wizard of the search processing language forming at least part of the correlation search. 33. The method of claim 31, further comprising:
causing a preview, in the sequence of graphical user interfaces, of search processing language forming the search query of the correlation search; enabling a user to execute, from the preview, the search query against the non-tabular data store to cause display of a sample dataset. 34. The method of claim 31, wherein the correlation search comprises a single textual string having the search query and a processing command for the criteria on which the triggering condition is based. 35. The method of claim 1, wherein the sequence of graphical user interfaces includes a plurality of separate graphical user interfaces comprising a GUI element for requesting a graphical user interface that is next in the sequence of graphical user interfaces. 36. The method of claim 1, wherein the graphical user interface for selection of the non-tabular data store is separate from the graphical user interface for defining the criteria of the triggering condition. | 2,100 |
4,515 | 12,850,607 | 2,138 | A method begins by a dispersed storage processing module obtaining data for storage. The method continues with the dispersed storage processing module encoding the data in accordance with an error coding dispersal storage function to produce a plurality of sets of encoded data slices. The method continues with the dispersed storage processing module determining a proxy unit. The method continues with the dispersed storage processing module transmitting the plurality of sets of encoded data slices to the proxy unit, wherein the proxy unit disperses the plurality of sets of encoded data slices to a plurality of dispersed storage units. | 1. A method for execution by a dispersed storage processing module, the method comprises:
obtaining data for storage; encoding the data in accordance with an error coding dispersal storage function to produce a plurality of sets of encoded data slices; determining a proxy unit; and transmitting the plurality of sets of encoded data slices to the proxy unit, wherein the proxy unit disperses the plurality of sets of encoded data slices to a plurality of dispersed storage (DS) units. 2. The method of claim 1 further comprises:
transmitting metadata to the proxy unit, wherein the metadata includes a dispersal approach regarding how the proxy unit is to disperse the plurality of sets of encoded data slices. 3. The method of claim 2, wherein the dispersal approach further comprises at least one of:
disperse in a sequential fashion; disperse in a daisy chain fashion; disperse in a one-to-many fashion; and forward to a second proxy unit, wherein the second proxy unit disperses the plurality of sets of encoded data slices to the plurality of dispersed storage units. 4. The method of claim 1 further comprises:
receiving dispersed storage information regarding dispersed storage of the plurality of sets of encoded data slices, wherein the dispersed storage information includes one or more of:
an encoded data slice storage confirmation identifier;
a DS unit identifier and at least one associated slice name;
a seed DS unit identifier;
an end DS unit identifier; and
storage path information. 5. The method of claim 1, wherein the determining the proxy unit further comprises:
selecting one of the plurality of dispersed storage units. 6. A method for execution by a dispersed storage (DS) unit, the method comprises:
receiving a plurality of sets of encoded data slices; receiving metadata associated with the plurality of sets of encoded data slices; interpreting the metadata to determine storage instructions regarding the plurality of encoded data slices; and when the storage instructions indicate daisy chain storage:
locally storing first encoded data slices of each set of encoded data slices; and
forwarding other encoded data slices of the sets of encoded data slices to at least one other DS unit. 7. The method of claim 6 further comprises:
when the storage instructions indicate the daisy chain storage:
updating the metadata to produce updated metadata;
locally storing the updated metadata; and
forwarding the updated metadata to the at least one other DS unit. 8. The method of claim 6 further comprises:
when the storage instructions indicate the daisy chain storage:
updating the metadata to produce updated metadata;
determining whether the DS unit is an end DS unit; and
when the DS unit is the end DS unit, forwarding the updated metadata to a DS processing module. 9. The method of claim 6 further comprises:
when the storage instructions indicate one-to-many storage:
transmitting pillar numbered encoded data slices of the plurality of sets of encoded data slices to corresponding ones of a plurality of DS units, wherein the plurality of DS units includes the at least one other DS unit. 10. The method of claim 6 further comprises:
receiving a retrieval message from an initiator;
retrieving locally stored metadata in response to the retrieval message;
retrieving stored encoded data slices in accordance with the locally stored metadata;
sending the stored encoded data slices to the initiator; and
forwarding the retrieval message to the at least one other DS unit in accordance with the locally stored metadata. 11. A dispersed storage processing module comprises:
an interface; and a processing module operable to:
obtain data for storage;
encode the data in accordance with an error coding dispersal storage function to produce a plurality of sets of encoded data slices;
determine a proxy unit; and
transmit, via the interface, the plurality of sets of encoded data slices to the proxy unit, wherein the proxy unit disperses the plurality of sets of encoded data slices to a plurality of dispersed storage (DS) units. 12. The dispersed storage processing module of claim 11, wherein the processing module further functions to:
transmit, via the interface, metadata to the proxy unit, wherein the metadata includes a dispersal approach regarding how the proxy unit is to disperse the plurality of sets of encoded data slices. 13. The dispersed storage processing module of claim 12, wherein the dispersal approach further comprises at least one of:
disperse in a sequential fashion; disperse in a daisy chain fashion; disperse in a one-to-many fashion; and forward to a second proxy unit, wherein the second proxy unit disperses the plurality of sets of encoded data slices to the plurality of dispersed storage units. 14. The dispersed storage processing module of claim 11, wherein the processing module further functions to:
receive, via the interface, dispersed storage information regarding dispersed storage of the plurality of sets of encoded data slices, wherein the dispersed storage information includes one or more of:
an encoded data slice storage confirmation identifier;
a DS unit identifier and at least one associated slice name;
a seed DS unit identifier;
an end DS unit identifier; and
storage path information. 15. The dispersed storage processing module of claim 11, wherein the processing module further functions to determine the proxy unit by:
selecting one of the plurality of dispersed storage units. 16. A dispersed storage (DS) unit comprises:
an interface; a memory; and a processing module operable to:
receive, via the interface, a plurality of sets of encoded data slices;
receive, via the interface, metadata associated with the plurality of sets of encoded data slices;
interpret the metadata to determine storage instructions regarding the plurality of encoded data slices; and
when the storage instructions indicate daisy chain storage:
locally store, in the memory, first encoded data slices of each set of encoded data slices; and
forward, via the interface, other encoded data slices of the sets of encoded data slices to at least one other DS unit. 17. The dispersed storage unit of claim 16, wherein the processing module further functions to:
when the storage instructions indicate the daisy chain storage:
update the metadata to produce updated metadata;
locally store, in the memory, the updated metadata; and
forward, via the interface, the updated metadata to the at least one other DS unit. 18. The dispersed storage unit of claim 16, wherein the processing module further functions to:
when the storage instructions indicate the daisy chain storage:
update the metadata to produce updated metadata;
determine whether the DS unit is an end DS unit; and
forward, via the interface, the updated metadata to a DS processing module, when the DS unit is the end DS unit. 19. The dispersed storage unit of claim 16, wherein the processing module further functions to:
when the storage instructions indicate one-to-many storage:
transmit, via the interface, pillar numbered encoded data slices of the plurality of sets of encoded data slices to corresponding ones of a plurality of DS units,
wherein the plurality of DS units includes the at least one other DS unit. 20. The dispersed storage unit of claim 16, wherein the processing module further functions to:
receive, via the interface, a retrieval message from an initiator; retrieve, from the memory, locally stored metadata in response to the retrieval message; retrieve, from the memory, stored encoded data slices in accordance with the locally stored metadata; send, via the interface, the stored encoded data slices to the initiator; and forward, via the interface, the retrieval message to the at least one other DS unit in accordance with the locally stored metadata. | A method begins by a dispersed storage processing module obtaining data for storage. The method continues with the dispersed storage processing module encoding the data in accordance with an error coding dispersal storage function to produce a plurality of sets of encoded data slices. The method continues with the dispersed storage processing module determining a proxy unit. The method continues with the dispersed storage processing module transmitting the plurality of sets of encoded data slices to the proxy unit, wherein the proxy unit disperses the plurality of sets of encoded data slices to a plurality of dispersed storage units.1. A method for execution by a dispersed storage processing module, the method comprises:
obtaining data for storage; encoding the data in accordance with an error coding dispersal storage function to produce a plurality of sets of encoded data slices; determining a proxy unit; and transmitting the plurality of sets of encoded data slices to the proxy unit, wherein the proxy unit disperses the plurality of sets of encoded data slices to a plurality of dispersed storage (DS) units. 2. The method of claim 1 further comprises:
transmitting metadata to the proxy unit, wherein the metadata includes a dispersal approach regarding how the proxy unit is to disperse the plurality of sets of encoded data slices. 3. The method of claim 2, wherein the dispersal approach further comprises at least one of:
disperse in a sequential fashion; disperse in a daisy chain fashion; disperse in a one-to-many fashion; and forward to a second proxy unit, wherein the second proxy unit disperses the plurality of sets of encoded data slices to the plurality of dispersed storage units. 4. The method of claim 1 further comprises:
receiving dispersed storage information regarding dispersed storage of the plurality of sets of encoded data slices, wherein the dispersed storage information includes one or more of:
an encoded data slice storage confirmation identifier;
a DS unit identifier and at least one associated slice name;
a seed DS unit identifier;
an end DS unit identifier; and
storage path information. 5. The method of claim 1, wherein the determining the proxy unit further comprises:
selecting one of the plurality of dispersed storage units. 6. A method for execution by a dispersed storage (DS) unit, the method comprises:
receiving a plurality of sets of encoded data slices; receiving metadata associated with the plurality of sets of encoded data slices; interpreting the metadata to determine storage instructions regarding the plurality of encoded data slices; and when the storage instructions indicate daisy chain storage:
locally storing first encoded data slices of each set of encoded data slices; and
forwarding other encoded data slices of the sets of encoded data slices to at least one other DS unit. 7. The method of claim 6 further comprises:
when the storage instructions indicate the daisy chain storage:
updating the metadata to produce updated metadata;
locally storing the updated metadata; and
forwarding the updated metadata to the at least one other DS unit. 8. The method of claim 6 further comprises:
when the storage instructions indicate the daisy chain storage:
updating the metadata to produce updated metadata;
determining whether the DS unit is an end DS unit; and
when the DS unit is the end DS unit, forwarding the updated metadata to a DS processing module. 9. The method of claim 6 further comprises:
when the storage instructions indicate one-to-many storage:
transmitting pillar numbered encoded data slices of the plurality of sets of encoded data slices to corresponding ones of a plurality of DS units, wherein the plurality of DS units includes the at least one other DS unit. 10. The method of claim 6 further comprises:
receiving a retrieval message from an initiator;
retrieving locally stored metadata in response to the retrieval message;
retrieving stored encoded data slices in accordance with the locally stored metadata;
sending the stored encoded data slices to the initiator; and
forwarding the retrieval message to the at least one other DS unit in accordance with the locally stored metadata. 11. A dispersed storage processing module comprises:
an interface; and a processing module operable to:
obtain data for storage;
encode the data in accordance with an error coding dispersal storage function to produce a plurality of sets of encoded data slices;
determine a proxy unit; and
transmit, via the interface, the plurality of sets of encoded data slices to the proxy unit, wherein the proxy unit disperses the plurality of sets of encoded data slices to a plurality of dispersed storage (DS) units. 12. The dispersed storage processing module of claim 11, wherein the processing module further functions to:
transmit, via the interface, metadata to the proxy unit, wherein the metadata includes a dispersal approach regarding how the proxy unit is to disperse the plurality of sets of encoded data slices. 13. The dispersed storage processing module of claim 12, wherein the dispersal approach further comprises at least one of:
disperse in a sequential fashion; disperse in a daisy chain fashion; disperse in a one-to-many fashion; and forward to a second proxy unit, wherein the second proxy unit disperses the plurality of sets of encoded data slices to the plurality of dispersed storage units. 14. The dispersed storage processing module of claim 11, wherein the processing module further functions to:
receive, via the interface, dispersed storage information regarding dispersed storage of the plurality of sets of encoded data slices, wherein the dispersed storage information includes one or more of:
an encoded data slice storage confirmation identifier;
a DS unit identifier and at least one associated slice name;
a seed DS unit identifier;
an end DS unit identifier; and
storage path information. 15. The dispersed storage processing module of claim 11, wherein the processing module further functions to determine the proxy unit by:
selecting one of the plurality of dispersed storage units. 16. A dispersed storage (DS) unit comprises:
an interface; a memory; and a processing module operable to:
receive, via the interface, a plurality of sets of encoded data slices;
receive, via the interface, metadata associated with the plurality of sets of encoded data slices;
interpret the metadata to determine storage instructions regarding the plurality of encoded data slices; and
when the storage instructions indicate daisy chain storage:
locally store, in the memory, first encoded data slices of each set of encoded data slices; and
forward, via the interface, other encoded data slices of the sets of encoded data slices to at least one other DS unit. 17. The dispersed storage unit of claim 16, wherein the processing module further functions to:
when the storage instructions indicate the daisy chain storage:
update the metadata to produce updated metadata;
locally store, in the memory, the updated metadata; and
forward, via the interface, the updated metadata to the at least one other DS unit. 18. The dispersed storage unit of claim 16, wherein the processing module further functions to:
when the storage instructions indicate the daisy chain storage:
update the metadata to produce updated metadata;
determine whether the DS unit is an end DS unit; and
forward, via the interface, the updated metadata to a DS processing module, when the DS unit is the end DS unit. 19. The dispersed storage unit of claim 16, wherein the processing module further functions to:
when the storage instructions indicate one-to-many storage:
transmit, via the interface, pillar numbered encoded data slices of the plurality of sets of encoded data slices to corresponding ones of a plurality of DS units,
wherein the plurality of DS units includes the at least one other DS unit. 20. The dispersed storage unit of claim 16, wherein the processing module further functions to:
receive, via the interface, a retrieval message from an initiator; retrieve, from the memory, locally stored metadata in response to the retrieval message; retrieve, from the memory, stored encoded data slices in accordance with the locally stored metadata; send, via the interface, the stored encoded data slices to the initiator; and forward, via the interface, the retrieval message to the at least one other DS unit in accordance with the locally stored metadata. | 2,100 |
4,516 | 13,855,581 | 2,121 | A system for updating a multiple domain embedded system may include a processor that can identify a device associated with the embedded system and a driver that supports the device. The processor can determine a domain associated with the driver and a first configuration label of a first configuration of the multiple domain embedded system. The processor can also determine a second configuration label of a second configuration of the multiple domain embedded system, based on the first configuration label, an identification of the driver, and an identification of the device. Further, the processor can update the driver based on the second configuration label. | 1. A system for updating a multiple domain embedded system, comprising:
a processor; and memory communicatively coupled to the processor, the memory including: instructions executable by the processor to identify an electronic device associated with the multiple domain embedded system; instructions executable by the processor to identify a driver that supports the electronic device; instructions executable by the processor to determine at least one domain associated with the driver; instructions executable by the processor to determine a first configuration label of a first configuration of the multiple domain embedded system, the first configuration label including a first list of first files that are associated with the at least one domain; instructions executable by the processor to transmit the first configuration label, an identification of the driver, and an identification of the electronic device to a configuration database; instructions executable by the processor to receive, from the configuration database, a second configuration label of a second configuration of the multiple domain embedded system, where the second configuration label includes a second list of second files that are associated with the at least one domain; and instructions executable by the processor to update the driver based on the second files and the second file list. 2. The system according to claim 1, where the second files include binary data, and where the update of the driver is based on the binary data. 3. The system according to claim 1, where the update of the driver includes binary data of the second files overwriting binary data of the first files. 4. The system according to claim 1, where the database is configurable to determine the second configuration label based on the first configuration label, the identification of the driver, and the identification of the electronic device. 5. The system according to claim 1, where in response to detection by the processor of failure of the update of the driver, the processor further configured to roll back the driver based on the first files and the first file list. 6. The system according to claim 1, where the configuration database is part of the multiple domain embedded system. 7. The system according to claim 1, where the configuration database is part of a system external to the multiple domain embedded system. 8. The system according to claim 1, where the multiple domain embedded system is embedded in a vehicle head unit. 9. The system according to claim 1, where the multiple domain embedded system is operable to interact with a vehicle head unit. 10. The system according to claim 1, where each domain of the multiple domain embedded system is associated with a separate address space. 11. A method for updating a multiple domain embedded system, comprising:
identifying, by a first processor associated with a configuration manager, an electronic device associated with the multiple domain embedded system; identifying, by the first processor, a driver that supports the electronic device; determining, by the first processor, at least one domain associated with the driver; determining, by the first processor, a first configuration label of a first configuration of the multiple domain embedded system, the first configuration label including a first list of first files that are associated with the at least one domain; communicating, by the first processor, the first configuration label, an identification of the driver, and an identification of the electronic device to a second processor associated with a configuration database; determining, by the second processor, a second configuration label of a second configuration of the multiple domain embedded system, based on the first configuration label, the identification of the driver, and the identification of the electronic device, and where the second configuration label includes a second list of second files that are associated with the at least one domain; and communicating, by the second processor, the second files and the second configuration label to the first processor; and updating, by the first processor, the driver based on the second files and the second file list. 12. The method according to claim 11, where the second files include binary data, and where the updating of the driver is based on the binary data. 13. The method according to claim 11, where the updating of the driver includes overwriting binary data of the first files with binary data of the second files. 14. The method according to claim 13, further comprising storing, by the second processor, the binary data of the first file in the configuration database, prior to the overwriting. 15. The method according to claim 11, further comprising determining with the first processor that the update has failed, and the first processor rolling back the driver based on the first files and the first file list. 16. The method according to claim 11, where the configuration manager and the configuration database are parts of the multiple domain embedded system. 17. The method according to claim 11, where the configuration manager is part of the multiple domain embedded system and the configuration database is part of a system external to the multiple domain embedded system. 18. The method according to claim 11, where the multiple domain embedded system is embedded in a vehicle head unit. 19. The method according to claim 11, where each domain of the multiple domain embedded system is associated with a separate address space. 20. A method for updating a multiple domain embedded system, comprising:
identifying, by a processor, an electronic device associated with the multiple domain embedded system; identifying, by the processor, a driver that supports the electronic device; determining, by the processor, at least one domain associated with the driver; determining, by the processor, a first configuration label of a first configuration of the multiple domain embedded system, the first configuration label including a first list of first files that are associated with the at least one domain; determining, by the processor, a second configuration label of a second configuration of the multiple domain embedded system, based on the first configuration label, an identification of the driver, and an identification of the electronic device, and where the second configuration label includes a second list of second files that are associated with the at least one domain; and updating, by the processor, the driver based on the second files and the second file list. | A system for updating a multiple domain embedded system may include a processor that can identify a device associated with the embedded system and a driver that supports the device. The processor can determine a domain associated with the driver and a first configuration label of a first configuration of the multiple domain embedded system. The processor can also determine a second configuration label of a second configuration of the multiple domain embedded system, based on the first configuration label, an identification of the driver, and an identification of the device. Further, the processor can update the driver based on the second configuration label.1. A system for updating a multiple domain embedded system, comprising:
a processor; and memory communicatively coupled to the processor, the memory including: instructions executable by the processor to identify an electronic device associated with the multiple domain embedded system; instructions executable by the processor to identify a driver that supports the electronic device; instructions executable by the processor to determine at least one domain associated with the driver; instructions executable by the processor to determine a first configuration label of a first configuration of the multiple domain embedded system, the first configuration label including a first list of first files that are associated with the at least one domain; instructions executable by the processor to transmit the first configuration label, an identification of the driver, and an identification of the electronic device to a configuration database; instructions executable by the processor to receive, from the configuration database, a second configuration label of a second configuration of the multiple domain embedded system, where the second configuration label includes a second list of second files that are associated with the at least one domain; and instructions executable by the processor to update the driver based on the second files and the second file list. 2. The system according to claim 1, where the second files include binary data, and where the update of the driver is based on the binary data. 3. The system according to claim 1, where the update of the driver includes binary data of the second files overwriting binary data of the first files. 4. The system according to claim 1, where the database is configurable to determine the second configuration label based on the first configuration label, the identification of the driver, and the identification of the electronic device. 5. The system according to claim 1, where in response to detection by the processor of failure of the update of the driver, the processor further configured to roll back the driver based on the first files and the first file list. 6. The system according to claim 1, where the configuration database is part of the multiple domain embedded system. 7. The system according to claim 1, where the configuration database is part of a system external to the multiple domain embedded system. 8. The system according to claim 1, where the multiple domain embedded system is embedded in a vehicle head unit. 9. The system according to claim 1, where the multiple domain embedded system is operable to interact with a vehicle head unit. 10. The system according to claim 1, where each domain of the multiple domain embedded system is associated with a separate address space. 11. A method for updating a multiple domain embedded system, comprising:
identifying, by a first processor associated with a configuration manager, an electronic device associated with the multiple domain embedded system; identifying, by the first processor, a driver that supports the electronic device; determining, by the first processor, at least one domain associated with the driver; determining, by the first processor, a first configuration label of a first configuration of the multiple domain embedded system, the first configuration label including a first list of first files that are associated with the at least one domain; communicating, by the first processor, the first configuration label, an identification of the driver, and an identification of the electronic device to a second processor associated with a configuration database; determining, by the second processor, a second configuration label of a second configuration of the multiple domain embedded system, based on the first configuration label, the identification of the driver, and the identification of the electronic device, and where the second configuration label includes a second list of second files that are associated with the at least one domain; and communicating, by the second processor, the second files and the second configuration label to the first processor; and updating, by the first processor, the driver based on the second files and the second file list. 12. The method according to claim 11, where the second files include binary data, and where the updating of the driver is based on the binary data. 13. The method according to claim 11, where the updating of the driver includes overwriting binary data of the first files with binary data of the second files. 14. The method according to claim 13, further comprising storing, by the second processor, the binary data of the first file in the configuration database, prior to the overwriting. 15. The method according to claim 11, further comprising determining with the first processor that the update has failed, and the first processor rolling back the driver based on the first files and the first file list. 16. The method according to claim 11, where the configuration manager and the configuration database are parts of the multiple domain embedded system. 17. The method according to claim 11, where the configuration manager is part of the multiple domain embedded system and the configuration database is part of a system external to the multiple domain embedded system. 18. The method according to claim 11, where the multiple domain embedded system is embedded in a vehicle head unit. 19. The method according to claim 11, where each domain of the multiple domain embedded system is associated with a separate address space. 20. A method for updating a multiple domain embedded system, comprising:
identifying, by a processor, an electronic device associated with the multiple domain embedded system; identifying, by the processor, a driver that supports the electronic device; determining, by the processor, at least one domain associated with the driver; determining, by the processor, a first configuration label of a first configuration of the multiple domain embedded system, the first configuration label including a first list of first files that are associated with the at least one domain; determining, by the processor, a second configuration label of a second configuration of the multiple domain embedded system, based on the first configuration label, an identification of the driver, and an identification of the electronic device, and where the second configuration label includes a second list of second files that are associated with the at least one domain; and updating, by the processor, the driver based on the second files and the second file list. | 2,100 |
4,517 | 13,604,377 | 2,122 | Particular embodiments provide functionality for predicting purchasing needs according to multidimensional data. The multidimensional data may define a multidimensional space. The multidimensional space may have at least three dimensions, and each of the dimensions may be capable of providing variable information, and/or having a type that is different from a type of another one of the dimensions. Particular embodiments may retrieve information from data associated with the multidimensional space. Predictions regarding purchasing needs may be generated based on the retrieved information. Purchasing recommendations may then be provided based on the predictions. | 1. A method comprising:
retrieving, by one or more processors associated with one or more computer servers, historical transaction information associated with a user; generating, by the one or more processors, at least a portion of a user profile for the user based on the historical transaction information; estimating, by the one or more processors, purchasing needs of the user; generating, by the one or more processors, purchasing recommendations for the user based on the purchasing needs of the user; and providing, by the one or more processors, the purchasing recommendations. 2. The method of claim 1, wherein the at least a portion of the user profile includes static characteristics. 3. The method of claim 2, wherein the static characteristics comprise demographic data, psychographic data, purchasing preferences, or any combination thereof 4. The method of claim 1, wherein the at least a portion of the user profile includes dynamic characteristics. 5. The method of claim 4, wherein the dynamic characteristics are based on rules describing the user's behavior. 6. The method of claim 5, wherein the rules describing the user's behavior are generated using machine learning based on the historical transaction information. 7. The method of claim 5, further comprising validating the rules describing the user's behavior based on a defined criteria. 8. The method of claim 7, wherein the validating the rules is based on input from the user, from an expert, or any combination thereof 9. The method of claim 1, further comprising combining a portion of the user profile including static characteristics with a portion of the user profile including dynamic characteristics. 10. The method of claim 1, wherein the historical transaction information is stored in a multidimensional space having at least three dimensions, each of the dimensions being capable of providing variable information. 11. The method of claim 1, wherein the generating purchasing recommendations further comprises: accessing a data store comprising information associated with products, services, suppliers, promotions, discounts, or any combination thereof 12. The method of claim 1, wherein estimating purchasing needs of the user is based on a state of the user, a state of the world, or any combination thereof. 13. The method of claim 1, wherein the purchasing recommendations are provided to a marketing application. 14. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
retrieve, by one or more processors associated with one or more computer servers, historical transaction information associated with a user; generate, by the one or more processors, at least a portion of a user profile for the user based on the historical transaction information; estimate, by the one or more processors, purchasing needs of the user; generate, by the one or more processors, purchasing recommendations for the user based on the purchasing needs of the user; and provide, by the one or more processors, the purchasing recommendations. 15. The media of claim 14, wherein the rules describing the user's behavior are generated using machine learning based on the historical transaction information. 16. The media of claim 14, further embodying software operable when executed to validate the rules describing the user's behavior based on a defined criteria. 17. The media of claim 16, wherein the step of validating the rules is based on input from the user, from an expert, or any combination thereof 18. A system comprising:
one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
retrieve historical transaction information associated with a user;
generate at least a portion of a user profile for the user based on the historical transaction information;
estimate purchasing needs of the user;
generate purchasing recommendations for the user based on the purchasing needs of the user; and
provide the purchasing recommendations. 19. The system of claim 18, wherein the historical transaction information is stored in a multidimensional space having at least three dimensions, each of the dimensions being capable of providing variable information. 20. The system of claim 18, wherein the step of estimating purchasing needs of the user is based on a state of the user, a state of the world, or any combination thereof | Particular embodiments provide functionality for predicting purchasing needs according to multidimensional data. The multidimensional data may define a multidimensional space. The multidimensional space may have at least three dimensions, and each of the dimensions may be capable of providing variable information, and/or having a type that is different from a type of another one of the dimensions. Particular embodiments may retrieve information from data associated with the multidimensional space. Predictions regarding purchasing needs may be generated based on the retrieved information. Purchasing recommendations may then be provided based on the predictions.1. A method comprising:
retrieving, by one or more processors associated with one or more computer servers, historical transaction information associated with a user; generating, by the one or more processors, at least a portion of a user profile for the user based on the historical transaction information; estimating, by the one or more processors, purchasing needs of the user; generating, by the one or more processors, purchasing recommendations for the user based on the purchasing needs of the user; and providing, by the one or more processors, the purchasing recommendations. 2. The method of claim 1, wherein the at least a portion of the user profile includes static characteristics. 3. The method of claim 2, wherein the static characteristics comprise demographic data, psychographic data, purchasing preferences, or any combination thereof 4. The method of claim 1, wherein the at least a portion of the user profile includes dynamic characteristics. 5. The method of claim 4, wherein the dynamic characteristics are based on rules describing the user's behavior. 6. The method of claim 5, wherein the rules describing the user's behavior are generated using machine learning based on the historical transaction information. 7. The method of claim 5, further comprising validating the rules describing the user's behavior based on a defined criteria. 8. The method of claim 7, wherein the validating the rules is based on input from the user, from an expert, or any combination thereof 9. The method of claim 1, further comprising combining a portion of the user profile including static characteristics with a portion of the user profile including dynamic characteristics. 10. The method of claim 1, wherein the historical transaction information is stored in a multidimensional space having at least three dimensions, each of the dimensions being capable of providing variable information. 11. The method of claim 1, wherein the generating purchasing recommendations further comprises: accessing a data store comprising information associated with products, services, suppliers, promotions, discounts, or any combination thereof 12. The method of claim 1, wherein estimating purchasing needs of the user is based on a state of the user, a state of the world, or any combination thereof. 13. The method of claim 1, wherein the purchasing recommendations are provided to a marketing application. 14. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
retrieve, by one or more processors associated with one or more computer servers, historical transaction information associated with a user; generate, by the one or more processors, at least a portion of a user profile for the user based on the historical transaction information; estimate, by the one or more processors, purchasing needs of the user; generate, by the one or more processors, purchasing recommendations for the user based on the purchasing needs of the user; and provide, by the one or more processors, the purchasing recommendations. 15. The media of claim 14, wherein the rules describing the user's behavior are generated using machine learning based on the historical transaction information. 16. The media of claim 14, further embodying software operable when executed to validate the rules describing the user's behavior based on a defined criteria. 17. The media of claim 16, wherein the step of validating the rules is based on input from the user, from an expert, or any combination thereof 18. A system comprising:
one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
retrieve historical transaction information associated with a user;
generate at least a portion of a user profile for the user based on the historical transaction information;
estimate purchasing needs of the user;
generate purchasing recommendations for the user based on the purchasing needs of the user; and
provide the purchasing recommendations. 19. The system of claim 18, wherein the historical transaction information is stored in a multidimensional space having at least three dimensions, each of the dimensions being capable of providing variable information. 20. The system of claim 18, wherein the step of estimating purchasing needs of the user is based on a state of the user, a state of the world, or any combination thereof | 2,100 |
4,518 | 14,789,857 | 2,156 | The present invention provides computer-based systems and methods directed to maintaining a database of user profiles based, respectively, on user interaction with third-party systems. The invention includes the processes of: accessing a unique user profile associated with a unique user; automatically collecting, by an agent module executing on a processor associated with a first system, data associated with the unique user based at least in part on the unique user's interaction with a system unassociated with the first system; evaluating by the processor the collected data and searching available databases to identify potential items of interest to the unique user based at least in part on the unique user profile and the collected data; determining a set of predicted items of interest to the unique user from the identified potential items of interest; and presenting at a display associated with the unique user data representing the set of predicted items of interest. In one implementation, the invention provides an intelligent agent possessing a level of “awareness” concerning individual users associated with user profiles or accounts and is adapted to access private and public databases, websites, resources, and other systems to efficiently collect, filter and deliver/present content and resources of interest to the individual user in a predictive fashion. | 1. A computer-implemented method of maintaining a database of user profiles based, respectively, on user interaction with third-party systems, the method comprising:
maintaining by a first system a first database comprising user profile records; accessing from the first database a unique user profile associated with a unique user, the unique user profile comprising personal information related to the unique user and information representing at least one entity of interest to the unique user; automatically collecting, by an agent module executing on a processor associated with the first system, data associated with the unique user based at least in part on the unique user's interaction with a system unassociated with the first system; evaluating by the processor the collected data and searching available databases other than the first database to identify potential items of interest to the unique user based at least in part on the unique user profile and the collected data, at least one identified potential item of interest related to an entity of interest to the unique user; determining a set of predicted items of interest to the unique user from the identified potential items of interest; and presenting at a display associated with the unique user data representing the set of predicted items of interest. 2. The method of claim 1, wherein automatically collecting by an agent module data associated with the unique user includes accessing and searching user account data associated with the unique user. 3. The method of claim 2, wherein the user account data includes one or more: of email;
calendar; contacts; phone record accounts; an entry in a calendar program indicating a scheduled meeting with a first entity; a contact record representing the first entity; an email including an email address associated with the first entity; and an email containing a name or other identifier associated with the first entity; a billing system entry containing client, billing, time or related data; a customer relationship management (CRM) system entry containing contact, company, activity or related data; a phone call record; a travel system entry containing travel plans, reservations and related data; click stream data; and application usage data. 4. The method of claim 3, wherein the set of predicted items of interest to the unique user includes content concerning a first entity, the content being one or more of biography, article, caselaw, website, regulatory filing, financial reporting, transcripts, interviews, competitive intelligence, trading data, related analytics, third-party reports, and related internal data, such as CRM activities, experience data and related proposals. 5. The method of claim 1, wherein the evaluating collected data and searching available databases includes accessing one or more of: publicly available content database; subscriber-based content database; fee-based content database; professional service provider content database; government maintained database; and regulatory database. 6. The method of claim 5, wherein evaluating collected data and searching available databases includes using secure sign-in data associated with the unique user to automatically access a database via a secure sign-in procedure. 7. The method of claim 6, wherein the secure sign-in data includes user login identifier and password data associated with the unique user. 8. The method of claim 5, wherein evaluating collected data and searching available databases includes using user profiles associated with one or more of professional networking sites (e.g., LinkedIn) and social networking sites (e.g., Facebook, MySpace) to collect either professional data, personal data, or both professional and personal data, associated with the user or an entity linked to the user. 9. The method of claim 8 further comprising accessing one or more user profiles associated with one or more of professional and social networking sites to collect either professional data, personal data, or both professional and personal data, associated with the user associated with the one or more user profiles. 10. The method of claim 1 further comprising:
determining based at least in part on the collected data a first entity, the set of predicted items of interest being related to the first entity. 11. The method of claim 10, wherein determining based at least in part on the collected data includes one or more from the group consisting of: evaluating the strength of relationship between the first entity and the unique user; comparing the first entity with an authority database to validate the identity of the first entity; comparing the first entity with one or more databases to determine a confidence level used to associate the first entity with a known entity; performing a disambiguation process on the first entity to validate the identity of the first entity; and performing a data cleansing to eliminate false positive identification of entities. 12. The method of claim 1, wherein determining a set of predicted items of interest to the unique user from the identified potential items of interest includes performing one or more of Bayesian, idf, and TF-idf, processes on the identified potential items of interest. 13. The method of claim 1, wherein presenting the unique user with data representing the set of predicted items of interest includes presenting links to one or more of document, webpage, contact data, profile data, email data, calendar data, and database; automatically generating and transmitting an email to an email account associated with the unique user; and automatically generating and presenting via a user dashboard associated with the unique user links to one or more of the predicted items of interest. 14. The method of claim 1 further comprising presenting the unique user with a user interface comprising a set of functions enabling the unique user to either dynamically select, dynamically deselect, or both dynamically select and dynamically deselect, certain ones of the predicted items of interest. 15. The method of claim 1 further comprising the unique user taking an action related to the predicted items of interest and collecting data associated with the user action and updating the user profile based on the collected data associated with the user action. 16. The method of claim 1 further comprising building a user profile via algorithms to segment and rank the areas of interest to a given user. 17. The method of claim 16 further comprising modifying the user profile based on user's reactions to the presented data. 18. A computer-implemented system for maintaining a database of user profiles based, respectively, on user interaction with third-party systems, the system comprising:
a server comprising a processor and a memory adapted to store executable program instructions and data; a database comprising a plurality of user profiles, each user profile being unique and being associated with a unique user entity, at least one unique user profile comprising personal information related to a unique user and information representing at least one entity of interest to the unique user, the server adapted to access the database and to receive inputs; an agent module comprising a first set of code executable by the processor and adapted to process data associated with the unique user based at least in part on the unique user's interaction with an unassociated system; a second set of executable code adapted to evaluate collected data and search available databases to identify potential items of interest to the unique user based at least in part on the unique user profile and the collected data, at least one identified potential item of interest related to an entity of interest to the unique user; a third set of executable code adapted to determine a set of predicted items of interest to the unique user from the identified potential items of interest; and a fourth set of executable code adapted to present at a display associated with the unique user data representing the set of predicted items of interest. 19. A non-transitory computer-readable medium comprising code adapted to maintain a database of user profiles based, respectively, on user interaction with third-party systems, the code being executable by a server comprising a processor and a memory adapted to store executable program instructions and being in communication with an associated database comprising a plurality of user profiles, each user profile being unique and being associated with a unique user entity, at least one unique user profile comprising personal information related to a unique user and information representing at least one entity of interest to the unique user, the server adapted to access the database and to receive inputs, the computer-readable medium comprising:
an agent module comprising a first set of code executable by the processor and adapted to process data associated with the unique user based at least in part on the unique user's interaction with an unassociated system; a second set of executable code adapted to evaluate collected data and search available databases to identify potential items of interest to the unique user based at least in part on the unique user profile and the collected data, at least one identified potential item of interest related to an entity of interest to the unique user; a third set of executable code adapted to determine a set of predicted items of interest to the unique user from the identified potential items of interest; and a fourth set of executable code adapted to present at a display associated with the unique user data representing the set of predicted items of interest. | The present invention provides computer-based systems and methods directed to maintaining a database of user profiles based, respectively, on user interaction with third-party systems. The invention includes the processes of: accessing a unique user profile associated with a unique user; automatically collecting, by an agent module executing on a processor associated with a first system, data associated with the unique user based at least in part on the unique user's interaction with a system unassociated with the first system; evaluating by the processor the collected data and searching available databases to identify potential items of interest to the unique user based at least in part on the unique user profile and the collected data; determining a set of predicted items of interest to the unique user from the identified potential items of interest; and presenting at a display associated with the unique user data representing the set of predicted items of interest. In one implementation, the invention provides an intelligent agent possessing a level of “awareness” concerning individual users associated with user profiles or accounts and is adapted to access private and public databases, websites, resources, and other systems to efficiently collect, filter and deliver/present content and resources of interest to the individual user in a predictive fashion.1. A computer-implemented method of maintaining a database of user profiles based, respectively, on user interaction with third-party systems, the method comprising:
maintaining by a first system a first database comprising user profile records; accessing from the first database a unique user profile associated with a unique user, the unique user profile comprising personal information related to the unique user and information representing at least one entity of interest to the unique user; automatically collecting, by an agent module executing on a processor associated with the first system, data associated with the unique user based at least in part on the unique user's interaction with a system unassociated with the first system; evaluating by the processor the collected data and searching available databases other than the first database to identify potential items of interest to the unique user based at least in part on the unique user profile and the collected data, at least one identified potential item of interest related to an entity of interest to the unique user; determining a set of predicted items of interest to the unique user from the identified potential items of interest; and presenting at a display associated with the unique user data representing the set of predicted items of interest. 2. The method of claim 1, wherein automatically collecting by an agent module data associated with the unique user includes accessing and searching user account data associated with the unique user. 3. The method of claim 2, wherein the user account data includes one or more: of email;
calendar; contacts; phone record accounts; an entry in a calendar program indicating a scheduled meeting with a first entity; a contact record representing the first entity; an email including an email address associated with the first entity; and an email containing a name or other identifier associated with the first entity; a billing system entry containing client, billing, time or related data; a customer relationship management (CRM) system entry containing contact, company, activity or related data; a phone call record; a travel system entry containing travel plans, reservations and related data; click stream data; and application usage data. 4. The method of claim 3, wherein the set of predicted items of interest to the unique user includes content concerning a first entity, the content being one or more of biography, article, caselaw, website, regulatory filing, financial reporting, transcripts, interviews, competitive intelligence, trading data, related analytics, third-party reports, and related internal data, such as CRM activities, experience data and related proposals. 5. The method of claim 1, wherein the evaluating collected data and searching available databases includes accessing one or more of: publicly available content database; subscriber-based content database; fee-based content database; professional service provider content database; government maintained database; and regulatory database. 6. The method of claim 5, wherein evaluating collected data and searching available databases includes using secure sign-in data associated with the unique user to automatically access a database via a secure sign-in procedure. 7. The method of claim 6, wherein the secure sign-in data includes user login identifier and password data associated with the unique user. 8. The method of claim 5, wherein evaluating collected data and searching available databases includes using user profiles associated with one or more of professional networking sites (e.g., LinkedIn) and social networking sites (e.g., Facebook, MySpace) to collect either professional data, personal data, or both professional and personal data, associated with the user or an entity linked to the user. 9. The method of claim 8 further comprising accessing one or more user profiles associated with one or more of professional and social networking sites to collect either professional data, personal data, or both professional and personal data, associated with the user associated with the one or more user profiles. 10. The method of claim 1 further comprising:
determining based at least in part on the collected data a first entity, the set of predicted items of interest being related to the first entity. 11. The method of claim 10, wherein determining based at least in part on the collected data includes one or more from the group consisting of: evaluating the strength of relationship between the first entity and the unique user; comparing the first entity with an authority database to validate the identity of the first entity; comparing the first entity with one or more databases to determine a confidence level used to associate the first entity with a known entity; performing a disambiguation process on the first entity to validate the identity of the first entity; and performing a data cleansing to eliminate false positive identification of entities. 12. The method of claim 1, wherein determining a set of predicted items of interest to the unique user from the identified potential items of interest includes performing one or more of Bayesian, idf, and TF-idf, processes on the identified potential items of interest. 13. The method of claim 1, wherein presenting the unique user with data representing the set of predicted items of interest includes presenting links to one or more of document, webpage, contact data, profile data, email data, calendar data, and database; automatically generating and transmitting an email to an email account associated with the unique user; and automatically generating and presenting via a user dashboard associated with the unique user links to one or more of the predicted items of interest. 14. The method of claim 1 further comprising presenting the unique user with a user interface comprising a set of functions enabling the unique user to either dynamically select, dynamically deselect, or both dynamically select and dynamically deselect, certain ones of the predicted items of interest. 15. The method of claim 1 further comprising the unique user taking an action related to the predicted items of interest and collecting data associated with the user action and updating the user profile based on the collected data associated with the user action. 16. The method of claim 1 further comprising building a user profile via algorithms to segment and rank the areas of interest to a given user. 17. The method of claim 16 further comprising modifying the user profile based on user's reactions to the presented data. 18. A computer-implemented system for maintaining a database of user profiles based, respectively, on user interaction with third-party systems, the system comprising:
a server comprising a processor and a memory adapted to store executable program instructions and data; a database comprising a plurality of user profiles, each user profile being unique and being associated with a unique user entity, at least one unique user profile comprising personal information related to a unique user and information representing at least one entity of interest to the unique user, the server adapted to access the database and to receive inputs; an agent module comprising a first set of code executable by the processor and adapted to process data associated with the unique user based at least in part on the unique user's interaction with an unassociated system; a second set of executable code adapted to evaluate collected data and search available databases to identify potential items of interest to the unique user based at least in part on the unique user profile and the collected data, at least one identified potential item of interest related to an entity of interest to the unique user; a third set of executable code adapted to determine a set of predicted items of interest to the unique user from the identified potential items of interest; and a fourth set of executable code adapted to present at a display associated with the unique user data representing the set of predicted items of interest. 19. A non-transitory computer-readable medium comprising code adapted to maintain a database of user profiles based, respectively, on user interaction with third-party systems, the code being executable by a server comprising a processor and a memory adapted to store executable program instructions and being in communication with an associated database comprising a plurality of user profiles, each user profile being unique and being associated with a unique user entity, at least one unique user profile comprising personal information related to a unique user and information representing at least one entity of interest to the unique user, the server adapted to access the database and to receive inputs, the computer-readable medium comprising:
an agent module comprising a first set of code executable by the processor and adapted to process data associated with the unique user based at least in part on the unique user's interaction with an unassociated system; a second set of executable code adapted to evaluate collected data and search available databases to identify potential items of interest to the unique user based at least in part on the unique user profile and the collected data, at least one identified potential item of interest related to an entity of interest to the unique user; a third set of executable code adapted to determine a set of predicted items of interest to the unique user from the identified potential items of interest; and a fourth set of executable code adapted to present at a display associated with the unique user data representing the set of predicted items of interest. | 2,100 |
4,519 | 14,935,082 | 2,185 | An apparatus includes a multiport hub, a single bridge configured to communicatively couple together a plurality of hosts and to emulate a slave device to each such host, and a plurality of connection port. The apparatus further includes a configurable data path network coupled to the multiport hub, the single bridge, and the plurality of connection ports. The configurable data path network is configured to selectively provide for a connection port for which a host is detected, data communications through the single bridge between the multiport hub and the connection port, and for a connection port for which no host is detected, data communications between the multiport hub and the connection port that bypass the single bridge. Corresponding methods are also so disclosed. | 1. An apparatus, comprising:
a multiport hub; a plurality of direction control circuits, each of the direction control circuits corresponding to a separate connection port and configured to differentiate as to whether a host or a slave device is coupled to the respective connection port; a bridge configured to communicatively couple together a plurality of hosts and to emulate a slave device to each of the hosts; and a configurable data path network coupled to the multiport hub, the direction control circuits, and the bridge; wherein each of the direction control circuits is configured to provide control signals to the configurable data path network to configure data communications between the multiport hub and the connection port corresponding to the direction control circuit based on whether the respective direction control circuit determines that a host or a slave device is coupled to the port. 2. The apparatus of claim 1, further comprising wherein the apparatus includes only one bridge configured to communicatively couple together the plurality of hosts and to emulate the slave device to each of the hosts. 3. The apparatus of claim 1, further comprising communication links between the direction control circuits over which each of the direction control circuits is configured to communicate to the other direction control circuits whether a host or a slave device is coupled to a connection port corresponding to the respective direction control circuit. 4. The apparatus of claim 3, wherein the direction control circuits are configured to perform an arbitration among themselves when at least two of the direction control circuits determine that a host is coupled to the respective connection ports. 5. The apparatus of claim 4, wherein only a winning direction control circuit of the arbitration is to configure the configurable data path network so that communications between the multiport hub and the connection port corresponding to the winning direction control circuit pass through the bridge, and communications between the multipart hub and all other ports pass through the configurable data path network but not through the bridge. 6. The apparatus of claim 4, wherein the winning direction control circuit of the arbitration is a first direction control circuit to detect a host. 7. The apparatus of claim 1, wherein the configurable data path network includes:
a pair of multiplexers for each of the connection ports to permit communications between the respective connection port and the multiport hub to selectively pass through the bridge or to bypass the bridge; and a pair of multiplexers coupled to the bridge to selectively provide communications between one of the ports and the bridge and between the bridge and the multiport hub. 8. The apparatus of claim 1, wherein the multipart hub and the bridge comprise a universal serial bus (USB) multiport hub and a USB bridge. 9. The apparatus of claim 1, wherein the configurable data path network comprises a plurality of multiplexers to provide configurable data communication paths between the multiport hub and the connection ports, and wherein the direction control circuits and not a host are configured to provide control signals to configure the multiplexers of the configurable data path network. 10. An apparatus, comprising:
a multiport hub; a single bridge configured to communicatively couple together a plurality of hosts and to emulate a slave device to each such host; a plurality of connection ports; and a configurable data path network coupled to the multiport hub, the single bridge, and the plurality of connection ports, wherein the configurable data path network is configured to selectively provide:
for a connection port for which a host is detected, data communications through the single bridge between the multiport hub and the connection port; and
for a connection port for which no host is detected, data communications between the multiport hub and the connection port that bypass the single bridge. 11. The apparatus of claim 10, further comprising a plurality of direction control circuits, wherein each of the direction control circuits corresponds to a separate connection port and is configured to differentiate as to whether a host or a slave device is coupled to the respective connection port. 12. The apparatus of claim 11, further comprising communication links between the direction control circuits over which each of the direction control circuits is configured to communicate to the other direction control circuits whether a host or a slave device is coupled to a connection port corresponding to the respective direction control circuit. 13. The apparatus of claim 11, wherein the direction control circuits are configured to perform an arbitration among themselves when at least two direction control circuits determine that a host is coupled to the respective connection ports. 14. The apparatus of claim 13, wherein the arbitration is based on which direction control circuit first detects a presence of a host, and wherein the first direction control circuit to detect a host configures the configurable data path network so that the communications only between the multiport hub and the connection port corresponding to the direction control circuit pass through the single bridge. 15. The apparatus of claim 10, wherein the configurable data path network includes:
a pair of multiplexers for each of the connection ports to permit communications between the respective connection port and the multiport hub to selectively pass through the single bridge or to bypass the single bridge; and a pair of multiplexers coupled to the single bridge to selectively provide communications between one of the ports and the single bridge and between the single bridge and the multiport hub. 16. The apparatus of claim 17, wherein the multiport hub and the single bridge comprise a universal serial bus (USB) multiport hub and a single USB bridge. 17. A method, comprising:
detecting whether a host is connected to a connection port; for a connection port for which a host is detected, configuring a configurable data path network to provide data communications through a bridge between a multiport hub and that particular connection port, wherein the bridge is configured to emulate a slave device to a host; and for a connection port for which no host is detected, configuring the configurable data path network to provide data communications between the multiport hub and the particular connection port that bypass the bridge. 18. The method of claim 17, wherein configuring the configurable data path network includes configuring a plurality of multiplexers. 19. The method of claim 17, wherein configuring the configurable data path network to provide data communications through a bridge between the multiport hub and the connection port comprises configuring a pair of multiplexers that are shared by all of the connection ports. 20. The method of claim 17, further comprising:
detecting multiple hosts connected to connection ports; performing an arbitration process to determine a winning connection port; and configuring the configurable data path network to provide data communications through the bridge only between the multiport hub and the winning connection port, so that the configurable data path network does not permit communications through the bridge to any other connection port. | An apparatus includes a multiport hub, a single bridge configured to communicatively couple together a plurality of hosts and to emulate a slave device to each such host, and a plurality of connection port. The apparatus further includes a configurable data path network coupled to the multiport hub, the single bridge, and the plurality of connection ports. The configurable data path network is configured to selectively provide for a connection port for which a host is detected, data communications through the single bridge between the multiport hub and the connection port, and for a connection port for which no host is detected, data communications between the multiport hub and the connection port that bypass the single bridge. Corresponding methods are also so disclosed.1. An apparatus, comprising:
a multiport hub; a plurality of direction control circuits, each of the direction control circuits corresponding to a separate connection port and configured to differentiate as to whether a host or a slave device is coupled to the respective connection port; a bridge configured to communicatively couple together a plurality of hosts and to emulate a slave device to each of the hosts; and a configurable data path network coupled to the multiport hub, the direction control circuits, and the bridge; wherein each of the direction control circuits is configured to provide control signals to the configurable data path network to configure data communications between the multiport hub and the connection port corresponding to the direction control circuit based on whether the respective direction control circuit determines that a host or a slave device is coupled to the port. 2. The apparatus of claim 1, further comprising wherein the apparatus includes only one bridge configured to communicatively couple together the plurality of hosts and to emulate the slave device to each of the hosts. 3. The apparatus of claim 1, further comprising communication links between the direction control circuits over which each of the direction control circuits is configured to communicate to the other direction control circuits whether a host or a slave device is coupled to a connection port corresponding to the respective direction control circuit. 4. The apparatus of claim 3, wherein the direction control circuits are configured to perform an arbitration among themselves when at least two of the direction control circuits determine that a host is coupled to the respective connection ports. 5. The apparatus of claim 4, wherein only a winning direction control circuit of the arbitration is to configure the configurable data path network so that communications between the multiport hub and the connection port corresponding to the winning direction control circuit pass through the bridge, and communications between the multipart hub and all other ports pass through the configurable data path network but not through the bridge. 6. The apparatus of claim 4, wherein the winning direction control circuit of the arbitration is a first direction control circuit to detect a host. 7. The apparatus of claim 1, wherein the configurable data path network includes:
a pair of multiplexers for each of the connection ports to permit communications between the respective connection port and the multiport hub to selectively pass through the bridge or to bypass the bridge; and a pair of multiplexers coupled to the bridge to selectively provide communications between one of the ports and the bridge and between the bridge and the multiport hub. 8. The apparatus of claim 1, wherein the multipart hub and the bridge comprise a universal serial bus (USB) multiport hub and a USB bridge. 9. The apparatus of claim 1, wherein the configurable data path network comprises a plurality of multiplexers to provide configurable data communication paths between the multiport hub and the connection ports, and wherein the direction control circuits and not a host are configured to provide control signals to configure the multiplexers of the configurable data path network. 10. An apparatus, comprising:
a multiport hub; a single bridge configured to communicatively couple together a plurality of hosts and to emulate a slave device to each such host; a plurality of connection ports; and a configurable data path network coupled to the multiport hub, the single bridge, and the plurality of connection ports, wherein the configurable data path network is configured to selectively provide:
for a connection port for which a host is detected, data communications through the single bridge between the multiport hub and the connection port; and
for a connection port for which no host is detected, data communications between the multiport hub and the connection port that bypass the single bridge. 11. The apparatus of claim 10, further comprising a plurality of direction control circuits, wherein each of the direction control circuits corresponds to a separate connection port and is configured to differentiate as to whether a host or a slave device is coupled to the respective connection port. 12. The apparatus of claim 11, further comprising communication links between the direction control circuits over which each of the direction control circuits is configured to communicate to the other direction control circuits whether a host or a slave device is coupled to a connection port corresponding to the respective direction control circuit. 13. The apparatus of claim 11, wherein the direction control circuits are configured to perform an arbitration among themselves when at least two direction control circuits determine that a host is coupled to the respective connection ports. 14. The apparatus of claim 13, wherein the arbitration is based on which direction control circuit first detects a presence of a host, and wherein the first direction control circuit to detect a host configures the configurable data path network so that the communications only between the multiport hub and the connection port corresponding to the direction control circuit pass through the single bridge. 15. The apparatus of claim 10, wherein the configurable data path network includes:
a pair of multiplexers for each of the connection ports to permit communications between the respective connection port and the multiport hub to selectively pass through the single bridge or to bypass the single bridge; and a pair of multiplexers coupled to the single bridge to selectively provide communications between one of the ports and the single bridge and between the single bridge and the multiport hub. 16. The apparatus of claim 17, wherein the multiport hub and the single bridge comprise a universal serial bus (USB) multiport hub and a single USB bridge. 17. A method, comprising:
detecting whether a host is connected to a connection port; for a connection port for which a host is detected, configuring a configurable data path network to provide data communications through a bridge between a multiport hub and that particular connection port, wherein the bridge is configured to emulate a slave device to a host; and for a connection port for which no host is detected, configuring the configurable data path network to provide data communications between the multiport hub and the particular connection port that bypass the bridge. 18. The method of claim 17, wherein configuring the configurable data path network includes configuring a plurality of multiplexers. 19. The method of claim 17, wherein configuring the configurable data path network to provide data communications through a bridge between the multiport hub and the connection port comprises configuring a pair of multiplexers that are shared by all of the connection ports. 20. The method of claim 17, further comprising:
detecting multiple hosts connected to connection ports; performing an arbitration process to determine a winning connection port; and configuring the configurable data path network to provide data communications through the bridge only between the multiport hub and the winning connection port, so that the configurable data path network does not permit communications through the bridge to any other connection port. | 2,100 |
4,520 | 14,412,048 | 2,153 | A data cache platform maintains pre-computed database query results computed by a computation platform based on data maintained in the computation platform and is configured to determine probabilities of the pre-computed database query results being outdated, to automatically issue re-computation orders to the computation platform for updating pre-computed database query results on the basis of the determined probabilities of the pre-computed database query results being outdated and to receive the updated pre-computed database query results as results of the re-computation orders. The probability determination depends on a probabilistic model and on the occurrence of asynchronous real-time events. The real-time events are indeterministic with regard to the expiration of the cached database query results and only have a probabilistic influence on the discrepancies between the database query results maintained in the data cache platform and presumed actual database query results. | 1-15. (canceled) 16. A data cache platform for maintaining pre-computed database query results computed by a computation platform based on data maintained in the computation platform, the data cache platform comprising:
at least one processor; and a memory coupled with the at least one processor, the memory comprising:
a data structure stored thereon and configured to store a probabilistic model that models discrepancies between the pre-computed database query results maintained in the data cache platform and presumed actual database query results; and
program code stored thereon and configured to be executed by the at least one processor to cause the at least one processor to:
determine probabilities of the pre-computed database query results being outdated based on the probabilistic model;
detect an asynchronous real-time event that has a probabilistic influence on the discrepancies between the pre-computed database query results maintained in the data cache platform and presumed actual database query results;
analyze whether the asynchronous real-time event is represented in the probabilistic model;
amend the probabilities of the pre-computed database query results being outdated if the asynchronous real-time events is determined to be not represented in the probabilistic model;
automatically issue re-computation orders to the computation platform for updating the pre-computed database query results based on the probabilities of the pre-computed database query results being outdated, wherein the pre-computed database query results having a probability of being outdated above a given threshold are ordered to be re-computed; and
receive the updated pre-computed database query results from the computation platform in response to the re-computation orders. 17. The data cache platform of claim 16 wherein the program code is further configured upon execution to cause the at least one processor to:
determine an accuracy of a portion of the pre-computed database query results maintained in the data cache platform, the portion of the pre-computed database query results being potentially affected by the asynchronous real-time event;
compare the accuracy with a predicted accuracy of the portion of pre-computed database query results based on the probabilistic model; and
determine that the asynchronous real-time event is not represented in the probabilistic model if the accuracy is below the predicted accuracy to a given extent. 18. The data cache platform of claim 17 wherein the program code determines the accuracy of the portion of pre-computed database query results by:
issuing sample re-computation orders to computation platform and comparing the results of the sample re-computation orders with the respective pre-computed database query results previously maintained in the data cache platform. 19. The data cache platform of claim 17 wherein the given extent is defined by a threshold value that is defined based on a historical reliability of the probabilistic model. 20. The data cache platform of claim 17 wherein the program code amends the determined probabilities of the pre-computed database query results by:
decreasing the probabilities of the pre-computed database query results in the portion to the accuracy of the portion. 21. The data cache platform of claim 16 wherein the program code is further configured upon execution to cause the at least one processor to:
for real-time events which are determined to be not represented in the probabilistic model, issuing re-computation orders regarding the pre-computed database query results that are potentially affected. 22. The data cache platform of claim 16 wherein the program code is further configured upon execution to cause the at least one processor to:
for real-time events that are determined to be represented in the probabilistic model, accumulating such real-time events over a certain period of time, comparing the actually occurred and accumulated real-time events with their representation in the probabilistic model and, if the actually occurred accumulated real-time events deviate from their representation in the probabilistic model to a predetermined extent, issuing re-computation orders with respect to potentially affected pre-computed database query results. 23. The data cache platform of claim 16 wherein the data cache platform, when determining the probabilities of the pre-computed database query results of being outdated and issuing the re-computation, considers grids of pre-computed database query results corresponding to groups of adjacent sets of data maintained in the computation platform. 24. The data cache platform of claim 16 wherein the data cache platform issues the re-computation orders based on an amount of available computation resources at the computation platform. 25. A method of updating pre-computed database query results in a distributed database system, the distributed database system including a data cache platform maintaining the pre-computed database query results and a computation platform for computing the pre-computed database query results based on data maintained in the computation platform, the data cache platform maintaining a probabilistic model that models discrepancies between the pre-computed database query results maintained in the data cache platform and presumed actual database query results, the method comprising:
determining, by the data cache platform, probabilities of the pre-computed database query results being outdated based on the probabilistic model; detecting, by the data cache platform, an asynchronous real-time event that has a probabilistic influence on the discrepancies between the pre-computed database query results maintained in the data cache platform and presumed actual database query results; analyzing, at the data cache platform, whether the asynchronous real-time event is represented in the probabilistic model; amending, by the data cache platform, the probabilities of the pre-computed database query results being outdated if the asynchronous real-time events is determined to be not represented in the probabilistic model; automatically issuing, by the data cache platform, re-computation orders to the computation platform for updating the pre-computed database query results based on the probabilities of the pre-computed database query results being outdated, wherein the pre-computed database query results having a probability of being outdated above a given threshold are ordered to be re-computed; and receiving, at the data cache platform, the updated pre-computed database query results from the computation platform in response to the re-computation orders. 26. The method of claim 25 wherein detecting the asynchronous real-time event and/or analyzing whether the asynchronous real-time event is represented in the probabilistic model comprises:
determining an accuracy of a portion of the pre-computed database query results maintained in the data cache platform, the portion of the pre-computed database query results being potentially affected by the asynchronous real-time event;
comparing the accuracy with a predicted accuracy of the portion of pre-computed database query results based on the probabilistic model; and
determining that the asynchronous real-time event is not represented in the probabilistic model if the accuracy is below the predicted accuracy to a given extent. 27. The method of claim 26 wherein determining the accuracy of the portion of pre-computed database query results comprises:
issuing sample re-computation orders to computation platform and comparing the results of the sample re-computation orders with the respective pre-computed database query results previously maintained in the data cache platform. 28. The method of claim 26 wherein the given extent is defined by a threshold value that is defined based on a historical reliability of the probabilistic model. 29. The method of claim 26 wherein amending the determined probabilities of the pre-computed database query results comprises:
decreasing the probabilities of the pre-computed database query results in the portion to the accuracy of the portion. 30. The method of claim 25 further comprising:
for real-time events which are determined to be not represented in the probabilistic model, issuing re-computation orders regarding the pre-computed database query results that are potentially affected. 31. The method of claim 25 further comprising:
for real-time events that are determined to be represented in the probabilistic model, accumulating such real-time events over a certain period of time, comparing the actually occurred and accumulated real-time events with their representation in the probabilistic model and, if the actually occurred accumulated real-time events deviate from their representation in the probabilistic model to a predetermined extent, issuing re-computation orders with respect to potentially affected pre-computed database query results. 32. The method of claim 25 wherein the data cache platform, when determining the probabilities of the pre-computed database query results of being outdated and issuing the re-computation, considers grids of pre-computed database query results corresponding to groups of adjacent sets of data maintained in the computation platform. 33. The method of claim 25 wherein the data cache platform issues the re-computation orders based on an amount of available computation resources at the computation platform. 34. The method of claim 25 wherein the distributed database system is a travel reservation system, the computation platform maintains information on travel availability and fares, and the data cache platform maintains priced travel recommendations calculated from the information on travel availability and the fares. 35. The method of claim 34 wherein the real-time events are selected from the group consisting of flight fare changes, airplane seat availability changes, client flight ticket requests, and flight cancellations. 36. The method of claim 34 wherein the distributed database system comprises at least one application platform connected to the computation platform, the at least one application platform configured to maintain and organize the pre-computed database query results, and the database query results stored in the at least one application platform being populated and/or updated by the computation platform as a result of the re-computation orders issued by the data cache platform. 37. A computer program product comprising:
a computer readable storage medium; and program code stored on the computer readable storage medium and configured, upon execution, to cause at least one processor to: maintain a probabilistic model that models discrepancies between pre-computed database query results maintained in a data cache platform and presumed actual database query results; determine probabilities of the pre-computed database query results being outdated based on the probabilistic model; detect an asynchronous real-time event that has a probabilistic influence on the discrepancies between the pre-computed database query results maintained in the data cache platform and presumed actual database query results; analyze whether the asynchronous real-time event is represented in the probabilistic model; amend the probabilities of the pre-computed database query results being outdated if the asynchronous real-time events is determined to be not represented in the probabilistic model; automatically issue re-computation orders to a computation platform for updating the pre-computed database query results based on the probabilities of the pre-computed database query results being outdated, wherein the pre-computed database query results having a probability of being outdated above a given threshold are ordered to be re-computed; and receive the updated pre-computed database query results from the computation platform in response to the re-computation orders. | A data cache platform maintains pre-computed database query results computed by a computation platform based on data maintained in the computation platform and is configured to determine probabilities of the pre-computed database query results being outdated, to automatically issue re-computation orders to the computation platform for updating pre-computed database query results on the basis of the determined probabilities of the pre-computed database query results being outdated and to receive the updated pre-computed database query results as results of the re-computation orders. The probability determination depends on a probabilistic model and on the occurrence of asynchronous real-time events. The real-time events are indeterministic with regard to the expiration of the cached database query results and only have a probabilistic influence on the discrepancies between the database query results maintained in the data cache platform and presumed actual database query results.1-15. (canceled) 16. A data cache platform for maintaining pre-computed database query results computed by a computation platform based on data maintained in the computation platform, the data cache platform comprising:
at least one processor; and a memory coupled with the at least one processor, the memory comprising:
a data structure stored thereon and configured to store a probabilistic model that models discrepancies between the pre-computed database query results maintained in the data cache platform and presumed actual database query results; and
program code stored thereon and configured to be executed by the at least one processor to cause the at least one processor to:
determine probabilities of the pre-computed database query results being outdated based on the probabilistic model;
detect an asynchronous real-time event that has a probabilistic influence on the discrepancies between the pre-computed database query results maintained in the data cache platform and presumed actual database query results;
analyze whether the asynchronous real-time event is represented in the probabilistic model;
amend the probabilities of the pre-computed database query results being outdated if the asynchronous real-time events is determined to be not represented in the probabilistic model;
automatically issue re-computation orders to the computation platform for updating the pre-computed database query results based on the probabilities of the pre-computed database query results being outdated, wherein the pre-computed database query results having a probability of being outdated above a given threshold are ordered to be re-computed; and
receive the updated pre-computed database query results from the computation platform in response to the re-computation orders. 17. The data cache platform of claim 16 wherein the program code is further configured upon execution to cause the at least one processor to:
determine an accuracy of a portion of the pre-computed database query results maintained in the data cache platform, the portion of the pre-computed database query results being potentially affected by the asynchronous real-time event;
compare the accuracy with a predicted accuracy of the portion of pre-computed database query results based on the probabilistic model; and
determine that the asynchronous real-time event is not represented in the probabilistic model if the accuracy is below the predicted accuracy to a given extent. 18. The data cache platform of claim 17 wherein the program code determines the accuracy of the portion of pre-computed database query results by:
issuing sample re-computation orders to computation platform and comparing the results of the sample re-computation orders with the respective pre-computed database query results previously maintained in the data cache platform. 19. The data cache platform of claim 17 wherein the given extent is defined by a threshold value that is defined based on a historical reliability of the probabilistic model. 20. The data cache platform of claim 17 wherein the program code amends the determined probabilities of the pre-computed database query results by:
decreasing the probabilities of the pre-computed database query results in the portion to the accuracy of the portion. 21. The data cache platform of claim 16 wherein the program code is further configured upon execution to cause the at least one processor to:
for real-time events which are determined to be not represented in the probabilistic model, issuing re-computation orders regarding the pre-computed database query results that are potentially affected. 22. The data cache platform of claim 16 wherein the program code is further configured upon execution to cause the at least one processor to:
for real-time events that are determined to be represented in the probabilistic model, accumulating such real-time events over a certain period of time, comparing the actually occurred and accumulated real-time events with their representation in the probabilistic model and, if the actually occurred accumulated real-time events deviate from their representation in the probabilistic model to a predetermined extent, issuing re-computation orders with respect to potentially affected pre-computed database query results. 23. The data cache platform of claim 16 wherein the data cache platform, when determining the probabilities of the pre-computed database query results of being outdated and issuing the re-computation, considers grids of pre-computed database query results corresponding to groups of adjacent sets of data maintained in the computation platform. 24. The data cache platform of claim 16 wherein the data cache platform issues the re-computation orders based on an amount of available computation resources at the computation platform. 25. A method of updating pre-computed database query results in a distributed database system, the distributed database system including a data cache platform maintaining the pre-computed database query results and a computation platform for computing the pre-computed database query results based on data maintained in the computation platform, the data cache platform maintaining a probabilistic model that models discrepancies between the pre-computed database query results maintained in the data cache platform and presumed actual database query results, the method comprising:
determining, by the data cache platform, probabilities of the pre-computed database query results being outdated based on the probabilistic model; detecting, by the data cache platform, an asynchronous real-time event that has a probabilistic influence on the discrepancies between the pre-computed database query results maintained in the data cache platform and presumed actual database query results; analyzing, at the data cache platform, whether the asynchronous real-time event is represented in the probabilistic model; amending, by the data cache platform, the probabilities of the pre-computed database query results being outdated if the asynchronous real-time events is determined to be not represented in the probabilistic model; automatically issuing, by the data cache platform, re-computation orders to the computation platform for updating the pre-computed database query results based on the probabilities of the pre-computed database query results being outdated, wherein the pre-computed database query results having a probability of being outdated above a given threshold are ordered to be re-computed; and receiving, at the data cache platform, the updated pre-computed database query results from the computation platform in response to the re-computation orders. 26. The method of claim 25 wherein detecting the asynchronous real-time event and/or analyzing whether the asynchronous real-time event is represented in the probabilistic model comprises:
determining an accuracy of a portion of the pre-computed database query results maintained in the data cache platform, the portion of the pre-computed database query results being potentially affected by the asynchronous real-time event;
comparing the accuracy with a predicted accuracy of the portion of pre-computed database query results based on the probabilistic model; and
determining that the asynchronous real-time event is not represented in the probabilistic model if the accuracy is below the predicted accuracy to a given extent. 27. The method of claim 26 wherein determining the accuracy of the portion of pre-computed database query results comprises:
issuing sample re-computation orders to computation platform and comparing the results of the sample re-computation orders with the respective pre-computed database query results previously maintained in the data cache platform. 28. The method of claim 26 wherein the given extent is defined by a threshold value that is defined based on a historical reliability of the probabilistic model. 29. The method of claim 26 wherein amending the determined probabilities of the pre-computed database query results comprises:
decreasing the probabilities of the pre-computed database query results in the portion to the accuracy of the portion. 30. The method of claim 25 further comprising:
for real-time events which are determined to be not represented in the probabilistic model, issuing re-computation orders regarding the pre-computed database query results that are potentially affected. 31. The method of claim 25 further comprising:
for real-time events that are determined to be represented in the probabilistic model, accumulating such real-time events over a certain period of time, comparing the actually occurred and accumulated real-time events with their representation in the probabilistic model and, if the actually occurred accumulated real-time events deviate from their representation in the probabilistic model to a predetermined extent, issuing re-computation orders with respect to potentially affected pre-computed database query results. 32. The method of claim 25 wherein the data cache platform, when determining the probabilities of the pre-computed database query results of being outdated and issuing the re-computation, considers grids of pre-computed database query results corresponding to groups of adjacent sets of data maintained in the computation platform. 33. The method of claim 25 wherein the data cache platform issues the re-computation orders based on an amount of available computation resources at the computation platform. 34. The method of claim 25 wherein the distributed database system is a travel reservation system, the computation platform maintains information on travel availability and fares, and the data cache platform maintains priced travel recommendations calculated from the information on travel availability and the fares. 35. The method of claim 34 wherein the real-time events are selected from the group consisting of flight fare changes, airplane seat availability changes, client flight ticket requests, and flight cancellations. 36. The method of claim 34 wherein the distributed database system comprises at least one application platform connected to the computation platform, the at least one application platform configured to maintain and organize the pre-computed database query results, and the database query results stored in the at least one application platform being populated and/or updated by the computation platform as a result of the re-computation orders issued by the data cache platform. 37. A computer program product comprising:
a computer readable storage medium; and program code stored on the computer readable storage medium and configured, upon execution, to cause at least one processor to: maintain a probabilistic model that models discrepancies between pre-computed database query results maintained in a data cache platform and presumed actual database query results; determine probabilities of the pre-computed database query results being outdated based on the probabilistic model; detect an asynchronous real-time event that has a probabilistic influence on the discrepancies between the pre-computed database query results maintained in the data cache platform and presumed actual database query results; analyze whether the asynchronous real-time event is represented in the probabilistic model; amend the probabilities of the pre-computed database query results being outdated if the asynchronous real-time events is determined to be not represented in the probabilistic model; automatically issue re-computation orders to a computation platform for updating the pre-computed database query results based on the probabilities of the pre-computed database query results being outdated, wherein the pre-computed database query results having a probability of being outdated above a given threshold are ordered to be re-computed; and receive the updated pre-computed database query results from the computation platform in response to the re-computation orders. | 2,100 |
4,521 | 11,934,759 | 2,159 | A method, system and computer program product for managing source annotation metadata. The metadata management technique may include maintaining a set of metadata, maintaining data/metadata relationships between individual units of the metadata and individual units of the source data, and maintaining metadata/metadata relationships between individual units of the metadata. The metadata/metadata relationships define two or more intersecting search pathways through the metadata that intersect at one or more metadata units belonging to more than one search domain. | 1. A method for managing source annotation metadata, comprising:
maintaining a set of metadata comprising source data annotation information; maintaining data/metadata relationships between individual units of said metadata and individual units of said source data; maintaining metadata/metadata relationships between individual units of said metadata; and said metadata/metadata relationships defining two or more intersecting search pathways through said metadata that intersect at one or more of said metadata units belonging to more than one search domain. 2. A method in accordance with claim 1, wherein said data/metadata relationships are arbitrarily defined and include statically defined data/metadata relationships and dynamically defined data/metadata relationships based on regular expressions. 3. A method in accordance with claim 1, wherein said metadata/metadata relationships are arbitrarily defined. 4. A method in accordance with claim 1, wherein said metadata units are maintained by metadata containers, each of said metadata containers comprising:
a context tag that defines one of said data/metadata relationships; a hierarchy tag that defines one of said metadata/metadata relationships; a category tag that represent an extension of said hierarchy tag and defines a category to which said metadata unit belongs; a custom tag that defines an additional metadata/metadata relationship; and data identifying said metadata unit. 5. A method in accordance with claim 4, wherein said metadata containers are organized for searching said context tags, said hierarchy tags, said category tags and said custom tags. 6. A method in accordance with claim 4, wherein said metadata containers are organized in a database that maintains key indices on said context tags, said hierarchy tags, said category tags and said custom tags. 7. A method in accordance with claim 5, further including providing a metadata navigation interface by displaying said hierarchy tags and said custom tags for plural metadata containers as selectable items that can be selected to display said category tags, and wherein said category tags can be selected to display said metadata units, said source data or both. 8. A data processing system for managing source annotation metadata, comprising:
a data processor; a source data store storing source data; a metadata store storing a set of metadata comprising source data annotation information; data/metadata relationship tags in said metadata store defining data/metadata relationships between individual units of said metadata and individual units of said source data; metadata/metadata relationship tags in said metadata store defining metadata/metadata relationships between individual units of said metadata; and said metadata/metadata relationships defining two or more intersecting search pathways through said metadata that intersect at one or more of said metadata units belonging to more than one search domain. 9. A system in accordance with claim 8, wherein said data/metadata relationships are arbitrarily defined and include statically defined data/metadata relationships and dynamically defined data/metadata relationships based on regular expressions. 10. A system in accordance with claim 8, wherein said metadata/metadata relationships are arbitrarily defined. 11. A system in accordance with claim 1, wherein said metadata units are maintained by metadata containers in said metadata store, each of said metadata containers comprising:
a context tag that defines one of said data/metadata relationships; a hierarchy tag that defines one of said metadata/metadata relationships; a category tag that represents an extension of said hierarchy tag and defines a category to which said metadata unit belongs; a custom tag that defines an additional metadata/metadata relationship; and data identifying said metadata unit. 12. A system in accordance with claim 11, wherein said metadata containers are organized for searching said context tags, said hierarchy tags, said category tags and said custom tags. 13. A system in accordance with claim 11, wherein said metadata containers are organized in a database that maintains key indices on said context tags, said hierarchy tags, said category tags and said custom tags. 14. A system in accordance with claim 12, further including a navigation interface that displays said hierarchy tags and said custom tags for plural metadata containers as selectable items that can be selected to display said category tags, and wherein said category tags can be selected to display said metadata units, said source data or both. 15. A computer program product, comprising:
one or more computer useable media; means associated with said computer useable media for programming a data processing platform to manage source annotation metadata, as by: maintaining a set of metadata comprising source data annotation information; maintaining data/metadata relationships between individual units of said metadata and individual units of said source data; maintaining metadata/metadata relationships between individual units of said metadata; and said metadata/metadata relationships defining two or more intersecting search pathways through said metadata that intersect at one or more of said metadata units belonging to more than one search domain. 16. A computer program product in accordance with claim 15, wherein said data/metadata relationships are arbitrarily defined and include statically defined data/metadata relationships and dynamically defined data/metadata relationships based on regular expressions. 17. A computer program product in accordance with claim 15, wherein said metadata/metadata relationships are arbitrarily defined. 18. A computer program product in accordance with claim 15, wherein said metadata units are maintained by metadata containers, each of said metadata containers comprising:
a context tag that defines one or more of said data/metadata relationships; a hierarchy tag that defines one of said metadata/metadata relationships; a category tag that represents an extension of said hierarchy tag and defines a category to which said metadata unit belongs; a custom tag that defines an additional metadata/metadata relationship; and data identifying said metadata unit. 19. A computer program product in accordance with claim 18, wherein said metadata containers are organized for searching said context tags, said hierarchy tags, said category tags and said custom tags. 20. A computer program product in accordance with claim 18, wherein said metadata containers are organized in a database that maintains key indices on said context tags, said hierarchy tags, said category tags and said custom tags. 21. A computer program product in accordance with claim 18, further including providing a metadata navigation interface by displaying said hierarchy tags and said custom tags for plural metadata containers as selectable items that can be selected to display said category tags, and wherein said category tags can be selected to display said metadata units, said source data or both. 22. A method for managing source annotation information, comprising:
maintaining a set of metadata containers representing metadata for one or more source data files; each of said metadata containers comprising: a context tag that defines a data/metadata relationship between said source data and said metadata container; a hierarchy tag that defines a metadata/metadata relationship between said metadata container and another metadata container; a category tag that defines a metadata category associated with said hierarchy tag; and associated metadata; organizing said hierarchy tags of said metadata containers for searching; and generating a metadata navigation interface comprising hierarchy displays that display said hierarchy tags as selectable items that can be selected to generate category displays that display said category tags as selectable items that can be selected to generate metadata displays that display said metadata, said metadata and said source data, or said source data, depending on a user input. 23. A method in accordance with claim 22 wherein said navigation interface comprises a user mode for searching said metadata containers and an administrative mode for editing said metadata containers. 24. A computer program product, comprising:
one or more computer useable media; means associated with said computer useable media for programming a data processing platform to manage source annotation metadata, as by: maintaining a set of metadata containers representing metadata for one or more source data files; each of said metadata containers being associated with a storage entity comprising a unit of metadata information, and comprising: a context tag that associates said metadata container with an arbitrary range of said source data; a hierarchy tag therein that defines a metadata/metadata relationship between said metadata container and another metadata container; and a category tag that defines a metadata category associated with said hierarchy tag; and organizing said hierarchy tags for searching. 25. A computer program product in accordance with claim 24 wherein said arbitrary ranges of source data include at least one range that is nested within another range. | A method, system and computer program product for managing source annotation metadata. The metadata management technique may include maintaining a set of metadata, maintaining data/metadata relationships between individual units of the metadata and individual units of the source data, and maintaining metadata/metadata relationships between individual units of the metadata. The metadata/metadata relationships define two or more intersecting search pathways through the metadata that intersect at one or more metadata units belonging to more than one search domain.1. A method for managing source annotation metadata, comprising:
maintaining a set of metadata comprising source data annotation information; maintaining data/metadata relationships between individual units of said metadata and individual units of said source data; maintaining metadata/metadata relationships between individual units of said metadata; and said metadata/metadata relationships defining two or more intersecting search pathways through said metadata that intersect at one or more of said metadata units belonging to more than one search domain. 2. A method in accordance with claim 1, wherein said data/metadata relationships are arbitrarily defined and include statically defined data/metadata relationships and dynamically defined data/metadata relationships based on regular expressions. 3. A method in accordance with claim 1, wherein said metadata/metadata relationships are arbitrarily defined. 4. A method in accordance with claim 1, wherein said metadata units are maintained by metadata containers, each of said metadata containers comprising:
a context tag that defines one of said data/metadata relationships; a hierarchy tag that defines one of said metadata/metadata relationships; a category tag that represent an extension of said hierarchy tag and defines a category to which said metadata unit belongs; a custom tag that defines an additional metadata/metadata relationship; and data identifying said metadata unit. 5. A method in accordance with claim 4, wherein said metadata containers are organized for searching said context tags, said hierarchy tags, said category tags and said custom tags. 6. A method in accordance with claim 4, wherein said metadata containers are organized in a database that maintains key indices on said context tags, said hierarchy tags, said category tags and said custom tags. 7. A method in accordance with claim 5, further including providing a metadata navigation interface by displaying said hierarchy tags and said custom tags for plural metadata containers as selectable items that can be selected to display said category tags, and wherein said category tags can be selected to display said metadata units, said source data or both. 8. A data processing system for managing source annotation metadata, comprising:
a data processor; a source data store storing source data; a metadata store storing a set of metadata comprising source data annotation information; data/metadata relationship tags in said metadata store defining data/metadata relationships between individual units of said metadata and individual units of said source data; metadata/metadata relationship tags in said metadata store defining metadata/metadata relationships between individual units of said metadata; and said metadata/metadata relationships defining two or more intersecting search pathways through said metadata that intersect at one or more of said metadata units belonging to more than one search domain. 9. A system in accordance with claim 8, wherein said data/metadata relationships are arbitrarily defined and include statically defined data/metadata relationships and dynamically defined data/metadata relationships based on regular expressions. 10. A system in accordance with claim 8, wherein said metadata/metadata relationships are arbitrarily defined. 11. A system in accordance with claim 1, wherein said metadata units are maintained by metadata containers in said metadata store, each of said metadata containers comprising:
a context tag that defines one of said data/metadata relationships; a hierarchy tag that defines one of said metadata/metadata relationships; a category tag that represents an extension of said hierarchy tag and defines a category to which said metadata unit belongs; a custom tag that defines an additional metadata/metadata relationship; and data identifying said metadata unit. 12. A system in accordance with claim 11, wherein said metadata containers are organized for searching said context tags, said hierarchy tags, said category tags and said custom tags. 13. A system in accordance with claim 11, wherein said metadata containers are organized in a database that maintains key indices on said context tags, said hierarchy tags, said category tags and said custom tags. 14. A system in accordance with claim 12, further including a navigation interface that displays said hierarchy tags and said custom tags for plural metadata containers as selectable items that can be selected to display said category tags, and wherein said category tags can be selected to display said metadata units, said source data or both. 15. A computer program product, comprising:
one or more computer useable media; means associated with said computer useable media for programming a data processing platform to manage source annotation metadata, as by: maintaining a set of metadata comprising source data annotation information; maintaining data/metadata relationships between individual units of said metadata and individual units of said source data; maintaining metadata/metadata relationships between individual units of said metadata; and said metadata/metadata relationships defining two or more intersecting search pathways through said metadata that intersect at one or more of said metadata units belonging to more than one search domain. 16. A computer program product in accordance with claim 15, wherein said data/metadata relationships are arbitrarily defined and include statically defined data/metadata relationships and dynamically defined data/metadata relationships based on regular expressions. 17. A computer program product in accordance with claim 15, wherein said metadata/metadata relationships are arbitrarily defined. 18. A computer program product in accordance with claim 15, wherein said metadata units are maintained by metadata containers, each of said metadata containers comprising:
a context tag that defines one or more of said data/metadata relationships; a hierarchy tag that defines one of said metadata/metadata relationships; a category tag that represents an extension of said hierarchy tag and defines a category to which said metadata unit belongs; a custom tag that defines an additional metadata/metadata relationship; and data identifying said metadata unit. 19. A computer program product in accordance with claim 18, wherein said metadata containers are organized for searching said context tags, said hierarchy tags, said category tags and said custom tags. 20. A computer program product in accordance with claim 18, wherein said metadata containers are organized in a database that maintains key indices on said context tags, said hierarchy tags, said category tags and said custom tags. 21. A computer program product in accordance with claim 18, further including providing a metadata navigation interface by displaying said hierarchy tags and said custom tags for plural metadata containers as selectable items that can be selected to display said category tags, and wherein said category tags can be selected to display said metadata units, said source data or both. 22. A method for managing source annotation information, comprising:
maintaining a set of metadata containers representing metadata for one or more source data files; each of said metadata containers comprising: a context tag that defines a data/metadata relationship between said source data and said metadata container; a hierarchy tag that defines a metadata/metadata relationship between said metadata container and another metadata container; a category tag that defines a metadata category associated with said hierarchy tag; and associated metadata; organizing said hierarchy tags of said metadata containers for searching; and generating a metadata navigation interface comprising hierarchy displays that display said hierarchy tags as selectable items that can be selected to generate category displays that display said category tags as selectable items that can be selected to generate metadata displays that display said metadata, said metadata and said source data, or said source data, depending on a user input. 23. A method in accordance with claim 22 wherein said navigation interface comprises a user mode for searching said metadata containers and an administrative mode for editing said metadata containers. 24. A computer program product, comprising:
one or more computer useable media; means associated with said computer useable media for programming a data processing platform to manage source annotation metadata, as by: maintaining a set of metadata containers representing metadata for one or more source data files; each of said metadata containers being associated with a storage entity comprising a unit of metadata information, and comprising: a context tag that associates said metadata container with an arbitrary range of said source data; a hierarchy tag therein that defines a metadata/metadata relationship between said metadata container and another metadata container; and a category tag that defines a metadata category associated with said hierarchy tag; and organizing said hierarchy tags for searching. 25. A computer program product in accordance with claim 24 wherein said arbitrary ranges of source data include at least one range that is nested within another range. | 2,100 |
4,522 | 14,313,743 | 2,171 | An approach is provided to display a grid user-interface on a display. The grid user-interface includes a number of medium-sized windows that are displayed in a grid format. Each of the medium-sized windows has a substantially common width and a substantially common height to the other medium-sized windows. The system receives a mixed-mode request from a user. The mixed-mode request corresponds to a selected application that is displayed in one of the medium-sized windows. A second user-interface is displayed in response to receiving the mixed-mode request. The selected application is displayed in a large window and a plurality of small-sized windows is displayed adjacent to the large window. Each of the small-sized windows also has a substantially common width and a substantially common height to the other small-sized windows. | 1. A device, comprising:
a display; a processor; a memory accessible to the processor and bearing instructions executable by the processor to: present a grid user-interface on the display, wherein the grid user-interface includes a plurality of medium-sized windows presented in a grid format, wherein the medium-sized windows represent respective applications, a first medium-sized window representing a first application requiring entry of authentication data to use the first application, wherein responsive to selection of the first medium-sized window the first medium-sized window animates to change its appearance to present at least one authentication data entry field; receive a mixed-mode request corresponding to a selected application that is presented in one of the plurality of medium-sized windows; and present a second user-interface display in response to receiving the mixed-mode request wherein the selected application is presented in a large window and a plurality of small-sized windows is presented adjacent to the large window, wherein each of the small-sized windows is smaller than a medium-sized window. 2. The device of claim 1, wherein the instructions are executable to:
receive a full-screen mode request corresponding to the selected application that is presented in one of the plurality of medium-sized windows in the grid user-interface; and present a full-screen user-interface on the display in response to receiving the full-screen mode request, wherein the selected application is presented in a substantially full-screen and wherein the plurality of medium-sized windows is removed from the display. 3. The device of claim 1, wherein the instructions are executable to:
present an icon ribbon in the grid user-interface that includes a first set of icons selected from the plurality of icons, wherein each of the icons in the first set of icons corresponds to an available application; present one or more ribbon scroll graphic user interface (GUI) controls adjacent to the icon ribbon that, when selected, scroll through a second set of icons selected from the plurality of icons, wherein each of the icons in the second set of icons corresponds to an available application. 4. The device of claim 3, wherein the instructions are executable to:
receive a selection corresponding to one of the plurality of icons presented in the icon ribbon; execute a software application corresponding to the selected icon; and present a software application graphical interface corresponding to the executed software application in one of the medium-sized windows. 5. The device of claim 1, wherein the instructions are executable to:
present a GUI scroll control proximate to the grid user-interface; receive a scroll request at the GUI scroll control; and present a second plurality of medium-sized windows in the grid user-interface in response to receiving the scroll request, wherein the second plurality of medium-sized windows inhibits presentation of two or more of the medium-sized windows included in the plurality of medium-sized windows. 6. The device of claim 1, wherein the instructions are executable to:
present a GUI scroll control proximate to the small-sized windows when the second user interface is presented; receive a scroll request at the GUI scroll control; and present a second plurality of small-sized windows in the second user-interface in response to receiving the scroll request, wherein the second plurality of small-sized windows inhibits presentation of at least one of the small-sized windows included in the plurality of small-sized windows. 7. The device of claim 1, wherein the first window when presenting authentication data appears in an inverted format from other medium-sized windows in the grid user-interface. 8. A method, comprising:
presenting a grid user-interface on a display, wherein the grid user-interface includes a plurality of medium-sized windows presented in a grid format, wherein the medium-sized windows represent respective applications, a first medium-sized window representing a first application requiring entry of authentication data to use the first application, wherein responsive to selection of the first medium-sized window the first medium-sized window animates to change its appearance to present at least one authentication data entry field; receiving a mixed-mode request corresponding to a selected application that is presented in one of the plurality of medium-sized windows; and presenting a second user-interface display in response to receiving the mixed-mode request wherein the selected application is presented in a large window and a plurality of small-sized windows is presented adjacent to the large window, wherein each of the small-sized windows is smaller than a medium-sized window. 9. The method of claim 8, comprising:
receiving a full-screen mode request corresponding to the selected application that is presented in one of the plurality of medium-sized windows in the grid user-interface; and presenting a full-screen user-interface on the display in response to receiving the full-screen mode request, wherein the selected application is presented in a substantially full-screen and wherein the plurality of medium-sized windows is removed from the display. 10. The method of claim 8, comprising:
presenting an icon ribbon in the grid user-interface that includes a first set of icons selected from the plurality of icons, wherein each of the icons in the first set of icons corresponds to an available application; presenting one or more ribbon scroll graphic user interface (GUI) controls adjacent to the icon ribbon that, when selected, scroll through a second set of icons selected from the plurality of icons, wherein each of the icons in the second set of icons corresponds to an available application. 11. The method of claim 10, comprising:
receiving a selection corresponding to one of the plurality of icons presented in the icon ribbon; executing a software application corresponding to the selected icon; and presenting a software application graphical interface corresponding to the executed software application in one of the medium-sized windows. 12. The method of claim 8, comprising:
presenting a GUI scroll control proximate to the grid user-interface; receiving a scroll request at the GUI scroll control; and presenting a second plurality of medium-sized windows in the grid user-interface in response to receiving the scroll request, wherein the second plurality of medium-sized windows inhibits presentation of two or more of the medium-sized windows included in the plurality of medium-sized windows. 13. The method of claim 8, comprising:
presenting a GUI scroll control proximate to the small-sized windows when the second user interface is presented; receiving a scroll request at the GUI scroll control; and presenting a second plurality of small-sized windows in the second user-interface in response to receiving the scroll request, wherein the second plurality of small-sized windows inhibits presentation of at least one of the small-sized windows included in the plurality of small-sized windows. 14. The method of claim 8, wherein the first window when presenting authentication data appears in an inverted format from other medium-sized windows in the grid user-interface. 15. A computer readable storage medium that is not a carrier wave, the computer readable storage medium bearing instructions executable by a processor to:
present a grid user-interface on a display, wherein the grid user-interface includes a plurality of medium-sized windows presented in a grid format, wherein the medium-sized windows represent respective applications, a first medium-sized window representing a first application requiring entry of authentication data to use the first application, wherein responsive to selection of the first medium-sized window the first medium-sized window animates to change its appearance to present at least one authentication data entry field; receive a mixed-mode request corresponding to a selected application that is presented in one of the plurality of medium-sized windows; and present a second user-interface display in response to receiving the mixed-mode request wherein the selected application is presented in a large window and a plurality of small-sized windows is presented adjacent to the large window, wherein each of the small-sized windows is smaller than a medium-sized window. 16. The computer readable storage medium of claim 15, wherein the instructions are executable to:
receive a full-screen mode request corresponding to the selected application that is presented in one of the plurality of medium-sized windows in the grid user-interface; and present a full-screen user-interface on the display in response to receiving the full-screen mode request, wherein the selected application is presented in a substantially full-screen and wherein the plurality of medium-sized windows is removed from the display. 17. The computer readable storage medium of claim 15, wherein the instructions are executable to:
present an icon ribbon in the grid user-interface that includes a first set of icons selected from the plurality of icons, wherein each of the icons in the first set of icons corresponds to an available application; present one or more ribbon scroll graphic user interface (GUI) controls adjacent to the icon ribbon that, when selected, scroll through a second set of icons selected from the plurality of icons, wherein each of the icons in the second set of icons corresponds to an available application. 18. The computer readable storage medium of claim 17, wherein the instructions are executable to:
receive a selection corresponding to one of the plurality of icons presented in the icon ribbon; execute a software application corresponding to the selected icon; and present a software application graphical interface corresponding to the executed software application in one of the medium-sized windows. 19. The computer readable storage medium of claim 15, wherein the instructions are executable to:
present a GUI scroll control proximate to the grid user-interface; receive a scroll request at the GUI scroll control; and present a second plurality of medium-sized windows in the grid user-interface in response to receiving the scroll request, wherein the second plurality of medium-sized windows inhibits presentation of two or more of the medium-sized windows included in the plurality of medium-sized windows. 20. The computer readable storage medium of claim 15, wherein the instructions are executable to:
present a GUI scroll control proximate to the small-sized windows when the second user interface is presented; receive a scroll request at the GUI scroll control; and present a second plurality of small-sized windows in the second user-interface in response to receiving the scroll request, wherein the second plurality of small-sized windows inhibits presentation of at least one of the small-sized windows included in the plurality of small-sized windows. | An approach is provided to display a grid user-interface on a display. The grid user-interface includes a number of medium-sized windows that are displayed in a grid format. Each of the medium-sized windows has a substantially common width and a substantially common height to the other medium-sized windows. The system receives a mixed-mode request from a user. The mixed-mode request corresponds to a selected application that is displayed in one of the medium-sized windows. A second user-interface is displayed in response to receiving the mixed-mode request. The selected application is displayed in a large window and a plurality of small-sized windows is displayed adjacent to the large window. Each of the small-sized windows also has a substantially common width and a substantially common height to the other small-sized windows.1. A device, comprising:
a display; a processor; a memory accessible to the processor and bearing instructions executable by the processor to: present a grid user-interface on the display, wherein the grid user-interface includes a plurality of medium-sized windows presented in a grid format, wherein the medium-sized windows represent respective applications, a first medium-sized window representing a first application requiring entry of authentication data to use the first application, wherein responsive to selection of the first medium-sized window the first medium-sized window animates to change its appearance to present at least one authentication data entry field; receive a mixed-mode request corresponding to a selected application that is presented in one of the plurality of medium-sized windows; and present a second user-interface display in response to receiving the mixed-mode request wherein the selected application is presented in a large window and a plurality of small-sized windows is presented adjacent to the large window, wherein each of the small-sized windows is smaller than a medium-sized window. 2. The device of claim 1, wherein the instructions are executable to:
receive a full-screen mode request corresponding to the selected application that is presented in one of the plurality of medium-sized windows in the grid user-interface; and present a full-screen user-interface on the display in response to receiving the full-screen mode request, wherein the selected application is presented in a substantially full-screen and wherein the plurality of medium-sized windows is removed from the display. 3. The device of claim 1, wherein the instructions are executable to:
present an icon ribbon in the grid user-interface that includes a first set of icons selected from the plurality of icons, wherein each of the icons in the first set of icons corresponds to an available application; present one or more ribbon scroll graphic user interface (GUI) controls adjacent to the icon ribbon that, when selected, scroll through a second set of icons selected from the plurality of icons, wherein each of the icons in the second set of icons corresponds to an available application. 4. The device of claim 3, wherein the instructions are executable to:
receive a selection corresponding to one of the plurality of icons presented in the icon ribbon; execute a software application corresponding to the selected icon; and present a software application graphical interface corresponding to the executed software application in one of the medium-sized windows. 5. The device of claim 1, wherein the instructions are executable to:
present a GUI scroll control proximate to the grid user-interface; receive a scroll request at the GUI scroll control; and present a second plurality of medium-sized windows in the grid user-interface in response to receiving the scroll request, wherein the second plurality of medium-sized windows inhibits presentation of two or more of the medium-sized windows included in the plurality of medium-sized windows. 6. The device of claim 1, wherein the instructions are executable to:
present a GUI scroll control proximate to the small-sized windows when the second user interface is presented; receive a scroll request at the GUI scroll control; and present a second plurality of small-sized windows in the second user-interface in response to receiving the scroll request, wherein the second plurality of small-sized windows inhibits presentation of at least one of the small-sized windows included in the plurality of small-sized windows. 7. The device of claim 1, wherein the first window when presenting authentication data appears in an inverted format from other medium-sized windows in the grid user-interface. 8. A method, comprising:
presenting a grid user-interface on a display, wherein the grid user-interface includes a plurality of medium-sized windows presented in a grid format, wherein the medium-sized windows represent respective applications, a first medium-sized window representing a first application requiring entry of authentication data to use the first application, wherein responsive to selection of the first medium-sized window the first medium-sized window animates to change its appearance to present at least one authentication data entry field; receiving a mixed-mode request corresponding to a selected application that is presented in one of the plurality of medium-sized windows; and presenting a second user-interface display in response to receiving the mixed-mode request wherein the selected application is presented in a large window and a plurality of small-sized windows is presented adjacent to the large window, wherein each of the small-sized windows is smaller than a medium-sized window. 9. The method of claim 8, comprising:
receiving a full-screen mode request corresponding to the selected application that is presented in one of the plurality of medium-sized windows in the grid user-interface; and presenting a full-screen user-interface on the display in response to receiving the full-screen mode request, wherein the selected application is presented in a substantially full-screen and wherein the plurality of medium-sized windows is removed from the display. 10. The method of claim 8, comprising:
presenting an icon ribbon in the grid user-interface that includes a first set of icons selected from the plurality of icons, wherein each of the icons in the first set of icons corresponds to an available application; presenting one or more ribbon scroll graphic user interface (GUI) controls adjacent to the icon ribbon that, when selected, scroll through a second set of icons selected from the plurality of icons, wherein each of the icons in the second set of icons corresponds to an available application. 11. The method of claim 10, comprising:
receiving a selection corresponding to one of the plurality of icons presented in the icon ribbon; executing a software application corresponding to the selected icon; and presenting a software application graphical interface corresponding to the executed software application in one of the medium-sized windows. 12. The method of claim 8, comprising:
presenting a GUI scroll control proximate to the grid user-interface; receiving a scroll request at the GUI scroll control; and presenting a second plurality of medium-sized windows in the grid user-interface in response to receiving the scroll request, wherein the second plurality of medium-sized windows inhibits presentation of two or more of the medium-sized windows included in the plurality of medium-sized windows. 13. The method of claim 8, comprising:
presenting a GUI scroll control proximate to the small-sized windows when the second user interface is presented; receiving a scroll request at the GUI scroll control; and presenting a second plurality of small-sized windows in the second user-interface in response to receiving the scroll request, wherein the second plurality of small-sized windows inhibits presentation of at least one of the small-sized windows included in the plurality of small-sized windows. 14. The method of claim 8, wherein the first window when presenting authentication data appears in an inverted format from other medium-sized windows in the grid user-interface. 15. A computer readable storage medium that is not a carrier wave, the computer readable storage medium bearing instructions executable by a processor to:
present a grid user-interface on a display, wherein the grid user-interface includes a plurality of medium-sized windows presented in a grid format, wherein the medium-sized windows represent respective applications, a first medium-sized window representing a first application requiring entry of authentication data to use the first application, wherein responsive to selection of the first medium-sized window the first medium-sized window animates to change its appearance to present at least one authentication data entry field; receive a mixed-mode request corresponding to a selected application that is presented in one of the plurality of medium-sized windows; and present a second user-interface display in response to receiving the mixed-mode request wherein the selected application is presented in a large window and a plurality of small-sized windows is presented adjacent to the large window, wherein each of the small-sized windows is smaller than a medium-sized window. 16. The computer readable storage medium of claim 15, wherein the instructions are executable to:
receive a full-screen mode request corresponding to the selected application that is presented in one of the plurality of medium-sized windows in the grid user-interface; and present a full-screen user-interface on the display in response to receiving the full-screen mode request, wherein the selected application is presented in a substantially full-screen and wherein the plurality of medium-sized windows is removed from the display. 17. The computer readable storage medium of claim 15, wherein the instructions are executable to:
present an icon ribbon in the grid user-interface that includes a first set of icons selected from the plurality of icons, wherein each of the icons in the first set of icons corresponds to an available application; present one or more ribbon scroll graphic user interface (GUI) controls adjacent to the icon ribbon that, when selected, scroll through a second set of icons selected from the plurality of icons, wherein each of the icons in the second set of icons corresponds to an available application. 18. The computer readable storage medium of claim 17, wherein the instructions are executable to:
receive a selection corresponding to one of the plurality of icons presented in the icon ribbon; execute a software application corresponding to the selected icon; and present a software application graphical interface corresponding to the executed software application in one of the medium-sized windows. 19. The computer readable storage medium of claim 15, wherein the instructions are executable to:
present a GUI scroll control proximate to the grid user-interface; receive a scroll request at the GUI scroll control; and present a second plurality of medium-sized windows in the grid user-interface in response to receiving the scroll request, wherein the second plurality of medium-sized windows inhibits presentation of two or more of the medium-sized windows included in the plurality of medium-sized windows. 20. The computer readable storage medium of claim 15, wherein the instructions are executable to:
present a GUI scroll control proximate to the small-sized windows when the second user interface is presented; receive a scroll request at the GUI scroll control; and present a second plurality of small-sized windows in the second user-interface in response to receiving the scroll request, wherein the second plurality of small-sized windows inhibits presentation of at least one of the small-sized windows included in the plurality of small-sized windows. | 2,100 |
4,523 | 14,104,822 | 2,159 | Embodiments of the present invention provide a method for generating a terminal log and a terminal. The method includes: obtaining sensor information and/or use information of a mobile terminal; generating first log information according to the sensor information and/or the use information; receiving second log information input by a user; and combining the first log information with the second log information to generate terminal log information; the terminal may receive modification information input by the user and update the first log information according to the modification information. In the embodiments of the present invention, by obtaining related information, a log is automatically generated; and in combination with a modification of a user and a log written by the user, it is ensured that log content required by the user is accurately obtained. | 1. A method for generating a terminal log, comprising:
obtaining at least one of sensor information and use information of a mobile terminal; generating first log information according to the at least one of the sensor information and the use information; receiving second log information input by a user; and combining the first log information with the second log information to generate terminal log information. 2. The method according to claim 1, wherein combining the first log information with the second log information to generate the terminal log information comprises:
generating the terminal log information according to at least one of a time sequence and content correlation of content recorded by the first log information and the second log information. 3. The method according to claim 1, wherein after generating the first log information according to the at least one of the sensor information and the use information, the method further comprises:
receiving modification information input by the user; and updating the first log information according to the modification information. 4. The method according to claim 3, wherein the sensor information comprises any one of the following information or a combination of multiple of the following information: acceleration information of the terminal, location information of the terminal, and direction information of the terminal. 5. The method according to claim 3, wherein the use information comprises any one of the following information or a combination of multiple of the following information: call record information, short message record information, network connection information of the terminal, and system process information of the terminal. 6. The method according to claim 3, wherein generating the first log information according to the at least one of the sensor information and the use information comprises:
obtaining at least one of an activity and an event of the user, by performing analysis using a set analysis policy according to the at least one of the sensor information and the use information; and generating the first log information for describing the at least one of the activity and the event of the user by using a set generation policy according to the at least one of the activity and the event of the user obtained by performing the analysis using the set analysis policy. 7. The method according to claim 6, wherein after updating the first log information according to the modification information, the method further comprises:
comparing the modification information with the first log information before the updating; and adjusting at least one of the set analysis policy and the set generation policy according to a result of the comparing. 8. A terminal, comprising:
an obtaining module, configured to obtain at least one of sensor information and use information of the terminal; a generating module, configured to generate first log information according to the at least one of the sensor information and the use information; a first receiving module, configured to receive second log information input by a user; and a combining module, configured to combine the first log information with the second log information to generate terminal log information. 9. The terminal according to claim 8, wherein the combining module is configured to generate the terminal log information according to at least one of a time sequence and content correlation of content recorded by the first log information and the second log information. 10. The terminal according to claim 8, further comprising:
a second receiving module, configured to receive modification information input by the user; and an updating module, configured to update the first log information according to the modification information. 11. The terminal according to claim 10, wherein the sensor information comprises any one of the following information or a combination of multiple of the following information: acceleration information of the terminal, location information of the terminal, and direction information of the terminal. 12. The terminal according to claim 10, wherein the use information comprises any one of the following information or a combination of multiple of the following information:
call record information, short message record information, network connection information of the terminal, and system process information of the terminal. 13. The terminal according to claim 10, wherein the generating module is configured to obtain at least one of an activity and an event of the user by performing analysis using a set analysis policy according to the at least one of the sensor information and the use information; and
generating the first log information for describing the at least one of the activity and the event of the user by using a set generation policy according to the at least one of the activity and the event of the user obtained by performing the analysis using the set analysis policy. 14. The terminal according to claim 13, further comprising:
a comparing module, configured to compare the modification information with the first log information before the updating; and an adjusting module, configured to adjust at least one of the set analysis policy and the set generation policy according to a result of the comparing. 15. A terminal, comprising:
a receiver, configured to: obtain at least one of sensor information and use information of the terminal; and, configured to receive second log information input by a user; and a processor, configured to generate first log information according to the at least one of the sensor information and the use information; and, configured to combine the first log information with the second log information to generate terminal log information. 16. The terminal according to claim 15, wherein the processor is further configured to generate the terminal log information according to at least one of a time sequence and content correlation of content recorded by the first log information and the second log information. 17. The terminal according to claim 15, wherein the receiver is further configured to receive modification information input by the user; and
the processor is further configured to update the first log information according to the modification information. 18. The terminal according to claim 17, wherein the sensor information that the receiver is configured to obtain comprises any one of the following information or a combination of multiple of the following information: acceleration information of the terminal, location information of the terminal, and direction information of the terminal. 19. The terminal according to claim 17, wherein the use information that the receiver is configured to obtain comprises any one of the following information or a combination of multiple of the following information: call record information, short message record information, network connection information of the terminal, and system process information of the terminal. 20. The terminal according to claim 17, wherein the processor is further configured to obtain at least one of an activity and an event of the user by performing analysis using a set analysis policy according to the at least one type of the sensor information and the user use information; and
generating the first log information for describing the at least one of the activity and the event of the user by using a set generation policy according to the at least one of the activity and the event of the user obtained by performing the analysis using a set analysis policy. 21. The terminal according to claim 20, wherein the processor is further configured to:
compare the modification information with the first log information before the updating; and adjust at least one of the set analysis policy and the generation policy according to a result of the comparing. | Embodiments of the present invention provide a method for generating a terminal log and a terminal. The method includes: obtaining sensor information and/or use information of a mobile terminal; generating first log information according to the sensor information and/or the use information; receiving second log information input by a user; and combining the first log information with the second log information to generate terminal log information; the terminal may receive modification information input by the user and update the first log information according to the modification information. In the embodiments of the present invention, by obtaining related information, a log is automatically generated; and in combination with a modification of a user and a log written by the user, it is ensured that log content required by the user is accurately obtained.1. A method for generating a terminal log, comprising:
obtaining at least one of sensor information and use information of a mobile terminal; generating first log information according to the at least one of the sensor information and the use information; receiving second log information input by a user; and combining the first log information with the second log information to generate terminal log information. 2. The method according to claim 1, wherein combining the first log information with the second log information to generate the terminal log information comprises:
generating the terminal log information according to at least one of a time sequence and content correlation of content recorded by the first log information and the second log information. 3. The method according to claim 1, wherein after generating the first log information according to the at least one of the sensor information and the use information, the method further comprises:
receiving modification information input by the user; and updating the first log information according to the modification information. 4. The method according to claim 3, wherein the sensor information comprises any one of the following information or a combination of multiple of the following information: acceleration information of the terminal, location information of the terminal, and direction information of the terminal. 5. The method according to claim 3, wherein the use information comprises any one of the following information or a combination of multiple of the following information: call record information, short message record information, network connection information of the terminal, and system process information of the terminal. 6. The method according to claim 3, wherein generating the first log information according to the at least one of the sensor information and the use information comprises:
obtaining at least one of an activity and an event of the user, by performing analysis using a set analysis policy according to the at least one of the sensor information and the use information; and generating the first log information for describing the at least one of the activity and the event of the user by using a set generation policy according to the at least one of the activity and the event of the user obtained by performing the analysis using the set analysis policy. 7. The method according to claim 6, wherein after updating the first log information according to the modification information, the method further comprises:
comparing the modification information with the first log information before the updating; and adjusting at least one of the set analysis policy and the set generation policy according to a result of the comparing. 8. A terminal, comprising:
an obtaining module, configured to obtain at least one of sensor information and use information of the terminal; a generating module, configured to generate first log information according to the at least one of the sensor information and the use information; a first receiving module, configured to receive second log information input by a user; and a combining module, configured to combine the first log information with the second log information to generate terminal log information. 9. The terminal according to claim 8, wherein the combining module is configured to generate the terminal log information according to at least one of a time sequence and content correlation of content recorded by the first log information and the second log information. 10. The terminal according to claim 8, further comprising:
a second receiving module, configured to receive modification information input by the user; and an updating module, configured to update the first log information according to the modification information. 11. The terminal according to claim 10, wherein the sensor information comprises any one of the following information or a combination of multiple of the following information: acceleration information of the terminal, location information of the terminal, and direction information of the terminal. 12. The terminal according to claim 10, wherein the use information comprises any one of the following information or a combination of multiple of the following information:
call record information, short message record information, network connection information of the terminal, and system process information of the terminal. 13. The terminal according to claim 10, wherein the generating module is configured to obtain at least one of an activity and an event of the user by performing analysis using a set analysis policy according to the at least one of the sensor information and the use information; and
generating the first log information for describing the at least one of the activity and the event of the user by using a set generation policy according to the at least one of the activity and the event of the user obtained by performing the analysis using the set analysis policy. 14. The terminal according to claim 13, further comprising:
a comparing module, configured to compare the modification information with the first log information before the updating; and an adjusting module, configured to adjust at least one of the set analysis policy and the set generation policy according to a result of the comparing. 15. A terminal, comprising:
a receiver, configured to: obtain at least one of sensor information and use information of the terminal; and, configured to receive second log information input by a user; and a processor, configured to generate first log information according to the at least one of the sensor information and the use information; and, configured to combine the first log information with the second log information to generate terminal log information. 16. The terminal according to claim 15, wherein the processor is further configured to generate the terminal log information according to at least one of a time sequence and content correlation of content recorded by the first log information and the second log information. 17. The terminal according to claim 15, wherein the receiver is further configured to receive modification information input by the user; and
the processor is further configured to update the first log information according to the modification information. 18. The terminal according to claim 17, wherein the sensor information that the receiver is configured to obtain comprises any one of the following information or a combination of multiple of the following information: acceleration information of the terminal, location information of the terminal, and direction information of the terminal. 19. The terminal according to claim 17, wherein the use information that the receiver is configured to obtain comprises any one of the following information or a combination of multiple of the following information: call record information, short message record information, network connection information of the terminal, and system process information of the terminal. 20. The terminal according to claim 17, wherein the processor is further configured to obtain at least one of an activity and an event of the user by performing analysis using a set analysis policy according to the at least one type of the sensor information and the user use information; and
generating the first log information for describing the at least one of the activity and the event of the user by using a set generation policy according to the at least one of the activity and the event of the user obtained by performing the analysis using a set analysis policy. 21. The terminal according to claim 20, wherein the processor is further configured to:
compare the modification information with the first log information before the updating; and adjust at least one of the set analysis policy and the generation policy according to a result of the comparing. | 2,100 |
4,524 | 14,780,389 | 2,135 | A computing system is disclosed herein. The computing system includes a computing node and a remote memory node coupled to the computing node via a system fabric. The computing node includes a plurality of processors and a master memory controller. The master memory controller is external to the plurality of processors. The master memory controller routes requests corresponding to requests from the plurality of processors across the system fabric to the remote memory node and returns a response. | 1. A computing system, comprising:
a computing node comprising:
a plurality of processors; and
a master memory controller, the master memory controller external to the plurality of processors; and
a remote memory node coupled to the computing node via a system fabric, wherein the master memory controller routes a request corresponding to a request from the plurality of processors across the system fabric to the remote memory node and returns a response. 2. The computing system of claim 1, wherein the plurality of processors interacts with the remote memory node as local memory via the master memory controller. 3. The computing system of claim 1, wherein when the master memory controller receives a request from a processor to access memory local to the processor, the master memory controller fulfills the request within the computing node. 4. The computing system of claim 1, wherein the master memory controller isolates remote memory node errors from the plurality of processors by filtering error messages received from the remote memory node. 5. The computing system of claim 1, wherein the remote memory node comprises memory coupled to a slave memory controller and wherein the master memory controller routes requests to the slave memory controller. 6. A method, comprising:
receiving, in an external memory controller, a request from a processor to access memory; routing a request corresponding to the request from the processor across a system fabric to a remote memory; and returning a response to the processor. 7. The method of claim 6, returning the response comprising returning one of a notice of completion, an error notice, data accessed from the remote memory, or a combination thereof. 8. The method of claim 6, the processor residing in a CPU package and the external memory controller residing externally to the CPU package. 9. The method of claim 6, comprising accessing locally stored data prior to routing the request across the system fabric. 10. The method of claim 6, further comprising filtering error messages to isolate remote memory errors from the processors. 11. The method of claim 6, routing the request comprising routing the request across the system fabric to a memory controller coupled to the remote memory. 12. A system for accessing memory, comprising:
a master memory controller to receive requests from a plurality of processors, the master memory controller external to the processors; a slave memory controller communicably coupled to the master memory controller via a system fabric; and a memory, remote from the processors, coupled to the slave memory controller, wherein the master memory controller routes requests corresponding to the requests from the plurality of processors to the slave memory controller to access the remote memory. 13. The system of claim 12, wherein the plurality of processors comprises a CPU package, and wherein the master memory controller is external to the CPU package. 14. The system of claim 12, wherein the plurality of processors perceives the memory remote from the processors as local memory by communicating via the master memory controller. 15. The system of claim 12, wherein the requests from the processors comprise coherent transactions, and wherein the master memory controller communicates with the slave memory controller via non-coherent transactions, such that a coherency domain of the processors extends only to the master memory controller. | A computing system is disclosed herein. The computing system includes a computing node and a remote memory node coupled to the computing node via a system fabric. The computing node includes a plurality of processors and a master memory controller. The master memory controller is external to the plurality of processors. The master memory controller routes requests corresponding to requests from the plurality of processors across the system fabric to the remote memory node and returns a response.1. A computing system, comprising:
a computing node comprising:
a plurality of processors; and
a master memory controller, the master memory controller external to the plurality of processors; and
a remote memory node coupled to the computing node via a system fabric, wherein the master memory controller routes a request corresponding to a request from the plurality of processors across the system fabric to the remote memory node and returns a response. 2. The computing system of claim 1, wherein the plurality of processors interacts with the remote memory node as local memory via the master memory controller. 3. The computing system of claim 1, wherein when the master memory controller receives a request from a processor to access memory local to the processor, the master memory controller fulfills the request within the computing node. 4. The computing system of claim 1, wherein the master memory controller isolates remote memory node errors from the plurality of processors by filtering error messages received from the remote memory node. 5. The computing system of claim 1, wherein the remote memory node comprises memory coupled to a slave memory controller and wherein the master memory controller routes requests to the slave memory controller. 6. A method, comprising:
receiving, in an external memory controller, a request from a processor to access memory; routing a request corresponding to the request from the processor across a system fabric to a remote memory; and returning a response to the processor. 7. The method of claim 6, returning the response comprising returning one of a notice of completion, an error notice, data accessed from the remote memory, or a combination thereof. 8. The method of claim 6, the processor residing in a CPU package and the external memory controller residing externally to the CPU package. 9. The method of claim 6, comprising accessing locally stored data prior to routing the request across the system fabric. 10. The method of claim 6, further comprising filtering error messages to isolate remote memory errors from the processors. 11. The method of claim 6, routing the request comprising routing the request across the system fabric to a memory controller coupled to the remote memory. 12. A system for accessing memory, comprising:
a master memory controller to receive requests from a plurality of processors, the master memory controller external to the processors; a slave memory controller communicably coupled to the master memory controller via a system fabric; and a memory, remote from the processors, coupled to the slave memory controller, wherein the master memory controller routes requests corresponding to the requests from the plurality of processors to the slave memory controller to access the remote memory. 13. The system of claim 12, wherein the plurality of processors comprises a CPU package, and wherein the master memory controller is external to the CPU package. 14. The system of claim 12, wherein the plurality of processors perceives the memory remote from the processors as local memory by communicating via the master memory controller. 15. The system of claim 12, wherein the requests from the processors comprise coherent transactions, and wherein the master memory controller communicates with the slave memory controller via non-coherent transactions, such that a coherency domain of the processors extends only to the master memory controller. | 2,100 |
4,525 | 14,514,795 | 2,165 | Embodiments relate to distributed processing of data on a distributed database computer system. An aspect includes distributing rows of an arbitrary matrix to all of a plurality of processing units, wherein a number of the rows is equal to a number of the processing units, wherein one row of the arbitrary matrix is stored in each storage memory. Another aspect includes executing a first user defined function (UDF) on each processing unit, wherein a Cartesian product of each processing parameter matrix and the row of the arbitrary matrix is calculated on each processing unit and the matrix set is stored in the processor memory of each processing unit; and executing a second UDF on each processing unit having at least one data record after the executing of the first UDF, wherein all data records stored in the storage memory of the each processing unit are processed one by one. | 1. A computer implemented method for distributed processing of data on a distributed database computer system, the method comprising:
distributing rows of an arbitrary matrix to all of a plurality of processing units, wherein a number of the rows is equal to a number of the processing units, wherein a matrix set is used to calculate a value set corresponding to each data record by using said data record as input, the matrix set comprising at least one processing parameter matrix, the value set comprising at least one calculation value, the distributed database computer system comprising the plurality of processing units connected in a share-nothing parallel processing architecture, wherein each processing unit comprises a processor of the each processing unit, a processor memory of the each processing unit, and a storage memory of the each processing unit, wherein the arbitrary matrix is stored in the distributed data base in a way that one row of the arbitrary matrix is stored in each storage memory, wherein the data records and the matrix set are stored in a distributed database using the storage memories, each processor is being operable for executing user defined functions (UDFs), calculating the value set corresponding to only one data record at a time, executing transaction processing, storing data in the processor memory, and using the data stored in the processor memory for execution of the UDFs within a framework of one transaction; and performing transaction processing in a framework of one transaction by:
executing a first UDF on each processing unit, wherein a Cartesian product of the each processing parameter matrix and the row of the arbitrary matrix is calculated on each processing unit and as a result thereof the matrix set is stored in the processor memory of each processing unit; and
executing a second UDF on each processing unit having at least one data record after the executing of the first UDF, wherein a number of repetitive executions of the second UDF on each processing unit is equal to the number of the data records stored in the storage memory of the each processing unit and all data records stored in the storage memory of the each processing unit are processed one by one, wherein the value set corresponding to the data record is calculated using the matrix set stored in the processor memory of said respective processing unit. 2. The method of claim 1, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of a link function of a generalized linear model, wherein the matrix set comprises the following processing parameter matrices: a metadata matrix, a predictor-to-parameter correlation matrix, and a beta coefficient matrix, wherein the metadata matrix determines a type of the link function and a distribution function used in said link function, the predictor-to-parameter correlation matrix determining correlation between each calculation value of the value set and the corresponding data record in said link function, wherein the predictor-to-parameter correlation matrix comprises rows of the predictor-to-parameter correlation matrix and each row of the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of the beta coefficient matrix in said link function. 3. The method of claim 1, wherein the distributed database is a Standard Query Language (SQL) distributed database, wherein the first UDF is one or more first SQL UDFs, wherein the second UDF is a second SQL UDF, wherein each first SQL UDF is performed by cross joining of the arbitrary matrix with one or more processing parameter matrices within a SQL query of the each first SQL UDF, wherein the second SQL UDF is performed by querying the data record in the distributed database within a SQL query of the second SQL UDF and after the querying of the data record in the distributed database causing the processor of the processing unit to calculate the value set corresponding to said data record within said SQL query of the second SQL UDF, wherein said processing unit comprises the storage memory comprising said data record. 4. The method of claim 1, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of link functions, wherein each link function is a link function of a unique generalized linear model, wherein each link function generates the corresponding portion of the calculation values of the value set, wherein the matrix set comprises the flowing sets of the processing parameter matrixes: a metadata matrix set, a predictor-to-parameter correlation matrix set, and a beta coefficient matrix set, wherein the metadata matrix set comprises at least one metadata matrix, wherein the predictor-to-parameter correlation matrix set comprises at least one predictor-to-parameter correlation matrix, wherein the beta coefficient matrix set comprises at least one beta coefficient matrix, wherein each generalized linear model has a unique combination of one metadata matrix of the metadata matrix set, one predictor-to-parameter correlation matrix of the predictor-to-parameter correlation matrix set, and one beta coefficient matrix of the beta coefficient matrix set, wherein the metadata matrix of each generalized linear model determines a type of the link function of the each generalized linear model and a distribution function used in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model determines correlation between each calculation value of the portion of the calculation values and the corresponding data record in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model comprises rows of said the predictor-to-parameter correlation matrix and each row of said the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of a beta coefficient matrix of the each generalized linear model in the link function of the each generalized linear model. 5. The method of claim 1, wherein the data records are linear arrays of data values. 6. The method of claim 1, wherein at least one processing parameter matrix is a linear array of processing parameter values. 7. A computer program product for distributed processing of data on a distributed database computer system, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:
distributing rows of an arbitrary matrix to all of a plurality of processing units, wherein a number of the rows is equal to a number of the processing units, wherein a matrix set is used to calculate a value set corresponding to each data record by using said data record as input, the matrix set comprising at least one processing parameter matrix, the value set comprising at least one calculation value, the distributed database computer system comprising the plurality of processing units connected in a share-nothing parallel processing architecture, wherein each processing unit comprises a processor of the each processing unit, a processor memory of the each processing unit, and a storage memory of the each processing unit, wherein the arbitrary matrix is stored in the distributed data base in a way that one row of the arbitrary matrix is stored in each storage memory, wherein the data records and the matrix set are stored in a distributed database using the storage memories, each processor is being operable for executing user defined functions (UDFs), calculating the value set corresponding to only one data record at a time, executing transaction processing, storing data in the processor memory, and using the data stored in the processor memory for execution of the UDFs within a framework of one transaction; and performing transaction processing in a framework of one transaction by:
executing a first UDF on each processing unit, wherein a Cartesian product of the each processing parameter matrix and the row of the arbitrary matrix is calculated on each processing unit and as a result thereof the matrix set is stored in the processor memory of each processing unit; and
executing a second UDF on each processing unit having at least one data record after the executing of the first UDF, wherein a number of repetitive executions of the second UDF on each processing unit is equal to the number of the data records stored in the storage memory of the each processing unit and all data records stored in the storage memory of the each processing unit are processed one by one, wherein the value set corresponding to the data record is calculated using the matrix set stored in the processor memory of said respective processing unit. 8. The computer program product of claim 7, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of a link function of a generalized linear model, wherein the matrix set comprises the following processing parameter matrices: a metadata matrix, a predictor-to-parameter correlation matrix, and a beta coefficient matrix, wherein the metadata matrix determines a type of the link function and a distribution function used in said link function, the predictor-to-parameter correlation matrix determining correlation between each calculation value of the value set and the corresponding data record in said link function, wherein the predictor-to-parameter correlation matrix comprises rows of the predictor-to-parameter correlation matrix and each row of the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of the beta coefficient matrix in said link function. 9. The computer program product of claim 7, wherein the distributed database is a Standard Query Language (SQL) distributed database, wherein the first UDF is one or more first SQL UDFs, wherein the second UDF is a second SQL UDF, wherein each first SQL UDF is performed by cross joining of the arbitrary matrix with one or more processing parameter matrices within a SQL query of the each first SQL UDF, wherein the second SQL UDF is performed by querying the data record in the distributed database within a SQL query of the second SQL UDF and after the querying of the data record in the distributed database causing the processor of the processing unit to calculate the value set corresponding to said data record within said SQL query of the second SQL UDF, wherein said processing unit comprises the storage memory comprising said data record. 10. The computer program product of claim 7, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of link functions, wherein each link function is a link function of a unique generalized linear model, wherein each link function generates the corresponding portion of the calculation values of the value set, wherein the matrix set comprises the flowing sets of the processing parameter matrixes: a metadata matrix set, a predictor-to-parameter correlation matrix set, and a beta coefficient matrix set, wherein the metadata matrix set comprises at least one metadata matrix, wherein the predictor-to-parameter correlation matrix set comprises at least one predictor-to-parameter correlation matrix, wherein the beta coefficient matrix set comprises at least one beta coefficient matrix, wherein each generalized linear model has a unique combination of one metadata matrix of the metadata matrix set, one predictor-to-parameter correlation matrix of the predictor-to-parameter correlation matrix set, and one beta coefficient matrix of the beta coefficient matrix set, wherein the metadata matrix of each generalized linear model determines a type of the link function of the each generalized linear model and a distribution function used in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model determines correlation between each calculation value of the portion of the calculation values and the corresponding data record in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model comprises rows of said the predictor-to-parameter correlation matrix and each row of said the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of a beta coefficient matrix of the each generalized linear model in the link function of the each generalized linear model. 11. The computer program product of claim 7, wherein the data records are linear arrays of data values. 12. The computer program product of claim 7, wherein at least one processing parameter matrix is a linear array of processing parameter values. 13. A computer system distributed processing of data on a distributed database computer system, the system comprising:
a memory; and a processor, communicatively coupled to said memory, the computer system configured to perform a method comprising: distributing rows of an arbitrary matrix to all of a plurality of processing units, wherein a number of the rows is equal to a number of the processing units, wherein a matrix set is used to calculate a value set corresponding to each data record by using said data record as input, the matrix set comprising at least one processing parameter matrix, the value set comprising at least one calculation value, the distributed database computer system comprising the plurality of processing units connected in a share-nothing parallel processing architecture, wherein each processing unit comprises a processor of the each processing unit, a processor memory of the each processing unit, and a storage memory of the each processing unit, wherein the arbitrary matrix is stored in the distributed data base in a way that one row of the arbitrary matrix is stored in each storage memory, wherein the data records and the matrix set are stored in a distributed database using the storage memories, each processor is being operable for executing user defined functions (UDFs), calculating the value set corresponding to only one data record at a time, executing transaction processing, storing data in the processor memory, and using the data stored in the processor memory for execution of the UDFs within a framework of one transaction; and performing transaction processing in a framework of one transaction by:
executing a first UDF on each processing unit, wherein a Cartesian product of the each processing parameter matrix and the row of the arbitrary matrix is calculated on each processing unit and as a result thereof the matrix set is stored in the processor memory of each processing unit; and
executing a second UDF on each processing unit having at least one data record after the executing of the first UDF, wherein a number of repetitive executions of the second UDF on each processing unit is equal to the number of the data records stored in the storage memory of the each processing unit and all data records stored in the storage memory of the each processing unit are processed one by one, wherein the value set corresponding to the data record is calculated using the matrix set stored in the processor memory of said respective processing unit. 14. The system of claim 13, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of a link function of a generalized linear model, wherein the matrix set comprises the following processing parameter matrices: a metadata matrix, a predictor-to-parameter correlation matrix, and a beta coefficient matrix, wherein the metadata matrix determines a type of the link function and a distribution function used in said link function, the predictor-to-parameter correlation matrix determining correlation between each calculation value of the value set and the corresponding data record in said link function, wherein the predictor-to-parameter correlation matrix comprises rows of the predictor-to-parameter correlation matrix and each row of the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of the beta coefficient matrix in said link function. 15. The system of claim 13, wherein the distributed database is a Standard Query Language (SQL) distributed database, wherein the first UDF is one or more first SQL UDFs, wherein the second UDF is a second SQL UDF, wherein each first SQL UDF is performed by cross joining of the arbitrary matrix with one or more processing parameter matrices within a SQL query of the each first SQL UDF, wherein the second SQL UDF is performed by querying the data record in the distributed database within a SQL query of the second SQL UDF and after the querying of the data record in the distributed database causing the processor of the processing unit to calculate the value set corresponding to said data record within said SQL query of the second SQL UDF, wherein said processing unit comprises the storage memory comprising said data record. 16. The system of claim 13, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of link functions, wherein each link function is a link function of a unique generalized linear model, wherein each link function generates the corresponding portion of the calculation values of the value set, wherein the matrix set comprises the flowing sets of the processing parameter matrixes: a metadata matrix set, a predictor-to-parameter correlation matrix set, and a beta coefficient matrix set, wherein the metadata matrix set comprises at least one metadata matrix, wherein the predictor-to-parameter correlation matrix set comprises at least one predictor-to-parameter correlation matrix, wherein the beta coefficient matrix set comprises at least one beta coefficient matrix, wherein each generalized linear model has a unique combination of one metadata matrix of the metadata matrix set, one predictor-to-parameter correlation matrix of the predictor-to-parameter correlation matrix set, and one beta coefficient matrix of the beta coefficient matrix set, wherein the metadata matrix of each generalized linear model determines a type of the link function of the each generalized linear model and a distribution function used in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model determines correlation between each calculation value of the portion of the calculation values and the corresponding data record in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model comprises rows of said the predictor-to-parameter correlation matrix and each row of said the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of a beta coefficient matrix of the each generalized linear model in the link function of the each generalized linear model. 17. The system of claim 13, wherein the data records are linear arrays of data values. 18. The system of claim 13, wherein at least one processing parameter matrix is a linear array of processing parameter values. | Embodiments relate to distributed processing of data on a distributed database computer system. An aspect includes distributing rows of an arbitrary matrix to all of a plurality of processing units, wherein a number of the rows is equal to a number of the processing units, wherein one row of the arbitrary matrix is stored in each storage memory. Another aspect includes executing a first user defined function (UDF) on each processing unit, wherein a Cartesian product of each processing parameter matrix and the row of the arbitrary matrix is calculated on each processing unit and the matrix set is stored in the processor memory of each processing unit; and executing a second UDF on each processing unit having at least one data record after the executing of the first UDF, wherein all data records stored in the storage memory of the each processing unit are processed one by one.1. A computer implemented method for distributed processing of data on a distributed database computer system, the method comprising:
distributing rows of an arbitrary matrix to all of a plurality of processing units, wherein a number of the rows is equal to a number of the processing units, wherein a matrix set is used to calculate a value set corresponding to each data record by using said data record as input, the matrix set comprising at least one processing parameter matrix, the value set comprising at least one calculation value, the distributed database computer system comprising the plurality of processing units connected in a share-nothing parallel processing architecture, wherein each processing unit comprises a processor of the each processing unit, a processor memory of the each processing unit, and a storage memory of the each processing unit, wherein the arbitrary matrix is stored in the distributed data base in a way that one row of the arbitrary matrix is stored in each storage memory, wherein the data records and the matrix set are stored in a distributed database using the storage memories, each processor is being operable for executing user defined functions (UDFs), calculating the value set corresponding to only one data record at a time, executing transaction processing, storing data in the processor memory, and using the data stored in the processor memory for execution of the UDFs within a framework of one transaction; and performing transaction processing in a framework of one transaction by:
executing a first UDF on each processing unit, wherein a Cartesian product of the each processing parameter matrix and the row of the arbitrary matrix is calculated on each processing unit and as a result thereof the matrix set is stored in the processor memory of each processing unit; and
executing a second UDF on each processing unit having at least one data record after the executing of the first UDF, wherein a number of repetitive executions of the second UDF on each processing unit is equal to the number of the data records stored in the storage memory of the each processing unit and all data records stored in the storage memory of the each processing unit are processed one by one, wherein the value set corresponding to the data record is calculated using the matrix set stored in the processor memory of said respective processing unit. 2. The method of claim 1, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of a link function of a generalized linear model, wherein the matrix set comprises the following processing parameter matrices: a metadata matrix, a predictor-to-parameter correlation matrix, and a beta coefficient matrix, wherein the metadata matrix determines a type of the link function and a distribution function used in said link function, the predictor-to-parameter correlation matrix determining correlation between each calculation value of the value set and the corresponding data record in said link function, wherein the predictor-to-parameter correlation matrix comprises rows of the predictor-to-parameter correlation matrix and each row of the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of the beta coefficient matrix in said link function. 3. The method of claim 1, wherein the distributed database is a Standard Query Language (SQL) distributed database, wherein the first UDF is one or more first SQL UDFs, wherein the second UDF is a second SQL UDF, wherein each first SQL UDF is performed by cross joining of the arbitrary matrix with one or more processing parameter matrices within a SQL query of the each first SQL UDF, wherein the second SQL UDF is performed by querying the data record in the distributed database within a SQL query of the second SQL UDF and after the querying of the data record in the distributed database causing the processor of the processing unit to calculate the value set corresponding to said data record within said SQL query of the second SQL UDF, wherein said processing unit comprises the storage memory comprising said data record. 4. The method of claim 1, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of link functions, wherein each link function is a link function of a unique generalized linear model, wherein each link function generates the corresponding portion of the calculation values of the value set, wherein the matrix set comprises the flowing sets of the processing parameter matrixes: a metadata matrix set, a predictor-to-parameter correlation matrix set, and a beta coefficient matrix set, wherein the metadata matrix set comprises at least one metadata matrix, wherein the predictor-to-parameter correlation matrix set comprises at least one predictor-to-parameter correlation matrix, wherein the beta coefficient matrix set comprises at least one beta coefficient matrix, wherein each generalized linear model has a unique combination of one metadata matrix of the metadata matrix set, one predictor-to-parameter correlation matrix of the predictor-to-parameter correlation matrix set, and one beta coefficient matrix of the beta coefficient matrix set, wherein the metadata matrix of each generalized linear model determines a type of the link function of the each generalized linear model and a distribution function used in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model determines correlation between each calculation value of the portion of the calculation values and the corresponding data record in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model comprises rows of said the predictor-to-parameter correlation matrix and each row of said the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of a beta coefficient matrix of the each generalized linear model in the link function of the each generalized linear model. 5. The method of claim 1, wherein the data records are linear arrays of data values. 6. The method of claim 1, wherein at least one processing parameter matrix is a linear array of processing parameter values. 7. A computer program product for distributed processing of data on a distributed database computer system, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:
distributing rows of an arbitrary matrix to all of a plurality of processing units, wherein a number of the rows is equal to a number of the processing units, wherein a matrix set is used to calculate a value set corresponding to each data record by using said data record as input, the matrix set comprising at least one processing parameter matrix, the value set comprising at least one calculation value, the distributed database computer system comprising the plurality of processing units connected in a share-nothing parallel processing architecture, wherein each processing unit comprises a processor of the each processing unit, a processor memory of the each processing unit, and a storage memory of the each processing unit, wherein the arbitrary matrix is stored in the distributed data base in a way that one row of the arbitrary matrix is stored in each storage memory, wherein the data records and the matrix set are stored in a distributed database using the storage memories, each processor is being operable for executing user defined functions (UDFs), calculating the value set corresponding to only one data record at a time, executing transaction processing, storing data in the processor memory, and using the data stored in the processor memory for execution of the UDFs within a framework of one transaction; and performing transaction processing in a framework of one transaction by:
executing a first UDF on each processing unit, wherein a Cartesian product of the each processing parameter matrix and the row of the arbitrary matrix is calculated on each processing unit and as a result thereof the matrix set is stored in the processor memory of each processing unit; and
executing a second UDF on each processing unit having at least one data record after the executing of the first UDF, wherein a number of repetitive executions of the second UDF on each processing unit is equal to the number of the data records stored in the storage memory of the each processing unit and all data records stored in the storage memory of the each processing unit are processed one by one, wherein the value set corresponding to the data record is calculated using the matrix set stored in the processor memory of said respective processing unit. 8. The computer program product of claim 7, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of a link function of a generalized linear model, wherein the matrix set comprises the following processing parameter matrices: a metadata matrix, a predictor-to-parameter correlation matrix, and a beta coefficient matrix, wherein the metadata matrix determines a type of the link function and a distribution function used in said link function, the predictor-to-parameter correlation matrix determining correlation between each calculation value of the value set and the corresponding data record in said link function, wherein the predictor-to-parameter correlation matrix comprises rows of the predictor-to-parameter correlation matrix and each row of the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of the beta coefficient matrix in said link function. 9. The computer program product of claim 7, wherein the distributed database is a Standard Query Language (SQL) distributed database, wherein the first UDF is one or more first SQL UDFs, wherein the second UDF is a second SQL UDF, wherein each first SQL UDF is performed by cross joining of the arbitrary matrix with one or more processing parameter matrices within a SQL query of the each first SQL UDF, wherein the second SQL UDF is performed by querying the data record in the distributed database within a SQL query of the second SQL UDF and after the querying of the data record in the distributed database causing the processor of the processing unit to calculate the value set corresponding to said data record within said SQL query of the second SQL UDF, wherein said processing unit comprises the storage memory comprising said data record. 10. The computer program product of claim 7, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of link functions, wherein each link function is a link function of a unique generalized linear model, wherein each link function generates the corresponding portion of the calculation values of the value set, wherein the matrix set comprises the flowing sets of the processing parameter matrixes: a metadata matrix set, a predictor-to-parameter correlation matrix set, and a beta coefficient matrix set, wherein the metadata matrix set comprises at least one metadata matrix, wherein the predictor-to-parameter correlation matrix set comprises at least one predictor-to-parameter correlation matrix, wherein the beta coefficient matrix set comprises at least one beta coefficient matrix, wherein each generalized linear model has a unique combination of one metadata matrix of the metadata matrix set, one predictor-to-parameter correlation matrix of the predictor-to-parameter correlation matrix set, and one beta coefficient matrix of the beta coefficient matrix set, wherein the metadata matrix of each generalized linear model determines a type of the link function of the each generalized linear model and a distribution function used in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model determines correlation between each calculation value of the portion of the calculation values and the corresponding data record in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model comprises rows of said the predictor-to-parameter correlation matrix and each row of said the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of a beta coefficient matrix of the each generalized linear model in the link function of the each generalized linear model. 11. The computer program product of claim 7, wherein the data records are linear arrays of data values. 12. The computer program product of claim 7, wherein at least one processing parameter matrix is a linear array of processing parameter values. 13. A computer system distributed processing of data on a distributed database computer system, the system comprising:
a memory; and a processor, communicatively coupled to said memory, the computer system configured to perform a method comprising: distributing rows of an arbitrary matrix to all of a plurality of processing units, wherein a number of the rows is equal to a number of the processing units, wherein a matrix set is used to calculate a value set corresponding to each data record by using said data record as input, the matrix set comprising at least one processing parameter matrix, the value set comprising at least one calculation value, the distributed database computer system comprising the plurality of processing units connected in a share-nothing parallel processing architecture, wherein each processing unit comprises a processor of the each processing unit, a processor memory of the each processing unit, and a storage memory of the each processing unit, wherein the arbitrary matrix is stored in the distributed data base in a way that one row of the arbitrary matrix is stored in each storage memory, wherein the data records and the matrix set are stored in a distributed database using the storage memories, each processor is being operable for executing user defined functions (UDFs), calculating the value set corresponding to only one data record at a time, executing transaction processing, storing data in the processor memory, and using the data stored in the processor memory for execution of the UDFs within a framework of one transaction; and performing transaction processing in a framework of one transaction by:
executing a first UDF on each processing unit, wherein a Cartesian product of the each processing parameter matrix and the row of the arbitrary matrix is calculated on each processing unit and as a result thereof the matrix set is stored in the processor memory of each processing unit; and
executing a second UDF on each processing unit having at least one data record after the executing of the first UDF, wherein a number of repetitive executions of the second UDF on each processing unit is equal to the number of the data records stored in the storage memory of the each processing unit and all data records stored in the storage memory of the each processing unit are processed one by one, wherein the value set corresponding to the data record is calculated using the matrix set stored in the processor memory of said respective processing unit. 14. The system of claim 13, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of a link function of a generalized linear model, wherein the matrix set comprises the following processing parameter matrices: a metadata matrix, a predictor-to-parameter correlation matrix, and a beta coefficient matrix, wherein the metadata matrix determines a type of the link function and a distribution function used in said link function, the predictor-to-parameter correlation matrix determining correlation between each calculation value of the value set and the corresponding data record in said link function, wherein the predictor-to-parameter correlation matrix comprises rows of the predictor-to-parameter correlation matrix and each row of the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of the beta coefficient matrix in said link function. 15. The system of claim 13, wherein the distributed database is a Standard Query Language (SQL) distributed database, wherein the first UDF is one or more first SQL UDFs, wherein the second UDF is a second SQL UDF, wherein each first SQL UDF is performed by cross joining of the arbitrary matrix with one or more processing parameter matrices within a SQL query of the each first SQL UDF, wherein the second SQL UDF is performed by querying the data record in the distributed database within a SQL query of the second SQL UDF and after the querying of the data record in the distributed database causing the processor of the processing unit to calculate the value set corresponding to said data record within said SQL query of the second SQL UDF, wherein said processing unit comprises the storage memory comprising said data record. 16. The system of claim 13, wherein the matrix set is used to calculate the value set corresponding to each data record by using said data record as input of link functions, wherein each link function is a link function of a unique generalized linear model, wherein each link function generates the corresponding portion of the calculation values of the value set, wherein the matrix set comprises the flowing sets of the processing parameter matrixes: a metadata matrix set, a predictor-to-parameter correlation matrix set, and a beta coefficient matrix set, wherein the metadata matrix set comprises at least one metadata matrix, wherein the predictor-to-parameter correlation matrix set comprises at least one predictor-to-parameter correlation matrix, wherein the beta coefficient matrix set comprises at least one beta coefficient matrix, wherein each generalized linear model has a unique combination of one metadata matrix of the metadata matrix set, one predictor-to-parameter correlation matrix of the predictor-to-parameter correlation matrix set, and one beta coefficient matrix of the beta coefficient matrix set, wherein the metadata matrix of each generalized linear model determines a type of the link function of the each generalized linear model and a distribution function used in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model determines correlation between each calculation value of the portion of the calculation values and the corresponding data record in the link function of the each generalized linear model, wherein the predictor-to-parameter correlation matrix of each generalized linear model comprises rows of said the predictor-to-parameter correlation matrix and each row of said the predictor-to-parameter correlation matrix is used in conjunction with a corresponding beta coefficient of a beta coefficient matrix of the each generalized linear model in the link function of the each generalized linear model. 17. The system of claim 13, wherein the data records are linear arrays of data values. 18. The system of claim 13, wherein at least one processing parameter matrix is a linear array of processing parameter values. | 2,100 |
4,526 | 13,516,443 | 2,121 | The present invention discloses a system and method for a morphological solution to the macroscopic problem of n-entropy (i.e. loss of control/information) of the prevailing global anarchy by super-augmenting a persona to manifest a pan-environment super-cyborg for global governance. Through a Christocratic Necked Service Oriented Architecture (CNSOA) model, the method of said system, categorizes the world people into two spaces, Bridespace and Christocratic-space. Each member or citizen of Bridespace and consenting Christocratic space is incorporated with Bridal Wedding Garments, namely holy goods & services & Necktie imitating Personal-Extender that includes a data processing device connected to a global network. Each member's Persona and proximity Meatspace are augmented by recasting the metaphoric environment of the data processor (network-is-the-supercomputer) as a Necktie Personal-Extender/Environment-Integrator. The ultimate objective of this invention is to provide a viable regulatory system for global governance to bring justice, peace and wealth for rightful people. With the Necktie Personal-Extender/Environment-Integrator that extends man into both space and time (eternal life) to solve all his problems, it is asserted that a union with the divine is achievable for all of mankind. | 1. A system and method for augmenting Persona for humans comprising the arranging of a user and a machine (including Super-Computers, Network-is-the-Super-Computer, etc) in a Head (or any part of the body) and a Extender/Environment-Integrator relationship, whereby said relationship produces synergy and said user's Persona is augmented 2. The system as claimed in claim 1, wherein said Personal-Extender/Environment-Integrator is a Necktie Imitation 3. The Necktie Imitation claimed in claim 2 includes pocket data processing device connected to a global network with handwriting, speech, gesture and image synthesizing/processing software, a camera on the forehead, an ear-phone with microphone and/or a projector 4. The method as claimed in claim 1, wherein the Personal-Extender/Environment-Integrator is implemented through black-box modernization technique whereby the general purpose data processor is reconfigured 5. The method as described in claim 2, wherein the Body part consists of space (Laborspace) available in the world including in Cyberspace, in which case Cyberspace may be layered over the Persona/Meatspace to achieve the desired result of augmentation/extension 6. A means, namely a Necked Service Oriented Architecture comprising of an Inverted Pyramidal Bridespace (Governance/Spiritual Support-space) and an Upright Pyramidal Christocratic-space (Governed Support-space) 7. A means, as claimed in claim 6 where the Necked Service Oriented Architecture has Christocratic governance 8. A means as claimed in claim 6 or claim 7, where control in the head and operation in the body is decussated between eastern and western regions of the earth, whereby control is achieved for the head as shown in FIG. 1B 9. A means as claimed in claim 6, where the greatest (most empowered) service of the inverted pyramid is below (i.e. in the (centre serving as a neck), and the greatest (most empowered) service in the upright pyramid is just below the neck (i.e. at the top of the upright pyramid), whereby the neck has supremacy both above through voluntary servitude in the inverted pyramid, and below in the upright pyramid after the fact (i.e. after manifestation of Super Cyborg) 10. A means as claimed in claim 9, where everyone (meaning, their Services represented with the suffix “space”) is assessed with said Service Selection Policy's Implementation Process and other custom set of assessments, ranked and placed in the Necked Service Oriented Architecture 11. A means as claimed in claim 10, where entropy is reduced through the said architecture whereby information from subordinates/superiors/Super-Augmented Persona is taken as sense perception (insight) i.e teleworking and telegovernance and thus reducing the said n-entropy, and the presentation of 7 plus or minus 2 units of information in the form of soft or hard units to the Ordinate Human Component at any given time or at any given node except when he is sleeping or taking rest, whereby it enables fewer resources to be present as we come closer to neck level from either below or above 12. An eThrone and method for manifestation of Pan-Environment Super Cyborgs, Global Cyborgic Conglomerate Super-humans or Christs comprising:
a. The rightful people space, namely Bridespace, arrived at using the Service-Selection-Policy's Implementation Process as shown in FIG. 3 b. Development of Necktie imitating Personal-Extender/Environment-Integrator shown in FIG. 2 c. A virtual wrapping of the membership/Citizenship of the said Global Cyborgic Conglomerate Christ/Superhuman with a global network of such apparatuses interconnected and fully integrated with all kinds of Goods and Services either supplied or procured through it by the membership/citizenship, which takes on an embodied cognition of having wrapped/clothed him with clean-linen cloth when it comes to Christ and no clothing when it comes to a Super-human d. And virtually tying-in the said wrapped-up body, which now consists of a plurality of metaphor objects of humans, systems, machines, organizations and other built environment using a computer and associated integration means e. Structuring the Christocratic Necked Service Oriented Architecture and a Lord's Necktie Personal-Extender/Environment-Integrator by way of ranking and placing each member in the architecture as claimed in claim 10 f. To result in a cognition through the said perception model of having tied a virtual Neck-tie around his (Cyborg's) neck and thus rendering or recasting the computer-Network as a Necktie-imitating Personal/Christ's Extender/Environment-Integrator that has the capability of bringing insight from below and above in the architecture as well as from everywhere else as claimed in claim 11 and perform tasks g. And also to result in a Super-Augmented Persona at the cross-section of the aforementioned “tied neck” in claim 12d by incorporating and employing all the members of Bridespace and Christocratic-space in the said Architecture, whereby governing of the new world order is made possible 13. The method claimed in claim 1, wherein it provides a morphological solution to the macroscopic problem of n-entropy i.e. loss of control/information in the global anarchy by super-augmenting a persona through the eThrone with the architecture as claimed in claim 12 to manifest a pan-environment super-cyborg for global governance. | The present invention discloses a system and method for a morphological solution to the macroscopic problem of n-entropy (i.e. loss of control/information) of the prevailing global anarchy by super-augmenting a persona to manifest a pan-environment super-cyborg for global governance. Through a Christocratic Necked Service Oriented Architecture (CNSOA) model, the method of said system, categorizes the world people into two spaces, Bridespace and Christocratic-space. Each member or citizen of Bridespace and consenting Christocratic space is incorporated with Bridal Wedding Garments, namely holy goods & services & Necktie imitating Personal-Extender that includes a data processing device connected to a global network. Each member's Persona and proximity Meatspace are augmented by recasting the metaphoric environment of the data processor (network-is-the-supercomputer) as a Necktie Personal-Extender/Environment-Integrator. The ultimate objective of this invention is to provide a viable regulatory system for global governance to bring justice, peace and wealth for rightful people. With the Necktie Personal-Extender/Environment-Integrator that extends man into both space and time (eternal life) to solve all his problems, it is asserted that a union with the divine is achievable for all of mankind.1. A system and method for augmenting Persona for humans comprising the arranging of a user and a machine (including Super-Computers, Network-is-the-Super-Computer, etc) in a Head (or any part of the body) and a Extender/Environment-Integrator relationship, whereby said relationship produces synergy and said user's Persona is augmented 2. The system as claimed in claim 1, wherein said Personal-Extender/Environment-Integrator is a Necktie Imitation 3. The Necktie Imitation claimed in claim 2 includes pocket data processing device connected to a global network with handwriting, speech, gesture and image synthesizing/processing software, a camera on the forehead, an ear-phone with microphone and/or a projector 4. The method as claimed in claim 1, wherein the Personal-Extender/Environment-Integrator is implemented through black-box modernization technique whereby the general purpose data processor is reconfigured 5. The method as described in claim 2, wherein the Body part consists of space (Laborspace) available in the world including in Cyberspace, in which case Cyberspace may be layered over the Persona/Meatspace to achieve the desired result of augmentation/extension 6. A means, namely a Necked Service Oriented Architecture comprising of an Inverted Pyramidal Bridespace (Governance/Spiritual Support-space) and an Upright Pyramidal Christocratic-space (Governed Support-space) 7. A means, as claimed in claim 6 where the Necked Service Oriented Architecture has Christocratic governance 8. A means as claimed in claim 6 or claim 7, where control in the head and operation in the body is decussated between eastern and western regions of the earth, whereby control is achieved for the head as shown in FIG. 1B 9. A means as claimed in claim 6, where the greatest (most empowered) service of the inverted pyramid is below (i.e. in the (centre serving as a neck), and the greatest (most empowered) service in the upright pyramid is just below the neck (i.e. at the top of the upright pyramid), whereby the neck has supremacy both above through voluntary servitude in the inverted pyramid, and below in the upright pyramid after the fact (i.e. after manifestation of Super Cyborg) 10. A means as claimed in claim 9, where everyone (meaning, their Services represented with the suffix “space”) is assessed with said Service Selection Policy's Implementation Process and other custom set of assessments, ranked and placed in the Necked Service Oriented Architecture 11. A means as claimed in claim 10, where entropy is reduced through the said architecture whereby information from subordinates/superiors/Super-Augmented Persona is taken as sense perception (insight) i.e teleworking and telegovernance and thus reducing the said n-entropy, and the presentation of 7 plus or minus 2 units of information in the form of soft or hard units to the Ordinate Human Component at any given time or at any given node except when he is sleeping or taking rest, whereby it enables fewer resources to be present as we come closer to neck level from either below or above 12. An eThrone and method for manifestation of Pan-Environment Super Cyborgs, Global Cyborgic Conglomerate Super-humans or Christs comprising:
a. The rightful people space, namely Bridespace, arrived at using the Service-Selection-Policy's Implementation Process as shown in FIG. 3 b. Development of Necktie imitating Personal-Extender/Environment-Integrator shown in FIG. 2 c. A virtual wrapping of the membership/Citizenship of the said Global Cyborgic Conglomerate Christ/Superhuman with a global network of such apparatuses interconnected and fully integrated with all kinds of Goods and Services either supplied or procured through it by the membership/citizenship, which takes on an embodied cognition of having wrapped/clothed him with clean-linen cloth when it comes to Christ and no clothing when it comes to a Super-human d. And virtually tying-in the said wrapped-up body, which now consists of a plurality of metaphor objects of humans, systems, machines, organizations and other built environment using a computer and associated integration means e. Structuring the Christocratic Necked Service Oriented Architecture and a Lord's Necktie Personal-Extender/Environment-Integrator by way of ranking and placing each member in the architecture as claimed in claim 10 f. To result in a cognition through the said perception model of having tied a virtual Neck-tie around his (Cyborg's) neck and thus rendering or recasting the computer-Network as a Necktie-imitating Personal/Christ's Extender/Environment-Integrator that has the capability of bringing insight from below and above in the architecture as well as from everywhere else as claimed in claim 11 and perform tasks g. And also to result in a Super-Augmented Persona at the cross-section of the aforementioned “tied neck” in claim 12d by incorporating and employing all the members of Bridespace and Christocratic-space in the said Architecture, whereby governing of the new world order is made possible 13. The method claimed in claim 1, wherein it provides a morphological solution to the macroscopic problem of n-entropy i.e. loss of control/information in the global anarchy by super-augmenting a persona through the eThrone with the architecture as claimed in claim 12 to manifest a pan-environment super-cyborg for global governance. | 2,100 |
4,527 | 12,826,335 | 2,168 | At least one unique collection of storage artifacts can be specified to indicate that the storage artifact is a member of the unique collection. Each storage artifact can be a discrete object comprising digitally encoded content that is stored as a node within a tree structure of a tangible storage medium. The collection can be referenced by a set of different storage artifacts to form a collection of related storage artifacts. Each storage artifact can correspond to different collections, wherein membership within a collection is independent of a storage path within the tree structure. A file management action relating to the storage artifact can be performed. The file management action can be dependent upon the storage artifact being a member of the unique collection. | 1. A method for establishing collections of storage artifacts comprising:
specifying at least one unique collection within metadata of a storage artifact to indicate that the storage artifact is a member of the unique collection, wherein the storage artifact is a discrete object comprising digitally encoded content that is stored as a node within a tree structure of a tangible storage medium, wherein the collection is able be referenced by a plurality of different storage artifacts to form a collection of related storage artifacts, wherein each storage artifact is able to correspond to a plurality of different collections, wherein membership of said collection is independent of a storage path within the tree structure used by the storage artifact that uniquely identifies the storage artifact; and performing a file management action relating to the storage artifact, wherein the file management action is dependent upon the storage artifact being a member of the unique collection. 2. The method of claim 1, further comprising:
updating the metadata of the storage artifact to indicate the storage artifact is no longer associated with the at least one unique collection; and responsive to the updating of the metadata, excluding the storage artifact from file management actions specific to the unique collection as said storage artifact is no longer a member of the unique collection. 3. The method of claim 1, wherein the at least one file management action is a search action that uses said unique collection as a search constraint. 4. The method of claim 1, wherein the at least one file management action is at least one of a delete action, a copy action, and a move action. 5. The method of claim 1, wherein said at least one file management action is triggered against a different storage artifact, which is also a member of the unique collection as indicated by metadata of said different storage artifact, wherein said at least one file management action is performed against all storage artifacts of the unique collection including said storage artifact and said different storage artifact. 6. The method of claim 1, further comprising:
receiving a user command to perform said at least one file management action against said storage artifact; determining that said storage artifact is a member of the unique collection by querying the metadata of the storage artifact; responsive to the determining, presenting an option to have the file management action performed against only the storage artifact or against all storage artifacts of the unique collection; when a response to the presenting indicates the file management action is to be against only the storage artifact, performing the file management action against only the storage artifact; and when a response to the presenting indicates the file management action is to be against all storage artifacts of the unique collection, performing the file management action against all the storage artifacts of the unique collection. 7. The method of claim 1, wherein said storage artifact is file managed by an operating system file manager, and wherein said storage artifact is stored within a non-volatile region of the tangible storage medium. 8. The method of claim 1, wherein said unique collection is associated with a collection specific file that is stored on the tangible storage. 9. The method of claim 1, wherein the unique collection is represented as a unique record of a collection table stored in a relational database system, wherein said collection table comprises a plurality of different records for different collections, each having a unique primary key, wherein said collection table is part of a database of the relational database system organized in third normal form. 10. The method of claim 1, further comprising:
specifying the unique collection within metadata of at least a second storage artifact and a third storage artifact, wherein the storage artifact, the second storage artifact and the third storage artifact belong to the unique collection, and wherein the first storage artifact, the second storage artifact, and the third storage artifact are heterogeneous files. 11. The method of claim 1, further comprising:
specifying the unique collection within metadata of at least a second storage artifact and a third storage artifact, wherein the storage artifact, the second storage artifact and the third storage artifact belong to the unique collection, and wherein the first storage artifact, the second storage artifact, and the third storage artifact are different file types that are associated with different applications. 12. The method of claim 1, wherein the unique collection is referenced by a plurality of different storage artifacts, wherein each of the different storage artifacts are associated with a numeric attribute that determines an order of the corresponding one of the different storage artifacts within the unique collection. 13. The method of claim 1, wherein the unique collection is referenced by a plurality of different storage artifacts, wherein each of the different storage artifacts are organized within a workflow that indicates which of the different storage artifacts must exist before subsequent ones of the different storage artifacts are to be created. 14. The method of claim 1, further comprising:
specifying a collection to be attached to an email message without explicitly specifying each storage artifact of the collection; determining the plurality of storage artifacts of the collection; responsive to the specifying, attaching each of the determined storage artifacts of the collection to the email message; and sending said email message. 15. The method of claim 1, further comprising:
selecting one of the storage artifacts belonging to a collection responsive to a user selection within a communication application; responsive to the selecting of the one storage artifact, determining a set of storage artifacts that belong to the collection, wherein the set comprises a plurality of different storage artifacts that have not been explicitly selected by a user; and responsive to the determining, conveying the set of storage artifacts to a remotely located computing device via the communication application. 16. The method of claim 1, further comprising:
representing for purposes of a file management system, each collection as a composite object, wherein file management actions actionable against each composite object comprise a copy action, a delete action, and a search action, each of which have a scope encompassing every storage artifact belonging to the collection that corresponds to the composite object. 17. The method of claim 16, wherein each user of a computing system has a user specific set of composite objects, each encapsulating individualized knowledge with respect to the set of storage artifacts associated with each composite object. 18. A computer program product comprising a computer readable storage medium having computer usable program code embodied therewith, the computer usable program code comprising:
computer usable program code stored in a tangible storage medium, when said computer usable program code is executed by a processor it is operable to specify at least one unique collection within metadata of a storage artifact to indicate that the storage artifact is a member of the unique collection, wherein the storage artifact is a discrete object comprising digitally encoded content that is stored as a node within a tree structure of a tangible storage medium, wherein the collection is able be referenced by a plurality of different storage artifacts to form a collection of related storage artifacts, wherein each storage artifact is able to correspond to a plurality of different collections, wherein membership of said collection is independent of a storage path within the tree structure used by the storage artifact that uniquely identifies the storage artifact; and computer usable program code stored in a tangible storage medium, when said computer usable program code is executed by a processor it is operable to perform a file management action relating to the storage artifact, wherein the file management action is dependent upon the storage artifact being a member of the unique collection. 19. A system comprising:
a tangible data store comprising a plurality of storage artifacts, wherein each of the storage artifacts is a discrete object comprising digitally encoded content that is stored as a node within a tree structure, wherein the storage artifacts are related to a plurality of different collections, wherein each collection is able to be referenced by a plurality of different storage artifacts and wherein each of the plurality of different storage artifacts is able to correspond to a plurality of different collections, wherein membership in a collection is independent of a storage path within the tree structure of each of the plurality of storage artifacts; and a storage artifact engine able to perform a plurality of file management actions against the storage artifacts, wherein said file management actions comprise an add action to add a storage artifact to a collection, a remove action to remove a storage artifact from a collection, and an edit action to modify specifics of an existing collection. 20. The system of claim 19, further comprising:
a graphical user interface through which any of the file management actions are able to be initiated by a user, wherein the graphical user interface comprises a file listing showing a set of files organized within a subnode of the tree structure, wherein for each set of files, a file name, at least one file property, and a collection that the file belongs to is shown. 21. The system of claim 19, said system representing for purposes of a file management system, each collection as a composite object, wherein file management actions actionable against each composite object comprise a copy action, a delete action, and a search action, each of which have a scope encompassing every storage artifact belonging to the collection that corresponds to the composite object. 22. A computing desktop rendered by a processor executing computer readable instructions to cause a display to present a graphical user interface, said computing desktop comprising:
a plurality of icons presented within the graphical user interface of the computing desktop, each icon representing a storage artifact of a tree structured repository, said repository comprising a tangible storage medium within which a plurality of storage artifacts are digitally encoded, said plurality of storage artifacts comprising a set of storage artifacts corresponding to each of the plurality of icons; and a pop-up window selectively presented upon having selected any of the icons, wherein the pop-up window includes a collection option, wherein said collection option comprises a plurality of file management actions pertaining to a collection, which are able to be selectively initiated for the storage artifact represented by the icon, wherein the file management actions permit a user to change a membership state of storage artifacts within a set of collections. 23. The computing desktop of claim 22, further comprising:
a storage artifact engine configured to execute programmatic instructions for each of the file management actions, wherein each programmatic action changes a relationship between an associated storage artifact and a collection, wherein execution of any of the file management actions changes metadata of the associated storage artifact to indicate the change of relationship between the associated storage artifact and the collection. | At least one unique collection of storage artifacts can be specified to indicate that the storage artifact is a member of the unique collection. Each storage artifact can be a discrete object comprising digitally encoded content that is stored as a node within a tree structure of a tangible storage medium. The collection can be referenced by a set of different storage artifacts to form a collection of related storage artifacts. Each storage artifact can correspond to different collections, wherein membership within a collection is independent of a storage path within the tree structure. A file management action relating to the storage artifact can be performed. The file management action can be dependent upon the storage artifact being a member of the unique collection.1. A method for establishing collections of storage artifacts comprising:
specifying at least one unique collection within metadata of a storage artifact to indicate that the storage artifact is a member of the unique collection, wherein the storage artifact is a discrete object comprising digitally encoded content that is stored as a node within a tree structure of a tangible storage medium, wherein the collection is able be referenced by a plurality of different storage artifacts to form a collection of related storage artifacts, wherein each storage artifact is able to correspond to a plurality of different collections, wherein membership of said collection is independent of a storage path within the tree structure used by the storage artifact that uniquely identifies the storage artifact; and performing a file management action relating to the storage artifact, wherein the file management action is dependent upon the storage artifact being a member of the unique collection. 2. The method of claim 1, further comprising:
updating the metadata of the storage artifact to indicate the storage artifact is no longer associated with the at least one unique collection; and responsive to the updating of the metadata, excluding the storage artifact from file management actions specific to the unique collection as said storage artifact is no longer a member of the unique collection. 3. The method of claim 1, wherein the at least one file management action is a search action that uses said unique collection as a search constraint. 4. The method of claim 1, wherein the at least one file management action is at least one of a delete action, a copy action, and a move action. 5. The method of claim 1, wherein said at least one file management action is triggered against a different storage artifact, which is also a member of the unique collection as indicated by metadata of said different storage artifact, wherein said at least one file management action is performed against all storage artifacts of the unique collection including said storage artifact and said different storage artifact. 6. The method of claim 1, further comprising:
receiving a user command to perform said at least one file management action against said storage artifact; determining that said storage artifact is a member of the unique collection by querying the metadata of the storage artifact; responsive to the determining, presenting an option to have the file management action performed against only the storage artifact or against all storage artifacts of the unique collection; when a response to the presenting indicates the file management action is to be against only the storage artifact, performing the file management action against only the storage artifact; and when a response to the presenting indicates the file management action is to be against all storage artifacts of the unique collection, performing the file management action against all the storage artifacts of the unique collection. 7. The method of claim 1, wherein said storage artifact is file managed by an operating system file manager, and wherein said storage artifact is stored within a non-volatile region of the tangible storage medium. 8. The method of claim 1, wherein said unique collection is associated with a collection specific file that is stored on the tangible storage. 9. The method of claim 1, wherein the unique collection is represented as a unique record of a collection table stored in a relational database system, wherein said collection table comprises a plurality of different records for different collections, each having a unique primary key, wherein said collection table is part of a database of the relational database system organized in third normal form. 10. The method of claim 1, further comprising:
specifying the unique collection within metadata of at least a second storage artifact and a third storage artifact, wherein the storage artifact, the second storage artifact and the third storage artifact belong to the unique collection, and wherein the first storage artifact, the second storage artifact, and the third storage artifact are heterogeneous files. 11. The method of claim 1, further comprising:
specifying the unique collection within metadata of at least a second storage artifact and a third storage artifact, wherein the storage artifact, the second storage artifact and the third storage artifact belong to the unique collection, and wherein the first storage artifact, the second storage artifact, and the third storage artifact are different file types that are associated with different applications. 12. The method of claim 1, wherein the unique collection is referenced by a plurality of different storage artifacts, wherein each of the different storage artifacts are associated with a numeric attribute that determines an order of the corresponding one of the different storage artifacts within the unique collection. 13. The method of claim 1, wherein the unique collection is referenced by a plurality of different storage artifacts, wherein each of the different storage artifacts are organized within a workflow that indicates which of the different storage artifacts must exist before subsequent ones of the different storage artifacts are to be created. 14. The method of claim 1, further comprising:
specifying a collection to be attached to an email message without explicitly specifying each storage artifact of the collection; determining the plurality of storage artifacts of the collection; responsive to the specifying, attaching each of the determined storage artifacts of the collection to the email message; and sending said email message. 15. The method of claim 1, further comprising:
selecting one of the storage artifacts belonging to a collection responsive to a user selection within a communication application; responsive to the selecting of the one storage artifact, determining a set of storage artifacts that belong to the collection, wherein the set comprises a plurality of different storage artifacts that have not been explicitly selected by a user; and responsive to the determining, conveying the set of storage artifacts to a remotely located computing device via the communication application. 16. The method of claim 1, further comprising:
representing for purposes of a file management system, each collection as a composite object, wherein file management actions actionable against each composite object comprise a copy action, a delete action, and a search action, each of which have a scope encompassing every storage artifact belonging to the collection that corresponds to the composite object. 17. The method of claim 16, wherein each user of a computing system has a user specific set of composite objects, each encapsulating individualized knowledge with respect to the set of storage artifacts associated with each composite object. 18. A computer program product comprising a computer readable storage medium having computer usable program code embodied therewith, the computer usable program code comprising:
computer usable program code stored in a tangible storage medium, when said computer usable program code is executed by a processor it is operable to specify at least one unique collection within metadata of a storage artifact to indicate that the storage artifact is a member of the unique collection, wherein the storage artifact is a discrete object comprising digitally encoded content that is stored as a node within a tree structure of a tangible storage medium, wherein the collection is able be referenced by a plurality of different storage artifacts to form a collection of related storage artifacts, wherein each storage artifact is able to correspond to a plurality of different collections, wherein membership of said collection is independent of a storage path within the tree structure used by the storage artifact that uniquely identifies the storage artifact; and computer usable program code stored in a tangible storage medium, when said computer usable program code is executed by a processor it is operable to perform a file management action relating to the storage artifact, wherein the file management action is dependent upon the storage artifact being a member of the unique collection. 19. A system comprising:
a tangible data store comprising a plurality of storage artifacts, wherein each of the storage artifacts is a discrete object comprising digitally encoded content that is stored as a node within a tree structure, wherein the storage artifacts are related to a plurality of different collections, wherein each collection is able to be referenced by a plurality of different storage artifacts and wherein each of the plurality of different storage artifacts is able to correspond to a plurality of different collections, wherein membership in a collection is independent of a storage path within the tree structure of each of the plurality of storage artifacts; and a storage artifact engine able to perform a plurality of file management actions against the storage artifacts, wherein said file management actions comprise an add action to add a storage artifact to a collection, a remove action to remove a storage artifact from a collection, and an edit action to modify specifics of an existing collection. 20. The system of claim 19, further comprising:
a graphical user interface through which any of the file management actions are able to be initiated by a user, wherein the graphical user interface comprises a file listing showing a set of files organized within a subnode of the tree structure, wherein for each set of files, a file name, at least one file property, and a collection that the file belongs to is shown. 21. The system of claim 19, said system representing for purposes of a file management system, each collection as a composite object, wherein file management actions actionable against each composite object comprise a copy action, a delete action, and a search action, each of which have a scope encompassing every storage artifact belonging to the collection that corresponds to the composite object. 22. A computing desktop rendered by a processor executing computer readable instructions to cause a display to present a graphical user interface, said computing desktop comprising:
a plurality of icons presented within the graphical user interface of the computing desktop, each icon representing a storage artifact of a tree structured repository, said repository comprising a tangible storage medium within which a plurality of storage artifacts are digitally encoded, said plurality of storage artifacts comprising a set of storage artifacts corresponding to each of the plurality of icons; and a pop-up window selectively presented upon having selected any of the icons, wherein the pop-up window includes a collection option, wherein said collection option comprises a plurality of file management actions pertaining to a collection, which are able to be selectively initiated for the storage artifact represented by the icon, wherein the file management actions permit a user to change a membership state of storage artifacts within a set of collections. 23. The computing desktop of claim 22, further comprising:
a storage artifact engine configured to execute programmatic instructions for each of the file management actions, wherein each programmatic action changes a relationship between an associated storage artifact and a collection, wherein execution of any of the file management actions changes metadata of the associated storage artifact to indicate the change of relationship between the associated storage artifact and the collection. | 2,100 |
4,528 | 13,966,610 | 2,158 | A system for monitoring one or more transactions includes a memory, which stores first metadata, second metadata, and third metadata, communicatively coupled to one or more processors. The one or more processors receive the first metadata from a first transaction processing system, the second metadata from a second transaction processing system, and the third metadata from a third transaction processing system and determine attributes from each of the first, second, and third metadata. Each of the first, second, and third metadata are associated with a task performed by the first, second, and third transaction processing systems, respectively. The one or more processors associate the first metadata with a first transaction. The one or more processors then determine that none of the attributes from the second metadata are the same as any of the attributes from the first metadata and then associate the second metadata with a second transaction. The one or more processors then determine that at least one of the attributes from the third metadata is the same as at least one of more attributes from the first metadata and associate the third metadata with the first transaction. | 1. A system for monitoring one or more transactions, comprising:
a memory operable to store first metadata, second metadata, and third metadata; and one or more processors communicatively coupled to the memory and operable to:
receive the first metadata from a first transaction processing system, wherein the first metadata is associated with a task performed by the first transaction processing system;
determine one or more attributes from the first metadata and associated with the task performed by the first transaction processing system;
associate the first metadata with a first transaction;
receive the second metadata from a second transaction processing system, wherein the second transaction processing system is different from the first transaction processing system and wherein the second metadata is associated with a task performed by the second transaction processing system;
determine one or more attributes from the second metadata and associated with the task performed by the second transaction processing system;
determine that none of the one or more attributes from the second metadata are the same as any of the one or more attributes from the first metadata;
associate the second metadata with a second transaction;
receive the third metadata from a third transaction processing system, wherein the third transaction processing system is different from the first transaction processing system and wherein the third metadata is associated with a task performed by the third transaction processing system;
determine one or more attributes from the third metadata and associated with the task performed by the third transaction processing system;
determine that at least one of the one or more attributes from the third metadata is the same as at least one of the one or more attributes from the first metadata; and
associate the third metadata with the first transaction. 2. The system of claim 1, wherein the one or more processors are further operable to:
associate the first metadata and third metadata with a first transaction tracking identifier; and associate the second metadata with a second transaction tracking identifier. 3. The system of claim 1, wherein the one or more processors are further operable to:
receive fourth metadata from a fourth transaction processing system, wherein the fourth transaction processing system is different from the second transaction processing system and wherein the fourth metadata is associated with a task performed by the fourth transaction processing system; determine one or more attributes from the fourth metadata and associated with the task performed by the fourth transaction processing system; determine that at least one of the one or more attributes from the fourth metadata is the same as at least one of the one or more attributes from the second metadata; and associate the fourth metadata with the second transaction. 4. The system of claim 1, wherein:
the one or more attributes from the first metadata and associated with the task performed by the first transaction processing system comprise at least an identifier specific to the first transaction processing system; and the one or more attributes from the second metadata and associated with the task performed by the second transaction processing system comprise at least an identifier specific to the second transaction processing system. 5. The system of claim 4, wherein the identifier specific to the first transaction processing system is different from the identifier specific to the second transaction processing system. 6. The system of claim 1, wherein:
the first metadata comprises:
a first account number;
a first payment amount; and
a first payment date;
the third metadata comprises:
a third account number;
a third payment amount; and
a third payment date. 7. The system of claim 6, wherein determining that at least one of the one or more attributes from the third metadata is the same as at least one of the one or more attributes from the first metadata further comprises:
determine that the first account number is the same as the third account number; determine that the first payment amount is the same as the third payment amount; and determine that the first payment date is the same as to the third payment date. 8. A method for monitoring one or more transactions, comprising:
receiving first metadata from a first transaction processing system, wherein the first metadata is associated with a task performed by the first transaction processing system; determining one or more attributes from the first metadata and associated with the task performed by the first transaction processing system; associating the first metadata with a first transaction; receiving second metadata from a second transaction processing system, wherein the second transaction processing system is different from the first transaction processing system and wherein the second metadata is associated with a task performed by the second transaction processing system; determining one or more attributes from the second metadata and associated with the task performed by the second transaction processing system; determining that none of the one or more attributes from the second metadata are the same as any of the one or more attributes from the first metadata; associating the second metadata with a second transaction; receiving third metadata from a third transaction processing system, wherein the third transaction processing system is different from the first transaction processing system and wherein the third metadata is associated with a task performed by the third transaction processing system; determining one or more attributes from the third metadata and associated with the task performed by the third transaction processing system; determining that at least one of the one or more attributes from the third metadata is the same as at least one of the one or more attributes from the first metadata; and associating the third metadata with the first transaction. 9. The method of claim 8, further comprising:
associating the first metadata and third metadata with a first transaction tracking identifier; and associating the second metadata with a second transaction tracking identifier. 10. The method of claim 8, further comprising:
receiving fourth metadata from a fourth transaction processing system, wherein the fourth transaction processing system is different from the second transaction processing system and wherein the fourth metadata is associated with a task performed by the fourth transaction processing system; determining one or more attributes from the fourth metadata and associated with the task performed by the fourth transaction processing system; determining that at least one of the one or more attributes from the fourth metadata is the same as at least one of the one or more attributes from the second metadata; and associating the fourth metadata with the second transaction. 11. The method of claim 8, wherein:
the one or more attributes from the first metadata and associated with the task performed by the first transaction processing system comprise at least an identifier specific to the first transaction processing system; and the one or more attributes from the second metadata and associated with the task performed by the second transaction processing system comprise at least an identifier specific to the second transaction processing system. 12. The method of claim 11, wherein the identifier specific to the first transaction processing system is different from the identifier specific to the second transaction processing system. 13. The method of claim 8, wherein:
the first metadata comprises:
a first account number;
a first payment amount; and
a first payment date;
the third metadata comprises:
a third account number;
a third payment amount; and
a third payment date. 14. The method of claim 13, wherein determining that at least one of the one or more attributes from the third metadata is the same as at least one of the one or more attributes from the first metadata further comprises:
determining that the first account number is the same as the third account number; determining that the first payment amount is the same as the third payment amount; and determining that the first payment date is the same as to the third payment date. 15. A system for monitoring one or more transactions, comprising:
a first transaction processing system operable to:
perform a first task for a transaction; and
transmit first metadata associated with the performance of the first task to a correlation engine;
a second transaction processing system operable to:
perform a second task for the transaction; and
transmit second metadata associated with the performance of the second task to the correlation engine; and
the correlation engine communicatively coupled to the first and second transaction processing systems and operable to:
receive the first metadata and the second metadata;
determine one or more attributes from the first metadata and associated with the first task;
determine one or more attributes from the second metadata and associated with the second task;
determine that at least one attribute associated with the first task is correlated to at least one attribute associated with the second task; and
associate the first metadata and the second metadata with the transaction. 16. The system of claim 15, further comprising:
a third transaction processing system, wherein the third transaction processing system is operable to:
perform a third task for the transaction; and
transmit third metadata created during the performance of the third task to the correlation engine; and
the correlation engine is further operable to:
receive the third metadata;
determine one or more third task attributes associated with the third metadata;
determine that at least one attribute associated with the first task is correlated to at least one attribute associated with the second task; and
associate the third metadata with the transaction. 17. The system of claim 15, wherein associating the first metadata and the second metadata with the transaction further comprises:
associate a transaction tracking identifier with the first metadata; and associate the transaction tracking identifier with the second metadata. 18. The system of claim 15, wherein the correlation engine is further operable to:
store a service level agreement associated with the second task, wherein the service level agreement comprises a task duration; before receiving an indication that the second task has been performed, determine that the task duration has elapsed; and generate an alert, wherein the alert indicates that the second task has not been performed. 19. The system of claim 15, wherein:
the first task comprises receiving a request to transfer funds from a first account to a second account; and the second task comprises transferring the funds from the first account to the second account. 20. The system of claim 16, wherein:
the third transaction processing system is not communicatively coupled to the first transaction processing system; and the correlation engine is further operable to determine that the first transaction processing system and the third transaction processing system are associated with the transaction. | A system for monitoring one or more transactions includes a memory, which stores first metadata, second metadata, and third metadata, communicatively coupled to one or more processors. The one or more processors receive the first metadata from a first transaction processing system, the second metadata from a second transaction processing system, and the third metadata from a third transaction processing system and determine attributes from each of the first, second, and third metadata. Each of the first, second, and third metadata are associated with a task performed by the first, second, and third transaction processing systems, respectively. The one or more processors associate the first metadata with a first transaction. The one or more processors then determine that none of the attributes from the second metadata are the same as any of the attributes from the first metadata and then associate the second metadata with a second transaction. The one or more processors then determine that at least one of the attributes from the third metadata is the same as at least one of more attributes from the first metadata and associate the third metadata with the first transaction.1. A system for monitoring one or more transactions, comprising:
a memory operable to store first metadata, second metadata, and third metadata; and one or more processors communicatively coupled to the memory and operable to:
receive the first metadata from a first transaction processing system, wherein the first metadata is associated with a task performed by the first transaction processing system;
determine one or more attributes from the first metadata and associated with the task performed by the first transaction processing system;
associate the first metadata with a first transaction;
receive the second metadata from a second transaction processing system, wherein the second transaction processing system is different from the first transaction processing system and wherein the second metadata is associated with a task performed by the second transaction processing system;
determine one or more attributes from the second metadata and associated with the task performed by the second transaction processing system;
determine that none of the one or more attributes from the second metadata are the same as any of the one or more attributes from the first metadata;
associate the second metadata with a second transaction;
receive the third metadata from a third transaction processing system, wherein the third transaction processing system is different from the first transaction processing system and wherein the third metadata is associated with a task performed by the third transaction processing system;
determine one or more attributes from the third metadata and associated with the task performed by the third transaction processing system;
determine that at least one of the one or more attributes from the third metadata is the same as at least one of the one or more attributes from the first metadata; and
associate the third metadata with the first transaction. 2. The system of claim 1, wherein the one or more processors are further operable to:
associate the first metadata and third metadata with a first transaction tracking identifier; and associate the second metadata with a second transaction tracking identifier. 3. The system of claim 1, wherein the one or more processors are further operable to:
receive fourth metadata from a fourth transaction processing system, wherein the fourth transaction processing system is different from the second transaction processing system and wherein the fourth metadata is associated with a task performed by the fourth transaction processing system; determine one or more attributes from the fourth metadata and associated with the task performed by the fourth transaction processing system; determine that at least one of the one or more attributes from the fourth metadata is the same as at least one of the one or more attributes from the second metadata; and associate the fourth metadata with the second transaction. 4. The system of claim 1, wherein:
the one or more attributes from the first metadata and associated with the task performed by the first transaction processing system comprise at least an identifier specific to the first transaction processing system; and the one or more attributes from the second metadata and associated with the task performed by the second transaction processing system comprise at least an identifier specific to the second transaction processing system. 5. The system of claim 4, wherein the identifier specific to the first transaction processing system is different from the identifier specific to the second transaction processing system. 6. The system of claim 1, wherein:
the first metadata comprises:
a first account number;
a first payment amount; and
a first payment date;
the third metadata comprises:
a third account number;
a third payment amount; and
a third payment date. 7. The system of claim 6, wherein determining that at least one of the one or more attributes from the third metadata is the same as at least one of the one or more attributes from the first metadata further comprises:
determine that the first account number is the same as the third account number; determine that the first payment amount is the same as the third payment amount; and determine that the first payment date is the same as to the third payment date. 8. A method for monitoring one or more transactions, comprising:
receiving first metadata from a first transaction processing system, wherein the first metadata is associated with a task performed by the first transaction processing system; determining one or more attributes from the first metadata and associated with the task performed by the first transaction processing system; associating the first metadata with a first transaction; receiving second metadata from a second transaction processing system, wherein the second transaction processing system is different from the first transaction processing system and wherein the second metadata is associated with a task performed by the second transaction processing system; determining one or more attributes from the second metadata and associated with the task performed by the second transaction processing system; determining that none of the one or more attributes from the second metadata are the same as any of the one or more attributes from the first metadata; associating the second metadata with a second transaction; receiving third metadata from a third transaction processing system, wherein the third transaction processing system is different from the first transaction processing system and wherein the third metadata is associated with a task performed by the third transaction processing system; determining one or more attributes from the third metadata and associated with the task performed by the third transaction processing system; determining that at least one of the one or more attributes from the third metadata is the same as at least one of the one or more attributes from the first metadata; and associating the third metadata with the first transaction. 9. The method of claim 8, further comprising:
associating the first metadata and third metadata with a first transaction tracking identifier; and associating the second metadata with a second transaction tracking identifier. 10. The method of claim 8, further comprising:
receiving fourth metadata from a fourth transaction processing system, wherein the fourth transaction processing system is different from the second transaction processing system and wherein the fourth metadata is associated with a task performed by the fourth transaction processing system; determining one or more attributes from the fourth metadata and associated with the task performed by the fourth transaction processing system; determining that at least one of the one or more attributes from the fourth metadata is the same as at least one of the one or more attributes from the second metadata; and associating the fourth metadata with the second transaction. 11. The method of claim 8, wherein:
the one or more attributes from the first metadata and associated with the task performed by the first transaction processing system comprise at least an identifier specific to the first transaction processing system; and the one or more attributes from the second metadata and associated with the task performed by the second transaction processing system comprise at least an identifier specific to the second transaction processing system. 12. The method of claim 11, wherein the identifier specific to the first transaction processing system is different from the identifier specific to the second transaction processing system. 13. The method of claim 8, wherein:
the first metadata comprises:
a first account number;
a first payment amount; and
a first payment date;
the third metadata comprises:
a third account number;
a third payment amount; and
a third payment date. 14. The method of claim 13, wherein determining that at least one of the one or more attributes from the third metadata is the same as at least one of the one or more attributes from the first metadata further comprises:
determining that the first account number is the same as the third account number; determining that the first payment amount is the same as the third payment amount; and determining that the first payment date is the same as to the third payment date. 15. A system for monitoring one or more transactions, comprising:
a first transaction processing system operable to:
perform a first task for a transaction; and
transmit first metadata associated with the performance of the first task to a correlation engine;
a second transaction processing system operable to:
perform a second task for the transaction; and
transmit second metadata associated with the performance of the second task to the correlation engine; and
the correlation engine communicatively coupled to the first and second transaction processing systems and operable to:
receive the first metadata and the second metadata;
determine one or more attributes from the first metadata and associated with the first task;
determine one or more attributes from the second metadata and associated with the second task;
determine that at least one attribute associated with the first task is correlated to at least one attribute associated with the second task; and
associate the first metadata and the second metadata with the transaction. 16. The system of claim 15, further comprising:
a third transaction processing system, wherein the third transaction processing system is operable to:
perform a third task for the transaction; and
transmit third metadata created during the performance of the third task to the correlation engine; and
the correlation engine is further operable to:
receive the third metadata;
determine one or more third task attributes associated with the third metadata;
determine that at least one attribute associated with the first task is correlated to at least one attribute associated with the second task; and
associate the third metadata with the transaction. 17. The system of claim 15, wherein associating the first metadata and the second metadata with the transaction further comprises:
associate a transaction tracking identifier with the first metadata; and associate the transaction tracking identifier with the second metadata. 18. The system of claim 15, wherein the correlation engine is further operable to:
store a service level agreement associated with the second task, wherein the service level agreement comprises a task duration; before receiving an indication that the second task has been performed, determine that the task duration has elapsed; and generate an alert, wherein the alert indicates that the second task has not been performed. 19. The system of claim 15, wherein:
the first task comprises receiving a request to transfer funds from a first account to a second account; and the second task comprises transferring the funds from the first account to the second account. 20. The system of claim 16, wherein:
the third transaction processing system is not communicatively coupled to the first transaction processing system; and the correlation engine is further operable to determine that the first transaction processing system and the third transaction processing system are associated with the transaction. | 2,100 |
4,529 | 14,973,603 | 2,112 | A method is provided that includes performing first decoding operations on data obtained from a plurality of units of memory using soft information values for the plurality of units of memory, where the plurality of units of memory includes an error correction stripe. The method further includes determining that two or more units of memory have uncorrectable errors. The method further includes updating a soft information value for a first unit of memory in accordance with a magnitude of a soft information value for a second unit and a direction based on parity of the error correction stripe excluding the first unit, where the first unit of memory and the second unit of memory are included in the two or more units of memory that have uncorrectable errors. The method further includes performing a second decoding operation on data obtained from the first unit using the updated soft information value. | 1. A method comprising:
performing first decoding operations on data obtained from a plurality of units of memory using soft information values for the plurality of units of memory, wherein the plurality of units of memory includes an error correction stripe; determining that two or more of the plurality of units of memory have uncorrectable errors, wherein the uncorrectable errors are uncorrectable using the first decoding operations; updating a respective soft information value for a first unit of memory in accordance with:
a magnitude of a corresponding soft information value for a second unit of memory; and
a direction based on parity of the error correction stripe excluding the first unit of memory, wherein the first unit of memory and the second unit of memory are included in the two or more units of memory that have uncorrectable errors; and
performing a second decoding operation on data obtained from at least a portion of the first unit of memory using the updated soft information value. 2. The method of claim 1, further including:
in accordance with a determination that the second decoding operation is successful, generating corrected data values for the second unit using decoded data for the first unit of memory produced by the second decoding operation. 3. The method of claim 1, further including, in accordance with a determination that the second decoding operation is unsuccessful, performing a set of remedial operations including:
updating a respective soft information value for the second unit of memory, corresponding to uncorrectable errors in the second unit of memory, in accordance with:
a magnitude of a corresponding soft information value for the first unit of memory; and
a direction based on parity of the error correction stripe excluding the second unit of memory; and
performing a third decoding operation on data obtained from at least a portion of the second unit using the updated soft information value for the second unit of memory; and in accordance with a determination that the third decoding operation is successful, generating corrected data values for the first unit of memory using decoded data for the second unit of memory produced by the third decoding operation. 4. The method of claim 1, further including, in accordance with a determination that the second decoding operation is unsuccessful, performing a set of remedial operations including:
further updating a respective soft information value for the first unit of memory, corresponding to uncorrectable errors in the first unit of memory, in accordance with:
a magnitude of a corresponding soft information value for a third unit of the two or more units of memory that include uncorrectable errors; and
a direction based on parity of the error correction stripe excluding the first unit of memory; and
performing a further decoding operation on data obtained from at least a portion of the first unit of memory using the updated soft information value. 5. The method of claim 1, wherein the error correction stripe includes a parity unit that stores one or more parity values based on at least data in the first unit and the second unit. 6. The method of claim 5, wherein the error correction stripe is a RAID stripe. 7. The method of claim 1, wherein the soft information values comprise log-likelihood ratios (LLRs). 8. The method of claim 1, wherein the units of memory comprise one of partial pages, pages, codewords, partial codewords, blocks, and die planes. 9. The method of claim 1, wherein the units of memory comprise non-volatile memory. 10. The method of claim 1, wherein the units of memory comprise flash memory. 11. The method of claim 1, wherein the first decoding operations and the second decoding operation comprise low-density parity check (LDPC) decoding operations. 12. The method of claim 1, wherein updating the respective soft information value for the first unit of memory comprises calculating, as the updated soft information value, a linear combination of:
the respective soft information value; and an update term calculated in accordance with the magnitude of the corresponding soft information value for the second unit of memory and the direction based on parity of the error correction stripe excluding the first unit of memory. 13. A storage device, comprising:
non-volatile memory; one or more processors; a decoder for decoding data obtained from the non-volatile memory, including first decoding operations on data obtained from a plurality of units of the non-volatile memory using soft information values for the plurality of units of the non-volatile memory, wherein the plurality of units of the non-volatile memory includes an error correction stripe; and controller memory storing one or more programs, which when executed by the one or more processors cause the storage device to perform operations comprising:
determining that two or more of the plurality of units of the non-volatile memory have uncorrectable errors, wherein the uncorrectable errors are uncorrectable using the first decoding operations;
updating a respective soft information value for a first unit of memory in accordance with:
a magnitude of a corresponding soft information value for a second unit of memory; and
a direction based on parity of the error correction stripe excluding the first unit of memory, wherein the first unit of memory and the second unit of memory are included in the two or more units of memory that have uncorrectable errors; and
wherein the decoder is further for a second decoding operation on data obtained from at least a portion of the first unit of memory using the updated soft information value. 14. The storage device of claim 13, including a memory controller that includes the one or more processors and controller memory, wherein the memory controller includes a soft information adjustment module that adjusts soft information values of respective units of the of the non-volatile memory. 15. The storage device of claim 13, wherein, in accordance with a determination that decoding data obtained from at least a portion of the first unit of memory using the updated soft information value is successful, the one or more processors cause the storage device to generate corrected data values for the second unit using decoded data for the first unit of memory produced by the second decoding operation. 16. The storage device of claim 13, wherein, in accordance with a determination that the second decoding operation is unsuccessful, the one or more processors cause the storage device to perform a set of remedial operations including:
updating a respective soft information value for the second unit of memory, corresponding to uncorrectable errors in the second unit of memory, in accordance with:
a magnitude of a corresponding soft information value for the first unit of memory; and
a direction based on parity of the error correction stripe excluding the second unit of memory; and
performing a third decoding operation on data obtained from at least a portion of the second unit using the updated soft information value for the second unit of memory; and in accordance with a determination that the third decoding operation is successful, generating corrected data values for the first unit of memory using decoded data for the second unit of memory produced by the third decoding operation. 17. The storage device of claim 13, wherein the error correction stripe includes a parity unit that stores one or more parity values based on at least data in the first unit and the second unit. 18. The storage device of claim 17, wherein the error correction stripe is a RAID stripe. 19. The storage device of claim 13, wherein the soft information values comprise log-likelihood ratios (LLRs). 20. The storage device of claim 13, wherein updating the respective soft information value for the first unit of memory comprises calculating, as the updated soft information value, a linear combination of:
the respective soft information value; and an update term calculated in accordance with the magnitude of the corresponding soft information value for the second unit of memory and the direction based on parity of the error correction stripe excluding the first unit of memory. 21. A non-transitory computer readable storage medium, storing one or more programs configured for execution by one or more processors of a storage system, the one or more programs including instructions for:
performing first decoding operations on a plurality of units of memory using soft information values for the plurality of units of memory, wherein the plurality of units of memory includes an error correction stripe; determining that two or more of the plurality of units of memory have uncorrectable errors, wherein the uncorrectable errors are uncorrectable using the first decoding operations; updating a respective soft information value for a first unit of memory in accordance with:
a magnitude of a corresponding soft information value for a second unit of memory; and
a direction based on parity of the error correction stripe excluding the first unit of memory, wherein the first unit of memory and the second unit of memory are included in the two or more units of memory that have uncorrectable errors; and
performing a second decoding operation on data obtained from at least a portion of the first unit of memory using the updated soft information value. | A method is provided that includes performing first decoding operations on data obtained from a plurality of units of memory using soft information values for the plurality of units of memory, where the plurality of units of memory includes an error correction stripe. The method further includes determining that two or more units of memory have uncorrectable errors. The method further includes updating a soft information value for a first unit of memory in accordance with a magnitude of a soft information value for a second unit and a direction based on parity of the error correction stripe excluding the first unit, where the first unit of memory and the second unit of memory are included in the two or more units of memory that have uncorrectable errors. The method further includes performing a second decoding operation on data obtained from the first unit using the updated soft information value.1. A method comprising:
performing first decoding operations on data obtained from a plurality of units of memory using soft information values for the plurality of units of memory, wherein the plurality of units of memory includes an error correction stripe; determining that two or more of the plurality of units of memory have uncorrectable errors, wherein the uncorrectable errors are uncorrectable using the first decoding operations; updating a respective soft information value for a first unit of memory in accordance with:
a magnitude of a corresponding soft information value for a second unit of memory; and
a direction based on parity of the error correction stripe excluding the first unit of memory, wherein the first unit of memory and the second unit of memory are included in the two or more units of memory that have uncorrectable errors; and
performing a second decoding operation on data obtained from at least a portion of the first unit of memory using the updated soft information value. 2. The method of claim 1, further including:
in accordance with a determination that the second decoding operation is successful, generating corrected data values for the second unit using decoded data for the first unit of memory produced by the second decoding operation. 3. The method of claim 1, further including, in accordance with a determination that the second decoding operation is unsuccessful, performing a set of remedial operations including:
updating a respective soft information value for the second unit of memory, corresponding to uncorrectable errors in the second unit of memory, in accordance with:
a magnitude of a corresponding soft information value for the first unit of memory; and
a direction based on parity of the error correction stripe excluding the second unit of memory; and
performing a third decoding operation on data obtained from at least a portion of the second unit using the updated soft information value for the second unit of memory; and in accordance with a determination that the third decoding operation is successful, generating corrected data values for the first unit of memory using decoded data for the second unit of memory produced by the third decoding operation. 4. The method of claim 1, further including, in accordance with a determination that the second decoding operation is unsuccessful, performing a set of remedial operations including:
further updating a respective soft information value for the first unit of memory, corresponding to uncorrectable errors in the first unit of memory, in accordance with:
a magnitude of a corresponding soft information value for a third unit of the two or more units of memory that include uncorrectable errors; and
a direction based on parity of the error correction stripe excluding the first unit of memory; and
performing a further decoding operation on data obtained from at least a portion of the first unit of memory using the updated soft information value. 5. The method of claim 1, wherein the error correction stripe includes a parity unit that stores one or more parity values based on at least data in the first unit and the second unit. 6. The method of claim 5, wherein the error correction stripe is a RAID stripe. 7. The method of claim 1, wherein the soft information values comprise log-likelihood ratios (LLRs). 8. The method of claim 1, wherein the units of memory comprise one of partial pages, pages, codewords, partial codewords, blocks, and die planes. 9. The method of claim 1, wherein the units of memory comprise non-volatile memory. 10. The method of claim 1, wherein the units of memory comprise flash memory. 11. The method of claim 1, wherein the first decoding operations and the second decoding operation comprise low-density parity check (LDPC) decoding operations. 12. The method of claim 1, wherein updating the respective soft information value for the first unit of memory comprises calculating, as the updated soft information value, a linear combination of:
the respective soft information value; and an update term calculated in accordance with the magnitude of the corresponding soft information value for the second unit of memory and the direction based on parity of the error correction stripe excluding the first unit of memory. 13. A storage device, comprising:
non-volatile memory; one or more processors; a decoder for decoding data obtained from the non-volatile memory, including first decoding operations on data obtained from a plurality of units of the non-volatile memory using soft information values for the plurality of units of the non-volatile memory, wherein the plurality of units of the non-volatile memory includes an error correction stripe; and controller memory storing one or more programs, which when executed by the one or more processors cause the storage device to perform operations comprising:
determining that two or more of the plurality of units of the non-volatile memory have uncorrectable errors, wherein the uncorrectable errors are uncorrectable using the first decoding operations;
updating a respective soft information value for a first unit of memory in accordance with:
a magnitude of a corresponding soft information value for a second unit of memory; and
a direction based on parity of the error correction stripe excluding the first unit of memory, wherein the first unit of memory and the second unit of memory are included in the two or more units of memory that have uncorrectable errors; and
wherein the decoder is further for a second decoding operation on data obtained from at least a portion of the first unit of memory using the updated soft information value. 14. The storage device of claim 13, including a memory controller that includes the one or more processors and controller memory, wherein the memory controller includes a soft information adjustment module that adjusts soft information values of respective units of the of the non-volatile memory. 15. The storage device of claim 13, wherein, in accordance with a determination that decoding data obtained from at least a portion of the first unit of memory using the updated soft information value is successful, the one or more processors cause the storage device to generate corrected data values for the second unit using decoded data for the first unit of memory produced by the second decoding operation. 16. The storage device of claim 13, wherein, in accordance with a determination that the second decoding operation is unsuccessful, the one or more processors cause the storage device to perform a set of remedial operations including:
updating a respective soft information value for the second unit of memory, corresponding to uncorrectable errors in the second unit of memory, in accordance with:
a magnitude of a corresponding soft information value for the first unit of memory; and
a direction based on parity of the error correction stripe excluding the second unit of memory; and
performing a third decoding operation on data obtained from at least a portion of the second unit using the updated soft information value for the second unit of memory; and in accordance with a determination that the third decoding operation is successful, generating corrected data values for the first unit of memory using decoded data for the second unit of memory produced by the third decoding operation. 17. The storage device of claim 13, wherein the error correction stripe includes a parity unit that stores one or more parity values based on at least data in the first unit and the second unit. 18. The storage device of claim 17, wherein the error correction stripe is a RAID stripe. 19. The storage device of claim 13, wherein the soft information values comprise log-likelihood ratios (LLRs). 20. The storage device of claim 13, wherein updating the respective soft information value for the first unit of memory comprises calculating, as the updated soft information value, a linear combination of:
the respective soft information value; and an update term calculated in accordance with the magnitude of the corresponding soft information value for the second unit of memory and the direction based on parity of the error correction stripe excluding the first unit of memory. 21. A non-transitory computer readable storage medium, storing one or more programs configured for execution by one or more processors of a storage system, the one or more programs including instructions for:
performing first decoding operations on a plurality of units of memory using soft information values for the plurality of units of memory, wherein the plurality of units of memory includes an error correction stripe; determining that two or more of the plurality of units of memory have uncorrectable errors, wherein the uncorrectable errors are uncorrectable using the first decoding operations; updating a respective soft information value for a first unit of memory in accordance with:
a magnitude of a corresponding soft information value for a second unit of memory; and
a direction based on parity of the error correction stripe excluding the first unit of memory, wherein the first unit of memory and the second unit of memory are included in the two or more units of memory that have uncorrectable errors; and
performing a second decoding operation on data obtained from at least a portion of the first unit of memory using the updated soft information value. | 2,100 |
4,530 | 14,824,694 | 2,112 | Systems and methods are disclosed herein relating to rate-compatible polar codes and the use thereof in a wireless communications system. In some embodiments, a transmit node operable for use in a wireless communications system comprises a rate-compatible polar encoder operable to encode information bits to provide coded bits utilizing parallel concatenated polar codes. The transmit node further comprises a transmitter operable to transmit the plurality of coded bits. In this manner, the transmit node may, in some embodiments, use polar codes having different coding rates to adapt to time-varying channel conditions. | 1. A transmit node operable for use in a wireless communications system, comprising:
a rate-compatible polar encoder operable to encode a plurality of information bits to provide a plurality of coded bits utilizing a plurality of parallel concatenated polar codes; and a transmitter operable to transmit the plurality of coded bits. 2. The transmit node of claim 1 wherein the rate-compatible polar encoder comprises:
a plurality of polar encoders operable to encode the plurality of information bits, the plurality of polar encoders comprising:
a first polar encoder operable to encode the plurality of information bits at a first code rate r1 to provide a number n1 of coded bits, where n1=k/r1 and k is the number of information bits in the plurality of information bits; and
a second polar encoder operable to encode a subset of the plurality of information bits at a second code rate r2 to provide a number n2 of coded bits, where r1>r2 and the number n2 of coded bits is a number of coded bits that, when concatenated with the number n1 of coded bits, transforms a resulting code word from the first code rate r1 to the second code rate r2;
wherein the plurality of coded bits are provided at a desired code rate rdesired and are a concatenation of coded bits output by polar encoders of the plurality of polar encoders for the code rates r1 through rdesired. 3. The transmit node of claim 2 wherein the rate-compatible polar encoder further comprises a concatenator operable to concatenate the coded bits output by the polar encoders for the code rates r1 through rdesired to provide the plurality of coded bits at the desired code rate rdesired. 4. The transmit node of claim 1 wherein the rate-compatible polar encoder comprises:
a plurality of polar encoders operable to encode the plurality of information bits based on corresponding polar code generator matrices for code rates ri and lengths ni, where:
i={1, . . . , T}, where T is a positive integer greater than or equal to 2;
n1 is a length for code rate r1 and, for all other values of i, ni is a number of additional coded bits to transform a code word for code rate ri−1 into a code word for code rate ri, i.e.,
n
i
=
{
k
r
i
,
for
i
=
1
k
r
i
-
∑
j
=
1
i
-
1
n
j
,
for
i
>
1
where k is the number of information bits in the plurality of information bits;
Σi=1 Tni=n, where n is a maximum code word length of the plurality of coded bits (i.e., n=k/nT); and
ri>ri+1 for i=1, . . . , T−1;
wherein the plurality of coded bits are provided at a desired code rate rdesired and are a concatenation of coded bits output by polar encoders of the plurality of polar encoders for the code rates r1 through rdesired. 5. The transmit node of claim 4 wherein the rate-compatible polar encoder further comprises a concatenator operable to concatenate outputs of the plurality of polar encoders to provide the plurality of coded bits at the desired code rate rdesired such that, for the desired code rate rdesired, the plurality of coded bits is a concatenation of the outputs of the plurality of polar encoders for the code rates r1, . . . , rdesired. 6. The transmit node of claim 4 wherein the polar code generator matrices for the plurality of polar encoders are submatrices Gn i A i ([1:r1n1]) of row-permuted generator matrices of i-th polar codes Gn i A i consisting of rows 1 through rini of Gn i A i . 7. The transmit node of claim 6 wherein the plurality of polar encoders comprises:
a first polar encoder for code rate r1 operable to encode the plurality of information bits at the code rate r1 to provide n1 coded bits; and
one or more additional polar encoders, each additional polar encoder operable to encode a subset of the plurality of information bits consisting of a number rini of the plurality of information bits at the code rate ri to provide ni coded bits. 8. The transmit node of claim 7 wherein, for each of the one or more additional polar encoders, the subset of the plurality of information bits encoded by the additional polar encoder is different than the subsets encoded by the other additional polar encoders. 9. The transmit node of claim 7 wherein, for each of the one or more additional polar encoders, the subset of the plurality of information bits encoded by the additional polar encoder comprises a predefined number of the plurality of information bits that are most unreliable with respect to transmission of the number n1 of coded bits from the first polar encoder. 10. The transmit node of claim 7 wherein, for at least one of the one or more additional polar encoders, an ordering of the subset of the plurality of information bits encoded by the at least one of the one or more additional polar encoders is different than an ordering of those same information bits when encoded by the first polar encoder. 11. The transmit node of claim 1 further comprising:
at least one processor; and
memory containing instructions executable by the at least one processor whereby the transmit node is further operable to:
select an initial code rate;
perform, via the rate-compatible polar encoder, polar encoding of the plurality of information bits at the initial code rate;
transmit, via the transmitter, the plurality of coded bits, having been encoded at the initial code rate;
upon receiving a negative acknowledgement from a receive node for the transmission of the plurality of coded bits, select a new code rate for an incremental redundancy retransmission;
perform, via the rate-compatible polar encoder, polar encoding of some of the plurality of information bits to provide additional coded bits for the new code rate; and
transmit, via the transmitter, the additional coded bits. 12. The transmit node of claim 11 wherein the rate-compatible polar encoder comprises:
a plurality of polar encoders operable to encode the plurality of information bits based on corresponding polar code generator matrices for code rates ri and lengths ni, where:
i={1, . . . , T}, where T is a positive integer greater than or equal to 2;
n1 is a length for code rate r1 and, for all other values of i, ni is a number of additional coded bits to transform a code word for rate ri−1 into a code word for code rate ri, i.e.,
n
i
=
{
k
r
i
,
for
i
=
1
k
r
i
-
∑
j
=
1
i
-
1
n
j
,
for
i
>
1
where k is a number of information bits in the plurality of information bits;
Σi=1 Tni=n, where n is a maximum code word length of the plurality of coded bits (i.e., n=k/nT); and
ri>ri+1 for i=1, . . . , T−1;
wherein the plurality of coded bits are provided at an initial code rate rinitial and are a concatenation of coded bits output by polar encoders of the plurality of polar encoders for the code rates r1 through rinitial. 13. The transmit node of claim 12 wherein the rate-compatible polar encoder further comprises a concatenator operable to selectively concatenate outputs of the plurality of polar encoders to provide the plurality of coded bits at the initial code rate rinitial such that, for the initial code rate rinitial the plurality of coded bits is a concatenation of the outputs of the plurality of polar encoders for the code rates r1, . . . ,rinitial. 14. The transmit node of claim 12 wherein the additional coded bits for a new code rate rnew are a concatenation of the outputs of the plurality of polar encoders for the code rates rinitial+1, . . . ,rnew, where rnew≦rinitial+1. 15. A method of operation of a transmit node in a wireless communications system, comprising:
encoding a plurality of information bits to provide a plurality of coded bits utilizing a plurality of parallel concatenated polar codes; and transmitting the plurality of coded bits. 16. The method of claim 15 wherein encoding the plurality of information bits comprises:
encoding the plurality of information bits via a first polar code generator matrix at a first code rate r1 to provide a number n1 of coded bits, where n1=k/r1 and k is a number of information bits in the plurality of information bits;
encoding a subset of the plurality of information bits via a second polar code generator matrix at a second code rate r2 to provide a number n2 of coded bits, where r1>r2 and the number n2 of coded bits is a number of coded bits that, when concatenated with the number n1 of coded bits, transforms a resulting code word from the first code rate r1 to the second code rate r2; and
selectively concatenating the number n1 of coded bits and the number n2 of coded bits to provide the plurality of coded bits at a desired code rate. 17. The method of claim 15 wherein encoding the plurality of information bits comprises:
encoding the plurality of information bits based on polar code generator matrices for code rates ri and lengths ni, where:
i={1, . . . , T}, where T is a positive integer greater than or equal to 2;
n1 is a length for code rate r1 and, for all other values of i, ni is a number of additional coded bits to transform a code word for code rate ri−1 into a code word for code rate ri, i.e.,
n
i
=
{
k
r
i
,
for
i
=
1
k
r
i
-
∑
j
=
1
i
-
1
n
j
,
for
i
>
1
where k is a number of information bits in the plurality of information bits;
Σi=1 Tni=n, where n is a maximum code word length of the plurality of coded bits (i.e., n=k/nT); and
ri>ri+1 for i=1, . . . , T−1; and
selectively concatenating sets of coded bits resulting from encoding the plurality of information bits based on the polar code generator matrices for the code rates ri and the lengths ni to provide the plurality of coded bits at a desired code rate rdesired such that, for the desired code rate rdesired, the plurality of coded bits is a concatenation of the sets of coded bits resulting from encoding the plurality of information bits based on the polar code generator matrices for the code rates r1, . . . ,rdesired. 18. The method of claim 17 wherein the polar code generator matrices are submatrices Gn i A i ([1:r1n1]) of row-permuted generator matrices of i-th polar codes Gn i A i consisting of rows 1 through rini of Gn i A i . 19. The method of claim 15 further comprising:
selecting an initial code rate; and
performing the encoding of the plurality of information bits at the initial code rate;
wherein transmitting the plurality of coded bits comprises transmitting the plurality of coded bits, having been encoded at the initial code rate. 20. The method of claim 19 further comprising:
upon receiving a negative acknowledgement from a receive node for the transmission of the plurality of coded bits, selecting a new code rate for an incremental redundancy retransmission;
performing polar encoding of some of the plurality of coded bits to provide additional coded bits for the new code rate; and
transmitting the additional coded bits. 21. The method of claim 20 wherein performing the encoding of the plurality of information bits at the initial code rate comprises:
encoding the plurality of information bits based on corresponding polar code generator matrices for code rates ri and lengths ni, where:
i={1, . . . , INITIAL}, where INITIAL is an index of the initial code rate and is a positive integer greater than or equal to 1;
n1 is a length for code rate r1 and, for all other values of i, ni is a number of additional coded bits to transform a code word for code rate ri−1 into a code word for code rate ri, i.e.,
n
i
=
{
k
r
i
,
for
i
=
1
k
r
i
-
∑
j
=
1
i
-
1
n
j
,
for
i
>
1
where k is the number of information bits in the plurality of information bits;
r1>ri+1; and
concatenating sets of coded bits resulting from encoding the plurality of information bits based on the corresponding polar code generator matrices for the code rates ri and the lengths ni for i={1, . . . , INITIAL} to provide the plurality of coded bits at the initial code rate. 22. The method of claim 21 wherein the additional coded bits for a new code rate rnew are a concatenation of one or more sets of coded bits resulting from encoding at least some of the plurality of information bits based on corresponding polar code generator matrices for code rates ri and lengths ni for i={INITIAL+1, . . . , NEW}, where NEW is an index of the new code rate rnew. 23. A receive node operable for use in a wireless communications system, comprising:
a receiver operable to receive a plurality of coded bits; and a rate-compatible polar decoder operable to decode the plurality of coded bits to provide a plurality of information bits. 24. The receive node of claim 23 wherein, in order to decode the plurality of coded bits, the rate-compatible polar decoder is operable to:
determine a code rate rd of the plurality of coded bits, the code rate rd being one of a predefined set of code rates {ri}i=1, . . . ,T where ri>ri+1 for i=1, . . . ,T−1 and T is a positive integer greater than or equal to 2;
successively perform polar decoding of the last ni coded bits of the plurality of coded bits for code rates rd to r1 to provide sets of information bits for the code rates rd to r1, respectively, where:
n
i
=
{
k
r
i
,
for
i
=
1
k
r
i
-
∑
j
=
1
i
-
1
n
j
,
for
i
>
1
;
k is a number of information bits encoded into the plurality of coded bits; and
r1>ri+1 for i=1, . . . ,T, where rT is a lowest code rate; and
concatenate the sets of information bits for the code rates rd to r1 to provide the plurality of information bits. 25. The receive node of claim 24 wherein, in order to successively perform polar decoding of the last ni coded bits of the plurality of coded bits for the code rates rd to r1 to provide the sets of information bits for the code rates rd to r1, respectively, the rate-compatible polar decoder is further operable to:
perform polar decoding of the last nd coded bits of the plurality of coded bits for the code rate rd to provide the set of information bits for the code rate rd;
perform polar decoding of the next nd−1 coded bits of the plurality of coded bits using the set of information bits for the code rate rd as frozen bits to provide the set of information bits for code rate rd−1; and
perform polar decoding of the next nd−2 coded bits of the plurality of coded bits using a union of the sets of information bits for code rates rd and rd−1 as frozen bits to provide the set of information bits for code rate rd−2. | Systems and methods are disclosed herein relating to rate-compatible polar codes and the use thereof in a wireless communications system. In some embodiments, a transmit node operable for use in a wireless communications system comprises a rate-compatible polar encoder operable to encode information bits to provide coded bits utilizing parallel concatenated polar codes. The transmit node further comprises a transmitter operable to transmit the plurality of coded bits. In this manner, the transmit node may, in some embodiments, use polar codes having different coding rates to adapt to time-varying channel conditions.1. A transmit node operable for use in a wireless communications system, comprising:
a rate-compatible polar encoder operable to encode a plurality of information bits to provide a plurality of coded bits utilizing a plurality of parallel concatenated polar codes; and a transmitter operable to transmit the plurality of coded bits. 2. The transmit node of claim 1 wherein the rate-compatible polar encoder comprises:
a plurality of polar encoders operable to encode the plurality of information bits, the plurality of polar encoders comprising:
a first polar encoder operable to encode the plurality of information bits at a first code rate r1 to provide a number n1 of coded bits, where n1=k/r1 and k is the number of information bits in the plurality of information bits; and
a second polar encoder operable to encode a subset of the plurality of information bits at a second code rate r2 to provide a number n2 of coded bits, where r1>r2 and the number n2 of coded bits is a number of coded bits that, when concatenated with the number n1 of coded bits, transforms a resulting code word from the first code rate r1 to the second code rate r2;
wherein the plurality of coded bits are provided at a desired code rate rdesired and are a concatenation of coded bits output by polar encoders of the plurality of polar encoders for the code rates r1 through rdesired. 3. The transmit node of claim 2 wherein the rate-compatible polar encoder further comprises a concatenator operable to concatenate the coded bits output by the polar encoders for the code rates r1 through rdesired to provide the plurality of coded bits at the desired code rate rdesired. 4. The transmit node of claim 1 wherein the rate-compatible polar encoder comprises:
a plurality of polar encoders operable to encode the plurality of information bits based on corresponding polar code generator matrices for code rates ri and lengths ni, where:
i={1, . . . , T}, where T is a positive integer greater than or equal to 2;
n1 is a length for code rate r1 and, for all other values of i, ni is a number of additional coded bits to transform a code word for code rate ri−1 into a code word for code rate ri, i.e.,
n
i
=
{
k
r
i
,
for
i
=
1
k
r
i
-
∑
j
=
1
i
-
1
n
j
,
for
i
>
1
where k is the number of information bits in the plurality of information bits;
Σi=1 Tni=n, where n is a maximum code word length of the plurality of coded bits (i.e., n=k/nT); and
ri>ri+1 for i=1, . . . , T−1;
wherein the plurality of coded bits are provided at a desired code rate rdesired and are a concatenation of coded bits output by polar encoders of the plurality of polar encoders for the code rates r1 through rdesired. 5. The transmit node of claim 4 wherein the rate-compatible polar encoder further comprises a concatenator operable to concatenate outputs of the plurality of polar encoders to provide the plurality of coded bits at the desired code rate rdesired such that, for the desired code rate rdesired, the plurality of coded bits is a concatenation of the outputs of the plurality of polar encoders for the code rates r1, . . . , rdesired. 6. The transmit node of claim 4 wherein the polar code generator matrices for the plurality of polar encoders are submatrices Gn i A i ([1:r1n1]) of row-permuted generator matrices of i-th polar codes Gn i A i consisting of rows 1 through rini of Gn i A i . 7. The transmit node of claim 6 wherein the plurality of polar encoders comprises:
a first polar encoder for code rate r1 operable to encode the plurality of information bits at the code rate r1 to provide n1 coded bits; and
one or more additional polar encoders, each additional polar encoder operable to encode a subset of the plurality of information bits consisting of a number rini of the plurality of information bits at the code rate ri to provide ni coded bits. 8. The transmit node of claim 7 wherein, for each of the one or more additional polar encoders, the subset of the plurality of information bits encoded by the additional polar encoder is different than the subsets encoded by the other additional polar encoders. 9. The transmit node of claim 7 wherein, for each of the one or more additional polar encoders, the subset of the plurality of information bits encoded by the additional polar encoder comprises a predefined number of the plurality of information bits that are most unreliable with respect to transmission of the number n1 of coded bits from the first polar encoder. 10. The transmit node of claim 7 wherein, for at least one of the one or more additional polar encoders, an ordering of the subset of the plurality of information bits encoded by the at least one of the one or more additional polar encoders is different than an ordering of those same information bits when encoded by the first polar encoder. 11. The transmit node of claim 1 further comprising:
at least one processor; and
memory containing instructions executable by the at least one processor whereby the transmit node is further operable to:
select an initial code rate;
perform, via the rate-compatible polar encoder, polar encoding of the plurality of information bits at the initial code rate;
transmit, via the transmitter, the plurality of coded bits, having been encoded at the initial code rate;
upon receiving a negative acknowledgement from a receive node for the transmission of the plurality of coded bits, select a new code rate for an incremental redundancy retransmission;
perform, via the rate-compatible polar encoder, polar encoding of some of the plurality of information bits to provide additional coded bits for the new code rate; and
transmit, via the transmitter, the additional coded bits. 12. The transmit node of claim 11 wherein the rate-compatible polar encoder comprises:
a plurality of polar encoders operable to encode the plurality of information bits based on corresponding polar code generator matrices for code rates ri and lengths ni, where:
i={1, . . . , T}, where T is a positive integer greater than or equal to 2;
n1 is a length for code rate r1 and, for all other values of i, ni is a number of additional coded bits to transform a code word for rate ri−1 into a code word for code rate ri, i.e.,
n
i
=
{
k
r
i
,
for
i
=
1
k
r
i
-
∑
j
=
1
i
-
1
n
j
,
for
i
>
1
where k is a number of information bits in the plurality of information bits;
Σi=1 Tni=n, where n is a maximum code word length of the plurality of coded bits (i.e., n=k/nT); and
ri>ri+1 for i=1, . . . , T−1;
wherein the plurality of coded bits are provided at an initial code rate rinitial and are a concatenation of coded bits output by polar encoders of the plurality of polar encoders for the code rates r1 through rinitial. 13. The transmit node of claim 12 wherein the rate-compatible polar encoder further comprises a concatenator operable to selectively concatenate outputs of the plurality of polar encoders to provide the plurality of coded bits at the initial code rate rinitial such that, for the initial code rate rinitial the plurality of coded bits is a concatenation of the outputs of the plurality of polar encoders for the code rates r1, . . . ,rinitial. 14. The transmit node of claim 12 wherein the additional coded bits for a new code rate rnew are a concatenation of the outputs of the plurality of polar encoders for the code rates rinitial+1, . . . ,rnew, where rnew≦rinitial+1. 15. A method of operation of a transmit node in a wireless communications system, comprising:
encoding a plurality of information bits to provide a plurality of coded bits utilizing a plurality of parallel concatenated polar codes; and transmitting the plurality of coded bits. 16. The method of claim 15 wherein encoding the plurality of information bits comprises:
encoding the plurality of information bits via a first polar code generator matrix at a first code rate r1 to provide a number n1 of coded bits, where n1=k/r1 and k is a number of information bits in the plurality of information bits;
encoding a subset of the plurality of information bits via a second polar code generator matrix at a second code rate r2 to provide a number n2 of coded bits, where r1>r2 and the number n2 of coded bits is a number of coded bits that, when concatenated with the number n1 of coded bits, transforms a resulting code word from the first code rate r1 to the second code rate r2; and
selectively concatenating the number n1 of coded bits and the number n2 of coded bits to provide the plurality of coded bits at a desired code rate. 17. The method of claim 15 wherein encoding the plurality of information bits comprises:
encoding the plurality of information bits based on polar code generator matrices for code rates ri and lengths ni, where:
i={1, . . . , T}, where T is a positive integer greater than or equal to 2;
n1 is a length for code rate r1 and, for all other values of i, ni is a number of additional coded bits to transform a code word for code rate ri−1 into a code word for code rate ri, i.e.,
n
i
=
{
k
r
i
,
for
i
=
1
k
r
i
-
∑
j
=
1
i
-
1
n
j
,
for
i
>
1
where k is a number of information bits in the plurality of information bits;
Σi=1 Tni=n, where n is a maximum code word length of the plurality of coded bits (i.e., n=k/nT); and
ri>ri+1 for i=1, . . . , T−1; and
selectively concatenating sets of coded bits resulting from encoding the plurality of information bits based on the polar code generator matrices for the code rates ri and the lengths ni to provide the plurality of coded bits at a desired code rate rdesired such that, for the desired code rate rdesired, the plurality of coded bits is a concatenation of the sets of coded bits resulting from encoding the plurality of information bits based on the polar code generator matrices for the code rates r1, . . . ,rdesired. 18. The method of claim 17 wherein the polar code generator matrices are submatrices Gn i A i ([1:r1n1]) of row-permuted generator matrices of i-th polar codes Gn i A i consisting of rows 1 through rini of Gn i A i . 19. The method of claim 15 further comprising:
selecting an initial code rate; and
performing the encoding of the plurality of information bits at the initial code rate;
wherein transmitting the plurality of coded bits comprises transmitting the plurality of coded bits, having been encoded at the initial code rate. 20. The method of claim 19 further comprising:
upon receiving a negative acknowledgement from a receive node for the transmission of the plurality of coded bits, selecting a new code rate for an incremental redundancy retransmission;
performing polar encoding of some of the plurality of coded bits to provide additional coded bits for the new code rate; and
transmitting the additional coded bits. 21. The method of claim 20 wherein performing the encoding of the plurality of information bits at the initial code rate comprises:
encoding the plurality of information bits based on corresponding polar code generator matrices for code rates ri and lengths ni, where:
i={1, . . . , INITIAL}, where INITIAL is an index of the initial code rate and is a positive integer greater than or equal to 1;
n1 is a length for code rate r1 and, for all other values of i, ni is a number of additional coded bits to transform a code word for code rate ri−1 into a code word for code rate ri, i.e.,
n
i
=
{
k
r
i
,
for
i
=
1
k
r
i
-
∑
j
=
1
i
-
1
n
j
,
for
i
>
1
where k is the number of information bits in the plurality of information bits;
r1>ri+1; and
concatenating sets of coded bits resulting from encoding the plurality of information bits based on the corresponding polar code generator matrices for the code rates ri and the lengths ni for i={1, . . . , INITIAL} to provide the plurality of coded bits at the initial code rate. 22. The method of claim 21 wherein the additional coded bits for a new code rate rnew are a concatenation of one or more sets of coded bits resulting from encoding at least some of the plurality of information bits based on corresponding polar code generator matrices for code rates ri and lengths ni for i={INITIAL+1, . . . , NEW}, where NEW is an index of the new code rate rnew. 23. A receive node operable for use in a wireless communications system, comprising:
a receiver operable to receive a plurality of coded bits; and a rate-compatible polar decoder operable to decode the plurality of coded bits to provide a plurality of information bits. 24. The receive node of claim 23 wherein, in order to decode the plurality of coded bits, the rate-compatible polar decoder is operable to:
determine a code rate rd of the plurality of coded bits, the code rate rd being one of a predefined set of code rates {ri}i=1, . . . ,T where ri>ri+1 for i=1, . . . ,T−1 and T is a positive integer greater than or equal to 2;
successively perform polar decoding of the last ni coded bits of the plurality of coded bits for code rates rd to r1 to provide sets of information bits for the code rates rd to r1, respectively, where:
n
i
=
{
k
r
i
,
for
i
=
1
k
r
i
-
∑
j
=
1
i
-
1
n
j
,
for
i
>
1
;
k is a number of information bits encoded into the plurality of coded bits; and
r1>ri+1 for i=1, . . . ,T, where rT is a lowest code rate; and
concatenate the sets of information bits for the code rates rd to r1 to provide the plurality of information bits. 25. The receive node of claim 24 wherein, in order to successively perform polar decoding of the last ni coded bits of the plurality of coded bits for the code rates rd to r1 to provide the sets of information bits for the code rates rd to r1, respectively, the rate-compatible polar decoder is further operable to:
perform polar decoding of the last nd coded bits of the plurality of coded bits for the code rate rd to provide the set of information bits for the code rate rd;
perform polar decoding of the next nd−1 coded bits of the plurality of coded bits using the set of information bits for the code rate rd as frozen bits to provide the set of information bits for code rate rd−1; and
perform polar decoding of the next nd−2 coded bits of the plurality of coded bits using a union of the sets of information bits for code rates rd and rd−1 as frozen bits to provide the set of information bits for code rate rd−2. | 2,100 |
4,531 | 12,239,596 | 2,166 | Methods and apparatuses are provided, which may be implemented to combine and distribute user enhanced video and/or audio content. | 1. A method comprising:
accessing user content, said user content comprising at least one of a user video track and/or a user audio track; accessing reference content, said reference content comprising at least one of a reference video track and/or a reference audio track; establishing tagged user content by temporally associating at least a portion of said user content with at least a portion of said reference content, said tagged user content further comprising sender input information; providing said tagged user content to at least one network resource device; and with said at least one network resource device:
establishing combined content by combining at least a portion of said tagged user content with at least a portion of said reference content, and
providing access to said combined content based, at least on part, and at least a portion of said sender input information. 2. The method as recited in claim 1, wherein accessing said user content comprises using at least one content establishing device to establish said user content. 3. The method as recited in claim 1, wherein accessing said reference content comprises accessing said reference content from an optical disc. 4. The method as recited in claim 3, wherein said optical disc comprises a Blu-ray disc. 5. The method as recited in claim 1, wherein establishing said tagged user content comprises accessing at least one temporal identifier associated with said reference content 6. The method as recited in claim 5, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 7. The method as recited in claim 5, wherein accessing said at least one temporal identifier associated with said reference content comprises establishing said at least one temporal identifier based, at least in part, on user input. 8. The method as recited in claim 1, wherein sender input information is identifiably associated with at least a first user. 9. The method as recited in claim 1, wherein sender input information comprises at least one presentation parameter. 10. The method as recited in claim 1, wherein establishing said combined content comprises at least one of:
combining at least a portion of said user video track with at least a portion of said reference video track, and/or combining at least a portion of said user audio track with at least a portion of said reference audio track. 11. The method as recited in claim 1, wherein providing access to said combined content comprises sending at least one notification to a computing device associated with at least one other user, said notification identifying that said combined content is available for access. 12. The method as recited in claim 11, wherein providing access to said combined content comprises identifying said at least one other user based, at least in part, on said sender input information. 13. A system comprising:
a network a first device connected to said network and adapted to:
access user content and reference content, said user content comprising at least one of a user video track and/or a user audio track, and said reference content comprising at least one of a reference video track and/or a reference audio track,
establish tagged user content by temporally associating at least a portion of said user content with at least a portion of said reference content, said tagged user content further comprising sender input information, and
provide said tagged user content to said network; and
at least one network resource device connected to said network and adapted to:
establish combined content by combining at least a portion of said tagged user content with at least a portion of said reference content, and
provide access to said combined content based, at least on part, and at least a portion of said sender input information. 14. The system as recited in claim 13, further comprising:
at least one content establishing device adapted to establish said user content. 15. The system as recited in claim 13, further comprising:
an optical disc reading mechanism connected to said first device and adapted to accept an optical disc comprising said reference content. 16. The system as recited in claim 15, wherein said optical disc comprises a Blu-ray disc. 17. The system as recited in claim 13, wherein said tagged user content is based, at least in part, on and/or comprises at least one temporal identifier associated with said reference content 18. The system as recited in claim 17, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 19. The system as recited in claim 17, wherein said at least one temporal identifier is established based, at least in part, on user input. 20. The system as recited in claim 13, wherein sender input information is identifiably associated with at least a first user. 21. The system as recited in claim 13, wherein sender input information comprises at least one presentation parameter. 22. The system as recited in claim 13, wherein said at least one network resource device is adapted to combine at least a portion of said user video track with at least a portion of said reference video track, and/or at least a portion of said user audio track with at least a portion of said reference audio track. 23. The system as recited in claim 13, further comprising:
at least one computing device connected to said network and adapted to access said combined content, and wherein said at least one network resource device is adapted to send at least one notification to said at least one computing device, said at least one computing device being associated with at least one other user, said notification identifying that said combined content is available for access. 24. The system as recited in claim 23, wherein said at least one network resource device is adapted to identify said at least one other user based, at least in part, on said sender input information. 25. An apparatus for use in a networked computing environment, the apparatus comprising:
means for accessing tagged user content, said tagged user content being established by temporally associating at least a portion of user content with at least a portion of reference content, said user content comprising at least one of a user video track and/or a user audio track, and said reference content comprising at least one of a reference video track and/or a reference audio track, and wherein said tagged user content further comprises sender input information identifiably associated with at least a first user, and means for establishing combined content by combining at least a portion of said tagged user content with at least a portion of said reference content; means for notifying at least one computing device associated with at least one other user, that said combined content is available for access; means for providing access to said combined content based, at least on part, and at least a portion of said sender input information. 26. The apparatus as recited in claim 25, wherein said tagged user content is based, at least in part, on and/or comprises at least one temporal identifier associated with said reference content 27. The apparatus as recited in claim 26, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 28. The apparatus as recited in claim 25, wherein sender input information comprises at least one presentation parameter. 29. The apparatus as recited in claim 25, wherein said means for establishing said combined content is adapted to combine at least a portion of said user video track with at least a portion of said reference video track, and/or at least a portion of said user audio track with at least a portion of said reference audio track. 30. The apparatus as recited in claim 25, wherein said means for notifying said at least one computing device is adapted to identify said at least one other user based, at least in part, on said sender input information. 31. An apparatus comprising:
means for accessing user content and reference content, said user content comprising at least one of a user video track and/or a user audio track, and said reference content comprising at least one of a reference video track and/or a reference audio track; means for establishing tagged user content by temporally associating at least a portion of said user content with at least a portion of said reference content, said tagged user content further comprising sender input information; and means for providing said tagged user content to a network. 32. The apparatus as recited in claim 31, wherein said means for accessing user content and reference content comprises means for reading an optical disc comprising said reference content. 33. The apparatus as recited in claim 32, wherein said optical disc comprises a Blu-ray disc. 34. The apparatus as recited in claim 31, wherein said tagged user content is based, at least in part, on and/or comprises at least one temporal identifier associated with said reference content 35. The apparatus as recited in claim 34, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 36. The apparatus as recited in claim 34, wherein said at least one temporal identifier is established based, at least in part, on user input. 37. The apparatus as recited in claim 31, wherein sender input information is identifiably associated with at least a first user. 38. The apparatus as recited in claim 31, wherein sender input information comprises at least one presentation parameter. 39. The apparatus as recited in claim 31, wherein said sender input information is based, at least in part, on and/or comprises at least one identifier associated with at least one other user. 40. A computer readable medium comprising having stored thereon computer implementable instructions that if implemented using at least one processing unit within a device, adapt the device to:
access tagged user content, said tagged user content being established by temporally associating at least a portion of user content with at least a portion of reference content, said user content comprising at least one of a user video track and/or a user audio track, and said reference content comprising at least one of a reference video track and/or a reference audio track, and wherein said tagged user content further comprises sender input information identifiably associated with at least a first user, and establish combined content by combining at least a portion of said tagged user content with at least a portion of said reference content; notify at least one computing device associated with at least one other user, that said combined % content is available for access; provide access to said combined content based, at least on part, and at least a portion of said sender input information. 41. The computer readable medium as recited in claim 40, wherein said tagged user content is based, at least in part, on and/or comprises at least one temporal identifier associated with said reference content 42. The computer readable medium as recited in claim 41, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 43. The computer readable medium as recited in claim 41, wherein sender input information comprises at least one presentation parameter. 44. The computer readable medium as recited in claim 40, further comprising computer implementable instructions that if implemented using the at least one processing unit within the device, adapt the device to combine at least a portion of said user video track with at least a portion of said reference video track, and/or at least a portion of said user audio track with at least a portion of said reference audio track. 45. The computer readable medium as recited in claim 40, further comprising computer implementable instructions that if implemented using the at least one processing unit within the device, adapt the device to identify said at least one other user based, at least in part, on said sender input information. 46. A computer readable medium comprising having stored thereon computer implementable instructions that if implemented using at least one processing unit within a device, adapt the device to:
access user content and reference content, said user content comprising at least one of a user video track and/or a user audio track, and said reference content comprising at least one of a reference video track and/or a reference audio track; establish tagged user content by temporally associating at least a portion of said user content with at least a portion of said reference content, said tagged user content further comprising sender input information; and provide said tagged user content to a network. 47. The computer readable medium as recited in claim 46, further comprising computer implementable instructions that if implemented using the at least one processing unit within the device, adapt the device to access an optical disc comprising said reference content. 48. The computer readable medium as recited in claim 47, wherein said optical disc comprises a Blu-ray disc. 49. The computer readable medium as recited in claim 46, wherein said tagged user content is based, at least in part, on and/or comprises at least one temporal identifier associated with said reference content 50. The computer readable medium as recited in claim 49, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 51. The computer readable medium as recited in claim 49, wherein said at least one temporal identifier is established based, at least in part, on user input. 52. The computer readable medium as recited in claim 46, wherein sender input information is identifiably associated with at least a first user. 53. The computer readable medium as recited in claim 46, wherein sender input information comprises at least one presentation parameter. 54. The computer readable medium as recited in claim 46, wherein said sender input information is based, at least in part, on and/or comprises at least one identifier associated with at least one other user. | Methods and apparatuses are provided, which may be implemented to combine and distribute user enhanced video and/or audio content.1. A method comprising:
accessing user content, said user content comprising at least one of a user video track and/or a user audio track; accessing reference content, said reference content comprising at least one of a reference video track and/or a reference audio track; establishing tagged user content by temporally associating at least a portion of said user content with at least a portion of said reference content, said tagged user content further comprising sender input information; providing said tagged user content to at least one network resource device; and with said at least one network resource device:
establishing combined content by combining at least a portion of said tagged user content with at least a portion of said reference content, and
providing access to said combined content based, at least on part, and at least a portion of said sender input information. 2. The method as recited in claim 1, wherein accessing said user content comprises using at least one content establishing device to establish said user content. 3. The method as recited in claim 1, wherein accessing said reference content comprises accessing said reference content from an optical disc. 4. The method as recited in claim 3, wherein said optical disc comprises a Blu-ray disc. 5. The method as recited in claim 1, wherein establishing said tagged user content comprises accessing at least one temporal identifier associated with said reference content 6. The method as recited in claim 5, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 7. The method as recited in claim 5, wherein accessing said at least one temporal identifier associated with said reference content comprises establishing said at least one temporal identifier based, at least in part, on user input. 8. The method as recited in claim 1, wherein sender input information is identifiably associated with at least a first user. 9. The method as recited in claim 1, wherein sender input information comprises at least one presentation parameter. 10. The method as recited in claim 1, wherein establishing said combined content comprises at least one of:
combining at least a portion of said user video track with at least a portion of said reference video track, and/or combining at least a portion of said user audio track with at least a portion of said reference audio track. 11. The method as recited in claim 1, wherein providing access to said combined content comprises sending at least one notification to a computing device associated with at least one other user, said notification identifying that said combined content is available for access. 12. The method as recited in claim 11, wherein providing access to said combined content comprises identifying said at least one other user based, at least in part, on said sender input information. 13. A system comprising:
a network a first device connected to said network and adapted to:
access user content and reference content, said user content comprising at least one of a user video track and/or a user audio track, and said reference content comprising at least one of a reference video track and/or a reference audio track,
establish tagged user content by temporally associating at least a portion of said user content with at least a portion of said reference content, said tagged user content further comprising sender input information, and
provide said tagged user content to said network; and
at least one network resource device connected to said network and adapted to:
establish combined content by combining at least a portion of said tagged user content with at least a portion of said reference content, and
provide access to said combined content based, at least on part, and at least a portion of said sender input information. 14. The system as recited in claim 13, further comprising:
at least one content establishing device adapted to establish said user content. 15. The system as recited in claim 13, further comprising:
an optical disc reading mechanism connected to said first device and adapted to accept an optical disc comprising said reference content. 16. The system as recited in claim 15, wherein said optical disc comprises a Blu-ray disc. 17. The system as recited in claim 13, wherein said tagged user content is based, at least in part, on and/or comprises at least one temporal identifier associated with said reference content 18. The system as recited in claim 17, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 19. The system as recited in claim 17, wherein said at least one temporal identifier is established based, at least in part, on user input. 20. The system as recited in claim 13, wherein sender input information is identifiably associated with at least a first user. 21. The system as recited in claim 13, wherein sender input information comprises at least one presentation parameter. 22. The system as recited in claim 13, wherein said at least one network resource device is adapted to combine at least a portion of said user video track with at least a portion of said reference video track, and/or at least a portion of said user audio track with at least a portion of said reference audio track. 23. The system as recited in claim 13, further comprising:
at least one computing device connected to said network and adapted to access said combined content, and wherein said at least one network resource device is adapted to send at least one notification to said at least one computing device, said at least one computing device being associated with at least one other user, said notification identifying that said combined content is available for access. 24. The system as recited in claim 23, wherein said at least one network resource device is adapted to identify said at least one other user based, at least in part, on said sender input information. 25. An apparatus for use in a networked computing environment, the apparatus comprising:
means for accessing tagged user content, said tagged user content being established by temporally associating at least a portion of user content with at least a portion of reference content, said user content comprising at least one of a user video track and/or a user audio track, and said reference content comprising at least one of a reference video track and/or a reference audio track, and wherein said tagged user content further comprises sender input information identifiably associated with at least a first user, and means for establishing combined content by combining at least a portion of said tagged user content with at least a portion of said reference content; means for notifying at least one computing device associated with at least one other user, that said combined content is available for access; means for providing access to said combined content based, at least on part, and at least a portion of said sender input information. 26. The apparatus as recited in claim 25, wherein said tagged user content is based, at least in part, on and/or comprises at least one temporal identifier associated with said reference content 27. The apparatus as recited in claim 26, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 28. The apparatus as recited in claim 25, wherein sender input information comprises at least one presentation parameter. 29. The apparatus as recited in claim 25, wherein said means for establishing said combined content is adapted to combine at least a portion of said user video track with at least a portion of said reference video track, and/or at least a portion of said user audio track with at least a portion of said reference audio track. 30. The apparatus as recited in claim 25, wherein said means for notifying said at least one computing device is adapted to identify said at least one other user based, at least in part, on said sender input information. 31. An apparatus comprising:
means for accessing user content and reference content, said user content comprising at least one of a user video track and/or a user audio track, and said reference content comprising at least one of a reference video track and/or a reference audio track; means for establishing tagged user content by temporally associating at least a portion of said user content with at least a portion of said reference content, said tagged user content further comprising sender input information; and means for providing said tagged user content to a network. 32. The apparatus as recited in claim 31, wherein said means for accessing user content and reference content comprises means for reading an optical disc comprising said reference content. 33. The apparatus as recited in claim 32, wherein said optical disc comprises a Blu-ray disc. 34. The apparatus as recited in claim 31, wherein said tagged user content is based, at least in part, on and/or comprises at least one temporal identifier associated with said reference content 35. The apparatus as recited in claim 34, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 36. The apparatus as recited in claim 34, wherein said at least one temporal identifier is established based, at least in part, on user input. 37. The apparatus as recited in claim 31, wherein sender input information is identifiably associated with at least a first user. 38. The apparatus as recited in claim 31, wherein sender input information comprises at least one presentation parameter. 39. The apparatus as recited in claim 31, wherein said sender input information is based, at least in part, on and/or comprises at least one identifier associated with at least one other user. 40. A computer readable medium comprising having stored thereon computer implementable instructions that if implemented using at least one processing unit within a device, adapt the device to:
access tagged user content, said tagged user content being established by temporally associating at least a portion of user content with at least a portion of reference content, said user content comprising at least one of a user video track and/or a user audio track, and said reference content comprising at least one of a reference video track and/or a reference audio track, and wherein said tagged user content further comprises sender input information identifiably associated with at least a first user, and establish combined content by combining at least a portion of said tagged user content with at least a portion of said reference content; notify at least one computing device associated with at least one other user, that said combined % content is available for access; provide access to said combined content based, at least on part, and at least a portion of said sender input information. 41. The computer readable medium as recited in claim 40, wherein said tagged user content is based, at least in part, on and/or comprises at least one temporal identifier associated with said reference content 42. The computer readable medium as recited in claim 41, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 43. The computer readable medium as recited in claim 41, wherein sender input information comprises at least one presentation parameter. 44. The computer readable medium as recited in claim 40, further comprising computer implementable instructions that if implemented using the at least one processing unit within the device, adapt the device to combine at least a portion of said user video track with at least a portion of said reference video track, and/or at least a portion of said user audio track with at least a portion of said reference audio track. 45. The computer readable medium as recited in claim 40, further comprising computer implementable instructions that if implemented using the at least one processing unit within the device, adapt the device to identify said at least one other user based, at least in part, on said sender input information. 46. A computer readable medium comprising having stored thereon computer implementable instructions that if implemented using at least one processing unit within a device, adapt the device to:
access user content and reference content, said user content comprising at least one of a user video track and/or a user audio track, and said reference content comprising at least one of a reference video track and/or a reference audio track; establish tagged user content by temporally associating at least a portion of said user content with at least a portion of said reference content, said tagged user content further comprising sender input information; and provide said tagged user content to a network. 47. The computer readable medium as recited in claim 46, further comprising computer implementable instructions that if implemented using the at least one processing unit within the device, adapt the device to access an optical disc comprising said reference content. 48. The computer readable medium as recited in claim 47, wherein said optical disc comprises a Blu-ray disc. 49. The computer readable medium as recited in claim 46, wherein said tagged user content is based, at least in part, on and/or comprises at least one temporal identifier associated with said reference content 50. The computer readable medium as recited in claim 49, wherein said at least one temporal identifier comprises at least one of a timecode value, a chapter identifier, and/or a sampled frame. 51. The computer readable medium as recited in claim 49, wherein said at least one temporal identifier is established based, at least in part, on user input. 52. The computer readable medium as recited in claim 46, wherein sender input information is identifiably associated with at least a first user. 53. The computer readable medium as recited in claim 46, wherein sender input information comprises at least one presentation parameter. 54. The computer readable medium as recited in claim 46, wherein said sender input information is based, at least in part, on and/or comprises at least one identifier associated with at least one other user. | 2,100 |
4,532 | 13,223,848 | 2,145 | Systems and methods are provides for changing a window stack for a multi-screen device. The window stack can change based on the movement of a window. The system can receive a gesture indicating a change in the position of a window in the device. Upon receiving the gesture, the system determines a new position in the window stack for the moved window. Then, the system can determine a display associated with the moved window and change the logic data structure associated with the moved window to describe the new position of the moved window in the window stack. | 1. A computer readable medium, having stored thereon, computer-executable instructions executable by a processor, the computer-executable instructions causing the processor to execute a method for creating a window stack for a multi-screen device, the computer-executable instructions comprising:
instructions to receive a gesture to move a window associated with the device; instructions to determine a display associated with the moved window; instructions to determine a new position in the window stack for the moved window; and after determining the position of and the display associated with the moved window, instructions to change a logic data structure associated with the moved window to describe the new position of the moved window in the window stack. 2. The computer readable medium as defined in claim 1, wherein the window stack is a logical arrangement of active and inactive windows for the multi-screen device. 3. The computer readable medium as defined in claim 2, wherein the moved window is displayed on at least one of two displays of the multi-screen device. 4. The computer readable medium as defined in claim 1, wherein the new position in the window stack can be associated with a different display of the at least two displays. 5. The computer readable medium as defined in claim 1, wherein the new position in the window stack can be a position among all windows without association to one of the displays of the multi-screen device. 6. The computer readable medium as defined in claim 1, wherein the logical data structure comprises one or more of:
a window identifier adapted to identify the moved window in relation to other windows in the window stack; a window stack position identifier adapted to identify the new position in the window stack for the moved window; and a display identifier adapted to identify which one of two displays of the multi-screen device the moved window is associated. 7. The computer readable medium as defined in claim 6, wherein a first display of the multi-screen device is associated with a first stack and a second display of the multi-screen device is associated with a second stack. 8. The computer readable medium as defined in claim 7, wherein the logic data structure further comprises a window stack identifier adapted to identify which one or more of the first stack and second stack the moved window is associated. 9. The computer readable medium as defined in claim 8, wherein the moved window is displayed across both the first and second display. 10. The computer readable medium as defined in claim 9, wherein the moved window has an identifier for a composite display associated with all the displays of the multi-screen device. 11. A device comprising:
at least two displays; a memory; a processor in communication with the memory and each of the at least two displays, the processor operable to:
receive a gesture on the device, wherein the gesture moves a window;
determine a new position in the window stack for the moved window or the one or more altered windows;
determine one of the two displays of the device associated with the moved window or the one or more altered windows; and
after determining the position and associated display of the moved window or the one or more altered windows, change the one or more logic data structures associated with the moved window or the one or more altered windows to describe the new position of the moved window or the one or more altered windows in the window stack, wherein the window stack is an arrangement of the moved window and at least one other window for at least one of the at least two displays. 12. The computer readable medium as defined in claim 11, wherein the moved window is displayed on at least one of the at least two displays of the device. 13. The computer readable medium as defined in claim 11, wherein the position in the window stack can be associated with at least one of the at least two displays or among all windows without association to one of the at least two displays of the device. 14. The computer readable medium as defined in claim 11, wherein the logic data structure comprises one or more of:
a window identifier adapted to identify the moved window in relation to other windows in the window stack; a window stack position identifier adapted to identify the position in the window stack for the moved window; and a display identifier adapted to identify which one of the at least two displays of the multi-screen device the moved window is associated. 15. The computer readable medium as defined in claim 14, wherein a first display of the multi-screen device is associated with a first stack and a second display of the multi-screen device is associated with a second stack. 16. A method for changing a window stack in a multi-screen device, the method comprising:
receiving a gesture associated with a window in a first display of the multi-screen device; interpreting the gesture as moving the window; determining if the gesture affects one or more other windows; determining a new position in the window stack for the moved window; determining a display associated with the moved window; changing a logic data structure associated with the moved window to describe the new position of the moved window in the window stack if the gesture affects one or more other windows:
determining a second new position for at least one of the one or more other windows; and
changing a second logic data structure associated with at least one of the one or more other windows to describe the second new position of the at least one of the one or more other windows in the window stack. 17. The method defined in claim 16, wherein the logic data structure comprises one or more of:
a window identifier that identifies the moved window in relation to other windows in the window stack; a window stack position identifier adapted to identify the new position in the window stack for the moved window; and a display identifier adapted to identify at least one of the first display or a second display of the multi-screen device is associated with the moved window. 18. The method defined in claim 16, wherein the window stack includes at least one inactive window. 19. The method defined in claim 16, wherein the moved window is also associated with a second display of the multi-screen device. 20. The method defined in claim 19, wherein the logic data structure also comprises a second display identifier adapted to identify that the second display of the multi-screen device is associated with the moved window. | Systems and methods are provides for changing a window stack for a multi-screen device. The window stack can change based on the movement of a window. The system can receive a gesture indicating a change in the position of a window in the device. Upon receiving the gesture, the system determines a new position in the window stack for the moved window. Then, the system can determine a display associated with the moved window and change the logic data structure associated with the moved window to describe the new position of the moved window in the window stack.1. A computer readable medium, having stored thereon, computer-executable instructions executable by a processor, the computer-executable instructions causing the processor to execute a method for creating a window stack for a multi-screen device, the computer-executable instructions comprising:
instructions to receive a gesture to move a window associated with the device; instructions to determine a display associated with the moved window; instructions to determine a new position in the window stack for the moved window; and after determining the position of and the display associated with the moved window, instructions to change a logic data structure associated with the moved window to describe the new position of the moved window in the window stack. 2. The computer readable medium as defined in claim 1, wherein the window stack is a logical arrangement of active and inactive windows for the multi-screen device. 3. The computer readable medium as defined in claim 2, wherein the moved window is displayed on at least one of two displays of the multi-screen device. 4. The computer readable medium as defined in claim 1, wherein the new position in the window stack can be associated with a different display of the at least two displays. 5. The computer readable medium as defined in claim 1, wherein the new position in the window stack can be a position among all windows without association to one of the displays of the multi-screen device. 6. The computer readable medium as defined in claim 1, wherein the logical data structure comprises one or more of:
a window identifier adapted to identify the moved window in relation to other windows in the window stack; a window stack position identifier adapted to identify the new position in the window stack for the moved window; and a display identifier adapted to identify which one of two displays of the multi-screen device the moved window is associated. 7. The computer readable medium as defined in claim 6, wherein a first display of the multi-screen device is associated with a first stack and a second display of the multi-screen device is associated with a second stack. 8. The computer readable medium as defined in claim 7, wherein the logic data structure further comprises a window stack identifier adapted to identify which one or more of the first stack and second stack the moved window is associated. 9. The computer readable medium as defined in claim 8, wherein the moved window is displayed across both the first and second display. 10. The computer readable medium as defined in claim 9, wherein the moved window has an identifier for a composite display associated with all the displays of the multi-screen device. 11. A device comprising:
at least two displays; a memory; a processor in communication with the memory and each of the at least two displays, the processor operable to:
receive a gesture on the device, wherein the gesture moves a window;
determine a new position in the window stack for the moved window or the one or more altered windows;
determine one of the two displays of the device associated with the moved window or the one or more altered windows; and
after determining the position and associated display of the moved window or the one or more altered windows, change the one or more logic data structures associated with the moved window or the one or more altered windows to describe the new position of the moved window or the one or more altered windows in the window stack, wherein the window stack is an arrangement of the moved window and at least one other window for at least one of the at least two displays. 12. The computer readable medium as defined in claim 11, wherein the moved window is displayed on at least one of the at least two displays of the device. 13. The computer readable medium as defined in claim 11, wherein the position in the window stack can be associated with at least one of the at least two displays or among all windows without association to one of the at least two displays of the device. 14. The computer readable medium as defined in claim 11, wherein the logic data structure comprises one or more of:
a window identifier adapted to identify the moved window in relation to other windows in the window stack; a window stack position identifier adapted to identify the position in the window stack for the moved window; and a display identifier adapted to identify which one of the at least two displays of the multi-screen device the moved window is associated. 15. The computer readable medium as defined in claim 14, wherein a first display of the multi-screen device is associated with a first stack and a second display of the multi-screen device is associated with a second stack. 16. A method for changing a window stack in a multi-screen device, the method comprising:
receiving a gesture associated with a window in a first display of the multi-screen device; interpreting the gesture as moving the window; determining if the gesture affects one or more other windows; determining a new position in the window stack for the moved window; determining a display associated with the moved window; changing a logic data structure associated with the moved window to describe the new position of the moved window in the window stack if the gesture affects one or more other windows:
determining a second new position for at least one of the one or more other windows; and
changing a second logic data structure associated with at least one of the one or more other windows to describe the second new position of the at least one of the one or more other windows in the window stack. 17. The method defined in claim 16, wherein the logic data structure comprises one or more of:
a window identifier that identifies the moved window in relation to other windows in the window stack; a window stack position identifier adapted to identify the new position in the window stack for the moved window; and a display identifier adapted to identify at least one of the first display or a second display of the multi-screen device is associated with the moved window. 18. The method defined in claim 16, wherein the window stack includes at least one inactive window. 19. The method defined in claim 16, wherein the moved window is also associated with a second display of the multi-screen device. 20. The method defined in claim 19, wherein the logic data structure also comprises a second display identifier adapted to identify that the second display of the multi-screen device is associated with the moved window. | 2,100 |
4,533 | 13,900,757 | 2,199 | A method of distributing threads among accelerators in a high performance computing system receives a request to assign an accelerator in the computing system to a thread. The request includes a mode indicative of location and exclusivity of the accelerator for use by the thread. The method selects the accelerator according to a processor assigned to the thread. The method also assigns the accelerator to the thread with the exclusivity specified in the request. | 1. A method of distributing threads among accelerators in a high performance computing system, the method comprising:
receiving, by an allocator, a request to assign an accelerator in the computing system to a thread, the request including a mode indicative of location and exclusivity of the accelerator for use by the thread; selecting, by the allocator, the accelerator according to a processor assigned to the thread; and assigning, by the allocator, the accelerator to the thread with the exclusivity specified in the request. 2. The method of claim 1, wherein receiving the request comprises receiving an identifier of the accelerator to assign to the thread. 3. The method of claim 2, further comprising:
determining, by the allocator, from the mode that the thread requires exclusive use of the accelerator; and storing, by the allocator, a record indicating the thread to which the accelerator is exclusively assigned. 4. The method of claim 3, further comprising:
uncoupling, by the allocator, threads that are already executing on the accelerator from the accelerator; selecting, by the allocator, a second accelerator to execute the threads; and assigning, by the allocator, the second accelerator to the threads. 5. The method of claim 1, wherein receiving the request comprises receiving a reference accelerator from which the allocator begins searching for the accelerator to assign to the thread. 6. The method of claim 5, wherein selecting the accelerator comprises
determining, by the allocator, that an accelerator proximate to the reference accelerator is available. 7. The method of claim 6, wherein determining if the accelerator proximate to the reference accelerator is available comprises
reading, by the allocator, a record that stores a status of the accelerator. 8. The method of claim 5, wherein selecting the accelerator comprises
iteratively determining, by the allocator, availability of accelerators in order of proximity to the reference accelerator until an available accelerator is found. 9. The method of claim 8, further comprising:
determining, by the allocator, from the mode that the thread requires exclusive use of the accelerator; and storing, by the allocator, a record indicating that the accelerator is unavailable. 10. The method of claim 9, further comprising:
uncoupling, by the allocator, threads that are already executing on the accelerator from the accelerator; selecting, by the allocator, a second accelerator to execute the threads; and assigning, by the allocator, the second accelerator to the threads. 11. The method of claim 1, further comprising:
receiving, by the allocator, a second request to assign an accelerator in the computing system to a thread, the second request including a mode indicative of at least one property of the accelerator for use by the thread; selecting, by the allocator, the accelerator according to the at least one property of the mode; and assigning, by the allocator, the accelerator with the at least one property of the mode to the thread. 12. A high performance computer system having at least one partition, the partition having a plurality of nodes that cooperate to perform a computation, a plurality of the nodes in the partition, each node comprising:
at least one computing processor, and a local memory, coupled to the at least one computing processor; a subset of the computer processors being directly coupled to at least one accelerator; and an allocator of the partition configured to be executed by at least one computing processor that is configured to 1) receive a request to assign an accelerator in the computing system to a thread, the request including a mode indicative of location and exclusivity of the accelerator for use by the thread, 2) select the accelerator according to a processor assigned to the thread, and 3) assign the accelerator to the thread with the exclusivity specified in the request. 13. The high performance computer system of claim 12, wherein the allocator is configured to receive an identifier of the accelerator to assign to the thread. 14. The high performance computer system of claim 13, wherein the allocator is configured to determine from the mode that the thread requires exclusive use of the accelerator, and store a record indicating the thread to which the accelerator is exclusively assigned. 15. The high performance computer system of claim 14, wherein the allocator is configured to uncouple threads that are already executing on the accelerator from the accelerator, select a second accelerator to execute the threads, and assign the second accelerator to the threads. 16. The high performance computer system of claim 12, wherein the allocator is configured to receive a reference accelerator from which the allocator begins searching for the accelerator to assign to the thread. 17. The high performance computer system of claim 16, wherein the allocator is configured to determine that an accelerator proximate to the reference accelerator is available. 18. The high performance computer system of claim 17, wherein the allocator is configured to read a record that stores a status of the accelerator. 19. The high performance computer system of claim 16, wherein the allocator is configured to iteratively determine availability of accelerators in order of proximity to the reference accelerator until an available accelerator is found. 20. The high performance computer system of claim 19, wherein the allocator is configured to determine from the mode that the thread requires exclusive use of the accelerator, and store a record indicating that the accelerator is unavailable. 21. The high performance computer system of claim 20, wherein the allocator is configured to uncouple threads that are already executing on the accelerator from the accelerator, select a second accelerator to execute the threads, and assign the second accelerator to the threads. 22. The high performance computer system of claim 12, wherein the allocator is further configured to 1) receive a second request to assign an accelerator in the computing system to a thread, the second request including a mode indicative of at least one property of the accelerator for use by the thread, 2) select the accelerator according to the at least one property of the mode, and 3) assign the accelerator with the at least one property of the mode to the thread. 23. A computer program product for distributing threads among accelerators in a partition of a high performance computing system, the partition having a plurality of nodes that cooperate to perform a computation, each node in the partition comprising at least one computing processor and a memory, the computer program product having a computer usable medium with non-transitory computer readable program code thereon, the program code comprising program code for:
receiving a request to assign an accelerator in the computing system to a thread, the request including a mode indicative of location and exclusivity of the accelerator for use by the thread; selecting the accelerator according to a processor assigned to the thread; and assigning the accelerator to the thread with the exclusivity specified in the request. 24. The computer program product of claim 23, the program code further comprising program code for:
receiving an identifier of the accelerator to assign to the thread. 25. The computer program product of claim 24, the program code further comprising program code for:
determining from the mode that the thread requires exclusive use of the accelerator; and storing a record indicating the thread to which the accelerator is exclusively assigned. 26. The computer program product of claim 25, the program code further comprising program code for:
uncoupling threads that are already executing on the accelerator from the accelerator; selecting a second accelerator to execute the threads; and assigning the second accelerator to the threads. 27. The computer program product of claim 23, the program code further comprising program code for:
receiving a reference accelerator from which the allocator begins searching for the accelerator to assign to the thread. 28. The computer program product of claim 27, the program code further comprising program code for:
determining that an accelerator proximate to the reference accelerator is available. 29. The computer program product of claim 28, the program code further comprising program code for:
reading a record that stores a status of the accelerator. 30. The computer program product of claim 27, the program code further comprising program code for:
iteratively determining availability of accelerators in order of proximity to the reference accelerator until an available accelerator is found. 31. The computer program product of claim 30, the program code further comprising program code for:
determining from the mode that the thread requires exclusive use of the accelerator; and storing a record indicating that the accelerator is unavailable. 32. The computer program product of claim 31, the program code further comprising program code for:
uncoupling threads that are already executing on the accelerator from the accelerator; selecting a second accelerator to execute the threads; and assigning the second accelerator to the threads. 33. The computer program product of claim 23, the program code further comprising program code for:
receiving a second request to assign an accelerator in the computing system to a thread, the second request including a mode indicative of at least one property of the accelerator for use by the thread; selecting the accelerator according to the at least one property of the mode; and assigning the accelerator with the at least one property of the mode to the thread. | A method of distributing threads among accelerators in a high performance computing system receives a request to assign an accelerator in the computing system to a thread. The request includes a mode indicative of location and exclusivity of the accelerator for use by the thread. The method selects the accelerator according to a processor assigned to the thread. The method also assigns the accelerator to the thread with the exclusivity specified in the request.1. A method of distributing threads among accelerators in a high performance computing system, the method comprising:
receiving, by an allocator, a request to assign an accelerator in the computing system to a thread, the request including a mode indicative of location and exclusivity of the accelerator for use by the thread; selecting, by the allocator, the accelerator according to a processor assigned to the thread; and assigning, by the allocator, the accelerator to the thread with the exclusivity specified in the request. 2. The method of claim 1, wherein receiving the request comprises receiving an identifier of the accelerator to assign to the thread. 3. The method of claim 2, further comprising:
determining, by the allocator, from the mode that the thread requires exclusive use of the accelerator; and storing, by the allocator, a record indicating the thread to which the accelerator is exclusively assigned. 4. The method of claim 3, further comprising:
uncoupling, by the allocator, threads that are already executing on the accelerator from the accelerator; selecting, by the allocator, a second accelerator to execute the threads; and assigning, by the allocator, the second accelerator to the threads. 5. The method of claim 1, wherein receiving the request comprises receiving a reference accelerator from which the allocator begins searching for the accelerator to assign to the thread. 6. The method of claim 5, wherein selecting the accelerator comprises
determining, by the allocator, that an accelerator proximate to the reference accelerator is available. 7. The method of claim 6, wherein determining if the accelerator proximate to the reference accelerator is available comprises
reading, by the allocator, a record that stores a status of the accelerator. 8. The method of claim 5, wherein selecting the accelerator comprises
iteratively determining, by the allocator, availability of accelerators in order of proximity to the reference accelerator until an available accelerator is found. 9. The method of claim 8, further comprising:
determining, by the allocator, from the mode that the thread requires exclusive use of the accelerator; and storing, by the allocator, a record indicating that the accelerator is unavailable. 10. The method of claim 9, further comprising:
uncoupling, by the allocator, threads that are already executing on the accelerator from the accelerator; selecting, by the allocator, a second accelerator to execute the threads; and assigning, by the allocator, the second accelerator to the threads. 11. The method of claim 1, further comprising:
receiving, by the allocator, a second request to assign an accelerator in the computing system to a thread, the second request including a mode indicative of at least one property of the accelerator for use by the thread; selecting, by the allocator, the accelerator according to the at least one property of the mode; and assigning, by the allocator, the accelerator with the at least one property of the mode to the thread. 12. A high performance computer system having at least one partition, the partition having a plurality of nodes that cooperate to perform a computation, a plurality of the nodes in the partition, each node comprising:
at least one computing processor, and a local memory, coupled to the at least one computing processor; a subset of the computer processors being directly coupled to at least one accelerator; and an allocator of the partition configured to be executed by at least one computing processor that is configured to 1) receive a request to assign an accelerator in the computing system to a thread, the request including a mode indicative of location and exclusivity of the accelerator for use by the thread, 2) select the accelerator according to a processor assigned to the thread, and 3) assign the accelerator to the thread with the exclusivity specified in the request. 13. The high performance computer system of claim 12, wherein the allocator is configured to receive an identifier of the accelerator to assign to the thread. 14. The high performance computer system of claim 13, wherein the allocator is configured to determine from the mode that the thread requires exclusive use of the accelerator, and store a record indicating the thread to which the accelerator is exclusively assigned. 15. The high performance computer system of claim 14, wherein the allocator is configured to uncouple threads that are already executing on the accelerator from the accelerator, select a second accelerator to execute the threads, and assign the second accelerator to the threads. 16. The high performance computer system of claim 12, wherein the allocator is configured to receive a reference accelerator from which the allocator begins searching for the accelerator to assign to the thread. 17. The high performance computer system of claim 16, wherein the allocator is configured to determine that an accelerator proximate to the reference accelerator is available. 18. The high performance computer system of claim 17, wherein the allocator is configured to read a record that stores a status of the accelerator. 19. The high performance computer system of claim 16, wherein the allocator is configured to iteratively determine availability of accelerators in order of proximity to the reference accelerator until an available accelerator is found. 20. The high performance computer system of claim 19, wherein the allocator is configured to determine from the mode that the thread requires exclusive use of the accelerator, and store a record indicating that the accelerator is unavailable. 21. The high performance computer system of claim 20, wherein the allocator is configured to uncouple threads that are already executing on the accelerator from the accelerator, select a second accelerator to execute the threads, and assign the second accelerator to the threads. 22. The high performance computer system of claim 12, wherein the allocator is further configured to 1) receive a second request to assign an accelerator in the computing system to a thread, the second request including a mode indicative of at least one property of the accelerator for use by the thread, 2) select the accelerator according to the at least one property of the mode, and 3) assign the accelerator with the at least one property of the mode to the thread. 23. A computer program product for distributing threads among accelerators in a partition of a high performance computing system, the partition having a plurality of nodes that cooperate to perform a computation, each node in the partition comprising at least one computing processor and a memory, the computer program product having a computer usable medium with non-transitory computer readable program code thereon, the program code comprising program code for:
receiving a request to assign an accelerator in the computing system to a thread, the request including a mode indicative of location and exclusivity of the accelerator for use by the thread; selecting the accelerator according to a processor assigned to the thread; and assigning the accelerator to the thread with the exclusivity specified in the request. 24. The computer program product of claim 23, the program code further comprising program code for:
receiving an identifier of the accelerator to assign to the thread. 25. The computer program product of claim 24, the program code further comprising program code for:
determining from the mode that the thread requires exclusive use of the accelerator; and storing a record indicating the thread to which the accelerator is exclusively assigned. 26. The computer program product of claim 25, the program code further comprising program code for:
uncoupling threads that are already executing on the accelerator from the accelerator; selecting a second accelerator to execute the threads; and assigning the second accelerator to the threads. 27. The computer program product of claim 23, the program code further comprising program code for:
receiving a reference accelerator from which the allocator begins searching for the accelerator to assign to the thread. 28. The computer program product of claim 27, the program code further comprising program code for:
determining that an accelerator proximate to the reference accelerator is available. 29. The computer program product of claim 28, the program code further comprising program code for:
reading a record that stores a status of the accelerator. 30. The computer program product of claim 27, the program code further comprising program code for:
iteratively determining availability of accelerators in order of proximity to the reference accelerator until an available accelerator is found. 31. The computer program product of claim 30, the program code further comprising program code for:
determining from the mode that the thread requires exclusive use of the accelerator; and storing a record indicating that the accelerator is unavailable. 32. The computer program product of claim 31, the program code further comprising program code for:
uncoupling threads that are already executing on the accelerator from the accelerator; selecting a second accelerator to execute the threads; and assigning the second accelerator to the threads. 33. The computer program product of claim 23, the program code further comprising program code for:
receiving a second request to assign an accelerator in the computing system to a thread, the second request including a mode indicative of at least one property of the accelerator for use by the thread; selecting the accelerator according to the at least one property of the mode; and assigning the accelerator with the at least one property of the mode to the thread. | 2,100 |
4,534 | 14,323,955 | 2,135 | Systems, methods and/or devices are used to enable using sub-region I/O history to cache repeatedly accessed sub-regions in a non-volatile storage device. In one aspect, the method includes (1) receiving a plurality of input/output (I/O) requests including read requests and write requests to be performed in a plurality of regions in a logical address space of a host, and (2) performing one or more operations for each region of the plurality of regions in the logical address space of the host, including, for each sub-region of a plurality of sub-regions of the region: (a) determining whether the sub-region is accessed more than a predetermined threshold number of times during a predetermined time period, and (b) if so, caching, from a storage medium of the storage device to a cache of the storage device, data from the sub-region. | 1. A method, comprising:
receiving, at a storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
for each sub-region of a plurality of sub-regions of the region,
determining whether the sub-region is accessed more than a predetermined threshold number of times during a predetermined time period; and
in accordance with a determination that the sub-region is accessed more than the predetermined threshold number of times in the predetermined time period, caching, from a storage medium of the storage device to a cache of the storage device, data from the sub-region. 2. The method of claim 1, wherein, with respect to a sub-region of the plurality of sub-regions, caching data from the sub-region includes:
in response to a subsequent write request to the sub-region, caching the sub-region. 3. The method of claim 1, further comprising, with respect to a sub-region of the plurality of sub-regions, subsequent to caching data from the sub-region:
writing subsequent write requests to the sub-region to the cache; reading subsequent read requests from the sub-region from the cache; and writing contents of the cache to the storage medium of the storage device in a merged operation. 4. The method of claim 1, further comprising, for each region of the plurality of regions in the logical address space, storing information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. 5. The method of claim 1, wherein the predetermined time period is configurable. 6. The method of claim 1, wherein the predetermined threshold number is configurable. 7. The method of claim 1, wherein the storage device comprises one or more flash memory devices. 8. The method of claim 1, wherein the storage device comprises one or more three-dimensional (3D) memory devices and circuitry associated with operation of memory elements in the one or more 3D memory devices. 9. The method of claim 8, wherein the circuitry and one or more memory elements in a respective 3D memory device, of the one or more 3D memory devices, are on the same substrate. 10. A storage device, comprising:
one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage device to:
receive, at the storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining, for each sub-region of a plurality of sub-regions of the region, whether the sub-region is accessed more than a predetermined threshold number of times during a predetermined time period; and
caching, operative in accordance with the determination that the sub-region is accessed more than the predetermined threshold number of times in the predetermined time period, from a storage medium of the storage device to a cache of the storage device, data from the sub-region. 11. The storage device of claim 10, wherein, with respect to a sub-region of the plurality of sub-regions, caching data from the sub-region includes:
in response to a subsequent write request to the sub-region, caching the sub-region. 12. The storage device of claim 10, wherein the one or more programs, which when executed by the one or more processors, further cause the storage device to, with respect to a sub-region of the plurality of sub-regions, subsequent to caching data from the sub-region:
write subsequent write requests to the sub-region to the cache; read subsequent read requests from the sub-region from the cache; and write contents of the cache to the storage medium of the storage device in a merged operation. 13. The storage device of claim 10, wherein the one or more programs, which when executed by the one or more processors, further cause the storage device to:
for each region of the plurality of regions in the logical address space, store information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. 14. The storage device of claim 10, wherein the predetermined time period is configurable. 15. A storage system, comprising:
a storage medium; one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage system to:
receive, at a storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining, for each sub-region of a plurality of sub-regions of the region, whether the sub-region is accessed more than a predetermined threshold number of times during a predetermined time period; and
caching, operative in accordance with the determination that the sub-region is accessed more than the predetermined threshold number of times in the predetermined time period, from a storage medium of the storage device to a cache of the storage device, data from the sub-region. 16. A non-transitory computer readable storage medium, storing one or more programs configured for execution by one or more processors of a storage device, the one or more programs including instructions for:
receiving, at the storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
for each sub-region of a plurality of sub-regions of the region,
determining whether the sub-region is accessed more than a predetermined threshold number of times during a predetermined time period; and
in accordance with a determination that the sub-region is accessed more than the predetermined threshold number of times in the predetermined time period, caching, from a storage medium of the storage device to a cache of the storage device, data from the sub-region. 17. The non-transitory computer readable storage medium of claim 16, wherein, with respect to a sub-region of the plurality of sub-regions, caching data from the sub-region includes:
in response to a subsequent write request to the sub-region, caching the sub-region. 18. The non-transitory computer readable storage medium of claim 16, wherein the one or more programs further include instructions for, with respect to a sub-region of the plurality of sub-regions, subsequent to caching data from the sub-region:
writing subsequent write requests to the sub-region to the cache; reading subsequent read requests from the sub-region from the cache; and writing contents of the cache to the storage medium of the storage device in a merged operation. 19. The non-transitory computer readable storage medium of claim 16, wherein the one or more programs further include instructions for:
for each region of the plurality of regions in the logical address space, storing information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. 20. The non-transitory computer readable storage medium of claim 16, wherein the predetermined time period is configurable. | Systems, methods and/or devices are used to enable using sub-region I/O history to cache repeatedly accessed sub-regions in a non-volatile storage device. In one aspect, the method includes (1) receiving a plurality of input/output (I/O) requests including read requests and write requests to be performed in a plurality of regions in a logical address space of a host, and (2) performing one or more operations for each region of the plurality of regions in the logical address space of the host, including, for each sub-region of a plurality of sub-regions of the region: (a) determining whether the sub-region is accessed more than a predetermined threshold number of times during a predetermined time period, and (b) if so, caching, from a storage medium of the storage device to a cache of the storage device, data from the sub-region.1. A method, comprising:
receiving, at a storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
for each sub-region of a plurality of sub-regions of the region,
determining whether the sub-region is accessed more than a predetermined threshold number of times during a predetermined time period; and
in accordance with a determination that the sub-region is accessed more than the predetermined threshold number of times in the predetermined time period, caching, from a storage medium of the storage device to a cache of the storage device, data from the sub-region. 2. The method of claim 1, wherein, with respect to a sub-region of the plurality of sub-regions, caching data from the sub-region includes:
in response to a subsequent write request to the sub-region, caching the sub-region. 3. The method of claim 1, further comprising, with respect to a sub-region of the plurality of sub-regions, subsequent to caching data from the sub-region:
writing subsequent write requests to the sub-region to the cache; reading subsequent read requests from the sub-region from the cache; and writing contents of the cache to the storage medium of the storage device in a merged operation. 4. The method of claim 1, further comprising, for each region of the plurality of regions in the logical address space, storing information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. 5. The method of claim 1, wherein the predetermined time period is configurable. 6. The method of claim 1, wherein the predetermined threshold number is configurable. 7. The method of claim 1, wherein the storage device comprises one or more flash memory devices. 8. The method of claim 1, wherein the storage device comprises one or more three-dimensional (3D) memory devices and circuitry associated with operation of memory elements in the one or more 3D memory devices. 9. The method of claim 8, wherein the circuitry and one or more memory elements in a respective 3D memory device, of the one or more 3D memory devices, are on the same substrate. 10. A storage device, comprising:
one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage device to:
receive, at the storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining, for each sub-region of a plurality of sub-regions of the region, whether the sub-region is accessed more than a predetermined threshold number of times during a predetermined time period; and
caching, operative in accordance with the determination that the sub-region is accessed more than the predetermined threshold number of times in the predetermined time period, from a storage medium of the storage device to a cache of the storage device, data from the sub-region. 11. The storage device of claim 10, wherein, with respect to a sub-region of the plurality of sub-regions, caching data from the sub-region includes:
in response to a subsequent write request to the sub-region, caching the sub-region. 12. The storage device of claim 10, wherein the one or more programs, which when executed by the one or more processors, further cause the storage device to, with respect to a sub-region of the plurality of sub-regions, subsequent to caching data from the sub-region:
write subsequent write requests to the sub-region to the cache; read subsequent read requests from the sub-region from the cache; and write contents of the cache to the storage medium of the storage device in a merged operation. 13. The storage device of claim 10, wherein the one or more programs, which when executed by the one or more processors, further cause the storage device to:
for each region of the plurality of regions in the logical address space, store information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. 14. The storage device of claim 10, wherein the predetermined time period is configurable. 15. A storage system, comprising:
a storage medium; one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage system to:
receive, at a storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
determining, for each sub-region of a plurality of sub-regions of the region, whether the sub-region is accessed more than a predetermined threshold number of times during a predetermined time period; and
caching, operative in accordance with the determination that the sub-region is accessed more than the predetermined threshold number of times in the predetermined time period, from a storage medium of the storage device to a cache of the storage device, data from the sub-region. 16. A non-transitory computer readable storage medium, storing one or more programs configured for execution by one or more processors of a storage device, the one or more programs including instructions for:
receiving, at the storage device, a plurality of input/output (I/O) requests from a host, the plurality of I/O requests including read requests and write requests to be performed in a plurality of regions in a logical address space of the host; and performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
for each sub-region of a plurality of sub-regions of the region,
determining whether the sub-region is accessed more than a predetermined threshold number of times during a predetermined time period; and
in accordance with a determination that the sub-region is accessed more than the predetermined threshold number of times in the predetermined time period, caching, from a storage medium of the storage device to a cache of the storage device, data from the sub-region. 17. The non-transitory computer readable storage medium of claim 16, wherein, with respect to a sub-region of the plurality of sub-regions, caching data from the sub-region includes:
in response to a subsequent write request to the sub-region, caching the sub-region. 18. The non-transitory computer readable storage medium of claim 16, wherein the one or more programs further include instructions for, with respect to a sub-region of the plurality of sub-regions, subsequent to caching data from the sub-region:
writing subsequent write requests to the sub-region to the cache; reading subsequent read requests from the sub-region from the cache; and writing contents of the cache to the storage medium of the storage device in a merged operation. 19. The non-transitory computer readable storage medium of claim 16, wherein the one or more programs further include instructions for:
for each region of the plurality of regions in the logical address space, storing information in a data structure to maintain a history of I/O request patterns in the region for the predetermined time period. 20. The non-transitory computer readable storage medium of claim 16, wherein the predetermined time period is configurable. | 2,100 |
4,535 | 14,662,731 | 2,114 | A scripting language, scripting-language execution environment and methodology is provided that allows for the self-tuning of troubleshooting scripts and, in particular, to allow for the execution of the troubleshooting workflow in an order that will resolve the user's troubleshooting issue with improved accuracy and speed. | 1. A computer-implemented method for executing a workflow, the method comprising:
determining an execution history for one or more of a plurality of chunks of the workflow, each chunk of the plurality of chunks defining at least a single action of the workflow; determining at least one ordered set of chunks from the plurality of chunks using the execution history of the plurality of chunks; and executing the at least one ordered set of chunks. 2. The computer-implemented method of claim 1, further comprising defining at least one of the plurality of chunks as a semantic structure that includes a gate, an action, and a verification using one or more commands of a scripting language. 3. The computer-implemented method of claim 1 further comprising:
determining a plurality of context variables and a plurality of constraints; and,
determining the at least one ordered set of chunks from the plurality of chunks using, in conjunction with the execution history of the plurality of chunks, the plurality of context variables and the plurality of constraints. 4. The computer-implemented method of claim 3 further comprising:
training a processor, for determining the at least one ordered set of chunks, using the execution history of the plurality of chunks;
determining a resolution for at least one chunk of the at least one ordered set of chunks upon execution thereof; and
updating the execution history with the resolution. 5. The computer-implemented method of claim 4 further comprising:
training the processor, for determining the at least one ordered set of chunks, using the plurality of context variables and the plurality of constraints; and
determining a success rate and an execution time for selected ones of the plurality of chunks. 6. The computer-implemented method of claim 1 wherein the workflow is a troubleshooting workflow related to communications services. 7. The computer-implemented method of claim 6 wherein particular ones of the context variables of the plurality of context variables define a context associated with a user of the communications services. 8. The computer-implemented method of claim 3 wherein the at least one ordered set of chunks is in a sequential order, and the plurality of constraints define at least one constraint that defines the sequential order between a first chunk of the at least one ordered set of chunks and a second chunk of the at least one ordered set of chunks. 9. An apparatus for delivering a workflow, the apparatus comprising:
a processor configured to: determine an execution history for one or more of a plurality of chunks of the workflow, each chunk of the plurality of chunks defining at least a single action of the workflow; and determine at least one ordered set of chunks from the plurality of chunks using the execution history of the plurality of chunks. 10. The apparatus of claim 9 wherein the processor is further configured to utilize at least one of the plurality of chunks in a semantic structure that includes a gate, an action, and a verification. 11. The apparatus of claim 9 wherein the processor is further configured to determine a success rate and an execution time for selected ones of the chunks of the plurality of chunks. 12. The apparatus of claim 9 wherein the processor is further configured to execute the at least one ordered set of chunks. 13. The apparatus of claim 12, wherein the processor is further configured to:
determine a resolution for at least one chunk of the at least one ordered set of chunks upon execution thereof; and update the execution history with the resolution. 14. The apparatus of claim 10 wherein the gate defines an applicability of a particular action, the action is an operation directed to resolving the workflow, and the verification identifies a resolution indication for the particular action. 15. The apparatus of claim 9 wherein the processor is further configured to utilize a plurality of context variables, and use the plurality of context variables in conjunction with the execution history of the plurality of chunks, to determine the at least one ordered set of chunks. 16. The apparatus of claim 15 wherein the processor is configured to utilize at least one of the plurality of context variables based upon a troubleshooting request initiated by a user. 17. The apparatus of claim 15 wherein the processor is further configured to utilize a plurality of constraints, in conjunction with the execution history of the plurality of chunks and the plurality of context variables, to determine the at least one ordered set of chunks. 18. A non-transitory computer-readable medium storing computer program instructions for executing a workflow, the computer program instructions, when executed on a processor, cause the processor to perform operations comprising:
determining an execution history for one or more of a plurality of chunks of the workflow, each chunk of the plurality of chunks defining at least a single action of the workflow; determining at least one ordered set of chunks from the plurality of chunks using the execution history of the plurality of chunks; and executing the at least one ordered set of chunks. 19. The non-transitory computer-readable medium of claim 18 wherein the operations further comprise:
determining a plurality of context variables and a plurality of constraints for the plurality of chunks; and
determining the at least one ordered set of chunks from the plurality of chunks using, in conjunction with the execution history of the plurality of chunks, the plurality of context variables and the plurality of constraints. 20. The non-transitory computer-readable medium of claim 19 wherein at least one of the plurality of chunks is defined as a semantic structure that includes a gate, an action, and a verification using one or more commands of a scripting language, and the operations further comprising:
training a processor, for determining the at least one ordered set of chunks, using the execution history of the plurality of chunks;
determining a resolution for at least one chunk of the at least one ordered set of chunks upon execution thereof; and
updating the execution history with the resolution. | A scripting language, scripting-language execution environment and methodology is provided that allows for the self-tuning of troubleshooting scripts and, in particular, to allow for the execution of the troubleshooting workflow in an order that will resolve the user's troubleshooting issue with improved accuracy and speed.1. A computer-implemented method for executing a workflow, the method comprising:
determining an execution history for one or more of a plurality of chunks of the workflow, each chunk of the plurality of chunks defining at least a single action of the workflow; determining at least one ordered set of chunks from the plurality of chunks using the execution history of the plurality of chunks; and executing the at least one ordered set of chunks. 2. The computer-implemented method of claim 1, further comprising defining at least one of the plurality of chunks as a semantic structure that includes a gate, an action, and a verification using one or more commands of a scripting language. 3. The computer-implemented method of claim 1 further comprising:
determining a plurality of context variables and a plurality of constraints; and,
determining the at least one ordered set of chunks from the plurality of chunks using, in conjunction with the execution history of the plurality of chunks, the plurality of context variables and the plurality of constraints. 4. The computer-implemented method of claim 3 further comprising:
training a processor, for determining the at least one ordered set of chunks, using the execution history of the plurality of chunks;
determining a resolution for at least one chunk of the at least one ordered set of chunks upon execution thereof; and
updating the execution history with the resolution. 5. The computer-implemented method of claim 4 further comprising:
training the processor, for determining the at least one ordered set of chunks, using the plurality of context variables and the plurality of constraints; and
determining a success rate and an execution time for selected ones of the plurality of chunks. 6. The computer-implemented method of claim 1 wherein the workflow is a troubleshooting workflow related to communications services. 7. The computer-implemented method of claim 6 wherein particular ones of the context variables of the plurality of context variables define a context associated with a user of the communications services. 8. The computer-implemented method of claim 3 wherein the at least one ordered set of chunks is in a sequential order, and the plurality of constraints define at least one constraint that defines the sequential order between a first chunk of the at least one ordered set of chunks and a second chunk of the at least one ordered set of chunks. 9. An apparatus for delivering a workflow, the apparatus comprising:
a processor configured to: determine an execution history for one or more of a plurality of chunks of the workflow, each chunk of the plurality of chunks defining at least a single action of the workflow; and determine at least one ordered set of chunks from the plurality of chunks using the execution history of the plurality of chunks. 10. The apparatus of claim 9 wherein the processor is further configured to utilize at least one of the plurality of chunks in a semantic structure that includes a gate, an action, and a verification. 11. The apparatus of claim 9 wherein the processor is further configured to determine a success rate and an execution time for selected ones of the chunks of the plurality of chunks. 12. The apparatus of claim 9 wherein the processor is further configured to execute the at least one ordered set of chunks. 13. The apparatus of claim 12, wherein the processor is further configured to:
determine a resolution for at least one chunk of the at least one ordered set of chunks upon execution thereof; and update the execution history with the resolution. 14. The apparatus of claim 10 wherein the gate defines an applicability of a particular action, the action is an operation directed to resolving the workflow, and the verification identifies a resolution indication for the particular action. 15. The apparatus of claim 9 wherein the processor is further configured to utilize a plurality of context variables, and use the plurality of context variables in conjunction with the execution history of the plurality of chunks, to determine the at least one ordered set of chunks. 16. The apparatus of claim 15 wherein the processor is configured to utilize at least one of the plurality of context variables based upon a troubleshooting request initiated by a user. 17. The apparatus of claim 15 wherein the processor is further configured to utilize a plurality of constraints, in conjunction with the execution history of the plurality of chunks and the plurality of context variables, to determine the at least one ordered set of chunks. 18. A non-transitory computer-readable medium storing computer program instructions for executing a workflow, the computer program instructions, when executed on a processor, cause the processor to perform operations comprising:
determining an execution history for one or more of a plurality of chunks of the workflow, each chunk of the plurality of chunks defining at least a single action of the workflow; determining at least one ordered set of chunks from the plurality of chunks using the execution history of the plurality of chunks; and executing the at least one ordered set of chunks. 19. The non-transitory computer-readable medium of claim 18 wherein the operations further comprise:
determining a plurality of context variables and a plurality of constraints for the plurality of chunks; and
determining the at least one ordered set of chunks from the plurality of chunks using, in conjunction with the execution history of the plurality of chunks, the plurality of context variables and the plurality of constraints. 20. The non-transitory computer-readable medium of claim 19 wherein at least one of the plurality of chunks is defined as a semantic structure that includes a gate, an action, and a verification using one or more commands of a scripting language, and the operations further comprising:
training a processor, for determining the at least one ordered set of chunks, using the execution history of the plurality of chunks;
determining a resolution for at least one chunk of the at least one ordered set of chunks upon execution thereof; and
updating the execution history with the resolution. | 2,100 |
4,536 | 14,047,318 | 2,124 | Systems, methods, and other embodiments associated with equivalence reasoning are described. One example method includes iteratively inputting batches of unprocessed equivalence pairs from a semantic model to an operating memory. In the operating memory, one or more cliques for the input batches are built until no further batches remain. A clique designates a canonical representative resource for a group of equivalent resources as determined from the equivalence pairs. The one or more cliques are built for the input batches to a clique map in a remote access memory. The clique map is returned for use by the semantic model. | 1. A non-transitory computer-readable medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
iteratively inputting batches of unprocessed equivalence pairs from a semantic model to an operating memory; building, in the operating memory, one or more cliques for the input batches until no further batches remain, where a clique designates a canonical representative resource for a group of equivalent resources as determined from the equivalence pairs; appending the one or more cliques built for the input batches to a clique map in remote memory; and returning the clique map for use by the semantic model. 2. The non-transitory computer-readable medium of claim 1, where the building of one or more cliques is performed using a union-find algorithm that inputs a resource and outputs the canonical representative resource for the resource. 3. The non-transitory computer-readable medium of claim 1, further comprising merging the input cliques in the operating memory, where the merging comprises inputting a batch of merge candidate cliques into operating memory. 4. The non-transitory computer-readable medium of claim 3, further comprising updating the clique map with the merged cliques, where by performing an outer join between the merge candidate cliques and the clique map. 5. The non-transitory computer-readable medium of claim 3, further comprising selecting the merge candidate cliques based on the presence of a common resource in more than one clique. 6. The non-transitory computer-readable medium of claim 1, further comprising consolidating asserted triples in the semantic model based, at least in part, on the cliques in the clique map and storing the consolidated asserted triples in triple storage. 7. The non-transitory computer-readable medium of claim 6, further comprising:
firing inference rules on the consolidated asserted triples to create inferred triples; appending the triple storage with the inferred triples deducing one or more inferred equivalence pairs from the inferred triples; building one or more cliques for the inferred equivalence pairs; and updating the clique map based, at least in part, on the one or more cliques built for the inferred equivalence pairs. 8. The non-transitory computer-readable medium of claim 7, further comprising consolidating the triple storage based, at least in part, on the updated clique map by:
hash partitioning the triple storage by a property of triples in the triple storage; and consolidating the triple storage partition by partition. 9. The non-transitory computer-readable medium of claim 1, where the equivalence pairs comprise an OWL (web ontology language) sameAs property. 10. A computing system, comprising:
a clique building logic configured to iteratively input, into an operating memory, batches of one or more equivalence pairs from a semantic model and configured to cause a processor to output, to remote memory, a clique map that maps groups of one or more equivalent resources, as determined from the equivalence pairs, to a canonical representative resource. 11. The computing system of claim 10, further comprising:
an inference engine configured to generate inferred equivalence pairs based on one or more inference rules in the semantic model and where the clique building logic is configured to iteratively input, into operating memory, batches of one or more inferred equivalence pairs, and update the clique map with one or more cliques that consolidate groups of equivalent resources, as determined from the inferred equivalence pairs, to a canonical representative resource. 12. The computing system of claim 11, where the inference engine is configured to store an output of rules that infer an equivalence pair in a temporary table that is input to the clique building logic. 13. The computing system of claim 10, further comprising a triple consolidation logic configured to access the clique map to consolidate one or more triples that still have equivalent resources for the input batches that can be merged in the semantic model by replacing resources that are in a clique with their corresponding canonical representative resources. 14. The computing system of claim 13, where the triple consolidation logic is configured to access the updated clique map to consolidate triples in the semantic model and inferred triples by replacing triple resources that are in a clique with their corresponding canonical representative resources. 15. The computing system of claim 13, where the triple consolidation logic is configured to delete duplicate triples. 16. The computing system of claim 13, comprising a partitioned temporary table in remote memory in which triples asserted in the semantic model and triples inferred using inference rules in the semantic model are stored by an inference engine. 17. A non-transitory computer-readable medium storing computer executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
initializing a triple data store in remote access memory with triples asserted by a semantic model; analyzing, in an operating memory, input batches of equivalence pairs deduced from the asserted triples to update a clique map by:
building, in the operating memory, one or more cliques for the input batches until no further batches remain, where a clique designates a canonical representative resource for a group of equivalent resources as determined from the equivalence pairs;
appending the one or more cliques to a clique map in remote memory; and
iteratively transferring merge candidate cliques for the input batches that can be merged from the clique map to operating memory until no further merges can be made to the one or more cliques in the clique map. 18. The non-transitory computer-readable medium of claim 17, where the method includes:
firing inference rules associated with the semantic model to create one or more inferred triples; storing the inferred triples in a triple data store; indentifying one or more inferred equivalence pairs from the inferred triples; updating the clique map based, at least in part on, the inferred equivalence pairs; and consolidating the triple data store by replacing resources in triples that are in a clique with the corresponding canonical representative resource and deleting duplicate triples created by the replacement. 19. The non-transitory computer-readable medium of claim 17, where the building of one or more cliques is performed using a union-find algorithm that inputs a resource and outputs the canonical representative resource for the resource. 20. The non-transitory computer-readable medium of claim 17, further comprising merging the merge candidate cliques in the operating memory, where the merging is performed using a union-find algorithm that inputs a clique resource and outputs the canonical representative resource for the clique resource. | Systems, methods, and other embodiments associated with equivalence reasoning are described. One example method includes iteratively inputting batches of unprocessed equivalence pairs from a semantic model to an operating memory. In the operating memory, one or more cliques for the input batches are built until no further batches remain. A clique designates a canonical representative resource for a group of equivalent resources as determined from the equivalence pairs. The one or more cliques are built for the input batches to a clique map in a remote access memory. The clique map is returned for use by the semantic model.1. A non-transitory computer-readable medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
iteratively inputting batches of unprocessed equivalence pairs from a semantic model to an operating memory; building, in the operating memory, one or more cliques for the input batches until no further batches remain, where a clique designates a canonical representative resource for a group of equivalent resources as determined from the equivalence pairs; appending the one or more cliques built for the input batches to a clique map in remote memory; and returning the clique map for use by the semantic model. 2. The non-transitory computer-readable medium of claim 1, where the building of one or more cliques is performed using a union-find algorithm that inputs a resource and outputs the canonical representative resource for the resource. 3. The non-transitory computer-readable medium of claim 1, further comprising merging the input cliques in the operating memory, where the merging comprises inputting a batch of merge candidate cliques into operating memory. 4. The non-transitory computer-readable medium of claim 3, further comprising updating the clique map with the merged cliques, where by performing an outer join between the merge candidate cliques and the clique map. 5. The non-transitory computer-readable medium of claim 3, further comprising selecting the merge candidate cliques based on the presence of a common resource in more than one clique. 6. The non-transitory computer-readable medium of claim 1, further comprising consolidating asserted triples in the semantic model based, at least in part, on the cliques in the clique map and storing the consolidated asserted triples in triple storage. 7. The non-transitory computer-readable medium of claim 6, further comprising:
firing inference rules on the consolidated asserted triples to create inferred triples; appending the triple storage with the inferred triples deducing one or more inferred equivalence pairs from the inferred triples; building one or more cliques for the inferred equivalence pairs; and updating the clique map based, at least in part, on the one or more cliques built for the inferred equivalence pairs. 8. The non-transitory computer-readable medium of claim 7, further comprising consolidating the triple storage based, at least in part, on the updated clique map by:
hash partitioning the triple storage by a property of triples in the triple storage; and consolidating the triple storage partition by partition. 9. The non-transitory computer-readable medium of claim 1, where the equivalence pairs comprise an OWL (web ontology language) sameAs property. 10. A computing system, comprising:
a clique building logic configured to iteratively input, into an operating memory, batches of one or more equivalence pairs from a semantic model and configured to cause a processor to output, to remote memory, a clique map that maps groups of one or more equivalent resources, as determined from the equivalence pairs, to a canonical representative resource. 11. The computing system of claim 10, further comprising:
an inference engine configured to generate inferred equivalence pairs based on one or more inference rules in the semantic model and where the clique building logic is configured to iteratively input, into operating memory, batches of one or more inferred equivalence pairs, and update the clique map with one or more cliques that consolidate groups of equivalent resources, as determined from the inferred equivalence pairs, to a canonical representative resource. 12. The computing system of claim 11, where the inference engine is configured to store an output of rules that infer an equivalence pair in a temporary table that is input to the clique building logic. 13. The computing system of claim 10, further comprising a triple consolidation logic configured to access the clique map to consolidate one or more triples that still have equivalent resources for the input batches that can be merged in the semantic model by replacing resources that are in a clique with their corresponding canonical representative resources. 14. The computing system of claim 13, where the triple consolidation logic is configured to access the updated clique map to consolidate triples in the semantic model and inferred triples by replacing triple resources that are in a clique with their corresponding canonical representative resources. 15. The computing system of claim 13, where the triple consolidation logic is configured to delete duplicate triples. 16. The computing system of claim 13, comprising a partitioned temporary table in remote memory in which triples asserted in the semantic model and triples inferred using inference rules in the semantic model are stored by an inference engine. 17. A non-transitory computer-readable medium storing computer executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
initializing a triple data store in remote access memory with triples asserted by a semantic model; analyzing, in an operating memory, input batches of equivalence pairs deduced from the asserted triples to update a clique map by:
building, in the operating memory, one or more cliques for the input batches until no further batches remain, where a clique designates a canonical representative resource for a group of equivalent resources as determined from the equivalence pairs;
appending the one or more cliques to a clique map in remote memory; and
iteratively transferring merge candidate cliques for the input batches that can be merged from the clique map to operating memory until no further merges can be made to the one or more cliques in the clique map. 18. The non-transitory computer-readable medium of claim 17, where the method includes:
firing inference rules associated with the semantic model to create one or more inferred triples; storing the inferred triples in a triple data store; indentifying one or more inferred equivalence pairs from the inferred triples; updating the clique map based, at least in part on, the inferred equivalence pairs; and consolidating the triple data store by replacing resources in triples that are in a clique with the corresponding canonical representative resource and deleting duplicate triples created by the replacement. 19. The non-transitory computer-readable medium of claim 17, where the building of one or more cliques is performed using a union-find algorithm that inputs a resource and outputs the canonical representative resource for the resource. 20. The non-transitory computer-readable medium of claim 17, further comprising merging the merge candidate cliques in the operating memory, where the merging is performed using a union-find algorithm that inputs a clique resource and outputs the canonical representative resource for the clique resource. | 2,100 |
4,537 | 14,017,051 | 2,141 | A method of providing a service using a keypad is provided. The method includes displaying a text box and a keypad on an executed screen, inputting a start identifier according to a selection of a smart conversion button of the keypad, inputting a command after the identifier, inputting a termination identifier after the command, performing an intelligent service according to the command when the termination identifier is inputted, and outputting a result according to the intelligent service in the text box. | 1. A method of providing a service using a keypad, the method comprising:
displaying a text box and a keypad on an executed screen; inputting a start identifier according to a selection of a smart conversion button of the keypad; inputting a command after the identifier; inputting a termination identifier after the command; performing an intelligent service according to the command when the termination identifier is inputted; and outputting a result according to the intelligent service in the text box. 2. The method of claim 1, wherein the inputting of the command comprises:
displaying all preset commands in a command candidate group region if the start identifier is inputted; selecting a command in the command candidate group region; and inputting the selected command after the identifier. 3. The method of claim 2, wherein the inputting of the termination identifier comprises inputting the selected command and the termination identifier if the command is selected in the command candidate group region. 4. The method of claim 2, wherein the inputting of the command comprises inputting the command according to a user's selection using the keypad after inputting the start identifier. 5. The method of claim 4, wherein the inputting of the command comprises:
inputting a character for the command after the start identifier; and displaying the command including the character in the command candidate region. 6. The method of claim 5, wherein the displaying of the command comprises:
extracting a command candidate group including the character from the preset all command candidate group; and substituting the all commands of the command candidate group region with commands of the extracted command candidate group, and displaying the substituted commands. 7. The method of claim 4, wherein the inputting of the termination identifier comprises at least one of automatically inputting the termination identifier according to selection of the command including the character in the command candidate group region, inputting the termination identifier according to selection of a smart conversion button after the character is inputted. 8. The method of claim 1, further comprising:
receiving a selected input of the smart conversion button in a state where the result according to the intelligent service is outputted in the text box; and restoring a screen in a state before the result is outputted through the text box according to selection of the smart conversion button. 9. The method of claim 1, further comprising:
inputting the start identifier and the termination identifier by a user's direction input using the keypad. 10. The method of claim 1, wherein the performing of the intelligent service comprises:
determining whether there is a parameter in front of the start identifier, and, if there is the parameter in front of the start identifier, distinguishing a parameter inputted in front of the start identifier and a command between the start identifier and the termination identifier. 11. The method of claim 1, wherein the performing of the intelligent service comprises:
determining a performance of an intelligent service if the termination identifier is inputted; extracting an actual command between the start identifier and the termination identifier when the performance of the intelligent service is determined; determining whether the extracted command corresponds to a command designated in a command table; performing the intelligent service internally if the command is a command in the command table; and executing the intelligent service corresponding to the command by being linked with an external server if the command is a command that is not in the command table. 12. The method of claim 11, wherein the outputting comprises outputting a result according to performance of an internal intelligent service or outputting a result received from the external server according to performance of the intelligent service by being linked with the external server. 13. The method of claim 11, wherein the external server includes at least one of an integrated server and a content server. 14. The method of claim 13, further comprising:
determining whether the command corresponds to a command that may be performed when receiving action information including the command from a user device; performing an intelligent service according to the command if the command may be performed, and transmitting a result of the performance of the intelligent service to the user device; requesting performance of the intelligent service according to the command by being linked with the content server if the command may not be performed; and receiving the result of the performance of the intelligent service of the command from the content server, and transmitting the result to the user device. 15. A method of providing a service using a keypad, the method comprising:
displaying a keypad on a performance screen; generating a command in response to a user's input using the keypad; determining a service performance according to the generated command; determining whether there is a parameter inputted before the command when the service is performed; performing the service according to the command based on the parameter if there is such a parameter, and displaying a result of the performance of the service; and performing the service according to the command if there is no such a parameter, and displaying a result of the performance of the service. 16. A user device comprising:
a display unit for displaying a text box and a keypad on a performance screen of an application, for displaying a command candidate region linked with the keypad and at least one command candidate group in the command candidate group region, and for displaying a result of a performance of an intelligent service on the text box; a storage unit for storing a command table for an intelligent service; and a controller for controlling a selection of a smart conversion button of the keypad or an input of a start identifier, a command and a termination identifier according to a user's input and for controlling performance of the intelligent service according to a command between the identifiers so that a result of the performance of the intelligent service is inputted and displayed on the text box. 17. The user device of claim 16, wherein the controller controls to display at least one command candidate group to be displayed on the command candidate region in response to the start identifier or the command input. 18. The user device of claim 16, wherein the controller determines performance of an intelligent service if the termination identifier is inputted, extracts the command between the start identifier and the termination identifier when the performance of the intelligent service is determined, and controls the performance of the intelligent service in response to the extracted command. 19. The user device of claim 18, wherein the controller determines whether the extracted command corresponds to a command designated in the command table, controls background performance of the intelligent service if the command is a command that is in the command table, and controls performance of the intelligent service corresponding to the command by being linked with an external server if the command is a command that is not in the command table. 20. The user device of claim 18, wherein, if the smart conversion button is selected in a state where a result according to the intelligent service is outputted in the text box, the controller restores a screen in a state before the result is outputted through the text box. 21. An apparatus for supporting an intelligent service, the apparatus comprising:
a keypad user interface for providing a keypad on a performance screen; an input manager for supporting a character input by the keypad, for inputting a result transmitted from a command controller to a text box of the performance screen, and for exchanging a character of a command type of a previously inputted start identifier, command and termination identifier for a text of the result when the result is inputted; the command controller for obtaining a result by performance of an internal service or an external service for the command according to a result of analysis on the command of a command parser, and for controlling an output of the obtained result, if an input of a text of the command type of the start identifier, the command and the termination identifier; the command parser for extracting a command between the identifiers if the text is transmitted, for analyzing whether the extracted command corresponds to a command designated in a command table, and for providing a result of the analysis to the command controller; a network binder for obtaining a dynamic result for the command from the external service through a service application program interface or web parsing if the command is transmitted from the command controller; and the command table for storing preset commands and service information corresponding to each of the commands. 22. A system for supporting an intelligent service, the system comprising:
a user device for controlling an input of a start identifier, a command and a termination identifier according to a user's input or a selection of a smart conversion button of a keypad, for performing an intelligent service according to a command between the identifiers through an internal or external server, and for inputting and displaying a result of the performance of the intelligent service on the text box; and an integrated server for generating a result by performing an intelligent service according to the command, and for providing the generated result to the user device when performance of the intelligent service is requested from the user device. 23. The system of claim 22, wherein the integrated server determines whether the command may be performed, performs the intelligent service and transmits a result of the performance to the user device if the command may be performed, determines a content server that may perform the intelligent service if the command may not be performed, obtains a result for the intelligent service by being linked with the determined content server, and transmits the obtains result to the user device. 24. A recording medium for processing a display of a text box and a keypad on a performance screen of an application, for controlling an input of a start identifier, a command and a termination identifier according to a user's input or a selection of a smart conversion button using the keypad, for extracting a command between the identifiers when the termination identifier is inputted, for obtaining a result after performing a service according to the extracted command, and for inputting and displaying the obtained result on the text box. | A method of providing a service using a keypad is provided. The method includes displaying a text box and a keypad on an executed screen, inputting a start identifier according to a selection of a smart conversion button of the keypad, inputting a command after the identifier, inputting a termination identifier after the command, performing an intelligent service according to the command when the termination identifier is inputted, and outputting a result according to the intelligent service in the text box.1. A method of providing a service using a keypad, the method comprising:
displaying a text box and a keypad on an executed screen; inputting a start identifier according to a selection of a smart conversion button of the keypad; inputting a command after the identifier; inputting a termination identifier after the command; performing an intelligent service according to the command when the termination identifier is inputted; and outputting a result according to the intelligent service in the text box. 2. The method of claim 1, wherein the inputting of the command comprises:
displaying all preset commands in a command candidate group region if the start identifier is inputted; selecting a command in the command candidate group region; and inputting the selected command after the identifier. 3. The method of claim 2, wherein the inputting of the termination identifier comprises inputting the selected command and the termination identifier if the command is selected in the command candidate group region. 4. The method of claim 2, wherein the inputting of the command comprises inputting the command according to a user's selection using the keypad after inputting the start identifier. 5. The method of claim 4, wherein the inputting of the command comprises:
inputting a character for the command after the start identifier; and displaying the command including the character in the command candidate region. 6. The method of claim 5, wherein the displaying of the command comprises:
extracting a command candidate group including the character from the preset all command candidate group; and substituting the all commands of the command candidate group region with commands of the extracted command candidate group, and displaying the substituted commands. 7. The method of claim 4, wherein the inputting of the termination identifier comprises at least one of automatically inputting the termination identifier according to selection of the command including the character in the command candidate group region, inputting the termination identifier according to selection of a smart conversion button after the character is inputted. 8. The method of claim 1, further comprising:
receiving a selected input of the smart conversion button in a state where the result according to the intelligent service is outputted in the text box; and restoring a screen in a state before the result is outputted through the text box according to selection of the smart conversion button. 9. The method of claim 1, further comprising:
inputting the start identifier and the termination identifier by a user's direction input using the keypad. 10. The method of claim 1, wherein the performing of the intelligent service comprises:
determining whether there is a parameter in front of the start identifier, and, if there is the parameter in front of the start identifier, distinguishing a parameter inputted in front of the start identifier and a command between the start identifier and the termination identifier. 11. The method of claim 1, wherein the performing of the intelligent service comprises:
determining a performance of an intelligent service if the termination identifier is inputted; extracting an actual command between the start identifier and the termination identifier when the performance of the intelligent service is determined; determining whether the extracted command corresponds to a command designated in a command table; performing the intelligent service internally if the command is a command in the command table; and executing the intelligent service corresponding to the command by being linked with an external server if the command is a command that is not in the command table. 12. The method of claim 11, wherein the outputting comprises outputting a result according to performance of an internal intelligent service or outputting a result received from the external server according to performance of the intelligent service by being linked with the external server. 13. The method of claim 11, wherein the external server includes at least one of an integrated server and a content server. 14. The method of claim 13, further comprising:
determining whether the command corresponds to a command that may be performed when receiving action information including the command from a user device; performing an intelligent service according to the command if the command may be performed, and transmitting a result of the performance of the intelligent service to the user device; requesting performance of the intelligent service according to the command by being linked with the content server if the command may not be performed; and receiving the result of the performance of the intelligent service of the command from the content server, and transmitting the result to the user device. 15. A method of providing a service using a keypad, the method comprising:
displaying a keypad on a performance screen; generating a command in response to a user's input using the keypad; determining a service performance according to the generated command; determining whether there is a parameter inputted before the command when the service is performed; performing the service according to the command based on the parameter if there is such a parameter, and displaying a result of the performance of the service; and performing the service according to the command if there is no such a parameter, and displaying a result of the performance of the service. 16. A user device comprising:
a display unit for displaying a text box and a keypad on a performance screen of an application, for displaying a command candidate region linked with the keypad and at least one command candidate group in the command candidate group region, and for displaying a result of a performance of an intelligent service on the text box; a storage unit for storing a command table for an intelligent service; and a controller for controlling a selection of a smart conversion button of the keypad or an input of a start identifier, a command and a termination identifier according to a user's input and for controlling performance of the intelligent service according to a command between the identifiers so that a result of the performance of the intelligent service is inputted and displayed on the text box. 17. The user device of claim 16, wherein the controller controls to display at least one command candidate group to be displayed on the command candidate region in response to the start identifier or the command input. 18. The user device of claim 16, wherein the controller determines performance of an intelligent service if the termination identifier is inputted, extracts the command between the start identifier and the termination identifier when the performance of the intelligent service is determined, and controls the performance of the intelligent service in response to the extracted command. 19. The user device of claim 18, wherein the controller determines whether the extracted command corresponds to a command designated in the command table, controls background performance of the intelligent service if the command is a command that is in the command table, and controls performance of the intelligent service corresponding to the command by being linked with an external server if the command is a command that is not in the command table. 20. The user device of claim 18, wherein, if the smart conversion button is selected in a state where a result according to the intelligent service is outputted in the text box, the controller restores a screen in a state before the result is outputted through the text box. 21. An apparatus for supporting an intelligent service, the apparatus comprising:
a keypad user interface for providing a keypad on a performance screen; an input manager for supporting a character input by the keypad, for inputting a result transmitted from a command controller to a text box of the performance screen, and for exchanging a character of a command type of a previously inputted start identifier, command and termination identifier for a text of the result when the result is inputted; the command controller for obtaining a result by performance of an internal service or an external service for the command according to a result of analysis on the command of a command parser, and for controlling an output of the obtained result, if an input of a text of the command type of the start identifier, the command and the termination identifier; the command parser for extracting a command between the identifiers if the text is transmitted, for analyzing whether the extracted command corresponds to a command designated in a command table, and for providing a result of the analysis to the command controller; a network binder for obtaining a dynamic result for the command from the external service through a service application program interface or web parsing if the command is transmitted from the command controller; and the command table for storing preset commands and service information corresponding to each of the commands. 22. A system for supporting an intelligent service, the system comprising:
a user device for controlling an input of a start identifier, a command and a termination identifier according to a user's input or a selection of a smart conversion button of a keypad, for performing an intelligent service according to a command between the identifiers through an internal or external server, and for inputting and displaying a result of the performance of the intelligent service on the text box; and an integrated server for generating a result by performing an intelligent service according to the command, and for providing the generated result to the user device when performance of the intelligent service is requested from the user device. 23. The system of claim 22, wherein the integrated server determines whether the command may be performed, performs the intelligent service and transmits a result of the performance to the user device if the command may be performed, determines a content server that may perform the intelligent service if the command may not be performed, obtains a result for the intelligent service by being linked with the determined content server, and transmits the obtains result to the user device. 24. A recording medium for processing a display of a text box and a keypad on a performance screen of an application, for controlling an input of a start identifier, a command and a termination identifier according to a user's input or a selection of a smart conversion button using the keypad, for extracting a command between the identifiers when the termination identifier is inputted, for obtaining a result after performing a service according to the extracted command, and for inputting and displaying the obtained result on the text box. | 2,100 |
4,538 | 13,690,964 | 2,144 | Systems, methods, and software for facilitating enhanced collection environments are disclosed. In at least one implementation, a collection environment is presented that includes a presentation recording and a written paragraph. The presentation recording includes presentation sections while the paragraph includes written sections. A user input may be directed to the written paragraph. One of the written paragraphs is identified as corresponding to the user input. In addition, one the presentation sections is identified as corresponding to the written section. A media function can then be applied to the presentation section in the presentation recording. | 1. One or more computer readable storage media having stored thereon program instructions for facilitating control of collection environments that, when executed by a computing system, direct the computing system to at least:
present a collection environment comprising a presentation recording having a plurality of presentation sections and a written paragraph having a plurality of written sections; identify which written section of the plurality of written sections corresponds to a user input directed to the written paragraph and which presentation section of the plurality of presentation sections corresponds to the written section; and apply a media function to the presentation section in the presentation recording. 2. The one or more computer readable storage media of claim 1 wherein the program instructions, when executed by the computing system, further direct the computing system to:
identify which one of the plurality of presentation sections corresponds to another user input directed to the presentation recording;
identify which one of the plurality of written sections in the written paragraph corresponds to the one of the plurality of presentation sections; and
apply another media function to the one of the plurality of written sections in the written paragraph. 3. The one or more computer readable storage media of claim 2 wherein each of the plurality of written sections corresponds to a different one of the plurality of presentation sections. 4. The one or more computer readable storage media of claim 3 wherein the program instructions, when executed by the computing system, further direct the computing system to track which of the plurality of written sections corresponds to which of the plurality of presentation sections while generating the written paragraph and the presentation recording. 5. The one or more computer readable storage media of claim 4 wherein the media function comprises a jump function and wherein to apply the jump function to the presentation section, the program instructions direct the computing system jump to the presentation section while playing out the presentation recording. 6. The one or more computer readable storage media of claim 4 wherein the media function comprises a delete function and wherein to apply the delete function to the presentation section, the program instructions direct the computing system to delete at least a portion of the presentation recording including the presentation section. 7. The one or more computer readable storage media of claim 4 wherein the another media function comprises an insert function and wherein to apply the another media function to the one of the plurality of written sections, the program instructions direct the computing system to insert text adjacent to the one of the plurality of written sections. 8. The one or more computer readable storage media of claim 1 wherein each of the plurality of written sections of the written paragraph comprises a one of an individual word, line, or phrase in the written paragraph. 9. The one or more computer readable storage media of claim 8 wherein the presentation recording comprises one of an audio recording, a video recording, a document presentation recording, an instant message recording, and a virtual white board recording. 10. The one or more computer readable storage media of claim 1 wherein the user input comprises a touch gesture and wherein the program instructions direct the computing system to identify the written section in response to the touch gesture and apply the media function to the presentation section in response to a subsequent touch gesture. 11. A computing apparatus comprising:
one or more computer readable storage media; and program instructions stored on the one or more computer readable storage media for facilitating control of collection environments that, when executed by a processing system, direct the processing system to at least initiate presentation of a collection page having plurality of collected items comprising a recording and notes while generating at least a portion of the recording, identify a word in the notes selected by the user input, identify a media function selected by a subsequent user input, and initiate application of the media function to a section of the recording that corresponds to the word. 12. The computing apparatus of claim 11 wherein the program instructions, when executed by the processing system, further direct the processing system to track which words of the notes correspond to which sections of the recording. 13. The computing apparatus of claim 12 wherein the words in the notes correspond to different sections of the recording and wherein the program instructions, when executed by the processing system, further direct the processing system to identify which of the sections in the recording corresponds to the word selected by the user input. 14. The computing apparatus of claim 11 wherein the user input comprises a touch gesture and wherein the subsequent user input comprises a subsequent touch gesture. 15. The computing apparatus of claim 11 further comprising the processing system coupled with the one or more computer readable storage media and configured to execute the program instructions. 16. The computing apparatus of claim 11 wherein the recording comprises at least one of an audio recording, a video recording, a document presentation recording, an instant message recording, and a virtual white board recording. 17. A method of operating a collection environment, the method comprising:
initiating presentation of the collection environment, the collection environment comprising a presentation recording having a plurality of presentation sections and a written paragraph having a plurality of written sections; initiating identification of which written section of the plurality of written sections corresponds to a user input directed to the written paragraph and which presentation section of the plurality of presentation sections corresponds to the written section; and initiating application of a media function to the presentation section in the presentation recording. 18. The method of claim 17 further comprising:
identifying which one of the plurality of presentation sections corresponds to another user input directed to the presentation recording;
identifying which one of the plurality of written sections in the written paragraph corresponds to the one of the plurality of presentation sections; and
applying another media function to the one of the plurality of written sections in the written paragraph. 19. The method of claim 18 wherein each of the plurality of written sections corresponds to a different one of the plurality of presentation sections and wherein the method further comprising tracking which of the plurality of written sections corresponds to which of the plurality of presentation sections while generating the written paragraph and the presentation recording. 20. The method of claim 19 wherein the media function comprises at least one of a play function, a jump function, and a delete function, and wherein the presentation recording comprises at least one of an audio recording, a video recording, a chat recording, a slide show recording, and a virtual white board recording. | Systems, methods, and software for facilitating enhanced collection environments are disclosed. In at least one implementation, a collection environment is presented that includes a presentation recording and a written paragraph. The presentation recording includes presentation sections while the paragraph includes written sections. A user input may be directed to the written paragraph. One of the written paragraphs is identified as corresponding to the user input. In addition, one the presentation sections is identified as corresponding to the written section. A media function can then be applied to the presentation section in the presentation recording.1. One or more computer readable storage media having stored thereon program instructions for facilitating control of collection environments that, when executed by a computing system, direct the computing system to at least:
present a collection environment comprising a presentation recording having a plurality of presentation sections and a written paragraph having a plurality of written sections; identify which written section of the plurality of written sections corresponds to a user input directed to the written paragraph and which presentation section of the plurality of presentation sections corresponds to the written section; and apply a media function to the presentation section in the presentation recording. 2. The one or more computer readable storage media of claim 1 wherein the program instructions, when executed by the computing system, further direct the computing system to:
identify which one of the plurality of presentation sections corresponds to another user input directed to the presentation recording;
identify which one of the plurality of written sections in the written paragraph corresponds to the one of the plurality of presentation sections; and
apply another media function to the one of the plurality of written sections in the written paragraph. 3. The one or more computer readable storage media of claim 2 wherein each of the plurality of written sections corresponds to a different one of the plurality of presentation sections. 4. The one or more computer readable storage media of claim 3 wherein the program instructions, when executed by the computing system, further direct the computing system to track which of the plurality of written sections corresponds to which of the plurality of presentation sections while generating the written paragraph and the presentation recording. 5. The one or more computer readable storage media of claim 4 wherein the media function comprises a jump function and wherein to apply the jump function to the presentation section, the program instructions direct the computing system jump to the presentation section while playing out the presentation recording. 6. The one or more computer readable storage media of claim 4 wherein the media function comprises a delete function and wherein to apply the delete function to the presentation section, the program instructions direct the computing system to delete at least a portion of the presentation recording including the presentation section. 7. The one or more computer readable storage media of claim 4 wherein the another media function comprises an insert function and wherein to apply the another media function to the one of the plurality of written sections, the program instructions direct the computing system to insert text adjacent to the one of the plurality of written sections. 8. The one or more computer readable storage media of claim 1 wherein each of the plurality of written sections of the written paragraph comprises a one of an individual word, line, or phrase in the written paragraph. 9. The one or more computer readable storage media of claim 8 wherein the presentation recording comprises one of an audio recording, a video recording, a document presentation recording, an instant message recording, and a virtual white board recording. 10. The one or more computer readable storage media of claim 1 wherein the user input comprises a touch gesture and wherein the program instructions direct the computing system to identify the written section in response to the touch gesture and apply the media function to the presentation section in response to a subsequent touch gesture. 11. A computing apparatus comprising:
one or more computer readable storage media; and program instructions stored on the one or more computer readable storage media for facilitating control of collection environments that, when executed by a processing system, direct the processing system to at least initiate presentation of a collection page having plurality of collected items comprising a recording and notes while generating at least a portion of the recording, identify a word in the notes selected by the user input, identify a media function selected by a subsequent user input, and initiate application of the media function to a section of the recording that corresponds to the word. 12. The computing apparatus of claim 11 wherein the program instructions, when executed by the processing system, further direct the processing system to track which words of the notes correspond to which sections of the recording. 13. The computing apparatus of claim 12 wherein the words in the notes correspond to different sections of the recording and wherein the program instructions, when executed by the processing system, further direct the processing system to identify which of the sections in the recording corresponds to the word selected by the user input. 14. The computing apparatus of claim 11 wherein the user input comprises a touch gesture and wherein the subsequent user input comprises a subsequent touch gesture. 15. The computing apparatus of claim 11 further comprising the processing system coupled with the one or more computer readable storage media and configured to execute the program instructions. 16. The computing apparatus of claim 11 wherein the recording comprises at least one of an audio recording, a video recording, a document presentation recording, an instant message recording, and a virtual white board recording. 17. A method of operating a collection environment, the method comprising:
initiating presentation of the collection environment, the collection environment comprising a presentation recording having a plurality of presentation sections and a written paragraph having a plurality of written sections; initiating identification of which written section of the plurality of written sections corresponds to a user input directed to the written paragraph and which presentation section of the plurality of presentation sections corresponds to the written section; and initiating application of a media function to the presentation section in the presentation recording. 18. The method of claim 17 further comprising:
identifying which one of the plurality of presentation sections corresponds to another user input directed to the presentation recording;
identifying which one of the plurality of written sections in the written paragraph corresponds to the one of the plurality of presentation sections; and
applying another media function to the one of the plurality of written sections in the written paragraph. 19. The method of claim 18 wherein each of the plurality of written sections corresponds to a different one of the plurality of presentation sections and wherein the method further comprising tracking which of the plurality of written sections corresponds to which of the plurality of presentation sections while generating the written paragraph and the presentation recording. 20. The method of claim 19 wherein the media function comprises at least one of a play function, a jump function, and a delete function, and wherein the presentation recording comprises at least one of an audio recording, a video recording, a chat recording, a slide show recording, and a virtual white board recording. | 2,100 |
4,539 | 13,677,991 | 2,163 | A first set of original records is processed by a first processing entity to generate a second set of records that includes the original records and one or more copies of each original record, each original record including one or more fields. The processing of each of at least some of the original records includes: generating at least one copy of the original record, and associating a first segment value with the original record and associating a second segment value with the copy. The method also includes partitioning the second set of records among a plurality of recipient processing entities based on the segment values associated with the records in the second set, and, at each recipient processing entity, performing an operation based on one or more data values of the records received at the recipient processing entity to generate results. | 1. A method, including:
processing a first set of original records by a first processing entity to generate a second set of records that includes the original records and one or more copies of each original record, each original record including one or more fields, and the processing of each of at least some of the original records including
generating at least one copy of the original record, and
associating a first segment value with the original record and associating a second segment value with the copy, where the first segment value corresponds to a first portion of one or more data values of respective fields of the original record and the second segment value correspond to a second portion of the one or more data values of the respective fields of the original record different from the first portion, and
partitioning the second set of records among a plurality of recipient processing entities based on the segment values associated with the records in the second set, and, at each recipient processing entity, performing an operation based on one or more data values of the records received at the recipient processing entity to generate results. 2. The method of claim 1, wherein the first segment value corresponds to a first sequence of characters from a first data value of a first field taken from a first set of positions of the characters in the first data value, and the second segment value corresponds to a second sequence of characters from the first data value taken from a second set of positions of the characters in the first data value. 3. The method of claim 2, wherein the first set of positions are non-overlapping with the second set of positions. 4. The method of claim 3, wherein the first set of positions are even positions relative to the first character of the data value, and the second set of positions are odd positions relative to the first character of the data value. 5. The method of claim 1, wherein associating a segment value with a record includes writing the associated segment value into a new field of the record. 6. The method of claim 1, wherein performing an operation based on the one or more data values of the records received at the recipient processing entity includes determining a match between character strings occurring in one or more data values of a first record and character strings occurring in one or more data values of at least a second record. 7. The method of claim 6, wherein the match is an approximate match. 8. The method of claim 7, wherein the approximate match allows the strings being matched to be different up to a specified edit distance. 9. The method of claim 7, wherein the approximate match is based on a match criterion that defines allowed differences between a data value of the first record and a data value of the second record, and wherein, for each original record, the first portion of the one or more data values and the second portion of the one or more data values are selected so that at least one of the first segment value or the second segment value does not change in response to a change of the one or more data values according to any of the allowed differences. 10. The method of claim 9, wherein the allowed differences include differences between a first character string occurring in the data value of the first record and a second character string occurring in the data value of the second record. 11. The method of claim 9, wherein the allowed differences include differences between a first binary value occurring in the data value of the first record and a second binary value occurring in the data value of the second record. 12. The method of claim 1, wherein performing an operation based on the one or more data values of the records received at the recipient processing entity includes surrogate key assignment. 13. The method of claim 12, wherein the results generated at the recipient processing entity include, for each record received at the recipient processing entity, the record augmented with an assigned surrogate key based on the one or more data values of the record. 14. The method of claim 1, wherein performing an operation based on the one or more data values of the records received at the recipient processing entity includes clustering the received records into one or more clusters. 15. The method of claim 14, wherein the results generated at the recipient processing entity include, for each record received at the recipient processing entity, the record augmented with an assigned cluster based on the one or more data values of the record and the one or more data values of at least some of the other records received at the recipient processing entity. 16. The method of claim 1, wherein the operation includes at least one of: surrogate key assignment, clustering, roll-up, or join. 17. The method of claim 1, wherein the first segment value corresponds to a first portion of multiple data values of respective fields of the original record and the second segment value correspond to a second portion of the multiple data values of the respective fields of the original record different from the first portion. 18. The method of claim 1, further including receiving results from each recipient processing entity at a second processing entity, and processing the received results to remove redundant results. 19. The method of claim 18, wherein the second set of records includes the original records and at least one copy of each original record. 20. The method of claim 19, wherein processing the received results to remove redundant results includes selecting at most one of: a first result associated with an original record, or a second result associated with a copy of the original record. 21. The method of claim 1, further including receiving results from each recipient processing entity at the first processing entity, and processing the received results to remove redundant results. 22. The method of claim 1, wherein each of the recipient processing entities perform the respective operations independently. 23. The method of claim 1, wherein the number of recipient processing entities is at least as large as the smallest number of different segment values associated with each original record and its copies. 24. The method of claim 1, wherein the processing entities are cores in a multicore processor, and the first processing entity sends the partitioned records from the second set of records to the recipient processing entities over an interconnection network in the multicore processor. 25. The method of claim 1, wherein the processing entities are processors in a multi-processor computer system, and the first processing entity sends the partitioned records from the second set of records to the recipient processing entities over an interconnection network in the multi-processor computer system. 26. The method of claim 1, wherein the processing entities are server computers in a rack-mounted server system, and the first processing entity sends the partitioned records from the second set of records to the recipient processing entities over an interconnection network in the rack-mounted server system. 27. The method of claim 1, wherein the processing entities are computer systems in communication over a network, and the first processing entity sends the partitioned records from the second set of records to the recipient processing entities over the network. 28. A computer program stored on a computer-readable storage medium, the computer program including instructions for causing a computing system to:
process a first set of original records by a first processing entity to generate a second set of records that includes the original records and one or more copies of each original record, each original record including one or more fields, and the processing of each of at least some of the original records including
generating at least one copy of the original record, and
associating a first segment value with the original record and associating a second segment value with the copy, where the first segment value corresponds to a first portion of one or more data values of respective fields of the original record and the second segment value correspond to a second portion of the one or more data values of the respective fields of the original record different from the first portion, and
partition the second set of records among a plurality of recipient processing entities based on the segment values associated with the records in the second set, and, at each recipient processing entity, perform an operation based on one or more data values of the records received at the recipient processing entity to generate results. 29. A computing system, including:
a first processing entity configured to process a first set of original records to generate a second set of records that includes the original records and one or more copies of each original record, each original record including one or more fields, and the processing of each of at least some of the original records including
generating at least one copy of the original record, and
associating a first segment value with the original record and associating a second segment value with the copy, where the first segment value corresponds to a first portion of one or more data values of respective fields of the original record and the second segment value correspond to a second portion of the one or more data values of the respective fields of the original record different from the first portion, and
a plurality of recipient processing entities receiving respective subsets of the second set of records partitioned based on the segment values associated with the records in the second set, each recipient processing entity configured to perform an operation based on one or more data values of the records received at the recipient processing entity to generate results. 30. A method, including:
partitioning a set of records by a first processing entity into multiple subsets of records; and processing different subsets of the set of records by different respective recipient processing entities and storing results in data storage accessible to each of the recipient processing entities, the processing by each recipient processing entity including
performing an operation on each record in the subset based on determining whether or not there is an approximate match between one or more values of one or more fields of the record and an entry within local reference information maintained by the recipient processing entity or an entry within the data storage that was provided by any of the other recipient processing entities, and
updating the data storage based on the local reference information maintained by the recipient processing entity. 31. The method of claim 30, wherein the data storage accessible to each of the recipient processing entities includes a non-volatile storage medium. 32. The method of claim 31, wherein the local reference information maintained by each recipient processing entity is stored in a volatile storage medium. 33. The method of claim 30, wherein the approximate match allows the values being matched to be different up to a specified edit distance. 34. The method of claim 30, wherein performing an operation on each record in the subset includes surrogate key assignment. 35. The method of claim 34, wherein results generated at a recipient processing entities include, for each record received at the recipient processing entity, the record augmented with an assigned surrogate key based on the one or more values of the record. 36. The method of claim 30, wherein performing an operation on each record in the subset includes clustering the records into one or more clusters. 37. The method of claim 36, wherein results generated at a recipient processing entity include, for each record received at the recipient processing entity, the record augmented with an assigned cluster based on the one or more values of the record and the one or more values of at least some of the other records received at the recipient processing entity. 38. The method of claim 30, wherein the operation includes at least one of: surrogate key assignment, clustering, roll-up, or join. 39. A computer program stored on a computer-readable storage medium, the computer program including instructions for causing a computing system to:
partition a set of records by a first processing entity into multiple subsets of records; and process different subsets of the set of records by different respective recipient processing entities and storing results in data storage accessible to each of the recipient processing entities, the processing by each recipient processing entity including
performing an operation on each record in the subset based on determining whether or not there is an approximate match between one or more values of one or more fields of the record and an entry within local reference information maintained by the recipient processing entity or an entry within the data storage that was provided by any of the other recipient processing entities, and
updating the data storage based on the local reference information maintained by the recipient processing entity. 40. A computing system, including:
a first processing entity configured to partition a set of records into multiple subsets of records; and a plurality of recipient processing entities each configured to process a different respective subset of the set of records and store results in data storage accessible to each of the recipient processing entities, the processing by each recipient processing entity including
performing an operation on each record in the subset based on determining whether or not there is an approximate match between one or more values of one or more fields of the record and an entry within local reference information maintained by the recipient processing entity or an entry within the data storage that was provided by any of the other recipient processing entities, and
updating the data storage based on the local reference information maintained by the recipient processing entity. | A first set of original records is processed by a first processing entity to generate a second set of records that includes the original records and one or more copies of each original record, each original record including one or more fields. The processing of each of at least some of the original records includes: generating at least one copy of the original record, and associating a first segment value with the original record and associating a second segment value with the copy. The method also includes partitioning the second set of records among a plurality of recipient processing entities based on the segment values associated with the records in the second set, and, at each recipient processing entity, performing an operation based on one or more data values of the records received at the recipient processing entity to generate results.1. A method, including:
processing a first set of original records by a first processing entity to generate a second set of records that includes the original records and one or more copies of each original record, each original record including one or more fields, and the processing of each of at least some of the original records including
generating at least one copy of the original record, and
associating a first segment value with the original record and associating a second segment value with the copy, where the first segment value corresponds to a first portion of one or more data values of respective fields of the original record and the second segment value correspond to a second portion of the one or more data values of the respective fields of the original record different from the first portion, and
partitioning the second set of records among a plurality of recipient processing entities based on the segment values associated with the records in the second set, and, at each recipient processing entity, performing an operation based on one or more data values of the records received at the recipient processing entity to generate results. 2. The method of claim 1, wherein the first segment value corresponds to a first sequence of characters from a first data value of a first field taken from a first set of positions of the characters in the first data value, and the second segment value corresponds to a second sequence of characters from the first data value taken from a second set of positions of the characters in the first data value. 3. The method of claim 2, wherein the first set of positions are non-overlapping with the second set of positions. 4. The method of claim 3, wherein the first set of positions are even positions relative to the first character of the data value, and the second set of positions are odd positions relative to the first character of the data value. 5. The method of claim 1, wherein associating a segment value with a record includes writing the associated segment value into a new field of the record. 6. The method of claim 1, wherein performing an operation based on the one or more data values of the records received at the recipient processing entity includes determining a match between character strings occurring in one or more data values of a first record and character strings occurring in one or more data values of at least a second record. 7. The method of claim 6, wherein the match is an approximate match. 8. The method of claim 7, wherein the approximate match allows the strings being matched to be different up to a specified edit distance. 9. The method of claim 7, wherein the approximate match is based on a match criterion that defines allowed differences between a data value of the first record and a data value of the second record, and wherein, for each original record, the first portion of the one or more data values and the second portion of the one or more data values are selected so that at least one of the first segment value or the second segment value does not change in response to a change of the one or more data values according to any of the allowed differences. 10. The method of claim 9, wherein the allowed differences include differences between a first character string occurring in the data value of the first record and a second character string occurring in the data value of the second record. 11. The method of claim 9, wherein the allowed differences include differences between a first binary value occurring in the data value of the first record and a second binary value occurring in the data value of the second record. 12. The method of claim 1, wherein performing an operation based on the one or more data values of the records received at the recipient processing entity includes surrogate key assignment. 13. The method of claim 12, wherein the results generated at the recipient processing entity include, for each record received at the recipient processing entity, the record augmented with an assigned surrogate key based on the one or more data values of the record. 14. The method of claim 1, wherein performing an operation based on the one or more data values of the records received at the recipient processing entity includes clustering the received records into one or more clusters. 15. The method of claim 14, wherein the results generated at the recipient processing entity include, for each record received at the recipient processing entity, the record augmented with an assigned cluster based on the one or more data values of the record and the one or more data values of at least some of the other records received at the recipient processing entity. 16. The method of claim 1, wherein the operation includes at least one of: surrogate key assignment, clustering, roll-up, or join. 17. The method of claim 1, wherein the first segment value corresponds to a first portion of multiple data values of respective fields of the original record and the second segment value correspond to a second portion of the multiple data values of the respective fields of the original record different from the first portion. 18. The method of claim 1, further including receiving results from each recipient processing entity at a second processing entity, and processing the received results to remove redundant results. 19. The method of claim 18, wherein the second set of records includes the original records and at least one copy of each original record. 20. The method of claim 19, wherein processing the received results to remove redundant results includes selecting at most one of: a first result associated with an original record, or a second result associated with a copy of the original record. 21. The method of claim 1, further including receiving results from each recipient processing entity at the first processing entity, and processing the received results to remove redundant results. 22. The method of claim 1, wherein each of the recipient processing entities perform the respective operations independently. 23. The method of claim 1, wherein the number of recipient processing entities is at least as large as the smallest number of different segment values associated with each original record and its copies. 24. The method of claim 1, wherein the processing entities are cores in a multicore processor, and the first processing entity sends the partitioned records from the second set of records to the recipient processing entities over an interconnection network in the multicore processor. 25. The method of claim 1, wherein the processing entities are processors in a multi-processor computer system, and the first processing entity sends the partitioned records from the second set of records to the recipient processing entities over an interconnection network in the multi-processor computer system. 26. The method of claim 1, wherein the processing entities are server computers in a rack-mounted server system, and the first processing entity sends the partitioned records from the second set of records to the recipient processing entities over an interconnection network in the rack-mounted server system. 27. The method of claim 1, wherein the processing entities are computer systems in communication over a network, and the first processing entity sends the partitioned records from the second set of records to the recipient processing entities over the network. 28. A computer program stored on a computer-readable storage medium, the computer program including instructions for causing a computing system to:
process a first set of original records by a first processing entity to generate a second set of records that includes the original records and one or more copies of each original record, each original record including one or more fields, and the processing of each of at least some of the original records including
generating at least one copy of the original record, and
associating a first segment value with the original record and associating a second segment value with the copy, where the first segment value corresponds to a first portion of one or more data values of respective fields of the original record and the second segment value correspond to a second portion of the one or more data values of the respective fields of the original record different from the first portion, and
partition the second set of records among a plurality of recipient processing entities based on the segment values associated with the records in the second set, and, at each recipient processing entity, perform an operation based on one or more data values of the records received at the recipient processing entity to generate results. 29. A computing system, including:
a first processing entity configured to process a first set of original records to generate a second set of records that includes the original records and one or more copies of each original record, each original record including one or more fields, and the processing of each of at least some of the original records including
generating at least one copy of the original record, and
associating a first segment value with the original record and associating a second segment value with the copy, where the first segment value corresponds to a first portion of one or more data values of respective fields of the original record and the second segment value correspond to a second portion of the one or more data values of the respective fields of the original record different from the first portion, and
a plurality of recipient processing entities receiving respective subsets of the second set of records partitioned based on the segment values associated with the records in the second set, each recipient processing entity configured to perform an operation based on one or more data values of the records received at the recipient processing entity to generate results. 30. A method, including:
partitioning a set of records by a first processing entity into multiple subsets of records; and processing different subsets of the set of records by different respective recipient processing entities and storing results in data storage accessible to each of the recipient processing entities, the processing by each recipient processing entity including
performing an operation on each record in the subset based on determining whether or not there is an approximate match between one or more values of one or more fields of the record and an entry within local reference information maintained by the recipient processing entity or an entry within the data storage that was provided by any of the other recipient processing entities, and
updating the data storage based on the local reference information maintained by the recipient processing entity. 31. The method of claim 30, wherein the data storage accessible to each of the recipient processing entities includes a non-volatile storage medium. 32. The method of claim 31, wherein the local reference information maintained by each recipient processing entity is stored in a volatile storage medium. 33. The method of claim 30, wherein the approximate match allows the values being matched to be different up to a specified edit distance. 34. The method of claim 30, wherein performing an operation on each record in the subset includes surrogate key assignment. 35. The method of claim 34, wherein results generated at a recipient processing entities include, for each record received at the recipient processing entity, the record augmented with an assigned surrogate key based on the one or more values of the record. 36. The method of claim 30, wherein performing an operation on each record in the subset includes clustering the records into one or more clusters. 37. The method of claim 36, wherein results generated at a recipient processing entity include, for each record received at the recipient processing entity, the record augmented with an assigned cluster based on the one or more values of the record and the one or more values of at least some of the other records received at the recipient processing entity. 38. The method of claim 30, wherein the operation includes at least one of: surrogate key assignment, clustering, roll-up, or join. 39. A computer program stored on a computer-readable storage medium, the computer program including instructions for causing a computing system to:
partition a set of records by a first processing entity into multiple subsets of records; and process different subsets of the set of records by different respective recipient processing entities and storing results in data storage accessible to each of the recipient processing entities, the processing by each recipient processing entity including
performing an operation on each record in the subset based on determining whether or not there is an approximate match between one or more values of one or more fields of the record and an entry within local reference information maintained by the recipient processing entity or an entry within the data storage that was provided by any of the other recipient processing entities, and
updating the data storage based on the local reference information maintained by the recipient processing entity. 40. A computing system, including:
a first processing entity configured to partition a set of records into multiple subsets of records; and a plurality of recipient processing entities each configured to process a different respective subset of the set of records and store results in data storage accessible to each of the recipient processing entities, the processing by each recipient processing entity including
performing an operation on each record in the subset based on determining whether or not there is an approximate match between one or more values of one or more fields of the record and an entry within local reference information maintained by the recipient processing entity or an entry within the data storage that was provided by any of the other recipient processing entities, and
updating the data storage based on the local reference information maintained by the recipient processing entity. | 2,100 |
4,540 | 12,967,351 | 2,157 | A method for adapting a workflow of a content management system comprises setting an allowed action for a user, creating at least one information item depending on the allowed action for the user, in which the at least one information item comprises content to be published and a first information item status level indicative of a present status level of the content within the workflow, and executing the workflow which comprises stages each corresponding to a respective information item status level, such that a next stage of the workflow is determined based on a combination of different types of user status information, indicative of a status of the user, and the first information item status level. | 1. A method for adapting a workflow of a content management system, the method comprising:
creating at least one information item depending on an allowed action established for a particular user, in which the at least one information item comprises content to be published and a first information item status level indicative of a present status level of the content within the workflow, and executing the workflow which comprises stages each corresponding to a respective information item status level, such that a next stage of the workflow is determined based on a combination of different types of user status information, indicative of a status of the user, and the first information item status level. 2. The method of claim 1, in which the workflow creates at least one information item for managing web pages, modifies at least one information item for managing web pages, deletes at least one information item for managing web pages, or combinations thereof. 3. The method of claim 1, in which the information item status level comprises a draft status level, an approved for publishing status level, an expired status level, a deleted status level, or combinations thereof. 4. The method of claim 1, in which the different types of user status information comprises a user role status, a user profile status, a historic transaction status, or combinations thereof. 5. The method of claim 1, in which the at least one information item further comprises a second information item status level. 6. The method of claim 5, in which the second information item status level comprises at an urgency level, the language of the information item, content area, content type, or combinations thereof. 7. A content management system for adapting a workflow, the content management system comprising:
a user interface configured to enable the user to create at least one information item depending on an allowed action established for a particular user by a setting unit, in which the at least one information item comprises content to be published and a first information item status level indicative of a present status level of the content within the workflow, a storage unit adapted for storing the at least one information item, a workflow engine comprising a dynamic workflow stage determination engine adapted for executing the workflow which comprises stages each corresponding to a respective status level, such that a next stage of the workflow is determined based on a combination of different types of user status information, indicative of a status of the user, and the first information item status level. 8. The system of claim 7, in which the workflow engine further comprises a dynamic actor determination engine configured to determine which user among those users associated with the content management system is to approve the at least one information item. 9. The system of claim 8, in which the determination of the user who approves the at least one information item is based on a second information item status level that is associated with the at least one information item. 10. The system of claim 9, in which the second information item status level comprises an urgency level, the language of the information item, content area, content type, or combinations thereof. 11. The system of claim 7, in which the workflow creates at least one information item for managing web pages, modifies at least one information item for managing web pages, deletes at least one information item for managing web pages, or combinations thereof. 12. The system of claim 7, in which the information item status level comprises a draft status level, an approved for publishing status level, an expired status level, a deleted status level, or combinations thereof. 13. The system of claim 7, in which the different types of user status information comprises a user role status, a user profile status, a historic transaction status, or combinations thereof. 14. A computer program product for adapting a workflow, 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 set an allowed action for a user;
computer readable program code configured to create at least one information item depending on an allowed action established for a particular user, in which the at least one information item comprises content to be published and a first information item status level indicative of a present status level of the content within the workflow; and
computer readable program code configured to execute the workflow which comprises stages each corresponding to a respective information item status level
in which a next stage of the workflow is determined based on a combination of different types of user status information, indicative of a status of the user, and the first information item status level. 15. The computer program product of claim 14, in which the workflow creates at least one information item for managing web pages, modifies at least one information item for managing web pages, deletes at least one information item for managing web pages, or combinations thereof. 16. The computer program product of claim 14, in which the information item status level comprises a draft status level, an approved for publishing status level, an expired status level, a deleted status level, or combinations thereof. 17. The computer program product of claim 14, in which the different types of user status information comprises a user role status, a user profile status, a historic transaction status, or combinations thereof. 18. The computer program product of claim 14, in which the at least one stored information item further comprises a second information item status level. 19. The computer program product of claim 14, in which the second information item status level comprises at an urgency level, the language of the information item, content area, content type, or combinations thereof. 20. A method of publishing content on a computer network, the method comprising:
creating at least one information item depending on an allowed action defined by a user role assigned to a particular user creating the at least one information item, in which the at least one information item comprises content to be published and a first information item status level indicative of a present status level of the content within the workflow, storing the at least one information item to a web content database; with a dynamic workflow stage determination engine, executing a workflow which comprises stages, each stage corresponding to a respective status level, such that a next stage of the workflow is determined based on a combination of different types of user roles, indicative of a status of the user, and the first information item status level; and publishing, to the computer network, the at least one information item. 21. The method of claim 20, further comprising a dynamic actor determination engine that determines which user among those users associated with the content management system is to approve the at least one information item. 22. The system of claim 21, in which the determination of the user who approves the at least one information item is based on a second information item status level that is associated with the at least one information item. | A method for adapting a workflow of a content management system comprises setting an allowed action for a user, creating at least one information item depending on the allowed action for the user, in which the at least one information item comprises content to be published and a first information item status level indicative of a present status level of the content within the workflow, and executing the workflow which comprises stages each corresponding to a respective information item status level, such that a next stage of the workflow is determined based on a combination of different types of user status information, indicative of a status of the user, and the first information item status level.1. A method for adapting a workflow of a content management system, the method comprising:
creating at least one information item depending on an allowed action established for a particular user, in which the at least one information item comprises content to be published and a first information item status level indicative of a present status level of the content within the workflow, and executing the workflow which comprises stages each corresponding to a respective information item status level, such that a next stage of the workflow is determined based on a combination of different types of user status information, indicative of a status of the user, and the first information item status level. 2. The method of claim 1, in which the workflow creates at least one information item for managing web pages, modifies at least one information item for managing web pages, deletes at least one information item for managing web pages, or combinations thereof. 3. The method of claim 1, in which the information item status level comprises a draft status level, an approved for publishing status level, an expired status level, a deleted status level, or combinations thereof. 4. The method of claim 1, in which the different types of user status information comprises a user role status, a user profile status, a historic transaction status, or combinations thereof. 5. The method of claim 1, in which the at least one information item further comprises a second information item status level. 6. The method of claim 5, in which the second information item status level comprises at an urgency level, the language of the information item, content area, content type, or combinations thereof. 7. A content management system for adapting a workflow, the content management system comprising:
a user interface configured to enable the user to create at least one information item depending on an allowed action established for a particular user by a setting unit, in which the at least one information item comprises content to be published and a first information item status level indicative of a present status level of the content within the workflow, a storage unit adapted for storing the at least one information item, a workflow engine comprising a dynamic workflow stage determination engine adapted for executing the workflow which comprises stages each corresponding to a respective status level, such that a next stage of the workflow is determined based on a combination of different types of user status information, indicative of a status of the user, and the first information item status level. 8. The system of claim 7, in which the workflow engine further comprises a dynamic actor determination engine configured to determine which user among those users associated with the content management system is to approve the at least one information item. 9. The system of claim 8, in which the determination of the user who approves the at least one information item is based on a second information item status level that is associated with the at least one information item. 10. The system of claim 9, in which the second information item status level comprises an urgency level, the language of the information item, content area, content type, or combinations thereof. 11. The system of claim 7, in which the workflow creates at least one information item for managing web pages, modifies at least one information item for managing web pages, deletes at least one information item for managing web pages, or combinations thereof. 12. The system of claim 7, in which the information item status level comprises a draft status level, an approved for publishing status level, an expired status level, a deleted status level, or combinations thereof. 13. The system of claim 7, in which the different types of user status information comprises a user role status, a user profile status, a historic transaction status, or combinations thereof. 14. A computer program product for adapting a workflow, 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 set an allowed action for a user;
computer readable program code configured to create at least one information item depending on an allowed action established for a particular user, in which the at least one information item comprises content to be published and a first information item status level indicative of a present status level of the content within the workflow; and
computer readable program code configured to execute the workflow which comprises stages each corresponding to a respective information item status level
in which a next stage of the workflow is determined based on a combination of different types of user status information, indicative of a status of the user, and the first information item status level. 15. The computer program product of claim 14, in which the workflow creates at least one information item for managing web pages, modifies at least one information item for managing web pages, deletes at least one information item for managing web pages, or combinations thereof. 16. The computer program product of claim 14, in which the information item status level comprises a draft status level, an approved for publishing status level, an expired status level, a deleted status level, or combinations thereof. 17. The computer program product of claim 14, in which the different types of user status information comprises a user role status, a user profile status, a historic transaction status, or combinations thereof. 18. The computer program product of claim 14, in which the at least one stored information item further comprises a second information item status level. 19. The computer program product of claim 14, in which the second information item status level comprises at an urgency level, the language of the information item, content area, content type, or combinations thereof. 20. A method of publishing content on a computer network, the method comprising:
creating at least one information item depending on an allowed action defined by a user role assigned to a particular user creating the at least one information item, in which the at least one information item comprises content to be published and a first information item status level indicative of a present status level of the content within the workflow, storing the at least one information item to a web content database; with a dynamic workflow stage determination engine, executing a workflow which comprises stages, each stage corresponding to a respective status level, such that a next stage of the workflow is determined based on a combination of different types of user roles, indicative of a status of the user, and the first information item status level; and publishing, to the computer network, the at least one information item. 21. The method of claim 20, further comprising a dynamic actor determination engine that determines which user among those users associated with the content management system is to approve the at least one information item. 22. The system of claim 21, in which the determination of the user who approves the at least one information item is based on a second information item status level that is associated with the at least one information item. | 2,100 |
4,541 | 13,727,440 | 2,142 | A user interface including one or more references to content is customized. Several user profiles are provided from which a user may be associated. Each user profile includes user profile information. The user profile associated with a user to whom a user interface will be provided is accessed. A user interface is configured for the user, based at least in part upon the user profile accessed as being associated with the user. Access to content is enabled based on user manipulation of the configured user interface. | 1.-60. (canceled) 61. A method comprising:
accessing, using at least one processor, user profile information associated with a user; receiving a request from the user to add requested content to a user interface; determining whether the requested content is permitted based on the user profile information; and adding the requested content to the user interface if permitted based on the user profile information. 62. The method as recited in claim 61, further comprising customizing the user interface to include customized content based on the user profile information. 63. The method as recited in claim 62, further comprising preventing the user from modifying the customized content of the user interface. 64. The method as recited in claim 63, wherein the customized content comprises one or more pre-approved links to content. 65. The method as recited in claim 61, wherein the requested content comprises one or more links to content. 66. The method as recited in claim 65, wherein the one or more links to content provide access to one or more websites. 67. The method as recited in claim 61, wherein the requested content comprises one or more toolbar controls. 68. The method as recited in claim 67, wherein the one or more toolbar controls comprise a control for accessing one or more websites. 70. The method as recited in claim 67, wherein the one or more toolbar controls comprise a button. 71. The method as recited in claim 67, wherein the one or more toolbar controls comprise a menu option. 72. The method as recited in claim 71, wherein the one or more toolbar controls comprises a pull down menu. 73. The method as recited in claim 61, wherein the requested content comprises one or more pictures. 74. The method as recited in claim 61, wherein the user profile information indicates one or more attributes of the user. 75. The method as recited in claim 74, wherein one or more attributes is an age of the user. 76. The method as recited in claim 74, wherein the one or more attributes are set by a master user. 77. The method as recited in claim 74, further comprising detecting the one or more attributes based on one or more activities of the user. 78. The method as recited in claim 77, wherein the one or more activities comprises viewing of one or more webpages. 79. The method as recited in claim 77, wherein the one or more activities comprises accessing one or more services. 80. The method as recited in claim 79, wherein the one or more services comprises one or more of website browsing, email, chat sessions, and file downloading. 81. A non-transitory computer-readable storage medium including a set of instructions that, when executed, cause at least one processor to perform steps comprising:
accessing user profile information associated with a user; receiving a request from the user to add requested content to a user interface; determining whether the requested content is permitted based on the user profile information; and adding the requested content to the user interface if permitted based on the user profile information. 82. The computer-readable storage medium as recited in claim 81, further comprising instructions that, when executed, cause at least one processor to customize the user interface to include customized content based on the user profile information. 83. The computer-readable storage medium as recited in claim 82, further comprising instructions that, when executed, cause at least one processor to prevent the user from modifying the customized content of the user interface. 84. The computer-readable storage medium as recited in claim 83, wherein the customized content comprises one or more pre-approved links to content. 85. The computer-readable storage medium as recited in claim 83, wherein the user profile information indicates one or more attributes of the user. 86. The computer-readable storage medium as recited in claim 85, wherein one or more attributes is an age of the user. 87. The computer-readable storage medium as recited in claim 86, wherein the one or more attributes are set by a master user. 88. The computer-readable storage medium as recited in claim 85, further comprising instructions that, when executed, cause at least one processor to detect the one or more attributes based on one or more activities of the user. 89. The computer-readable storage medium as recited in claim 88, wherein the one or more activities comprises accessing one or more services. 90. The computer-readable storage medium as recited in claim 89, wherein the one or more services comprises one or more of website browsing, email, chat sessions, and file downloading. 91. The computer-readable storage medium as recited in claim 88, wherein the one or more activities comprises viewing of one or more webpages. 92. The computer-readable storage medium as recited in claim 91, wherein the one or more toolbar controls comprise a button. 93. The computer-readable storage medium as recited in claim 91, wherein the one or more toolbar controls comprise a menu option. 94. The computer-readable storage medium as recited in claim 93, wherein the one or more toolbar controls comprises a pull down menu. 95. A method comprising:
accessing, using at least one processor, user profile information associated with a user; customizing a user interface to include customized content based on the user profile information; receiving a request from the user to add requested content to the customized user interface; determining whether the requested content is permitted based on the user profile information; and adding the requested content to the customized user interface if permitted based on the user profile information. 96. The method as recited in claim 95, further comprising:
receiving a request to remove at least a portion of the customized content from the user interface; and preventing the removal of the customized content. 97. The method as recited in claim 95, wherein the user profile information indicates one or more attributes of the user. 98. The method as recited in claim 96, wherein one or more attributes is an age of the user. 99. The method as recited in claim 96, wherein the one or more attributes are set by a master user. 100. The method as recited in claim 96, further comprising detecting the one or more attributes based on one or more activities of the user. 101. The method as recited in claim 100, wherein the one or more activities comprises viewing of one or more webpages. 102. The method as recited in claim 96, wherein the one or more activities comprises accessing one or more services. 103. The method as recited in claim 102, wherein the one or more services comprises one or more of website browsing, email, chat sessions, and file downloading. | A user interface including one or more references to content is customized. Several user profiles are provided from which a user may be associated. Each user profile includes user profile information. The user profile associated with a user to whom a user interface will be provided is accessed. A user interface is configured for the user, based at least in part upon the user profile accessed as being associated with the user. Access to content is enabled based on user manipulation of the configured user interface.1.-60. (canceled) 61. A method comprising:
accessing, using at least one processor, user profile information associated with a user; receiving a request from the user to add requested content to a user interface; determining whether the requested content is permitted based on the user profile information; and adding the requested content to the user interface if permitted based on the user profile information. 62. The method as recited in claim 61, further comprising customizing the user interface to include customized content based on the user profile information. 63. The method as recited in claim 62, further comprising preventing the user from modifying the customized content of the user interface. 64. The method as recited in claim 63, wherein the customized content comprises one or more pre-approved links to content. 65. The method as recited in claim 61, wherein the requested content comprises one or more links to content. 66. The method as recited in claim 65, wherein the one or more links to content provide access to one or more websites. 67. The method as recited in claim 61, wherein the requested content comprises one or more toolbar controls. 68. The method as recited in claim 67, wherein the one or more toolbar controls comprise a control for accessing one or more websites. 70. The method as recited in claim 67, wherein the one or more toolbar controls comprise a button. 71. The method as recited in claim 67, wherein the one or more toolbar controls comprise a menu option. 72. The method as recited in claim 71, wherein the one or more toolbar controls comprises a pull down menu. 73. The method as recited in claim 61, wherein the requested content comprises one or more pictures. 74. The method as recited in claim 61, wherein the user profile information indicates one or more attributes of the user. 75. The method as recited in claim 74, wherein one or more attributes is an age of the user. 76. The method as recited in claim 74, wherein the one or more attributes are set by a master user. 77. The method as recited in claim 74, further comprising detecting the one or more attributes based on one or more activities of the user. 78. The method as recited in claim 77, wherein the one or more activities comprises viewing of one or more webpages. 79. The method as recited in claim 77, wherein the one or more activities comprises accessing one or more services. 80. The method as recited in claim 79, wherein the one or more services comprises one or more of website browsing, email, chat sessions, and file downloading. 81. A non-transitory computer-readable storage medium including a set of instructions that, when executed, cause at least one processor to perform steps comprising:
accessing user profile information associated with a user; receiving a request from the user to add requested content to a user interface; determining whether the requested content is permitted based on the user profile information; and adding the requested content to the user interface if permitted based on the user profile information. 82. The computer-readable storage medium as recited in claim 81, further comprising instructions that, when executed, cause at least one processor to customize the user interface to include customized content based on the user profile information. 83. The computer-readable storage medium as recited in claim 82, further comprising instructions that, when executed, cause at least one processor to prevent the user from modifying the customized content of the user interface. 84. The computer-readable storage medium as recited in claim 83, wherein the customized content comprises one or more pre-approved links to content. 85. The computer-readable storage medium as recited in claim 83, wherein the user profile information indicates one or more attributes of the user. 86. The computer-readable storage medium as recited in claim 85, wherein one or more attributes is an age of the user. 87. The computer-readable storage medium as recited in claim 86, wherein the one or more attributes are set by a master user. 88. The computer-readable storage medium as recited in claim 85, further comprising instructions that, when executed, cause at least one processor to detect the one or more attributes based on one or more activities of the user. 89. The computer-readable storage medium as recited in claim 88, wherein the one or more activities comprises accessing one or more services. 90. The computer-readable storage medium as recited in claim 89, wherein the one or more services comprises one or more of website browsing, email, chat sessions, and file downloading. 91. The computer-readable storage medium as recited in claim 88, wherein the one or more activities comprises viewing of one or more webpages. 92. The computer-readable storage medium as recited in claim 91, wherein the one or more toolbar controls comprise a button. 93. The computer-readable storage medium as recited in claim 91, wherein the one or more toolbar controls comprise a menu option. 94. The computer-readable storage medium as recited in claim 93, wherein the one or more toolbar controls comprises a pull down menu. 95. A method comprising:
accessing, using at least one processor, user profile information associated with a user; customizing a user interface to include customized content based on the user profile information; receiving a request from the user to add requested content to the customized user interface; determining whether the requested content is permitted based on the user profile information; and adding the requested content to the customized user interface if permitted based on the user profile information. 96. The method as recited in claim 95, further comprising:
receiving a request to remove at least a portion of the customized content from the user interface; and preventing the removal of the customized content. 97. The method as recited in claim 95, wherein the user profile information indicates one or more attributes of the user. 98. The method as recited in claim 96, wherein one or more attributes is an age of the user. 99. The method as recited in claim 96, wherein the one or more attributes are set by a master user. 100. The method as recited in claim 96, further comprising detecting the one or more attributes based on one or more activities of the user. 101. The method as recited in claim 100, wherein the one or more activities comprises viewing of one or more webpages. 102. The method as recited in claim 96, wherein the one or more activities comprises accessing one or more services. 103. The method as recited in claim 102, wherein the one or more services comprises one or more of website browsing, email, chat sessions, and file downloading. | 2,100 |
4,542 | 14,968,376 | 2,112 | Coding for bursty interference is discussed in which a base station receives data bits for transmission. The base station may generate code blocks including information bits and parity bits. The base station may also generate parity check code blocks including information bits corresponding to information bits of the generated code blocks. The base station may transmit the code blocks and the parity check code blocks to a mobile device to improve decoding. When errors are detected, the mobile device may decode the received code blocks using hard or soft parity checks and the parity check code blocks. | 1. A method of wireless communication, comprising:
receiving, by a base station, a plurality of data bits; generating, by the base station, one or more code blocks, each of the one or more code blocks including one or more information bits and one or more parity bits, wherein for each code block the one or more information bits are generated based, at least in part, on data bits in the received plurality of data bits, and wherein for each code block the one or more parity bits are generated based, at least in part, on the one or more information bits of the code block; generating, by the base station, one or more parity check code blocks, each of the one or more parity check code blocks including one or more information bits, wherein for each parity check code block the one or more information bits correspond to information bits of the one or more code blocks; and transmitting, by the base station, each of the one or more code blocks and the one or more parity check code blocks to a mobile device. 2. The method of claim 1, wherein each of the one or more parity check code blocks also includes one or more parity bits, and wherein for each parity check code block the one or more parity bits are generated based, at least in part, on the one or more information bits of the parity check code block. 3. The method of claim 1, further including determining, by the base station, a number of parity check code blocks to generate based on information received from the mobile device, wherein generating the one or more parity check code blocks includes generating the determined number of parity check code blocks. 4. The method of claim 3, wherein the information received from the mobile device includes a recommended number of parity check code blocks to generate, wherein the recommended number is determined based, at least in part, on decoding statistics associated with a decoder at the mobile device. 5. The method of claim 1, wherein each information bit of a parity check code block corresponds to a different set of information bits of the one or more code blocks. 6. The method of claim 5, wherein the different set of information bits of the one or more code blocks includes a single bit from each of the one or more code blocks. 7. The method of claim 5, wherein each information bit of a parity check code block is generated based, at least in part, on the set of information bits of the one or more code blocks to which the parity check code block information bit corresponds. 8. The method of claim 1, wherein each information bit of a parity check code block is generated based, at least in part, on the same data bits in the received plurality of data bits used to generate the information bits of the one or more code blocks to which the parity check code block bit corresponds. 9. The method of claim 1, wherein each information bit of a parity check code block is generated based, at least in part, on the one or code blocks and additional code blocks not part of the one or more code blocks. 10. The method of claim 1, further including:
identifying an interference signal; and transmitting a notification to the mobile device via a side channel which indicates which of the one or more code blocks will be affected by the interference signal. 11. The method of claim 1, further including:
receiving a request from the mobile device for retransmission of the one or more code blocks and the one or more parity check code blocks when the number of code blocks that have errors is greater than the number of parity check code blocks that do not have errors; and retransmitting the one or more code blocks and the one or more parity check code blocks to the mobile device in response to receiving the retransmission request. 12. The method of claim 1, further including:
identifying an interference signal; and dynamically adapting the number of parity check code blocks to generate based, at least in part, on the identified interference signal. 13. A method of wireless communication, comprising:
receiving, by a mobile device, one or more code blocks and one or more parity check code blocks; decoding, by the mobile device, the one or more code blocks; determining, by the mobile device, a number of decoded code blocks that have errors; decoding, by the mobile device, the one or more parity check code blocks when one or more of the received code blocks have errors; determining, by the mobile device, a number of decoded parity check code blocks that do not have errors; and correcting, by the mobile device, errors in the decoded code blocks determined to have errors based, at least in part, on the decoded parity check code blocks determined to not have errors to complete the decoding of the one or more code blocks when the number of code blocks that have errors is equal to or less than the number of parity check code blocks determined to not have errors. 14. The method of claim 13, further including transmitting a request for retransmission to the base station when the number of code blocks that have errors is greater than the number of parity check code blocks determined to not have errors. 15. The method of claim 13, further including terminating decoding of the received one or more code blocks when none of the one or more code blocks have errors. 16. A method of wireless communication, comprising:
receiving, by a mobile device, one or more code blocks and one or more parity check code blocks; decoding, by the mobile device, each of the one or more code blocks, wherein, for each code block, decoding includes generating a logarithm of the likelihood ratio (LLR) value for each bit in the code block based, at least in part, on information bits in the code block; determining, by the mobile device, which code blocks of the one or more code blocks have errors and which code blocks of the one or more code blocks do not have errors; and subsequently decoding, by the mobile device, each of the code blocks determined to have errors, wherein, for each code block subsequently decoded, subsequent decoding includes modifying the LLR value for each bit in the code block based, at least in part, on the previously generated LLR value for information bits in the code block and an LLR value of an information bit in at least one of the received one or more parity check code blocks. 17. The method of claim 16, wherein, after each subsequent decoding of each of the code blocks determined to have errors, another determination of which code blocks of the subsequently decoded have errors is made, and wherein subsequent decoding continues for subsequently decoded code blocks determined to still have errors. 18. The method of claim 17, further including locking the LLR value for a bit when the code block that includes the bit has been determined to have no errors. 19. The method of claim 18, wherein the value to which the LLR value for a bit is locked is different than the LLR value for the bit when the code block that includes the bit was determined to have no errors. 20. The method of claim 17, further including terminating decoding of a code block when the code block is determined to have no errors. 21. A method of wireless communication, comprising:
receiving, by a mobile device, one or more code blocks and one or more parity check code blocks, each of the one or more code blocks including one or more information bits and each of the one or more parity check code blocks including one or more information bits, wherein for each parity check code block the one or more information bits correspond to information bits of the one or more code blocks; and decoding, by the mobile device, the one or more code blocks. 22. The method of claim 21, further including:
receiving a notification from a base station via a side channel which indicates which of the one or more code blocks will be affected by the interference signal; and decoding the one or more code blocks based, at least in part, on the received notification. 23. The method of claim 21, wherein each of the one or more code blocks includes one or more parity bits and each of the one or more parity check code blocks includes one or more parity bits, wherein for each code block the one or more parity bits were generated based, at least in part, on the one or more information bits of the code block, and wherein for each parity check code block the one or more parity bits were generated based, at least in part, on the one or more information bits of the parity check code block. 24. The method of claim 21, further including terminating decoding of the received one or more code blocks when none of the one or more code blocks have errors. 25. The method of claim 21, further including transmitting to the base station a recommended number of parity check code blocks to generate, wherein the recommended number is determined based, at least in part, on statistics of the decoding performed by the mobile device. | Coding for bursty interference is discussed in which a base station receives data bits for transmission. The base station may generate code blocks including information bits and parity bits. The base station may also generate parity check code blocks including information bits corresponding to information bits of the generated code blocks. The base station may transmit the code blocks and the parity check code blocks to a mobile device to improve decoding. When errors are detected, the mobile device may decode the received code blocks using hard or soft parity checks and the parity check code blocks.1. A method of wireless communication, comprising:
receiving, by a base station, a plurality of data bits; generating, by the base station, one or more code blocks, each of the one or more code blocks including one or more information bits and one or more parity bits, wherein for each code block the one or more information bits are generated based, at least in part, on data bits in the received plurality of data bits, and wherein for each code block the one or more parity bits are generated based, at least in part, on the one or more information bits of the code block; generating, by the base station, one or more parity check code blocks, each of the one or more parity check code blocks including one or more information bits, wherein for each parity check code block the one or more information bits correspond to information bits of the one or more code blocks; and transmitting, by the base station, each of the one or more code blocks and the one or more parity check code blocks to a mobile device. 2. The method of claim 1, wherein each of the one or more parity check code blocks also includes one or more parity bits, and wherein for each parity check code block the one or more parity bits are generated based, at least in part, on the one or more information bits of the parity check code block. 3. The method of claim 1, further including determining, by the base station, a number of parity check code blocks to generate based on information received from the mobile device, wherein generating the one or more parity check code blocks includes generating the determined number of parity check code blocks. 4. The method of claim 3, wherein the information received from the mobile device includes a recommended number of parity check code blocks to generate, wherein the recommended number is determined based, at least in part, on decoding statistics associated with a decoder at the mobile device. 5. The method of claim 1, wherein each information bit of a parity check code block corresponds to a different set of information bits of the one or more code blocks. 6. The method of claim 5, wherein the different set of information bits of the one or more code blocks includes a single bit from each of the one or more code blocks. 7. The method of claim 5, wherein each information bit of a parity check code block is generated based, at least in part, on the set of information bits of the one or more code blocks to which the parity check code block information bit corresponds. 8. The method of claim 1, wherein each information bit of a parity check code block is generated based, at least in part, on the same data bits in the received plurality of data bits used to generate the information bits of the one or more code blocks to which the parity check code block bit corresponds. 9. The method of claim 1, wherein each information bit of a parity check code block is generated based, at least in part, on the one or code blocks and additional code blocks not part of the one or more code blocks. 10. The method of claim 1, further including:
identifying an interference signal; and transmitting a notification to the mobile device via a side channel which indicates which of the one or more code blocks will be affected by the interference signal. 11. The method of claim 1, further including:
receiving a request from the mobile device for retransmission of the one or more code blocks and the one or more parity check code blocks when the number of code blocks that have errors is greater than the number of parity check code blocks that do not have errors; and retransmitting the one or more code blocks and the one or more parity check code blocks to the mobile device in response to receiving the retransmission request. 12. The method of claim 1, further including:
identifying an interference signal; and dynamically adapting the number of parity check code blocks to generate based, at least in part, on the identified interference signal. 13. A method of wireless communication, comprising:
receiving, by a mobile device, one or more code blocks and one or more parity check code blocks; decoding, by the mobile device, the one or more code blocks; determining, by the mobile device, a number of decoded code blocks that have errors; decoding, by the mobile device, the one or more parity check code blocks when one or more of the received code blocks have errors; determining, by the mobile device, a number of decoded parity check code blocks that do not have errors; and correcting, by the mobile device, errors in the decoded code blocks determined to have errors based, at least in part, on the decoded parity check code blocks determined to not have errors to complete the decoding of the one or more code blocks when the number of code blocks that have errors is equal to or less than the number of parity check code blocks determined to not have errors. 14. The method of claim 13, further including transmitting a request for retransmission to the base station when the number of code blocks that have errors is greater than the number of parity check code blocks determined to not have errors. 15. The method of claim 13, further including terminating decoding of the received one or more code blocks when none of the one or more code blocks have errors. 16. A method of wireless communication, comprising:
receiving, by a mobile device, one or more code blocks and one or more parity check code blocks; decoding, by the mobile device, each of the one or more code blocks, wherein, for each code block, decoding includes generating a logarithm of the likelihood ratio (LLR) value for each bit in the code block based, at least in part, on information bits in the code block; determining, by the mobile device, which code blocks of the one or more code blocks have errors and which code blocks of the one or more code blocks do not have errors; and subsequently decoding, by the mobile device, each of the code blocks determined to have errors, wherein, for each code block subsequently decoded, subsequent decoding includes modifying the LLR value for each bit in the code block based, at least in part, on the previously generated LLR value for information bits in the code block and an LLR value of an information bit in at least one of the received one or more parity check code blocks. 17. The method of claim 16, wherein, after each subsequent decoding of each of the code blocks determined to have errors, another determination of which code blocks of the subsequently decoded have errors is made, and wherein subsequent decoding continues for subsequently decoded code blocks determined to still have errors. 18. The method of claim 17, further including locking the LLR value for a bit when the code block that includes the bit has been determined to have no errors. 19. The method of claim 18, wherein the value to which the LLR value for a bit is locked is different than the LLR value for the bit when the code block that includes the bit was determined to have no errors. 20. The method of claim 17, further including terminating decoding of a code block when the code block is determined to have no errors. 21. A method of wireless communication, comprising:
receiving, by a mobile device, one or more code blocks and one or more parity check code blocks, each of the one or more code blocks including one or more information bits and each of the one or more parity check code blocks including one or more information bits, wherein for each parity check code block the one or more information bits correspond to information bits of the one or more code blocks; and decoding, by the mobile device, the one or more code blocks. 22. The method of claim 21, further including:
receiving a notification from a base station via a side channel which indicates which of the one or more code blocks will be affected by the interference signal; and decoding the one or more code blocks based, at least in part, on the received notification. 23. The method of claim 21, wherein each of the one or more code blocks includes one or more parity bits and each of the one or more parity check code blocks includes one or more parity bits, wherein for each code block the one or more parity bits were generated based, at least in part, on the one or more information bits of the code block, and wherein for each parity check code block the one or more parity bits were generated based, at least in part, on the one or more information bits of the parity check code block. 24. The method of claim 21, further including terminating decoding of the received one or more code blocks when none of the one or more code blocks have errors. 25. The method of claim 21, further including transmitting to the base station a recommended number of parity check code blocks to generate, wherein the recommended number is determined based, at least in part, on statistics of the decoding performed by the mobile device. | 2,100 |
4,543 | 15,281,317 | 2,111 | A method begins by a dispersed storage (DS) processing module receiving encoded data slices and decoding encoded data slices to reproduce a secure data segment, followed by de-combining the secure data segment to reproduce encrypted data and a masked key. The method continues by performing a deterministic function on the encrypted data to produce transformed data, de-masking the masked key based on the transformed data to produce a master key and de-aggregating the encrypted data to reproduce encrypted data sub-segments. A sub-key is generated based on the master key and a decode threshold number of sub-keys are output to a corresponding number of distributed storage and task execution units, followed by decrypting the encrypted data sub-segment utilizing a corresponding sub-key for each encrypted data sub-segment and de-partitioning the decode threshold number of data sub-segments to re-produce a data segment. | 1. A method for execution by one or more processing modules of one or more computing devices, the method comprises:
receiving at least a decode threshold number of encoded data slices of a set of encoded data slices; decoding the at least a decode threshold number of encoded data slices to reproduce a secure data segment; de-combining the secure data segment to reproduce encrypted data and a masked key; performing a deterministic function on the encrypted data to produce transformed data; de-masking the masked key based on the transformed data to produce a master key; de-aggregating the encrypted data to reproduce a decode threshold number of encrypted data sub-segments; for each of at least a decode threshold number of encrypted data sub-segments, generating a sub-key based on the master key; outputting a decode threshold number of sub-keys to a corresponding decode threshold number of distributed storage and task execution units; for each encrypted data sub-segment, decrypting the encrypted data sub-segment utilizing a corresponding sub-key; and de-partitioning the decode threshold number of data sub-segments to re-produce a data segment. 2. The method of claim 1, wherein the at least a decode threshold number of encoded data slices include a decode threshold number of encrypted data sub-segments. 3. The method of claim 1 wherein the receiving the at least a decode threshold number of encoded data slices of a set of encoded data slices includes at least one of generating read slice requests, sending the read slice requests to a decode threshold number of distributed storage and task execution units, or receiving the decode threshold number of encoded data slices from the decode threshold number of distributed storage and task execution units. 4. The method of claim 1, wherein the de-masking the masked key is based on a processing module performing an exclusive OR function on the masked key and the transformed data to reproduce the master key. 5. The method of claim 1, wherein the generating a sub-key based on the master key includes generating a descriptor associated with the encrypted data sub-segment. 6. The method of claim 1, wherein the outputting the decode threshold number of sub-keys to a corresponding decode threshold number of distributed storage and task execution units includes each distributed storage and task execution unit obtaining a corresponding encrypted data sub-segment. 7. The method of claim 6, wherein the corresponding encrypted data sub-segment is a locally stored slice. 8. The method of claim 1, wherein the deterministic function is at least one of a hashing function, a hash-based message authentication code function, a mask generating function, or a sponge function. 9. The method of claim 1, wherein the de-combining includes at least one of de-interleaving or de-appending. 10. A dispersed storage (DS) module comprises:
a first module, when operable within a computing device, causes the computing device to: receive encoded data slices; and unsecure each encoded data slice for a partition based on slice de-security information to generate sliced encoded data; a second module, when operable within the computing device, causes the computing device to: de-slice the sliced encoded data into encoded data segments; a third module, when operable within the computing device, causes the computing device to: decode the encoded data segments to produce secure data segments; a fourth module, when operable within the computing device, causes the computing device to: unsecure the secured data segments to produce data segments; and a fifth module, when operable within the computing device, causes the computing device to: de-segment the data segments into one or more data partitions. 11. The DS module of claim 10, wherein the first module slice de-security information is based on at least one of data decompression, decryption, de-watermarking, or integrity check. 12. The DS module of claim 10 further comprises:
the first module further functions to verify integrity information of each encoded data slice of retrieve slices, decrypt each verified encoded data slice, and decompresses each decrypted encoded data slice. 13. The DS module of claim 10, wherein the first module is bypassed such that the received encoded data slices are provided as sliced encoded data when the first module is not enabled. 14. The DS module of claim 10, wherein the second module further functions to de-slice the sliced encoded data into encoded data segments according to the pillar width of error correction encoding parameters. 15. The DS module of claim 10, wherein the third module further functions to decode the encoded data segments in accordance with error correction decoding parameters received from a control module. 16. The DS module of claim 15, wherein the error correction decoding parameters include identifying an error correction encoding scheme based on at least one of a forward error correction algorithm, a Reed-Salomon based algorithm, an information dispersal algorithm, a pillar width, a decode threshold, a read threshold, or a write threshold. 17. The DS module of claim 10, wherein the fourth module further functions to unsecure the secured data segments to produce data segments based on segment security information and partitioning information received from a control module. 18. The DS module of claim 10, wherein the fourth module further functions to unsecure the secured data segments to produce data segments based on segment security information including at least one of data decompression, decryption, de-watermarking, or integrity check verification. | A method begins by a dispersed storage (DS) processing module receiving encoded data slices and decoding encoded data slices to reproduce a secure data segment, followed by de-combining the secure data segment to reproduce encrypted data and a masked key. The method continues by performing a deterministic function on the encrypted data to produce transformed data, de-masking the masked key based on the transformed data to produce a master key and de-aggregating the encrypted data to reproduce encrypted data sub-segments. A sub-key is generated based on the master key and a decode threshold number of sub-keys are output to a corresponding number of distributed storage and task execution units, followed by decrypting the encrypted data sub-segment utilizing a corresponding sub-key for each encrypted data sub-segment and de-partitioning the decode threshold number of data sub-segments to re-produce a data segment.1. A method for execution by one or more processing modules of one or more computing devices, the method comprises:
receiving at least a decode threshold number of encoded data slices of a set of encoded data slices; decoding the at least a decode threshold number of encoded data slices to reproduce a secure data segment; de-combining the secure data segment to reproduce encrypted data and a masked key; performing a deterministic function on the encrypted data to produce transformed data; de-masking the masked key based on the transformed data to produce a master key; de-aggregating the encrypted data to reproduce a decode threshold number of encrypted data sub-segments; for each of at least a decode threshold number of encrypted data sub-segments, generating a sub-key based on the master key; outputting a decode threshold number of sub-keys to a corresponding decode threshold number of distributed storage and task execution units; for each encrypted data sub-segment, decrypting the encrypted data sub-segment utilizing a corresponding sub-key; and de-partitioning the decode threshold number of data sub-segments to re-produce a data segment. 2. The method of claim 1, wherein the at least a decode threshold number of encoded data slices include a decode threshold number of encrypted data sub-segments. 3. The method of claim 1 wherein the receiving the at least a decode threshold number of encoded data slices of a set of encoded data slices includes at least one of generating read slice requests, sending the read slice requests to a decode threshold number of distributed storage and task execution units, or receiving the decode threshold number of encoded data slices from the decode threshold number of distributed storage and task execution units. 4. The method of claim 1, wherein the de-masking the masked key is based on a processing module performing an exclusive OR function on the masked key and the transformed data to reproduce the master key. 5. The method of claim 1, wherein the generating a sub-key based on the master key includes generating a descriptor associated with the encrypted data sub-segment. 6. The method of claim 1, wherein the outputting the decode threshold number of sub-keys to a corresponding decode threshold number of distributed storage and task execution units includes each distributed storage and task execution unit obtaining a corresponding encrypted data sub-segment. 7. The method of claim 6, wherein the corresponding encrypted data sub-segment is a locally stored slice. 8. The method of claim 1, wherein the deterministic function is at least one of a hashing function, a hash-based message authentication code function, a mask generating function, or a sponge function. 9. The method of claim 1, wherein the de-combining includes at least one of de-interleaving or de-appending. 10. A dispersed storage (DS) module comprises:
a first module, when operable within a computing device, causes the computing device to: receive encoded data slices; and unsecure each encoded data slice for a partition based on slice de-security information to generate sliced encoded data; a second module, when operable within the computing device, causes the computing device to: de-slice the sliced encoded data into encoded data segments; a third module, when operable within the computing device, causes the computing device to: decode the encoded data segments to produce secure data segments; a fourth module, when operable within the computing device, causes the computing device to: unsecure the secured data segments to produce data segments; and a fifth module, when operable within the computing device, causes the computing device to: de-segment the data segments into one or more data partitions. 11. The DS module of claim 10, wherein the first module slice de-security information is based on at least one of data decompression, decryption, de-watermarking, or integrity check. 12. The DS module of claim 10 further comprises:
the first module further functions to verify integrity information of each encoded data slice of retrieve slices, decrypt each verified encoded data slice, and decompresses each decrypted encoded data slice. 13. The DS module of claim 10, wherein the first module is bypassed such that the received encoded data slices are provided as sliced encoded data when the first module is not enabled. 14. The DS module of claim 10, wherein the second module further functions to de-slice the sliced encoded data into encoded data segments according to the pillar width of error correction encoding parameters. 15. The DS module of claim 10, wherein the third module further functions to decode the encoded data segments in accordance with error correction decoding parameters received from a control module. 16. The DS module of claim 15, wherein the error correction decoding parameters include identifying an error correction encoding scheme based on at least one of a forward error correction algorithm, a Reed-Salomon based algorithm, an information dispersal algorithm, a pillar width, a decode threshold, a read threshold, or a write threshold. 17. The DS module of claim 10, wherein the fourth module further functions to unsecure the secured data segments to produce data segments based on segment security information and partitioning information received from a control module. 18. The DS module of claim 10, wherein the fourth module further functions to unsecure the secured data segments to produce data segments based on segment security information including at least one of data decompression, decryption, de-watermarking, or integrity check verification. | 2,100 |
4,544 | 14,171,815 | 2,129 | Systems, methods, and computer-readable media are provided for a near-well unstructured grid model builder for generating a full-field unstructured grid for reservoir simulation. As described further below, the near-well unstructured grid model builder may include a workflow interface and a parallel unstructured grid model builder. The inputs to the near-well unstructured grid model builder may include existing well trajectory and completion data, future well data, a geological model, a structured grid simulation model, or any combination thereof. The near-well unstructured grid model builder may output a near-well unstructured grid having a specified grid resolution in regions of interest that include a well. | 1. A computer-implemented method for generating a near-well unstructured grid, the method comprising:
receiving, by one or more processors, input data, the input data comprising:
a structured geocellular model having a well or a structured reservoir simulation model having a well; and
well trajectory data and completion data for the well;
determining, by one or more processors, a field polygon based on the input data; determining, by one or more processors, a reservoir polygon having a region of interest containing the well; generating, by one or more processors, a plurality of grid points, the plurality of grid points comprising:
a plurality of field grid points based on a user-specified field grid size; and
a plurality of reservoir grid points based on a user-specified reservoir grid size for each reservoir;
a plurality of well grid points based on a well grid size; and
a plurality of parallel near-wellbore grid points on both sides of each of the plurality of well grid points based on the well grid size;
performing conflicting point removal and point adjustments to generate a plurality of final grid points based on a point prioritization of weights assigned to the plurality of grid points; performing, by one or more processors, a Delaunay triangulation based on the plurality of final grid points; generating, by one or more processors, a Voronoi grid based on the Delaunay triangulation; generating, by one or more processors, a near-well unstructured grid based on the Voronoi grid, the generating comprising:
generating a geometry of the near-well unstructured grid;
generating properties of the near-well unstructured grid; and
generating perforation of the near-well unstructured grid; and
providing, by one or more processors, the near-well unstructured grid to a parallel reservoir simulator. 2. The method of claim 1, comprising performing a reservoir simulation of the near-well unstructured grid via the parallel reservoir simulator. 3. The method of claim 1, wherein the plurality of grid points comprises a plurality of region of interest grid points based on a user-specified region of interest grid size for the region of interest. 4. The method of claim 1, wherein generating the plurality of grid points comprises a plurality of multi-level quad-tree local grid refinement (LGR) grid points based on a user-specified number of levels and user specified near-well distances. 5. The method of claim 1, wherein generating the geometry of the near-well unstructured grid comprises generating a 2.5D unstructured grid geometry. 6. The method of claim 5, wherein generating the geometry of the near-well unstructured grid comprises computing a depth to a bounding surface of each grid layer. 7. The method of claim 5, wherein the generated unstructured grid geometry comprises a layer geometry of the structured geocellular model or a structured reservoir simulation model. 8. The method of claim 1, wherein generating properties of the near-well unstructured grid comprising applying interpolation or point injection from a property value of the structured geocellular model or a structured reservoir simulation model to a grid point center of the near-well unstructured grid, such that the unstructured grid property maps closely match the original structured grid property maps. 9. The method of claim 1, wherein generating a perforation of the near-well unstructured grid comprising computing an intersection point of the well trajectory and well completion data with a finite volume cell face of one or more of the plurality of grid cells penetrated by a wellbore of the well. 10. The method of claim 1, comprising providing a graphical user interface to a user, the graphical user interface comprising an interface for specifying the input data. 11. The method of claim 1, wherein the graphical user interface comprises a rendering tool for visualizing the generated unstructured grid geometry. 12. The method of claim 1, wherein the graphic graphical user interface comprises a property analysis tool for displaying the generated unstructured grid properties. 13. The method of claim 1, wherein the graphical user interface comprises a perforation analysis tool for displaying the generated unstructured grid perforation. 14. A non-transitory tangible computer-readable storage medium having executable computer code stored thereon, the computer code comprising a set of instructions that causes one or more processors to perform the following:
receiving, by one or more processors, input data, the input data comprising:
a structured geocellular model or a structured reservoir simulation model having a well; and
well trajectory data and completion data for the well;
determining, by one or more processors, a field polygon based on the input data; determining, by one or more processors, a reservoir polygon having a region of interest containing the well; generating, by one or more processors, a plurality of grid points, the plurality of grid points comprising:
a plurality of field grid points based on a user-specified field grid size;
a plurality of reservoir grid points based on a user-specified reservoir grid size for each reservoir;
a plurality of well grid points based on a well grid size; and
a plurality of parallel near-wellbore grid points on both sides of each of the plurality of well grid points based on the well grid size;
performing conflicting point removal and point adjustments to produce a plurality of final grid points based on a point prioritization of weights assigned to the plurality of grid points; performing, by one or more processors, a Delaunay triangulation based on the plurality of final grid points: generating, by one or more processors, a Voronoi grid based on the Delaunay triangulation; generating, by one or more processors, a near-well unstructured grid model based on the Voronoi grid, the generating comprising:
generating a geometry of the near-well unstructured grid model;
generating properties of the near-well unstructured grid model; and
generating perforation of the near-well unstructured grid model; and
providing, by one or more processors, the near-well unstructured grid to a parallel reservoir simulator. 15. The non-transitory tangible computer-readable storage medium of claim 14, the computer code further comprising a set of instructions that causes one or more processors to perform the following: performing a reservoir simulation of the near-well unstructured grid via the parallel reservoir simulator. 16. The non-transitory tangible computer-readable storage medium of claim 14, wherein plurality of grid points comprises a plurality of region of interest grid points based on a user-specified region of interest grid size for the region of interest. 17. The non-transitory tangible computer-readable storage medium of claim 14, wherein the plurality of grid points comprises a plurality of multi-level quad-tree local grid refinement (LGR) grid points based on a user-specified number of levels and user specified near-well distances. 18. The non-transitory tangible computer-readable storage medium of claim 14, wherein generating the geometry of the near-well unstructured grid comprises generating a 2.5D unstructured grid geometry. 19. The non-transitory tangible computer-readable storage medium of claim 18, wherein generating the geometry of the near-well unstructured grid comprises computing a depth to a bounding surface of each grid layer. 20. The non-transitory tangible computer-readable storage medium of claim 18, wherein the generated unstructured grid geometry comprises a layer geometry of the structured geocellular model or a structured reservoir simulation model. 21. The non-transitory tangible computer-readable storage medium of claim 14, wherein generating properties of the near-well unstructured grid comprising applying an interpolation or point injection from a property value of the structured geocellular model or a structured reservoir simulation model to a grid point center of the near-well unstructured grid, such that the unstructured grid property maps closely match the original structured grid property maps. 22. The non-transitory tangible computer-readable storage medium of claim 14, wherein generating a perforation of the near-well unstructured grid comprising computing an intersection point of the well trajectory data with a finite volume cell face of one or more of the plurality of grid cells penetrated by a wellbore of the well. 23. The non-transitory tangible computer-readable storage medium of claim 14, the computer code further comprising a set of instructions that causes one or more processors to perform the following: providing a graphical user interface to a user, the graphical user interface comprising an interface for specifying the input data. 24. The non-transitory tangible computer-readable storage medium of claim 14, wherein the graphical user interface comprises a rendering tool for visualizing the generated unstructured grid geometry. 25. The non-transitory tangible computer-readable storage medium of claim 14, wherein the graphic graphical user interface comprises a property analysis tool for displaying the generated unstructured grid properties. 26. The non-transitory tangible computer-readable storage medium of claim 14, wherein the graphical user interface comprises a perforation analysis tool for displaying the generated unstructured grid perforation. 27. A system, comprising:
one or more processors; a non-transitory tangible computer-readable memory having executable computer code stored thereon, the computer code comprising a set of instructions that causes one or more processors to perform the following:
receiving, by the one or more processors, input data, the input data comprising:
a structured geocellular model having a well or a structured reservoir simulation model having a well; and
well trajectory data and completion data for the well; and
determining, by the one or more processors, a reservoir polygon having a region of interest containing the well;
generating, by one or more processors, a plurality of grid points, the plurality of grid points comprising:
a plurality of field grid points based on a user-specified field grid size;
a plurality of reservoir grid points based on a user-specified reservoir grid size for each reservoir;
a plurality of well grid points based on a well grid size; and
a plurality of parallel near-wellbore grid points on both sides of each of the plurality of well grid points based on the well grid size;
performing conflicting point removal and point adjustments to produce a plurality of final grid points based on a point prioritization of weights assigned to the plurality of grid points;
performing, by the one or more processors, a Delaunay triangulation based on the plurality of final grid points:
generating, by the one or more processors, a Voronoi grid based on the Delaunay triangulation;
generating, by the one or more processors, a near-well unstructured grid based on the Voronoi grid, the generating comprising:
generating a geometry of the near-well unstructured grid;
generating properties of the near-well unstructured grid; and
generating a perforation of the near-well unstructured grid; and
providing, over a network coupled to the one or more processors, the near-well unstructured grid to a parallel reservoir simulator. 28. The system of claim 27, the computer code further comprising a set of instructions that causes one or more processors to perform the following: performing a reservoir simulation of the near-well unstructured grid via the parallel reservoir simulator. 29. The system of claim 27, wherein the plurality of grid points comprises a plurality of multi-level quad-tree local grid refinement (LGR) grid points based on a user-specified number of levels and user specified near-well distances. 30. The system of claim 27, wherein generating the geometry of the near-well unstructured grid comprises generating a 2.5D unstructured grid geometry. 31. The system of claim 30, wherein generating the geometry of the near-well unstructured grid comprises computing a depth to a bounding surface of each grid layer. 32. The system of claim 27, comprising a client computer coupled to the one or more processors, the client computer configured to provide a graphical user interface to a user, the graphical user interface comprising an interface for specifying the input data. 33. The system of claim 27, wherein the graphical user interface comprises a rendering tool for visualizing the generated unstructured grid geometry. 34. The system of claim 27, wherein the graphic graphical user interface comprises a property analysis tool for displaying the generated unstructured grid properties. 35. The system of claim 27, wherein the graphical user interface comprises a perforation analysis tool for displaying the generated unstructured grid perforation. 36. A non-transitory tangible computer-readable storage medium having executable computer code stored thereon for a workflow interface for generating a near-well unstructured grid, the computer code comprising a set of instructions that causes one or more processors to perform the following:
define a workflow interface for a near-well unstructured grid builder, the workflow interface configured to:
define input data for the near-well unstructured grid builder;
define gridding options for the near-well unstructured grid builder;
display well data of the input data in a 2D or 3D visualization;
provide well data and a region of interest within the input data to an unstructured grid model builder for generation of an unstructured grid;
display geometry of the generated unstructured grid;
display the properties of the generated unstructured grid; and
display the perforation of the generated unstructured grid. 37. The non-transitory tangible computer-readable storage medium of claim 36, the workflow interface comprising a graphical user interface. 38. The non-transitory tangible computer-readable storage medium of claim 36, the workflow interface configured to well data of the input data in a 2D or 3D visualization according to user-selected colors. 39. The non-transitory tangible computer-readable storage medium of claim 36, the workflow interface configured to well data of the input data in a 2D or 3D visualization according to user-selected colors. 40. A computer-implemented method for constructing an unstructured grid, comprising:
receiving, by one or more processors, a structured grid having a first plurality of grid points and a well of a reservoir; determining, by one or more processors, a region of interest in the structured grid; generating, by one or more processors, a second plurality of grid points in the region of interest according to a first grid size: generating, by one or more processors, a third plurality of grid points outside of the region of interest according to a second grid size; constructing, by one or more processors, a 2.5D unstructured grid from the second plurality of grid points and the third plurality of grid points; and processing, by one or more processors, the 2.5 unstructured grid via a reservoir simulator to produce a simulation of the reservoir. 41. The method of claim 40, comprising generating, by one or more processor, properties of the 2.5D unstructured grid based on properties of the structured grid. 42. The method of claim 40, comprising receiving, by one or more processors, well trajectory data and completion data for the well. 43. The method of claim 40, wherein the 2.5D unstructured grid comprises a reservoir layer geometry of the structured grid. | Systems, methods, and computer-readable media are provided for a near-well unstructured grid model builder for generating a full-field unstructured grid for reservoir simulation. As described further below, the near-well unstructured grid model builder may include a workflow interface and a parallel unstructured grid model builder. The inputs to the near-well unstructured grid model builder may include existing well trajectory and completion data, future well data, a geological model, a structured grid simulation model, or any combination thereof. The near-well unstructured grid model builder may output a near-well unstructured grid having a specified grid resolution in regions of interest that include a well.1. A computer-implemented method for generating a near-well unstructured grid, the method comprising:
receiving, by one or more processors, input data, the input data comprising:
a structured geocellular model having a well or a structured reservoir simulation model having a well; and
well trajectory data and completion data for the well;
determining, by one or more processors, a field polygon based on the input data; determining, by one or more processors, a reservoir polygon having a region of interest containing the well; generating, by one or more processors, a plurality of grid points, the plurality of grid points comprising:
a plurality of field grid points based on a user-specified field grid size; and
a plurality of reservoir grid points based on a user-specified reservoir grid size for each reservoir;
a plurality of well grid points based on a well grid size; and
a plurality of parallel near-wellbore grid points on both sides of each of the plurality of well grid points based on the well grid size;
performing conflicting point removal and point adjustments to generate a plurality of final grid points based on a point prioritization of weights assigned to the plurality of grid points; performing, by one or more processors, a Delaunay triangulation based on the plurality of final grid points; generating, by one or more processors, a Voronoi grid based on the Delaunay triangulation; generating, by one or more processors, a near-well unstructured grid based on the Voronoi grid, the generating comprising:
generating a geometry of the near-well unstructured grid;
generating properties of the near-well unstructured grid; and
generating perforation of the near-well unstructured grid; and
providing, by one or more processors, the near-well unstructured grid to a parallel reservoir simulator. 2. The method of claim 1, comprising performing a reservoir simulation of the near-well unstructured grid via the parallel reservoir simulator. 3. The method of claim 1, wherein the plurality of grid points comprises a plurality of region of interest grid points based on a user-specified region of interest grid size for the region of interest. 4. The method of claim 1, wherein generating the plurality of grid points comprises a plurality of multi-level quad-tree local grid refinement (LGR) grid points based on a user-specified number of levels and user specified near-well distances. 5. The method of claim 1, wherein generating the geometry of the near-well unstructured grid comprises generating a 2.5D unstructured grid geometry. 6. The method of claim 5, wherein generating the geometry of the near-well unstructured grid comprises computing a depth to a bounding surface of each grid layer. 7. The method of claim 5, wherein the generated unstructured grid geometry comprises a layer geometry of the structured geocellular model or a structured reservoir simulation model. 8. The method of claim 1, wherein generating properties of the near-well unstructured grid comprising applying interpolation or point injection from a property value of the structured geocellular model or a structured reservoir simulation model to a grid point center of the near-well unstructured grid, such that the unstructured grid property maps closely match the original structured grid property maps. 9. The method of claim 1, wherein generating a perforation of the near-well unstructured grid comprising computing an intersection point of the well trajectory and well completion data with a finite volume cell face of one or more of the plurality of grid cells penetrated by a wellbore of the well. 10. The method of claim 1, comprising providing a graphical user interface to a user, the graphical user interface comprising an interface for specifying the input data. 11. The method of claim 1, wherein the graphical user interface comprises a rendering tool for visualizing the generated unstructured grid geometry. 12. The method of claim 1, wherein the graphic graphical user interface comprises a property analysis tool for displaying the generated unstructured grid properties. 13. The method of claim 1, wherein the graphical user interface comprises a perforation analysis tool for displaying the generated unstructured grid perforation. 14. A non-transitory tangible computer-readable storage medium having executable computer code stored thereon, the computer code comprising a set of instructions that causes one or more processors to perform the following:
receiving, by one or more processors, input data, the input data comprising:
a structured geocellular model or a structured reservoir simulation model having a well; and
well trajectory data and completion data for the well;
determining, by one or more processors, a field polygon based on the input data; determining, by one or more processors, a reservoir polygon having a region of interest containing the well; generating, by one or more processors, a plurality of grid points, the plurality of grid points comprising:
a plurality of field grid points based on a user-specified field grid size;
a plurality of reservoir grid points based on a user-specified reservoir grid size for each reservoir;
a plurality of well grid points based on a well grid size; and
a plurality of parallel near-wellbore grid points on both sides of each of the plurality of well grid points based on the well grid size;
performing conflicting point removal and point adjustments to produce a plurality of final grid points based on a point prioritization of weights assigned to the plurality of grid points; performing, by one or more processors, a Delaunay triangulation based on the plurality of final grid points: generating, by one or more processors, a Voronoi grid based on the Delaunay triangulation; generating, by one or more processors, a near-well unstructured grid model based on the Voronoi grid, the generating comprising:
generating a geometry of the near-well unstructured grid model;
generating properties of the near-well unstructured grid model; and
generating perforation of the near-well unstructured grid model; and
providing, by one or more processors, the near-well unstructured grid to a parallel reservoir simulator. 15. The non-transitory tangible computer-readable storage medium of claim 14, the computer code further comprising a set of instructions that causes one or more processors to perform the following: performing a reservoir simulation of the near-well unstructured grid via the parallel reservoir simulator. 16. The non-transitory tangible computer-readable storage medium of claim 14, wherein plurality of grid points comprises a plurality of region of interest grid points based on a user-specified region of interest grid size for the region of interest. 17. The non-transitory tangible computer-readable storage medium of claim 14, wherein the plurality of grid points comprises a plurality of multi-level quad-tree local grid refinement (LGR) grid points based on a user-specified number of levels and user specified near-well distances. 18. The non-transitory tangible computer-readable storage medium of claim 14, wherein generating the geometry of the near-well unstructured grid comprises generating a 2.5D unstructured grid geometry. 19. The non-transitory tangible computer-readable storage medium of claim 18, wherein generating the geometry of the near-well unstructured grid comprises computing a depth to a bounding surface of each grid layer. 20. The non-transitory tangible computer-readable storage medium of claim 18, wherein the generated unstructured grid geometry comprises a layer geometry of the structured geocellular model or a structured reservoir simulation model. 21. The non-transitory tangible computer-readable storage medium of claim 14, wherein generating properties of the near-well unstructured grid comprising applying an interpolation or point injection from a property value of the structured geocellular model or a structured reservoir simulation model to a grid point center of the near-well unstructured grid, such that the unstructured grid property maps closely match the original structured grid property maps. 22. The non-transitory tangible computer-readable storage medium of claim 14, wherein generating a perforation of the near-well unstructured grid comprising computing an intersection point of the well trajectory data with a finite volume cell face of one or more of the plurality of grid cells penetrated by a wellbore of the well. 23. The non-transitory tangible computer-readable storage medium of claim 14, the computer code further comprising a set of instructions that causes one or more processors to perform the following: providing a graphical user interface to a user, the graphical user interface comprising an interface for specifying the input data. 24. The non-transitory tangible computer-readable storage medium of claim 14, wherein the graphical user interface comprises a rendering tool for visualizing the generated unstructured grid geometry. 25. The non-transitory tangible computer-readable storage medium of claim 14, wherein the graphic graphical user interface comprises a property analysis tool for displaying the generated unstructured grid properties. 26. The non-transitory tangible computer-readable storage medium of claim 14, wherein the graphical user interface comprises a perforation analysis tool for displaying the generated unstructured grid perforation. 27. A system, comprising:
one or more processors; a non-transitory tangible computer-readable memory having executable computer code stored thereon, the computer code comprising a set of instructions that causes one or more processors to perform the following:
receiving, by the one or more processors, input data, the input data comprising:
a structured geocellular model having a well or a structured reservoir simulation model having a well; and
well trajectory data and completion data for the well; and
determining, by the one or more processors, a reservoir polygon having a region of interest containing the well;
generating, by one or more processors, a plurality of grid points, the plurality of grid points comprising:
a plurality of field grid points based on a user-specified field grid size;
a plurality of reservoir grid points based on a user-specified reservoir grid size for each reservoir;
a plurality of well grid points based on a well grid size; and
a plurality of parallel near-wellbore grid points on both sides of each of the plurality of well grid points based on the well grid size;
performing conflicting point removal and point adjustments to produce a plurality of final grid points based on a point prioritization of weights assigned to the plurality of grid points;
performing, by the one or more processors, a Delaunay triangulation based on the plurality of final grid points:
generating, by the one or more processors, a Voronoi grid based on the Delaunay triangulation;
generating, by the one or more processors, a near-well unstructured grid based on the Voronoi grid, the generating comprising:
generating a geometry of the near-well unstructured grid;
generating properties of the near-well unstructured grid; and
generating a perforation of the near-well unstructured grid; and
providing, over a network coupled to the one or more processors, the near-well unstructured grid to a parallel reservoir simulator. 28. The system of claim 27, the computer code further comprising a set of instructions that causes one or more processors to perform the following: performing a reservoir simulation of the near-well unstructured grid via the parallel reservoir simulator. 29. The system of claim 27, wherein the plurality of grid points comprises a plurality of multi-level quad-tree local grid refinement (LGR) grid points based on a user-specified number of levels and user specified near-well distances. 30. The system of claim 27, wherein generating the geometry of the near-well unstructured grid comprises generating a 2.5D unstructured grid geometry. 31. The system of claim 30, wherein generating the geometry of the near-well unstructured grid comprises computing a depth to a bounding surface of each grid layer. 32. The system of claim 27, comprising a client computer coupled to the one or more processors, the client computer configured to provide a graphical user interface to a user, the graphical user interface comprising an interface for specifying the input data. 33. The system of claim 27, wherein the graphical user interface comprises a rendering tool for visualizing the generated unstructured grid geometry. 34. The system of claim 27, wherein the graphic graphical user interface comprises a property analysis tool for displaying the generated unstructured grid properties. 35. The system of claim 27, wherein the graphical user interface comprises a perforation analysis tool for displaying the generated unstructured grid perforation. 36. A non-transitory tangible computer-readable storage medium having executable computer code stored thereon for a workflow interface for generating a near-well unstructured grid, the computer code comprising a set of instructions that causes one or more processors to perform the following:
define a workflow interface for a near-well unstructured grid builder, the workflow interface configured to:
define input data for the near-well unstructured grid builder;
define gridding options for the near-well unstructured grid builder;
display well data of the input data in a 2D or 3D visualization;
provide well data and a region of interest within the input data to an unstructured grid model builder for generation of an unstructured grid;
display geometry of the generated unstructured grid;
display the properties of the generated unstructured grid; and
display the perforation of the generated unstructured grid. 37. The non-transitory tangible computer-readable storage medium of claim 36, the workflow interface comprising a graphical user interface. 38. The non-transitory tangible computer-readable storage medium of claim 36, the workflow interface configured to well data of the input data in a 2D or 3D visualization according to user-selected colors. 39. The non-transitory tangible computer-readable storage medium of claim 36, the workflow interface configured to well data of the input data in a 2D or 3D visualization according to user-selected colors. 40. A computer-implemented method for constructing an unstructured grid, comprising:
receiving, by one or more processors, a structured grid having a first plurality of grid points and a well of a reservoir; determining, by one or more processors, a region of interest in the structured grid; generating, by one or more processors, a second plurality of grid points in the region of interest according to a first grid size: generating, by one or more processors, a third plurality of grid points outside of the region of interest according to a second grid size; constructing, by one or more processors, a 2.5D unstructured grid from the second plurality of grid points and the third plurality of grid points; and processing, by one or more processors, the 2.5 unstructured grid via a reservoir simulator to produce a simulation of the reservoir. 41. The method of claim 40, comprising generating, by one or more processor, properties of the 2.5D unstructured grid based on properties of the structured grid. 42. The method of claim 40, comprising receiving, by one or more processors, well trajectory data and completion data for the well. 43. The method of claim 40, wherein the 2.5D unstructured grid comprises a reservoir layer geometry of the structured grid. | 2,100 |
4,545 | 13,992,817 | 2,169 | A query optimizer may determine the time sensitivity of a database query using the query semantics information. The query optimizer may determine a query execution plan based on the time sensitivity of the database query. The query execution plan may also be based on performance characteristics of database servers. | 1. A method comprising:
receiving a database query from a client computer; and selecting, based on a time sensitivity of the database query, one of a plurality of database servers to execute the database query. 2. The method of claim 1 wherein selecting one of the plurality of database servers to execute the database query is also based on a performance characteristic of each of the plurality of database servers. 3. The method of claim 1 further comprising storing the database query for later execution. 4. The method of claim 3 wherein storing the database query comprises storing the database query on a query optimizer server. 5. The method of claim 4 further comprising, after storing the database query on the query optimizer server, sending the database query to the selected one of the plurality of database servers. 6. The method of claim 3 wherein storing the database query comprises storing the database query on the selected one of the plurality of database servers. 7. The method of claim 1 further comprising determining the time sensitivity of the query based on query semantics information. 8. The method of claim 7 further comprising obtaining the query semantics information from at least one data source external to the plurality of database servers. 9. The method of claim 7 further comprising obtaining the query semantics information from user information. 10. The method of claim 1 further comprising obtaining a performance characteristic of each of the plurality of database servers 11. The method of claim 1 further comprising determining an execution plan for executing the database query. 12. The method of claim 1 further comprising executing the database query on the selected one of the plurality of database servers. 13. A non-transitory computer readable medium storing instructions to cause the computer to:
receive a database query; determine a time sensitivity of the database query; and select, based on the time sensitivity of the database query, one of a plurality of database servers to execute the database query. 14. The medium of claim 13 wherein selecting one of the plurality of database servers to execute the database query is also based on a performance characteristic of each of the plurality of database servers. 15. The medium of claim 13 further storing instructions to store the database query for later execution. 16. The medium of claim 15 wherein storing the database query for later execution comprises storing the database query on a query optimizer server. 17. The medium of claim 13 further storing instructions to determine the time sensitivity of the query based on query semantics information. 18. The medium of claim 17 further storing instructions to obtain the query semantics information from an external data source. 19. The medium of claim 17 further storing instructions to obtain the query semantics information from a user profile. 20. The medium of claim 13 further storing instructions to determine an execution plan for executing the database query. 21. An apparatus comprising:
a hardware processor; and a semantics module executed by the hardware processor, the semantics module to: receive a database query from a client computer, determine a time sensitivity of the database query, obtain performance characteristics for a plurality of database servers, and select, based on the time sensitivity and the performance characteristics, at least one of the plurality of database servers to execute the database query. 22. The apparatus of claim 21 wherein the semantics module is to determine time sensitivity of the database query using query semantics information. 23. The apparatus of claim 23 wherein the semantics module is also to obtain the query semantics information from a website. 24. The apparatus of claim 23 wherein the semantics module is also to obtain the query semantics information from a personal computing device. 25. The apparatus of claim 21 wherein obtaining the performance characteristics comprises obtaining an operating mode for each of the plurality of database servers. 26. The apparatus of claim 21 wherein obtaining the performance characteristics comprises obtaining an planned maintenance schedule for each of the plurality of database servers. 27. The apparatus of claim 21 wherein obtaining the performance characteristics comprises obtaining a current work load for each of the plurality of database servers. 28. The apparatus of claim 21 wherein obtaining the performance characteristics comprises obtaining a bandwidth utilization for each of the plurality of database servers. 29. The apparatus of claim 21 wherein obtaining the performance characteristics comprises obtaining a number of pending transactions for each of the plurality of database servers. 30. The apparatus of claim 21 wherein the semantics module is also to store the query for later execution. | A query optimizer may determine the time sensitivity of a database query using the query semantics information. The query optimizer may determine a query execution plan based on the time sensitivity of the database query. The query execution plan may also be based on performance characteristics of database servers.1. A method comprising:
receiving a database query from a client computer; and selecting, based on a time sensitivity of the database query, one of a plurality of database servers to execute the database query. 2. The method of claim 1 wherein selecting one of the plurality of database servers to execute the database query is also based on a performance characteristic of each of the plurality of database servers. 3. The method of claim 1 further comprising storing the database query for later execution. 4. The method of claim 3 wherein storing the database query comprises storing the database query on a query optimizer server. 5. The method of claim 4 further comprising, after storing the database query on the query optimizer server, sending the database query to the selected one of the plurality of database servers. 6. The method of claim 3 wherein storing the database query comprises storing the database query on the selected one of the plurality of database servers. 7. The method of claim 1 further comprising determining the time sensitivity of the query based on query semantics information. 8. The method of claim 7 further comprising obtaining the query semantics information from at least one data source external to the plurality of database servers. 9. The method of claim 7 further comprising obtaining the query semantics information from user information. 10. The method of claim 1 further comprising obtaining a performance characteristic of each of the plurality of database servers 11. The method of claim 1 further comprising determining an execution plan for executing the database query. 12. The method of claim 1 further comprising executing the database query on the selected one of the plurality of database servers. 13. A non-transitory computer readable medium storing instructions to cause the computer to:
receive a database query; determine a time sensitivity of the database query; and select, based on the time sensitivity of the database query, one of a plurality of database servers to execute the database query. 14. The medium of claim 13 wherein selecting one of the plurality of database servers to execute the database query is also based on a performance characteristic of each of the plurality of database servers. 15. The medium of claim 13 further storing instructions to store the database query for later execution. 16. The medium of claim 15 wherein storing the database query for later execution comprises storing the database query on a query optimizer server. 17. The medium of claim 13 further storing instructions to determine the time sensitivity of the query based on query semantics information. 18. The medium of claim 17 further storing instructions to obtain the query semantics information from an external data source. 19. The medium of claim 17 further storing instructions to obtain the query semantics information from a user profile. 20. The medium of claim 13 further storing instructions to determine an execution plan for executing the database query. 21. An apparatus comprising:
a hardware processor; and a semantics module executed by the hardware processor, the semantics module to: receive a database query from a client computer, determine a time sensitivity of the database query, obtain performance characteristics for a plurality of database servers, and select, based on the time sensitivity and the performance characteristics, at least one of the plurality of database servers to execute the database query. 22. The apparatus of claim 21 wherein the semantics module is to determine time sensitivity of the database query using query semantics information. 23. The apparatus of claim 23 wherein the semantics module is also to obtain the query semantics information from a website. 24. The apparatus of claim 23 wherein the semantics module is also to obtain the query semantics information from a personal computing device. 25. The apparatus of claim 21 wherein obtaining the performance characteristics comprises obtaining an operating mode for each of the plurality of database servers. 26. The apparatus of claim 21 wherein obtaining the performance characteristics comprises obtaining an planned maintenance schedule for each of the plurality of database servers. 27. The apparatus of claim 21 wherein obtaining the performance characteristics comprises obtaining a current work load for each of the plurality of database servers. 28. The apparatus of claim 21 wherein obtaining the performance characteristics comprises obtaining a bandwidth utilization for each of the plurality of database servers. 29. The apparatus of claim 21 wherein obtaining the performance characteristics comprises obtaining a number of pending transactions for each of the plurality of database servers. 30. The apparatus of claim 21 wherein the semantics module is also to store the query for later execution. | 2,100 |
4,546 | 12,973,017 | 2,157 | A recording medium stores an information processing program that causes a computer having a storage unit storing therein a file group in which character code strings are described, to execute generating combined identification information by dividing into two portions, at least one among identification information for a preceding character code and identification information for a succeeding character code and respectively combining the portions with the identification information that is not divided, the preceding and succeeding character codes constituting a character code string for two-consecutive grams in a file among the file group; storing to the storage unit, various consecutive-gram divided maps obtained by allocating to each type of combined identification information generated, a string of bits corresponding to the quantity of files in the file group; and updating in the consecutive-gram divided maps, a bit indicating whether the character code string for the two-consecutive grams is present in the file. | 1. A non-transitory computer-readable recording medium storing therein an information processing program that, with respect to a computer comprising a storage unit storing therein a file group in which character code strings are described, causes the computer to execute:
generating plural types of combined identification information by dividing into two portions, at least one among identification information for a preceding character code and identification information for a succeeding character code and by respectively combining the portions of the divided identification information with the identification information that is not divided, the preceding and the succeeding character codes constituting a character code string for two-consecutive grams in a file selected from the file group; storing to the storage unit, plural types of consecutive-gram divided maps obtained by allocating to each type of combined identification information generated, a string of bits of a quantity corresponding to the quantity of files in the file group; and updating in the consecutive-gram divided maps, a bit that indicates whether the character code string for the two-consecutive grams is present in the selected file. 2. The recording medium according to claim 1, wherein
the generating includes generating two types of combined identification information by respectively coupling the portions with the identification information that is not divided. 3. The recording medium according to claim 1, wherein
the generating includes generating four types of combined identification information by respectively dividing into two portions, the identification information for the preceding character code and the identification information for the succeeding character code and selectively coupling pairs of the portions. 4. A non-transitory computer-readable recording medium storing therein an information processing program that, with respect to a computer comprising a storage unit storing therein a file group in which character code strings are described, causes the computer to execute:
generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code and by respectively combining the portions of the divided identification information with the identification information that is not divided, the head and the tail character codes constituting a character code string for multiple-consecutive grams in a file selected from the file group; storing to the storage unit, plural types of head-and-tail divided maps obtained by allocating to each type of combined identification information generated, a string of bits of a quantity corresponding to the quantity of files in the file group; and updating in the head-and-tail divided maps, a bit that indicates whether a combination of the head and the tail character codes in the character code string for the multiple-consecutive grams is present in the selected file. 5. The recording medium according to claim 4, wherein
the generating includes generating two types of combined identification information by respectively coupling the portions with the identification information that is not divided. 6. The recording medium according to claim 4, wherein
the generating includes generating four types of combined identification information by respectively dividing into two portions, the identification information for the head character code and the identification information for the tail character code and selectively coupling pairs of the portions. 7. The recording medium according to claim 1, wherein
the generating includes generating the plural types of combined identification information by dividing into two portions and combining, at least one among identification information for a head character code and identification information for a tail character code, the head and the tail character codes constituting a character code string for multiple-consecutive grams in the file, the storing to the storage unit includes storing plural types of head-and-tail divided maps obtained by allocating to each type of generated combined identification information that is based on the identification information for the head character code and for the tail character code, a string of bits of a quantity corresponding to the quantity of files in the file group, and the updating includes updating in the head-and-tail divided maps, a bit that indicates whether a combination of the head character code and the tail character code in the character code string for the multiple-consecutive grams is present in the file. 8. The recording medium according to claim 2, wherein
the generating includes generating the two types of combined identification information by dividing into two portions, one among identification information for a head character code and identification information for a tail character code and by respectively coupling the portions with the identification information that is not divided, the head and the tail character codes constituting a character code string for multiple-consecutive grams in the file, the storing to the storage unit includes storing two types of head-and-tail divided maps obtained by allocating to each type of generated combined identification information that is based on the identification information for the head character code and for the tail character code, a string of bits of a quantity corresponding to the quantity of files in the file group, and the updating includes updating in the two types of head-and-tail divided maps, a bit that indicates whether a combination of the head character code and the tail character code in the character code string for the multiple-consecutive grams is present in the file. 9. The recording medium according to claim 3, wherein
the generating includes generating the four types of combined identification information by respectively dividing into two portions, identification information for a head character code and identification information for a tail character code and by selectively coupling pairs of the portions, the head and the tail character codes constituting a character code string for multiple-consecutive grams in the file, the storing to the storage unit includes storing four types of head-and-tail divided maps obtained by allocating to each type of combined identification information that is generated and based on the identification information for the head character code and for the tail character code, a string of bits of a quantity corresponding to the quantity of files in the file group, and the updating includes updating in the four types of head-and-tail divided maps, a bit indicating whether a combination of the head character code and the tail character code in the character code string for the multiple-consecutive grams is present in the file. 10. A non-transitory computer-readable recording medium storing therein an information search program that, with respect to a computer comprising a storage unit storing therein a file group in which character code strings are described and a group of plural types of consecutive-gram divided maps formed by allocating to each type of combined identification information respectively set for each character code string representing two-consecutive grams, a bit string of a quantity corresponding to the quantity of files in the file group, causes the computer to execute:
receiving input of a search keyword; generating plural types of combined identification information by dividing into two portions, at least one among identification information for a preceding character code and identification information for a succeeding character code and by respectively combining the portions of the divided identification information with the identification information that is not divided, the preceding character code and the succeeding character code constituting a character code string for two-consecutive grams in the search keyword; identifying from among the group of consecutive-gram divided maps and for the preceding character code and the succeeding character code that constitute the character code string for the two-consecutive grams in the search keyword, plural types of consecutive-gram divided maps allocated with the plural types of combined identification information generated at the generating; and identifying from the among file group and based on the identified consecutive-gram divided maps, a file having therein the preceding character code and the succeeding character code that constitute the character code string for the two consecutive grams in the search keyword. 11. The recording medium according to claim 10, wherein
the file group describes therein a special character code at the head of a character code string for a term, the receiving includes receiving designation of a search condition concerning a forward search, the generating includes generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code in the search keyword to which the special character code string has been appended at the head thereof, and respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the consecutive-gram divided maps identified for the preceding and the succeeding character codes that constitute the character code string of the two-consecutive grams in the search keyword to which the special character code has been appended, a file having therein the preceding character code and the succeeding character code that constitute the character code string of two-consecutive grams in the search keyword to which the special character code string has been appended. 12. The recording medium according to claim 10, wherein
the file group describes therein a special character code at the tail of a character code string for a term, the receiving includes receiving designation of a search condition concerning a reverse search, the generating includes generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code in the search keyword to which the special character code string has been appended at the tail thereof, and respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the consecutive-gram divided maps identified for the preceding and the succeeding character codes that constitute the character code string of the two-consecutive grams in the search keyword to which the special character code has been appended, a file having therein the preceding character code and the succeeding character code that constitute the character code string of two-consecutive grams in the search keyword to which the special character code string has been appended. 13. A non-transitory computer-readable recording medium storing therein an information search program that, with respect to a computer comprising a storage unit storing therein a file group in which character code strings are described and a group of plural types of head-and-tail divided maps formed by allocating a string of bits of a quantity corresponding to the quantity of files in the file group to each type of combined identification information respectively set for each combination of a head character code and a tail character code that constitute a character code string for multiple-consecutive grams, causes the computer to execute:
receiving input of a search keyword; generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code and respectively combining the portions of the divided identification information with the identification information that is not divided, the head character code and the tail character code being in the search keyword; identifying from among the group of head-and-tail divided maps, plural types of head-and-tail divided maps that are allocated with the combined identification information generated at the generating; and identifying from among the file group and based on the identified head-and-tail divided maps, a file having therein a character code string that has a gram quantity equivalent to that of the search keyword and a head character code and tail character code that coincide with those of the search keyword. 14. The recording medium according to claim 13, wherein
the generating when designation of a search condition concerning a forward search has been received, includes generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code in the search keyword to which the special character code string has been appended at the head thereof and respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the identified head-and-tail divided maps, a file having therein a character code string that has a gram quantity equivalent to that of the search keyword to which the special character code string has been appended and a head character code and tail character code that coincide with those of the search keyword to which the special character code string has been appended. 15. The recording medium according to claim 13, wherein
the file group describes therein a special character code at the tail of a character code string for a term, the receiving includes receiving designation of a search condition concerning a reverse search, the generating when designation of a search condition concerning a reverse search has been received, includes generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code in the search keyword to which the special character code string has been appended at the tail thereof, and respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the identified head-and-tail divided maps, a file having therein a character code string that has a gram quantity equivalent to that of the search keyword to which the special character code string has been appended and a head character code and tail character code that coincide with those of the search keyword to which the special character code string has been appended. 16. The recording medium according to claim 10, wherein
the storage unit stores therein plural types of head-and-tail divided maps formed by allocating to each type of combined identification information respectively set for each combination of the head character code and the tail character code that constitute the character code string for the multiple-consecutive grams, a string of bits of a quantity corresponding to the quantity of files in the file group, the generating includes generating plural types of combined identification information based on the head character code and the tail character code by dividing into two portions, at least one among identification information for the head character code and the identification information for tail character code in the search keyword, and by respectively combining the portions of the divided identification information with the identification information that is not divided, the identifying includes identifying from among the group of head-and-tail divided maps, plural types of head-and-tail divided maps that are allocated with the generated plural types of combined identification information based on the head character code and the tail character code, and the identifying includes identifying from among the file group and based on the identified consecutive-gram divided maps and the identified head-and-tail divided maps, a file having therein the preceding character code and the succeeding character code that constitute the character code string of two-consecutive grams in the search keyword, and further having therein the character code string that has a gram quantity equivalent to that of the search keyword and a head character code and tail character code that coincide with those of the search keyword. 17. The recording medium according to claim 11, wherein
the generating includes generating plural types of combined identification information based on a head character code and a tail character code in the search keyword to which the special character code string has been appended, by dividing into two portions, at least one among identification information for the head character code and identification information for the tail character code in the search keyword to which the special character code string has been appended and by respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the identified consecutive-gram divided maps and the identified head-and-tail divided maps, a file having therein the preceding character code and the succeeding character code that constitute the character code string of two-consecutive grams in the search keyword to which the special character code string has been appended, and further having therein the character code string that has a gram quantity equivalent to that of the search keyword to which the special character code string has been attached and a head character code and tail character code that coincide with those of the search keyword to which the special character code string has been attached. 18. The recording medium according to claim 12, wherein
the generating includes generating plural types of combined identification information based on a head character code and a tail character code in the search keyword to which the special character code string has been appended, by dividing into two portions, at least one among identification information for the head character code and identification information for the tail character code in the search keyword to which the special character code string has been appended and by respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the identified consecutive-gram divided maps and the identified head-and-tail divided maps, a file having therein the preceding character code and the succeeding character code that constitute the character code string of two-consecutive grams in the search keyword to which the special character code string has been appended, and further having therein the character code string that has a gram quantity equivalent to that of the search keyword to which the special character code string has been attached and a head character code and tail character code that coincide with those of the search keyword to which the special character code string has been attached. | A recording medium stores an information processing program that causes a computer having a storage unit storing therein a file group in which character code strings are described, to execute generating combined identification information by dividing into two portions, at least one among identification information for a preceding character code and identification information for a succeeding character code and respectively combining the portions with the identification information that is not divided, the preceding and succeeding character codes constituting a character code string for two-consecutive grams in a file among the file group; storing to the storage unit, various consecutive-gram divided maps obtained by allocating to each type of combined identification information generated, a string of bits corresponding to the quantity of files in the file group; and updating in the consecutive-gram divided maps, a bit indicating whether the character code string for the two-consecutive grams is present in the file.1. A non-transitory computer-readable recording medium storing therein an information processing program that, with respect to a computer comprising a storage unit storing therein a file group in which character code strings are described, causes the computer to execute:
generating plural types of combined identification information by dividing into two portions, at least one among identification information for a preceding character code and identification information for a succeeding character code and by respectively combining the portions of the divided identification information with the identification information that is not divided, the preceding and the succeeding character codes constituting a character code string for two-consecutive grams in a file selected from the file group; storing to the storage unit, plural types of consecutive-gram divided maps obtained by allocating to each type of combined identification information generated, a string of bits of a quantity corresponding to the quantity of files in the file group; and updating in the consecutive-gram divided maps, a bit that indicates whether the character code string for the two-consecutive grams is present in the selected file. 2. The recording medium according to claim 1, wherein
the generating includes generating two types of combined identification information by respectively coupling the portions with the identification information that is not divided. 3. The recording medium according to claim 1, wherein
the generating includes generating four types of combined identification information by respectively dividing into two portions, the identification information for the preceding character code and the identification information for the succeeding character code and selectively coupling pairs of the portions. 4. A non-transitory computer-readable recording medium storing therein an information processing program that, with respect to a computer comprising a storage unit storing therein a file group in which character code strings are described, causes the computer to execute:
generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code and by respectively combining the portions of the divided identification information with the identification information that is not divided, the head and the tail character codes constituting a character code string for multiple-consecutive grams in a file selected from the file group; storing to the storage unit, plural types of head-and-tail divided maps obtained by allocating to each type of combined identification information generated, a string of bits of a quantity corresponding to the quantity of files in the file group; and updating in the head-and-tail divided maps, a bit that indicates whether a combination of the head and the tail character codes in the character code string for the multiple-consecutive grams is present in the selected file. 5. The recording medium according to claim 4, wherein
the generating includes generating two types of combined identification information by respectively coupling the portions with the identification information that is not divided. 6. The recording medium according to claim 4, wherein
the generating includes generating four types of combined identification information by respectively dividing into two portions, the identification information for the head character code and the identification information for the tail character code and selectively coupling pairs of the portions. 7. The recording medium according to claim 1, wherein
the generating includes generating the plural types of combined identification information by dividing into two portions and combining, at least one among identification information for a head character code and identification information for a tail character code, the head and the tail character codes constituting a character code string for multiple-consecutive grams in the file, the storing to the storage unit includes storing plural types of head-and-tail divided maps obtained by allocating to each type of generated combined identification information that is based on the identification information for the head character code and for the tail character code, a string of bits of a quantity corresponding to the quantity of files in the file group, and the updating includes updating in the head-and-tail divided maps, a bit that indicates whether a combination of the head character code and the tail character code in the character code string for the multiple-consecutive grams is present in the file. 8. The recording medium according to claim 2, wherein
the generating includes generating the two types of combined identification information by dividing into two portions, one among identification information for a head character code and identification information for a tail character code and by respectively coupling the portions with the identification information that is not divided, the head and the tail character codes constituting a character code string for multiple-consecutive grams in the file, the storing to the storage unit includes storing two types of head-and-tail divided maps obtained by allocating to each type of generated combined identification information that is based on the identification information for the head character code and for the tail character code, a string of bits of a quantity corresponding to the quantity of files in the file group, and the updating includes updating in the two types of head-and-tail divided maps, a bit that indicates whether a combination of the head character code and the tail character code in the character code string for the multiple-consecutive grams is present in the file. 9. The recording medium according to claim 3, wherein
the generating includes generating the four types of combined identification information by respectively dividing into two portions, identification information for a head character code and identification information for a tail character code and by selectively coupling pairs of the portions, the head and the tail character codes constituting a character code string for multiple-consecutive grams in the file, the storing to the storage unit includes storing four types of head-and-tail divided maps obtained by allocating to each type of combined identification information that is generated and based on the identification information for the head character code and for the tail character code, a string of bits of a quantity corresponding to the quantity of files in the file group, and the updating includes updating in the four types of head-and-tail divided maps, a bit indicating whether a combination of the head character code and the tail character code in the character code string for the multiple-consecutive grams is present in the file. 10. A non-transitory computer-readable recording medium storing therein an information search program that, with respect to a computer comprising a storage unit storing therein a file group in which character code strings are described and a group of plural types of consecutive-gram divided maps formed by allocating to each type of combined identification information respectively set for each character code string representing two-consecutive grams, a bit string of a quantity corresponding to the quantity of files in the file group, causes the computer to execute:
receiving input of a search keyword; generating plural types of combined identification information by dividing into two portions, at least one among identification information for a preceding character code and identification information for a succeeding character code and by respectively combining the portions of the divided identification information with the identification information that is not divided, the preceding character code and the succeeding character code constituting a character code string for two-consecutive grams in the search keyword; identifying from among the group of consecutive-gram divided maps and for the preceding character code and the succeeding character code that constitute the character code string for the two-consecutive grams in the search keyword, plural types of consecutive-gram divided maps allocated with the plural types of combined identification information generated at the generating; and identifying from the among file group and based on the identified consecutive-gram divided maps, a file having therein the preceding character code and the succeeding character code that constitute the character code string for the two consecutive grams in the search keyword. 11. The recording medium according to claim 10, wherein
the file group describes therein a special character code at the head of a character code string for a term, the receiving includes receiving designation of a search condition concerning a forward search, the generating includes generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code in the search keyword to which the special character code string has been appended at the head thereof, and respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the consecutive-gram divided maps identified for the preceding and the succeeding character codes that constitute the character code string of the two-consecutive grams in the search keyword to which the special character code has been appended, a file having therein the preceding character code and the succeeding character code that constitute the character code string of two-consecutive grams in the search keyword to which the special character code string has been appended. 12. The recording medium according to claim 10, wherein
the file group describes therein a special character code at the tail of a character code string for a term, the receiving includes receiving designation of a search condition concerning a reverse search, the generating includes generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code in the search keyword to which the special character code string has been appended at the tail thereof, and respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the consecutive-gram divided maps identified for the preceding and the succeeding character codes that constitute the character code string of the two-consecutive grams in the search keyword to which the special character code has been appended, a file having therein the preceding character code and the succeeding character code that constitute the character code string of two-consecutive grams in the search keyword to which the special character code string has been appended. 13. A non-transitory computer-readable recording medium storing therein an information search program that, with respect to a computer comprising a storage unit storing therein a file group in which character code strings are described and a group of plural types of head-and-tail divided maps formed by allocating a string of bits of a quantity corresponding to the quantity of files in the file group to each type of combined identification information respectively set for each combination of a head character code and a tail character code that constitute a character code string for multiple-consecutive grams, causes the computer to execute:
receiving input of a search keyword; generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code and respectively combining the portions of the divided identification information with the identification information that is not divided, the head character code and the tail character code being in the search keyword; identifying from among the group of head-and-tail divided maps, plural types of head-and-tail divided maps that are allocated with the combined identification information generated at the generating; and identifying from among the file group and based on the identified head-and-tail divided maps, a file having therein a character code string that has a gram quantity equivalent to that of the search keyword and a head character code and tail character code that coincide with those of the search keyword. 14. The recording medium according to claim 13, wherein
the generating when designation of a search condition concerning a forward search has been received, includes generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code in the search keyword to which the special character code string has been appended at the head thereof and respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the identified head-and-tail divided maps, a file having therein a character code string that has a gram quantity equivalent to that of the search keyword to which the special character code string has been appended and a head character code and tail character code that coincide with those of the search keyword to which the special character code string has been appended. 15. The recording medium according to claim 13, wherein
the file group describes therein a special character code at the tail of a character code string for a term, the receiving includes receiving designation of a search condition concerning a reverse search, the generating when designation of a search condition concerning a reverse search has been received, includes generating plural types of combined identification information by dividing into two portions, at least one among identification information for a head character code and identification information for a tail character code in the search keyword to which the special character code string has been appended at the tail thereof, and respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the identified head-and-tail divided maps, a file having therein a character code string that has a gram quantity equivalent to that of the search keyword to which the special character code string has been appended and a head character code and tail character code that coincide with those of the search keyword to which the special character code string has been appended. 16. The recording medium according to claim 10, wherein
the storage unit stores therein plural types of head-and-tail divided maps formed by allocating to each type of combined identification information respectively set for each combination of the head character code and the tail character code that constitute the character code string for the multiple-consecutive grams, a string of bits of a quantity corresponding to the quantity of files in the file group, the generating includes generating plural types of combined identification information based on the head character code and the tail character code by dividing into two portions, at least one among identification information for the head character code and the identification information for tail character code in the search keyword, and by respectively combining the portions of the divided identification information with the identification information that is not divided, the identifying includes identifying from among the group of head-and-tail divided maps, plural types of head-and-tail divided maps that are allocated with the generated plural types of combined identification information based on the head character code and the tail character code, and the identifying includes identifying from among the file group and based on the identified consecutive-gram divided maps and the identified head-and-tail divided maps, a file having therein the preceding character code and the succeeding character code that constitute the character code string of two-consecutive grams in the search keyword, and further having therein the character code string that has a gram quantity equivalent to that of the search keyword and a head character code and tail character code that coincide with those of the search keyword. 17. The recording medium according to claim 11, wherein
the generating includes generating plural types of combined identification information based on a head character code and a tail character code in the search keyword to which the special character code string has been appended, by dividing into two portions, at least one among identification information for the head character code and identification information for the tail character code in the search keyword to which the special character code string has been appended and by respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the identified consecutive-gram divided maps and the identified head-and-tail divided maps, a file having therein the preceding character code and the succeeding character code that constitute the character code string of two-consecutive grams in the search keyword to which the special character code string has been appended, and further having therein the character code string that has a gram quantity equivalent to that of the search keyword to which the special character code string has been attached and a head character code and tail character code that coincide with those of the search keyword to which the special character code string has been attached. 18. The recording medium according to claim 12, wherein
the generating includes generating plural types of combined identification information based on a head character code and a tail character code in the search keyword to which the special character code string has been appended, by dividing into two portions, at least one among identification information for the head character code and identification information for the tail character code in the search keyword to which the special character code string has been appended and by respectively combining the portions of the divided identification information with the identification information that is not divided, and the identifying includes identifying from among the file group and based on the identified consecutive-gram divided maps and the identified head-and-tail divided maps, a file having therein the preceding character code and the succeeding character code that constitute the character code string of two-consecutive grams in the search keyword to which the special character code string has been appended, and further having therein the character code string that has a gram quantity equivalent to that of the search keyword to which the special character code string has been attached and a head character code and tail character code that coincide with those of the search keyword to which the special character code string has been attached. | 2,100 |
4,547 | 13,077,969 | 2,174 | Some embodiments provide methods of distributing system menus, comprising: receiving a request, from over a distributed network, to communicate a system menu to a requesting consumer electronic (CE) device; identifying the CE device; identifying a user interface corresponding to the CE device; identifying a system menu intended to be utilized by the CE device, wherein the system menu comprises a plurality of menu items with each menu item associates with a function; and communicating the identified system menu to the CE device. | 1. A method of distributing system menus, the method comprising:
receiving a request, from over a distributed network, to communicate a system menu to a requesting consumer electronic (CE) device; identifying the CE device; identifying a user interface corresponding to the CE device; identifying a system menu intended to be utilized by the CE device, wherein the system menu comprises a plurality of menu items with each menu item associates with a function; and communicating the identified system menu to the CE device. 2. The method of claim 1, wherein the system menu is defined according to a base cell where each of the menu items of the system menu has dimensions that are a whole number multiple of the base cell. 3. The method of claim 2, wherein the communicating the system menu further comprises identifying menu definitions that can be implemented by the identified CE device and only communicating those menu definitions that can be implemented by the CE device. 4. The method of claim 3, wherein communicating the menu definitions of the identified system menu further comprises determining whether the system menu has been modified since the system menu definitions were previously forwarded to the CE device, such that the communicating the menu definitions for the identified system menu comprises communicating only modifications to menu definitions when it is determined the system menu was modified. 5. The method of claim 2, further comprising:
determining, in response to identifying the CE device, whether the CE device is authorized to receive a system menu, and implementing the communicating the system menu to the CE device in response to determining that the CE device is authorized to receive the system menu. 6. The method of claim 2, wherein the identifying the system menu intended to be utilized by the CE device comprises identifying that the CE device is associated with a first group, and identifying the system menu corresponding to the first group. 7. The method of claim 6, wherein the identifying the system menu further comprises identifying the CE device is associated with a second group, and selecting the system menu corresponding to both the first group and the second group. 8. A method of customizing a system menu, the method comprising:
identifying a system menu, the system menu comprising a plurality of menu items with each menu item corresponding to a different function configured to be implemented in response to selection of the menu item by an end user when the system menu is displayed by a consumer electronic device; receiving a selection of a first menu item of the plurality of menu items; receiving instructions to modify dimensions of the first menu item when displayed; identifying, in response to the instructions to modify the dimensions of the first menu item, a first plurality of a base cells to merge in defining modified dimensions of the first menu item; and merging the first plurality of base cells and defining the modified dimensions of the first menu item. 9. The method of claim 8, wherein dimensions of the plurality of menu items are limited to whole number multiples of the base cell 10. The method of claim 8, wherein the identifying the first plurality of base cells to merge comprises identifying a first whole number multiplier of the base cell defining a width of the modified first menu item. 11. The method of claim 10, within the identifying the first plurality of base cells to merge comprises identifying a second whole number multiplier of the base cell defining a height of the modified first menu item. 12. The method of claim 11, further comprising:
receiving instructions to modify dimensions of a second menu item when displayed; identifying, in response to the instructions to modify the dimensions of the second menu item, a third whole number multiplier of the base cell in defining the modified dimensions of the second menu item, where the modified dimensions the second menu item is different than the modified dimensions of the first menu item. 13. The method of claim 12, wherein system menu comprises a sub-menu and the second menu item is part of the sub-menu and the first menu item is not part of the sub-menu. 14. The method of claim 8, further comprising:
receiving a designation that the system menu is to be associated with a group of consumer electronic devices; and communicating the system menu over the distributed network to one or more remote consumer electronic devices associated with the group. 15. A computer program product comprising a medium for embodying a computer program for input to a processor based system and a computer program embodied in the medium configured to cause the processor based system to perform steps comprising:
receiving a request, from over a distributed network, to communicate a system menu to a requesting consumer electronic (CE) device; identifying the CE device; identifying a user interface corresponding to the CE device; identifying a system menu intended to be utilized by the CE device, wherein the system menu comprises a plurality of menu items with each menu item associates with a function; and communicating the identified system menu to the CE device. 16. A computer program product in accordance with claim 15, wherein the system menu is defined according to a base cell where the system menu and each of the menu items of the system menu have dimensions that are whole number multiples of the base cell. 17. A computer program product in accordance with claim 16, wherein the communicating the system menu further comprises identifying menu definitions that can be implemented by the identified CE device and only communicating those menu definitions that can be implemented by the CE device. 18. A computer program product in accordance with claim 17, wherein the identifying the system menu further comprises determining whether the system menu has been modified since the system menu was previously forwarded to the CE device, such that the communicating the identified system menu comprises communicating only modifications to menu definitions of the system menu when it is determined the system menu was modified since the system menu was previously forwarded to the CE device. 19. A computer program product in accordance with claim 15, wherein the identifying the system menu intended to be utilized by the CE device comprises identifying that the CE device is associated with a first group, and identifying the system menu corresponding to the first group. 20. A computer program product in accordance with claim 19, wherein the identifying the system menu further comprises identifying the CE device is associated with a second group, and selecting the system menu corresponding to both the first group and the second group. | Some embodiments provide methods of distributing system menus, comprising: receiving a request, from over a distributed network, to communicate a system menu to a requesting consumer electronic (CE) device; identifying the CE device; identifying a user interface corresponding to the CE device; identifying a system menu intended to be utilized by the CE device, wherein the system menu comprises a plurality of menu items with each menu item associates with a function; and communicating the identified system menu to the CE device.1. A method of distributing system menus, the method comprising:
receiving a request, from over a distributed network, to communicate a system menu to a requesting consumer electronic (CE) device; identifying the CE device; identifying a user interface corresponding to the CE device; identifying a system menu intended to be utilized by the CE device, wherein the system menu comprises a plurality of menu items with each menu item associates with a function; and communicating the identified system menu to the CE device. 2. The method of claim 1, wherein the system menu is defined according to a base cell where each of the menu items of the system menu has dimensions that are a whole number multiple of the base cell. 3. The method of claim 2, wherein the communicating the system menu further comprises identifying menu definitions that can be implemented by the identified CE device and only communicating those menu definitions that can be implemented by the CE device. 4. The method of claim 3, wherein communicating the menu definitions of the identified system menu further comprises determining whether the system menu has been modified since the system menu definitions were previously forwarded to the CE device, such that the communicating the menu definitions for the identified system menu comprises communicating only modifications to menu definitions when it is determined the system menu was modified. 5. The method of claim 2, further comprising:
determining, in response to identifying the CE device, whether the CE device is authorized to receive a system menu, and implementing the communicating the system menu to the CE device in response to determining that the CE device is authorized to receive the system menu. 6. The method of claim 2, wherein the identifying the system menu intended to be utilized by the CE device comprises identifying that the CE device is associated with a first group, and identifying the system menu corresponding to the first group. 7. The method of claim 6, wherein the identifying the system menu further comprises identifying the CE device is associated with a second group, and selecting the system menu corresponding to both the first group and the second group. 8. A method of customizing a system menu, the method comprising:
identifying a system menu, the system menu comprising a plurality of menu items with each menu item corresponding to a different function configured to be implemented in response to selection of the menu item by an end user when the system menu is displayed by a consumer electronic device; receiving a selection of a first menu item of the plurality of menu items; receiving instructions to modify dimensions of the first menu item when displayed; identifying, in response to the instructions to modify the dimensions of the first menu item, a first plurality of a base cells to merge in defining modified dimensions of the first menu item; and merging the first plurality of base cells and defining the modified dimensions of the first menu item. 9. The method of claim 8, wherein dimensions of the plurality of menu items are limited to whole number multiples of the base cell 10. The method of claim 8, wherein the identifying the first plurality of base cells to merge comprises identifying a first whole number multiplier of the base cell defining a width of the modified first menu item. 11. The method of claim 10, within the identifying the first plurality of base cells to merge comprises identifying a second whole number multiplier of the base cell defining a height of the modified first menu item. 12. The method of claim 11, further comprising:
receiving instructions to modify dimensions of a second menu item when displayed; identifying, in response to the instructions to modify the dimensions of the second menu item, a third whole number multiplier of the base cell in defining the modified dimensions of the second menu item, where the modified dimensions the second menu item is different than the modified dimensions of the first menu item. 13. The method of claim 12, wherein system menu comprises a sub-menu and the second menu item is part of the sub-menu and the first menu item is not part of the sub-menu. 14. The method of claim 8, further comprising:
receiving a designation that the system menu is to be associated with a group of consumer electronic devices; and communicating the system menu over the distributed network to one or more remote consumer electronic devices associated with the group. 15. A computer program product comprising a medium for embodying a computer program for input to a processor based system and a computer program embodied in the medium configured to cause the processor based system to perform steps comprising:
receiving a request, from over a distributed network, to communicate a system menu to a requesting consumer electronic (CE) device; identifying the CE device; identifying a user interface corresponding to the CE device; identifying a system menu intended to be utilized by the CE device, wherein the system menu comprises a plurality of menu items with each menu item associates with a function; and communicating the identified system menu to the CE device. 16. A computer program product in accordance with claim 15, wherein the system menu is defined according to a base cell where the system menu and each of the menu items of the system menu have dimensions that are whole number multiples of the base cell. 17. A computer program product in accordance with claim 16, wherein the communicating the system menu further comprises identifying menu definitions that can be implemented by the identified CE device and only communicating those menu definitions that can be implemented by the CE device. 18. A computer program product in accordance with claim 17, wherein the identifying the system menu further comprises determining whether the system menu has been modified since the system menu was previously forwarded to the CE device, such that the communicating the identified system menu comprises communicating only modifications to menu definitions of the system menu when it is determined the system menu was modified since the system menu was previously forwarded to the CE device. 19. A computer program product in accordance with claim 15, wherein the identifying the system menu intended to be utilized by the CE device comprises identifying that the CE device is associated with a first group, and identifying the system menu corresponding to the first group. 20. A computer program product in accordance with claim 19, wherein the identifying the system menu further comprises identifying the CE device is associated with a second group, and selecting the system menu corresponding to both the first group and the second group. | 2,100 |
4,548 | 13,652,674 | 2,144 | A method for determining the placement of content on a page is provided. The method initiates with receiving a content feed, the content feed including one or more content data items. One or more content viewer modules are selected for inclusion in the page, each content viewer module configured to present a content data item on the page. One or more page layouts are determined, each page layout defining one or more placement slots for placement of the content viewer modules. The selected content viewer modules are fitted to the page layouts to identify a valid page layout which can simultaneously accommodate each of the content viewer modules. The valid page layout is populated by assigning the content viewer modules to the placement slots of the valid page layout and applying the assigned content viewer modules to one or more of the content data items of the content feed. | 1. A method for determining the placement of content on a page, comprising:
receiving a content feed, the content feed including one or more content data items; selecting one or more content viewer modules for inclusion in the page, each content viewer module configured to present a content data item on the page; determining one or more page layouts, each page layout defining one or more placement slots for placement of the content viewer modules; fitting the selected content viewer modules to the page layouts to identify a valid page layout which can simultaneously accommodate each of the content viewer modules; populating the valid page layout by assigning the content viewer modules to the placement slots of the valid page layout and applying the assigned content viewer modules to one or more of the content data items of the content feed. 2. The method of claim 1, wherein selecting the content viewer modules for inclusion in the page includes identifying a number of content viewer modules to include based on a position page number of the page. 3. The method of claim 2, wherein determining the page layouts includes selecting layouts having a number of placement slots equal to the identified number of content viewer modules to include. 4. The method of claim 1, wherein fitting the selected content viewer modules to the page layouts includes identifying an invalid page layout which cannot simultaneously accommodate each of the selected content viewer modules, and storing information identifying the combination of the invalid page layout and the selected content viewer modules. 5. The method of claim 1, wherein fitting the selected content viewer modules to a given page layout includes determining a priority of the selected content viewer modules for fitting based on one or more placement requirements associated with the selected content viewer modules. 6. The method of claim 1, wherein the content data items include one or more of text data, graphic data, audio data, or video data. 7. A tangible computer readable medium having program instructions embodied thereon for determining the placement of content on a page, including:
program instructions for receiving a content feed, the content feed including one or more content data items; program instructions for selecting one or more content viewer modules for inclusion in the page, each content viewer module configured to present a content data item on the page; program instructions for determining one or more page layouts, each page layout defining one or more placement slots for placement of the content viewer modules; program instructions for fitting the selected content viewer modules to the page layouts to identify a valid page layout which can simultaneously accommodate each of the content viewer modules; program instructions for populating the valid page layout by assigning the content viewer modules to the placement slots of the valid page layout and applying the assigned content viewer modules to one or more of the content data items of the content feed. 8. The tangible computer readable medium of claim 7, wherein selecting the content viewer modules for inclusion in the page includes identifying a number of content viewer modules to include based on a position page number of the page. 9. The tangible computer readable medium of claim 8, wherein determining the page layouts includes selecting layouts having a number of placement slots equal to the identified number of content viewer modules to include. 10. The tangible computer readable medium of claim 7, wherein fitting the selected content viewer modules to the page layouts includes identifying an invalid page layout which cannot simultaneously accommodate each of the selected content viewer modules, and storing information identifying the combination of the invalid page layout and the selected content viewer modules. 11. The tangible computer readable medium of claim 7, wherein fitting the selected content viewer modules to a given page layout includes determining a priority of the selected content viewer modules for fitting based on one or more placement requirements associated with the selected content viewer modules. 12. The tangible computer readable medium of claim 7, wherein the content data items include one or more of text data, graphic data, audio data, or video data. 13. A system for determining the placement of content on a page, comprising:
a generator manager for receiving a content feed, the content feed including one or more content data items; a viewer generator for selecting one or more content viewer modules for inclusion in the page, each content viewer module configured to present a content data item on the page; a layout generator for determining one or more page layouts, each page layout defining one or more placement slots for placement of the content viewer modules; a fitting module for fitting the selected content viewer modules to the page layouts to identify a valid page layout which can simultaneously accommodate each of the content viewer modules; a renderer for populating the valid page layout by assigning the content viewer modules to the placement slots of the valid page layout and applying the assigned content viewer modules to one or more of the content data items of the content feed. 14. The system of claim 13, wherein selecting the content viewer modules for inclusion in the page includes identifying a number of content viewer modules to include based on a position page number of the page. 15. The system of claim 14, wherein determining the page layouts includes selecting layouts having a number of placement slots equal to the identified number of content viewer modules to include. 16. The system of claim 13, wherein fitting the selected content viewer modules to the page layouts includes identifying an invalid page layout which cannot simultaneously accommodate each of the selected content viewer modules, and storing information identifying the combination of the invalid page layout and the selected content viewer modules. 17. The system of claim 13, wherein fitting the selected content viewer modules to a given page layout includes determining a priority of the selected content viewer modules for fitting based on one or more placement requirements associated with the selected content viewer modules. 18. The system of claim 13, wherein the content data items include one or more of text data, graphic data, audio data, or video data. | A method for determining the placement of content on a page is provided. The method initiates with receiving a content feed, the content feed including one or more content data items. One or more content viewer modules are selected for inclusion in the page, each content viewer module configured to present a content data item on the page. One or more page layouts are determined, each page layout defining one or more placement slots for placement of the content viewer modules. The selected content viewer modules are fitted to the page layouts to identify a valid page layout which can simultaneously accommodate each of the content viewer modules. The valid page layout is populated by assigning the content viewer modules to the placement slots of the valid page layout and applying the assigned content viewer modules to one or more of the content data items of the content feed.1. A method for determining the placement of content on a page, comprising:
receiving a content feed, the content feed including one or more content data items; selecting one or more content viewer modules for inclusion in the page, each content viewer module configured to present a content data item on the page; determining one or more page layouts, each page layout defining one or more placement slots for placement of the content viewer modules; fitting the selected content viewer modules to the page layouts to identify a valid page layout which can simultaneously accommodate each of the content viewer modules; populating the valid page layout by assigning the content viewer modules to the placement slots of the valid page layout and applying the assigned content viewer modules to one or more of the content data items of the content feed. 2. The method of claim 1, wherein selecting the content viewer modules for inclusion in the page includes identifying a number of content viewer modules to include based on a position page number of the page. 3. The method of claim 2, wherein determining the page layouts includes selecting layouts having a number of placement slots equal to the identified number of content viewer modules to include. 4. The method of claim 1, wherein fitting the selected content viewer modules to the page layouts includes identifying an invalid page layout which cannot simultaneously accommodate each of the selected content viewer modules, and storing information identifying the combination of the invalid page layout and the selected content viewer modules. 5. The method of claim 1, wherein fitting the selected content viewer modules to a given page layout includes determining a priority of the selected content viewer modules for fitting based on one or more placement requirements associated with the selected content viewer modules. 6. The method of claim 1, wherein the content data items include one or more of text data, graphic data, audio data, or video data. 7. A tangible computer readable medium having program instructions embodied thereon for determining the placement of content on a page, including:
program instructions for receiving a content feed, the content feed including one or more content data items; program instructions for selecting one or more content viewer modules for inclusion in the page, each content viewer module configured to present a content data item on the page; program instructions for determining one or more page layouts, each page layout defining one or more placement slots for placement of the content viewer modules; program instructions for fitting the selected content viewer modules to the page layouts to identify a valid page layout which can simultaneously accommodate each of the content viewer modules; program instructions for populating the valid page layout by assigning the content viewer modules to the placement slots of the valid page layout and applying the assigned content viewer modules to one or more of the content data items of the content feed. 8. The tangible computer readable medium of claim 7, wherein selecting the content viewer modules for inclusion in the page includes identifying a number of content viewer modules to include based on a position page number of the page. 9. The tangible computer readable medium of claim 8, wherein determining the page layouts includes selecting layouts having a number of placement slots equal to the identified number of content viewer modules to include. 10. The tangible computer readable medium of claim 7, wherein fitting the selected content viewer modules to the page layouts includes identifying an invalid page layout which cannot simultaneously accommodate each of the selected content viewer modules, and storing information identifying the combination of the invalid page layout and the selected content viewer modules. 11. The tangible computer readable medium of claim 7, wherein fitting the selected content viewer modules to a given page layout includes determining a priority of the selected content viewer modules for fitting based on one or more placement requirements associated with the selected content viewer modules. 12. The tangible computer readable medium of claim 7, wherein the content data items include one or more of text data, graphic data, audio data, or video data. 13. A system for determining the placement of content on a page, comprising:
a generator manager for receiving a content feed, the content feed including one or more content data items; a viewer generator for selecting one or more content viewer modules for inclusion in the page, each content viewer module configured to present a content data item on the page; a layout generator for determining one or more page layouts, each page layout defining one or more placement slots for placement of the content viewer modules; a fitting module for fitting the selected content viewer modules to the page layouts to identify a valid page layout which can simultaneously accommodate each of the content viewer modules; a renderer for populating the valid page layout by assigning the content viewer modules to the placement slots of the valid page layout and applying the assigned content viewer modules to one or more of the content data items of the content feed. 14. The system of claim 13, wherein selecting the content viewer modules for inclusion in the page includes identifying a number of content viewer modules to include based on a position page number of the page. 15. The system of claim 14, wherein determining the page layouts includes selecting layouts having a number of placement slots equal to the identified number of content viewer modules to include. 16. The system of claim 13, wherein fitting the selected content viewer modules to the page layouts includes identifying an invalid page layout which cannot simultaneously accommodate each of the selected content viewer modules, and storing information identifying the combination of the invalid page layout and the selected content viewer modules. 17. The system of claim 13, wherein fitting the selected content viewer modules to a given page layout includes determining a priority of the selected content viewer modules for fitting based on one or more placement requirements associated with the selected content viewer modules. 18. The system of claim 13, wherein the content data items include one or more of text data, graphic data, audio data, or video data. | 2,100 |
4,549 | 13,830,115 | 2,174 | Method and systems of visually depicting hierarchical data are provided. The hierarchical data includes data pertaining to a plurality of categories, the hierarchical data further including data pertaining to a plurality of subcategories of at least one of the plurality of categories. Multiple viewing regions may then be displayed simultaneously on a display, each viewing region depicting a different view of the hierarchical data, objects displayed in each viewing region being color-coded with a different color for each category, such that an object corresponding to a first category in a first viewing region is displayed in an identical color as an object corresponding to the first category in a second viewing region. | 1. A computerized method of visually depicting hierarchical data, the method comprising:
accessing hierarchical data, the hierarchical data including data pertaining to a plurality of categories, the hierarchical data further including data pertaining to a plurality of subcategories of at least one of the plurality of categories; displaying multiple viewing regions simultaneously on a display, each viewing region depicting a different view of the hierarchical data, objects displayed in each viewing region being color-coded with a different color for each category, such that an object corresponding to a first category in a first viewing region is displayed in an identical color as an object corresponding to the first category in a second viewing region. 2. The method of claim 1, wherein the displaying multiple viewing regions simultaneously includes displaying objects corresponding to a plurality of subcategories of one of the plurality of categories, each object corresponding to the plurality of subcategories being color-coded with a different color for each subcategory, such that an object corresponding to a first subcategory in the first viewing region is displayed with an identical color as an object corresponding to the first subcategory in the second viewing region. 3. The method of claim 2, the color selected for each of the plurality of subcategories of a particular category being a shade of the color selected for the particular category. 4. The method of claim 2, the objects corresponding to the plurality of subcategories of a particular category being displayed in response to user input indicating a drill-down operation on the particular category. 5. The method of claim 1, the objects in the first viewing region including textual objects and the objects in the second viewing region including graphical objects. 6. The method of claim 5, the graphical objects including bar lines of a bar graph. 7. The method of claim 1, further comprising:
receiving user input indicating a selection of a particular object in either the first or second viewing region; and filtering the first and second viewing regions such that colors selected for categories other than the category to which the particular object relates are gray, thus causing only objects relating to the category to which the particular object relates to be displayed in color. 8. The method of claim 1, the hierarchical data including performance data relating to a user-scriptable engine used to view and interact with multimedia. 9. The method of claim 8, the user-scriptable engine including native functions and user-defined functions, the hierarchical data including instrumented data relating to performance of the native functions and sampled data relating to performance of the user-defined functions. 10. The method of claim 9, the instrumented data and sampled data being received as separate streams. 11. An apparatus comprising:
a processor, a database storing hierarchical data, the hierarchical data including data pertaining to a plurality of categories, the hierarchical data further including data pertaining to a plurality of subcategories of at least one of the plurality of categories; a user interface configured to display multiple viewing regions simultaneously on a display, each viewing region depicting a different view of the hierarchical data, objects displayed in each viewing region being color-coded such that an object corresponding to a first category in a first viewing region is displayed in an identical color as an object corresponding to the first category in a second viewing region. 12. The apparatus of claim 11, the database being located in a database layer written in an object-oriented programming language. 13. The apparatus of claim 11, the user interface being located in a user interface layer written in a lightweight multi-paradigm programming language designed as a scripting language having extensible semantics. 14. The apparatus of claim 11, the database storing telemetry data from a user-scriptable engine, the telemetry data being transferred to the database in three layers, one layer being a network layer, one layer being a format to serialize objects, and one layer being a telemetry layer, the telemetry layer defining a particular set of data formats understandable by the serialization layer that are used to transmit the hierarchical data. 15. The apparatus of claim 14, the telemetry data being stored by the database as sessions. 16. The apparatus of claim 12, the database layer further comprising a query engine configured to receive requests for data generated by the user interface and retrieve information from the database in response to the requests. 17. A non-transitory machine-readable storage medium comprising a set of instructions which, when executed by a processor, causes execution of operations comprising:
accessing hierarchical data, the hierarchical data including data pertaining to a plurality of categories, the hierarchical data further including data pertaining to a plurality of subcategories of at least one of the plurality of categories; displaying multiple viewing regions simultaneously on a display, each viewing region depicting a different view of the hierarchical data, objects displayed in each viewing region being color-coded with a different color for each category, such that an object corresponding to a first category in a first viewing region is displayed in an identical color as an object corresponding to the first category in a second viewing region. 18. The non-transitory machine-readable storage medium of claim 17, the set of instructions further causing execution of the displaying multiple viewing regions simultaneously including displaying objects corresponding to a plurality of subcategories of one of the plurality of categories, each object corresponding to the plurality of subcategories being color-coded with a different color for each subcategory, such that an object corresponding to a first subcategory in the first viewing region is displayed with an identical color as an object corresponding to the first subcategory in the second viewing region. 19. The non-transitory machine-readable storage medium of claim 18, the color selected for each of the plurality of subcategories of a particular category being a shade of the color selected for the particular category. 20. The non-transitory machine-readable storage medium of claim 18, the objects corresponding to the plurality of subcategories of a particular category being displayed in response to user input indicating a drill-down operation on the particular category. | Method and systems of visually depicting hierarchical data are provided. The hierarchical data includes data pertaining to a plurality of categories, the hierarchical data further including data pertaining to a plurality of subcategories of at least one of the plurality of categories. Multiple viewing regions may then be displayed simultaneously on a display, each viewing region depicting a different view of the hierarchical data, objects displayed in each viewing region being color-coded with a different color for each category, such that an object corresponding to a first category in a first viewing region is displayed in an identical color as an object corresponding to the first category in a second viewing region.1. A computerized method of visually depicting hierarchical data, the method comprising:
accessing hierarchical data, the hierarchical data including data pertaining to a plurality of categories, the hierarchical data further including data pertaining to a plurality of subcategories of at least one of the plurality of categories; displaying multiple viewing regions simultaneously on a display, each viewing region depicting a different view of the hierarchical data, objects displayed in each viewing region being color-coded with a different color for each category, such that an object corresponding to a first category in a first viewing region is displayed in an identical color as an object corresponding to the first category in a second viewing region. 2. The method of claim 1, wherein the displaying multiple viewing regions simultaneously includes displaying objects corresponding to a plurality of subcategories of one of the plurality of categories, each object corresponding to the plurality of subcategories being color-coded with a different color for each subcategory, such that an object corresponding to a first subcategory in the first viewing region is displayed with an identical color as an object corresponding to the first subcategory in the second viewing region. 3. The method of claim 2, the color selected for each of the plurality of subcategories of a particular category being a shade of the color selected for the particular category. 4. The method of claim 2, the objects corresponding to the plurality of subcategories of a particular category being displayed in response to user input indicating a drill-down operation on the particular category. 5. The method of claim 1, the objects in the first viewing region including textual objects and the objects in the second viewing region including graphical objects. 6. The method of claim 5, the graphical objects including bar lines of a bar graph. 7. The method of claim 1, further comprising:
receiving user input indicating a selection of a particular object in either the first or second viewing region; and filtering the first and second viewing regions such that colors selected for categories other than the category to which the particular object relates are gray, thus causing only objects relating to the category to which the particular object relates to be displayed in color. 8. The method of claim 1, the hierarchical data including performance data relating to a user-scriptable engine used to view and interact with multimedia. 9. The method of claim 8, the user-scriptable engine including native functions and user-defined functions, the hierarchical data including instrumented data relating to performance of the native functions and sampled data relating to performance of the user-defined functions. 10. The method of claim 9, the instrumented data and sampled data being received as separate streams. 11. An apparatus comprising:
a processor, a database storing hierarchical data, the hierarchical data including data pertaining to a plurality of categories, the hierarchical data further including data pertaining to a plurality of subcategories of at least one of the plurality of categories; a user interface configured to display multiple viewing regions simultaneously on a display, each viewing region depicting a different view of the hierarchical data, objects displayed in each viewing region being color-coded such that an object corresponding to a first category in a first viewing region is displayed in an identical color as an object corresponding to the first category in a second viewing region. 12. The apparatus of claim 11, the database being located in a database layer written in an object-oriented programming language. 13. The apparatus of claim 11, the user interface being located in a user interface layer written in a lightweight multi-paradigm programming language designed as a scripting language having extensible semantics. 14. The apparatus of claim 11, the database storing telemetry data from a user-scriptable engine, the telemetry data being transferred to the database in three layers, one layer being a network layer, one layer being a format to serialize objects, and one layer being a telemetry layer, the telemetry layer defining a particular set of data formats understandable by the serialization layer that are used to transmit the hierarchical data. 15. The apparatus of claim 14, the telemetry data being stored by the database as sessions. 16. The apparatus of claim 12, the database layer further comprising a query engine configured to receive requests for data generated by the user interface and retrieve information from the database in response to the requests. 17. A non-transitory machine-readable storage medium comprising a set of instructions which, when executed by a processor, causes execution of operations comprising:
accessing hierarchical data, the hierarchical data including data pertaining to a plurality of categories, the hierarchical data further including data pertaining to a plurality of subcategories of at least one of the plurality of categories; displaying multiple viewing regions simultaneously on a display, each viewing region depicting a different view of the hierarchical data, objects displayed in each viewing region being color-coded with a different color for each category, such that an object corresponding to a first category in a first viewing region is displayed in an identical color as an object corresponding to the first category in a second viewing region. 18. The non-transitory machine-readable storage medium of claim 17, the set of instructions further causing execution of the displaying multiple viewing regions simultaneously including displaying objects corresponding to a plurality of subcategories of one of the plurality of categories, each object corresponding to the plurality of subcategories being color-coded with a different color for each subcategory, such that an object corresponding to a first subcategory in the first viewing region is displayed with an identical color as an object corresponding to the first subcategory in the second viewing region. 19. The non-transitory machine-readable storage medium of claim 18, the color selected for each of the plurality of subcategories of a particular category being a shade of the color selected for the particular category. 20. The non-transitory machine-readable storage medium of claim 18, the objects corresponding to the plurality of subcategories of a particular category being displayed in response to user input indicating a drill-down operation on the particular category. | 2,100 |
4,550 | 13,773,818 | 2,125 | Methods and systems that perform one or more operations on a plurality of elements using a multiple data processing element processor are provided. An input vector comprising a plurality of elements is received by a processor. The processor determines if performing a first operation on a first element will cause an exception and if so, writes an indication of the exception caused by the first operation to a first portion of an output vector stored in an output register. A second operation can be performed on a second element with the result of the second operation being written to a second portion of the output vector stored in the output register. | 1. A method of performing one or more operations on a plurality of elements using a multiple data processing element processor, comprising:
receiving one or more input vectors, wherein the one or more input vectors comprise a first set of elements and a second set of elements; determining that performing a first operation on the first set of elements will cause an exception; writing an indication of the exception caused by the first operation to a first element of an output vector, performing a second operation on the second set of elements; and writing a result of the second operation to a second element of the output vector. 2. The method of claim 1, further comprising determining that a non-signaling exception mode is enabled in the processor. 3. The method of claim 1, wherein the one or more input vectors comprise a third set of elements. 4. The method of claim 3, further comprising determining that performing a third operation on the third set of elements will cause an exception and writing an indication of the exception to a third element of the output vector. 5. The method of claim 1, wherein the first and second operations are the same operation. 6. The method of claim 1, wherein the multiple data processing element processor is a single input multiple data (SIMD) processor. 7. The method of claim 1, wherein the multiple data processing element processor is a multiple input multiple data (MIMD) processor. 8. The method of claim 1, wherein the indication signals an exception handler to handle the exception. 9. The method of claim 1, wherein each of the first and second sets of elements contains a single element. 10. The method of claim 1, wherein each of the first and second sets of elements contains a plurality of elements. 11. A multiple data processing element system, comprising:
an input register configured to store one or more input vectors, wherein the one or more input vectors comprise a first set of elements and a second set of elements; an output register configured to store the results of a plurality of operations; and a multiple data processing element processor configured to:
receive the one or more input vectors from the input register,
determine that performing a first operation on the first set of elements will cause an exception and output an indication of the exception caused by the first operation to a first element of the output register, and
perform a second operation on a second set of elements and output the result of the operation to a second element of the output register. 12. The system of claim 11, wherein the processor is further configured to determine that a non-signaling exception mode is enabled in the processor. 13. The system of claim 11, wherein the one or more input vectors further comprise a third set of elements. 14. The system of claim 13, wherein the processor is further configured to determine that performing a third operation on the third set of elements will cause an exception and to output an indication of the exception to a third element of the output register. 15. The system of claim 11, wherein the first and second operations are the same operation. 16. The system of claim 11, wherein the multiple data processing element processor is a single input multiple data (SIMD) processor. 17. The system of claim 11, wherein the multiple data processing element processor is a multiple input multiple data (MIMD) processor. 18. The method of claim 11, wherein the indication is configured to signal an exception handler to handle the exception. 19. The system of claim 11, wherein each of the first and second sets of elements contains a single element. 20. The system of claim 11, wherein each of the first and second sets of elements contains a plurality of elements. | Methods and systems that perform one or more operations on a plurality of elements using a multiple data processing element processor are provided. An input vector comprising a plurality of elements is received by a processor. The processor determines if performing a first operation on a first element will cause an exception and if so, writes an indication of the exception caused by the first operation to a first portion of an output vector stored in an output register. A second operation can be performed on a second element with the result of the second operation being written to a second portion of the output vector stored in the output register.1. A method of performing one or more operations on a plurality of elements using a multiple data processing element processor, comprising:
receiving one or more input vectors, wherein the one or more input vectors comprise a first set of elements and a second set of elements; determining that performing a first operation on the first set of elements will cause an exception; writing an indication of the exception caused by the first operation to a first element of an output vector, performing a second operation on the second set of elements; and writing a result of the second operation to a second element of the output vector. 2. The method of claim 1, further comprising determining that a non-signaling exception mode is enabled in the processor. 3. The method of claim 1, wherein the one or more input vectors comprise a third set of elements. 4. The method of claim 3, further comprising determining that performing a third operation on the third set of elements will cause an exception and writing an indication of the exception to a third element of the output vector. 5. The method of claim 1, wherein the first and second operations are the same operation. 6. The method of claim 1, wherein the multiple data processing element processor is a single input multiple data (SIMD) processor. 7. The method of claim 1, wherein the multiple data processing element processor is a multiple input multiple data (MIMD) processor. 8. The method of claim 1, wherein the indication signals an exception handler to handle the exception. 9. The method of claim 1, wherein each of the first and second sets of elements contains a single element. 10. The method of claim 1, wherein each of the first and second sets of elements contains a plurality of elements. 11. A multiple data processing element system, comprising:
an input register configured to store one or more input vectors, wherein the one or more input vectors comprise a first set of elements and a second set of elements; an output register configured to store the results of a plurality of operations; and a multiple data processing element processor configured to:
receive the one or more input vectors from the input register,
determine that performing a first operation on the first set of elements will cause an exception and output an indication of the exception caused by the first operation to a first element of the output register, and
perform a second operation on a second set of elements and output the result of the operation to a second element of the output register. 12. The system of claim 11, wherein the processor is further configured to determine that a non-signaling exception mode is enabled in the processor. 13. The system of claim 11, wherein the one or more input vectors further comprise a third set of elements. 14. The system of claim 13, wherein the processor is further configured to determine that performing a third operation on the third set of elements will cause an exception and to output an indication of the exception to a third element of the output register. 15. The system of claim 11, wherein the first and second operations are the same operation. 16. The system of claim 11, wherein the multiple data processing element processor is a single input multiple data (SIMD) processor. 17. The system of claim 11, wherein the multiple data processing element processor is a multiple input multiple data (MIMD) processor. 18. The method of claim 11, wherein the indication is configured to signal an exception handler to handle the exception. 19. The system of claim 11, wherein each of the first and second sets of elements contains a single element. 20. The system of claim 11, wherein each of the first and second sets of elements contains a plurality of elements. | 2,100 |
4,551 | 14,288,591 | 2,152 | A database management system (DBMS) in which a user can express a query plan as a Raw Plan of arbitrary complexity in a format that can be executed by the DBMS. The user may also specify criteria under which this Raw Plan is to be executed. When a matching query and the subject circumstances are encountered the DBMS will execute the Raw Plan, instead of searching in a query cache or generating a new query plan. | 1. A database management system comprising:
a network interface, for receiving an incoming query from two or more client applications, the client applications operating on two or more client computers, and for providing a least one connection into the system for each such client application to provide incoming commands to the system that include at least the incoming query; a group of one or more operational nodes for executing the incoming query as database operations, each operational node implemented as a logical collection of software components that execute on one or more physical or virtual machines; a storage system for storing data; a Query Parser for programmatically transforming the incoming query into template information and non-template information, wherein template information represents a parsed database command without manifest parameters specific to the incoming query, and the non-template information includes manifest parameters specific to the incoming query; a Query Planner for programmatically transforming the incoming query into a Constructed Query Plan, the Constructed Query Plan including one or more database operations to be performed to implement the incoming query; the system further receiving incoming commands from the client computers that include a command to store a Raw Query Plan in a Raw Plan Cache, the Raw Query Plan including (a) template information (b) one or more database operations to be performed to implement an incoming query with matching template information, and (c), additional criteria associated with the Raw Query Plan, wherein the additional criteria include an expression that when evaluated produces a value; a Query Executor for executing the database operations in the Constructed Query Plans, and for executing the database operations in the Raw Query Plans, and for causing one or more results of executing the database operations to be sent to one or more client applications; and the system further configured to, after receipt of the incoming query: execute the Query Parser and extract the template information and the non-template information provided in the incoming query; search the Raw Plan Cache to find a Raw Query Plan with template information matching the template information of the incoming query, and when a Raw Query Plan with a matching template is found,
then evaluate the expression in the additional criteria, and when the expression evaluates to a predetermined value,
then operate the Query Executor to execute the matching template in the Raw Query Plan that was found in the search; and
only when a Raw Query Plan with a matching template is not found,
then
operate the Query Planner to construct a Constructed Query Plan, and
operate the Query Executor to execute the Constructed Query Plan. 2. (canceled) 3. The system of claim 1 whereby in response to a command that provides a Raw Query Plan and non-template information specific to a query associated with the Raw Query Plan, the Query Executor further executes the Raw Query Plan along with the non-template information specific to the incoming query. 4.-5. (canceled) 6. The system of claim 1 wherein the incoming commands include a command that enables a plan in the Raw Plan Cache. 7. The system of claim 1 wherein the incoming commands include a command that disables a plan in the Raw Plan Cache. 8. The system of claim 1 and wherein the incoming commands include a command that deletes a plan in the Raw Plan Cache. 9. The system of claim 1 wherein the additional criteria associated with the Raw Query Plan include one or more database(s), user(s), connection(s) or time(s). 10. (canceled) 11. A method for operating a database management system comprising:
receiving incoming database queries from two or more client applications via a network interface, the client applications operating on two or more user client computers; providing a least one connection into the system for each such client application to provide incoming commands to the system, the incoming commands including at least the incoming queries; storing data in a storage medium; operating a group of one or more operational nodes for the further steps of: receiving incoming commands from the client computers that include a command to store a Raw Query Plan in a Raw Plan Cache, the Raw Query Plan including (a) template information that represents a parsed database command without manifest parameters, (b) one or more database operations to be performed to implement incoming queries, and (c) additional criteria associated with the Raw Query Plan, the additional criteria further including an expression that when evaluated, generates a value after receipt of an incoming query: parsing the incoming query to extract template information and non-template information, the template information representing a parsed database command without manifest parameters specific to the incoming query, and the non-template information including manifest parameters specific to the incoming query; searching the Raw Plan Cache for a stored Raw Query Plan having template information that matches the template information parsed from the incoming query; upon finding a matching Raw Query Plan with matching template information;
then evaluating the expression associated with the matching Raw Query Plan to generate a value, and
when the expression evaluates to a predetermined value,
then operating a Query Executor to execute the matching Raw Query Plan, else
upon finding no Raw Query Plan with matching template information,
then
operating a Query Planner on one or more of the operational nodes, for further programmatically transforming the incoming query into a Constructed Query Plan, the Constructed Query Plan including one or more database operations to implement the incoming query; and
operating the Query Executor to execute the Constructed Query Plan. 12. (canceled) 13. The method of claim 11 additionally comprising in response to a command that provides a Raw Query Plan and non-template information specific to an incoming query associated with the Raw Query Plan, and further when the expression evaluates to a predetermined value, further operating the Query Executor to execute the Raw Query Plan along with the non-template information provided with the incoming query. 14.-15. (canceled) 16. The method of claim 11 wherein the incoming command enables a plan in the Raw Plan Cache. 17. The method of claim 11 wherein the incoming command disables a plan in the Raw Plan Cache. 18. The method of claim 11 wherein the incoming command deletes a plan in the Raw Plan Cache. 19. The method of claim 11 wherein the Raw Query Plan specifies one or more database(s), user(s), connection(s) or time(s) as the additional criteria. 20. (canceled) 21. The system of claim 1 wherein the Raw Query Plan further specifies two or more plan steps, a plan step dependency, and plan step ordering. 22. The method of claim 11 wherein the Raw Query Plan specifies two or more plan steps, a plan step dependency, and plan step ordering. 23. (canceled) 24. The system of claim 1 wherein:
the additional criteria provided with the Raw Query Plan reference non-template information in the incoming query or specific operational attributes of the executing environment within the system at a time of receipt of the incoming query. 25. (canceled) 26. The method of claim 11 wherein:
the additional criteria in the Raw Query Plan reference non-template information in the incoming query or specific operational attributes of the executing environment within the system at a time of receipt of the incoming query. 27. The system of claim 1 wherein the expression when evaluated further identifies a user, such that expression evaluates to a first value when evaluated for a first user and to a second value when the user is not the first user, and whereby the Raw Query Plan is executed when the user is a first user, and such that the Constructed Query Plan is executed only when the user is not the first user. 28. The system of claim 1 wherein the expression when evaluated further identifies a time of day, such that the Raw Query Plan is executed when a time of day is a first time, and such that the Constructed Query Plan is executed only when a time of day is a second time. 29. The system of claim 1 wherein the additional criteria provided with the Raw Query Plan is not used by the Query Planner to programmatically transform the incoming query into the Constructed Query Plan. 30. The method of claim 11 wherein the additional criteria provided with the Raw Query Plan is not used in programmatically transforming the incoming query into the Constructed Query Plan. | A database management system (DBMS) in which a user can express a query plan as a Raw Plan of arbitrary complexity in a format that can be executed by the DBMS. The user may also specify criteria under which this Raw Plan is to be executed. When a matching query and the subject circumstances are encountered the DBMS will execute the Raw Plan, instead of searching in a query cache or generating a new query plan.1. A database management system comprising:
a network interface, for receiving an incoming query from two or more client applications, the client applications operating on two or more client computers, and for providing a least one connection into the system for each such client application to provide incoming commands to the system that include at least the incoming query; a group of one or more operational nodes for executing the incoming query as database operations, each operational node implemented as a logical collection of software components that execute on one or more physical or virtual machines; a storage system for storing data; a Query Parser for programmatically transforming the incoming query into template information and non-template information, wherein template information represents a parsed database command without manifest parameters specific to the incoming query, and the non-template information includes manifest parameters specific to the incoming query; a Query Planner for programmatically transforming the incoming query into a Constructed Query Plan, the Constructed Query Plan including one or more database operations to be performed to implement the incoming query; the system further receiving incoming commands from the client computers that include a command to store a Raw Query Plan in a Raw Plan Cache, the Raw Query Plan including (a) template information (b) one or more database operations to be performed to implement an incoming query with matching template information, and (c), additional criteria associated with the Raw Query Plan, wherein the additional criteria include an expression that when evaluated produces a value; a Query Executor for executing the database operations in the Constructed Query Plans, and for executing the database operations in the Raw Query Plans, and for causing one or more results of executing the database operations to be sent to one or more client applications; and the system further configured to, after receipt of the incoming query: execute the Query Parser and extract the template information and the non-template information provided in the incoming query; search the Raw Plan Cache to find a Raw Query Plan with template information matching the template information of the incoming query, and when a Raw Query Plan with a matching template is found,
then evaluate the expression in the additional criteria, and when the expression evaluates to a predetermined value,
then operate the Query Executor to execute the matching template in the Raw Query Plan that was found in the search; and
only when a Raw Query Plan with a matching template is not found,
then
operate the Query Planner to construct a Constructed Query Plan, and
operate the Query Executor to execute the Constructed Query Plan. 2. (canceled) 3. The system of claim 1 whereby in response to a command that provides a Raw Query Plan and non-template information specific to a query associated with the Raw Query Plan, the Query Executor further executes the Raw Query Plan along with the non-template information specific to the incoming query. 4.-5. (canceled) 6. The system of claim 1 wherein the incoming commands include a command that enables a plan in the Raw Plan Cache. 7. The system of claim 1 wherein the incoming commands include a command that disables a plan in the Raw Plan Cache. 8. The system of claim 1 and wherein the incoming commands include a command that deletes a plan in the Raw Plan Cache. 9. The system of claim 1 wherein the additional criteria associated with the Raw Query Plan include one or more database(s), user(s), connection(s) or time(s). 10. (canceled) 11. A method for operating a database management system comprising:
receiving incoming database queries from two or more client applications via a network interface, the client applications operating on two or more user client computers; providing a least one connection into the system for each such client application to provide incoming commands to the system, the incoming commands including at least the incoming queries; storing data in a storage medium; operating a group of one or more operational nodes for the further steps of: receiving incoming commands from the client computers that include a command to store a Raw Query Plan in a Raw Plan Cache, the Raw Query Plan including (a) template information that represents a parsed database command without manifest parameters, (b) one or more database operations to be performed to implement incoming queries, and (c) additional criteria associated with the Raw Query Plan, the additional criteria further including an expression that when evaluated, generates a value after receipt of an incoming query: parsing the incoming query to extract template information and non-template information, the template information representing a parsed database command without manifest parameters specific to the incoming query, and the non-template information including manifest parameters specific to the incoming query; searching the Raw Plan Cache for a stored Raw Query Plan having template information that matches the template information parsed from the incoming query; upon finding a matching Raw Query Plan with matching template information;
then evaluating the expression associated with the matching Raw Query Plan to generate a value, and
when the expression evaluates to a predetermined value,
then operating a Query Executor to execute the matching Raw Query Plan, else
upon finding no Raw Query Plan with matching template information,
then
operating a Query Planner on one or more of the operational nodes, for further programmatically transforming the incoming query into a Constructed Query Plan, the Constructed Query Plan including one or more database operations to implement the incoming query; and
operating the Query Executor to execute the Constructed Query Plan. 12. (canceled) 13. The method of claim 11 additionally comprising in response to a command that provides a Raw Query Plan and non-template information specific to an incoming query associated with the Raw Query Plan, and further when the expression evaluates to a predetermined value, further operating the Query Executor to execute the Raw Query Plan along with the non-template information provided with the incoming query. 14.-15. (canceled) 16. The method of claim 11 wherein the incoming command enables a plan in the Raw Plan Cache. 17. The method of claim 11 wherein the incoming command disables a plan in the Raw Plan Cache. 18. The method of claim 11 wherein the incoming command deletes a plan in the Raw Plan Cache. 19. The method of claim 11 wherein the Raw Query Plan specifies one or more database(s), user(s), connection(s) or time(s) as the additional criteria. 20. (canceled) 21. The system of claim 1 wherein the Raw Query Plan further specifies two or more plan steps, a plan step dependency, and plan step ordering. 22. The method of claim 11 wherein the Raw Query Plan specifies two or more plan steps, a plan step dependency, and plan step ordering. 23. (canceled) 24. The system of claim 1 wherein:
the additional criteria provided with the Raw Query Plan reference non-template information in the incoming query or specific operational attributes of the executing environment within the system at a time of receipt of the incoming query. 25. (canceled) 26. The method of claim 11 wherein:
the additional criteria in the Raw Query Plan reference non-template information in the incoming query or specific operational attributes of the executing environment within the system at a time of receipt of the incoming query. 27. The system of claim 1 wherein the expression when evaluated further identifies a user, such that expression evaluates to a first value when evaluated for a first user and to a second value when the user is not the first user, and whereby the Raw Query Plan is executed when the user is a first user, and such that the Constructed Query Plan is executed only when the user is not the first user. 28. The system of claim 1 wherein the expression when evaluated further identifies a time of day, such that the Raw Query Plan is executed when a time of day is a first time, and such that the Constructed Query Plan is executed only when a time of day is a second time. 29. The system of claim 1 wherein the additional criteria provided with the Raw Query Plan is not used by the Query Planner to programmatically transform the incoming query into the Constructed Query Plan. 30. The method of claim 11 wherein the additional criteria provided with the Raw Query Plan is not used in programmatically transforming the incoming query into the Constructed Query Plan. | 2,100 |
4,552 | 13,795,257 | 2,171 | A control circuit facilitates providing a user interface to facilitate developing a radiation-treatment plan for a given patient, the user interface comprising, at least in part, an opportunity to select an automated multi-step radiation-treatment plan development capability. Upon detecting a user's selection of this automated multi-step radiation-treatment plan development capability, these teachings then provide for automatically carrying out a plurality of steps wherein at least some of the plurality of steps pertain to other than optimizing a radiation dosing. These steps are carried out without requiring further interaction with the user and yield at least one output radiation-treatment plan that is specific to the given patient and that is administrable as yielded. | 1. A method comprising:
at a control circuit:
providing a user interface to facilitate developing a radiation-treatment plan for a given patient, the user interface comprising, at least in part, an opportunity to select an automated multi-step radiation-treatment plan development capability;
upon detecting a user's selection of the automated multi-step radiation-treatment plan development capability, automatically carrying out a plurality of steps wherein at least some of the plurality of steps pertain to other than optimizing a radiation dosing, without requiring further interaction with the user, to yield at least one output radiation-treatment plan that is specific to the given patient and that is administrable as yielded. 2. The method of claim 1 wherein the user interface comprises, at least in part, an active display. 3. The method of claim 2 wherein the user interface comprises at least one of:
the active display comprising, at least in part, a touch-screen display;
a cursor-control component to facilitate user control of a cursor-based selector that is displayed on the active display;
a keyboard to facilitate user selection of the opportunity. 4. The method of claim 1 wherein the plurality of steps include, at least in part, accessing physiological information regarding the given patient. 5. The method of claim 4 wherein the plurality of steps include, at least in part, developing at least some of the physiological information by processing previously-stored information regarding the given patient. 6. The method of claim 1 wherein the plurality of steps include, at least in part, optimizing at least one candidate radiation-treatment plan. 7. The method of claim 1 wherein the plurality of steps include, at least in part, comparing a plurality of candidate radiation-treatment plans to identify a recommended radiation-treatment plan to provide as the output radiation-treatment plan. 8. The method of claim 1 wherein yielding at least one output radiation-treatment plan that is specific to the given patient and that is administrable as yielded comprises yielding a plurality of alternative radiation-treatment plans that are specific to the given patient and that are administrable as yielded. 9. The method of claim 8 further comprising:
detecting a user selection of a particular one of the plurality of alternative radiation-treatment plans to be used when treating the given patient 10. The method of claim 1 wherein the plurality of steps include, at least in part, accessing operating parameter information for at least one candidate radiation-treatment platform and using that operating parameter information when forming the radiation-treatment plan. 11. The method of claim 10 wherein accessing operating parameter information for at least one candidate radiation-treatment platform comprises accessing operating parameter information for a plurality of different candidate radiation-treatment platforms and using that operating parameter information when forming the radiation-treatment plan. 12. The method of claim 1 further comprising:
detecting the user's selection of the automated multi-step radiation-treatment plan development capability while the given patient waits in a treatment position with respect to a radiation-treatment delivery platform that will implement the output radiation-treatment plan. 13. The method of claim 1 wherein at least one of the plurality of steps comprises:
scheduling a radiation treatment;
evaluating at least some automatically generated information;
approving at least some automatically generated information;
optimizing a radiation dosing;
selecting the given patient;
selecting a patient image;
using Standarized Uptake Value (SUV) information;
determining a treatment method;
modeling at least one patient support device;
dose tracking;
imaging the given patient;
determining intra-fractional motion management parameters. 14. The method of claim 13 wherein at least two of the plurality of steps comprise different ones of:
scheduling a radiation treatment;
evaluating at least some automatically generated information;
approving at least some automatically generated information;
optimizing a radiation dosing;
selecting the given patient;
selecting a patient image;
using Standarized Uptake Value (SUV) information;
determining a treatment method;
modeling at least one patient support device;
dose tracking;
imaging the given patient;
determining intra-fractional motion management parameters. 15. The method of claim 1 wherein at least one of the plurality of steps comprises an administrative step. 16. An apparatus comprising:
an active display; a control circuit operably coupled to the active display and configured to:
provide a user interface via the active display to facilitate developing a radiation-treatment plan for a given patient, the user interface comprising, at least in part, an opportunity to select an automated multi-step radiation-treatment plan development capability;
upon detecting a user's selection of the automated multi-step radiation-treatment plan development capability, automatically carry out a plurality of steps wherein at least some of the plurality of steps pertain to other than optimizing a radiation dosing, without requiring further interaction with the user, to yield at least one output radiation-treatment plan that is specific to the given patient and that is administrable as yielded. 17. The apparatus of claim 15 wherein the user interface comprises at least one of:
the active display comprises, at least in part, a touch-screen display;
a cursor-control component to facilitate user control of a cursor-based selector that is displayed on the active display;
a keyboard to facilitate user selection of the opportunity. 18. The apparatus of claim 15 wherein the plurality of steps include, at least in part, accessing physiological information regarding the given patient. 19. The apparatus of claim 17 wherein the plurality of steps include, at least in part, developing at least some of the physiological information by processing previously-stored information regarding the given patient. 20. The apparatus of claim 15 wherein the plurality of steps include, at least in part, optimizing at least one candidate radiation-treatment plan. 21. The apparatus of claim 15 wherein the plurality of steps include, at least in part, comparing a plurality of candidate radiation-treatment plans to identify a recommended radiation-treatment plan to provide as the output radiation-treatment plan. 22. The apparatus of claim 15 wherein the control circuit is configured to yield at least one output radiation-treatment plan that is specific to the given patient and that is administrable as yielded by yielding a plurality of alternative radiation-treatment plans that are specific to the given patient and that are administrable as yielded. 23. The method of claim 15 wherein the plurality of steps include, at least in part, accessing operating parameter information for at least one candidate radiation-treatment platform and using that operating parameter information when forming the radiation-treatment plan. | A control circuit facilitates providing a user interface to facilitate developing a radiation-treatment plan for a given patient, the user interface comprising, at least in part, an opportunity to select an automated multi-step radiation-treatment plan development capability. Upon detecting a user's selection of this automated multi-step radiation-treatment plan development capability, these teachings then provide for automatically carrying out a plurality of steps wherein at least some of the plurality of steps pertain to other than optimizing a radiation dosing. These steps are carried out without requiring further interaction with the user and yield at least one output radiation-treatment plan that is specific to the given patient and that is administrable as yielded.1. A method comprising:
at a control circuit:
providing a user interface to facilitate developing a radiation-treatment plan for a given patient, the user interface comprising, at least in part, an opportunity to select an automated multi-step radiation-treatment plan development capability;
upon detecting a user's selection of the automated multi-step radiation-treatment plan development capability, automatically carrying out a plurality of steps wherein at least some of the plurality of steps pertain to other than optimizing a radiation dosing, without requiring further interaction with the user, to yield at least one output radiation-treatment plan that is specific to the given patient and that is administrable as yielded. 2. The method of claim 1 wherein the user interface comprises, at least in part, an active display. 3. The method of claim 2 wherein the user interface comprises at least one of:
the active display comprising, at least in part, a touch-screen display;
a cursor-control component to facilitate user control of a cursor-based selector that is displayed on the active display;
a keyboard to facilitate user selection of the opportunity. 4. The method of claim 1 wherein the plurality of steps include, at least in part, accessing physiological information regarding the given patient. 5. The method of claim 4 wherein the plurality of steps include, at least in part, developing at least some of the physiological information by processing previously-stored information regarding the given patient. 6. The method of claim 1 wherein the plurality of steps include, at least in part, optimizing at least one candidate radiation-treatment plan. 7. The method of claim 1 wherein the plurality of steps include, at least in part, comparing a plurality of candidate radiation-treatment plans to identify a recommended radiation-treatment plan to provide as the output radiation-treatment plan. 8. The method of claim 1 wherein yielding at least one output radiation-treatment plan that is specific to the given patient and that is administrable as yielded comprises yielding a plurality of alternative radiation-treatment plans that are specific to the given patient and that are administrable as yielded. 9. The method of claim 8 further comprising:
detecting a user selection of a particular one of the plurality of alternative radiation-treatment plans to be used when treating the given patient 10. The method of claim 1 wherein the plurality of steps include, at least in part, accessing operating parameter information for at least one candidate radiation-treatment platform and using that operating parameter information when forming the radiation-treatment plan. 11. The method of claim 10 wherein accessing operating parameter information for at least one candidate radiation-treatment platform comprises accessing operating parameter information for a plurality of different candidate radiation-treatment platforms and using that operating parameter information when forming the radiation-treatment plan. 12. The method of claim 1 further comprising:
detecting the user's selection of the automated multi-step radiation-treatment plan development capability while the given patient waits in a treatment position with respect to a radiation-treatment delivery platform that will implement the output radiation-treatment plan. 13. The method of claim 1 wherein at least one of the plurality of steps comprises:
scheduling a radiation treatment;
evaluating at least some automatically generated information;
approving at least some automatically generated information;
optimizing a radiation dosing;
selecting the given patient;
selecting a patient image;
using Standarized Uptake Value (SUV) information;
determining a treatment method;
modeling at least one patient support device;
dose tracking;
imaging the given patient;
determining intra-fractional motion management parameters. 14. The method of claim 13 wherein at least two of the plurality of steps comprise different ones of:
scheduling a radiation treatment;
evaluating at least some automatically generated information;
approving at least some automatically generated information;
optimizing a radiation dosing;
selecting the given patient;
selecting a patient image;
using Standarized Uptake Value (SUV) information;
determining a treatment method;
modeling at least one patient support device;
dose tracking;
imaging the given patient;
determining intra-fractional motion management parameters. 15. The method of claim 1 wherein at least one of the plurality of steps comprises an administrative step. 16. An apparatus comprising:
an active display; a control circuit operably coupled to the active display and configured to:
provide a user interface via the active display to facilitate developing a radiation-treatment plan for a given patient, the user interface comprising, at least in part, an opportunity to select an automated multi-step radiation-treatment plan development capability;
upon detecting a user's selection of the automated multi-step radiation-treatment plan development capability, automatically carry out a plurality of steps wherein at least some of the plurality of steps pertain to other than optimizing a radiation dosing, without requiring further interaction with the user, to yield at least one output radiation-treatment plan that is specific to the given patient and that is administrable as yielded. 17. The apparatus of claim 15 wherein the user interface comprises at least one of:
the active display comprises, at least in part, a touch-screen display;
a cursor-control component to facilitate user control of a cursor-based selector that is displayed on the active display;
a keyboard to facilitate user selection of the opportunity. 18. The apparatus of claim 15 wherein the plurality of steps include, at least in part, accessing physiological information regarding the given patient. 19. The apparatus of claim 17 wherein the plurality of steps include, at least in part, developing at least some of the physiological information by processing previously-stored information regarding the given patient. 20. The apparatus of claim 15 wherein the plurality of steps include, at least in part, optimizing at least one candidate radiation-treatment plan. 21. The apparatus of claim 15 wherein the plurality of steps include, at least in part, comparing a plurality of candidate radiation-treatment plans to identify a recommended radiation-treatment plan to provide as the output radiation-treatment plan. 22. The apparatus of claim 15 wherein the control circuit is configured to yield at least one output radiation-treatment plan that is specific to the given patient and that is administrable as yielded by yielding a plurality of alternative radiation-treatment plans that are specific to the given patient and that are administrable as yielded. 23. The method of claim 15 wherein the plurality of steps include, at least in part, accessing operating parameter information for at least one candidate radiation-treatment platform and using that operating parameter information when forming the radiation-treatment plan. | 2,100 |
4,553 | 11,786,005 | 2,144 | Techniques to cross-reference information for application programs are described. An apparatus may comprise a first application program to create notes for an operator, a second application program to display a target document, and a context generation module to generate a context for a note by displaying a document view for the target document using stored context information when the note is displayed. Other embodiments are described and claimed. | 1. A method, comprising:
creating a note with a first application program; generating a context reference for a document for a second application program; associating the context reference with the note; and storing context information for the document. 2. The method of claim 1, comprising storing the note with the context reference and the context information. 3. The method of claim 1, comprising displaying the note with a visual indicator for the context reference and the context information. 4. The method of claim 1, comprising displaying the document using the context information when the note is opened. 5. The method of claim 1, comprising displaying the document with a document view substantially similar to a document view recorded when the note was created using the context information. 6. The method of claim 1, comprising displaying the document at a specific location within the document using the context information. 7. The method of claim 1, comprising displaying a visual indicator with the document indicating the associated note. 8. An article comprising a storage medium containing instructions that if executed enable a system to:
create a note with a first application program; generate a context reference for a document for a second application program; associate the context reference with the note; and store context information for the document with the note. 9. The article of claim 8, further comprising instructions that if executed enable the system to record the context information for the document once the context reference is associated with the note. 10. The article of claim 8, further comprising instructions that if executed enable the system to display the note with a visual indicator for the context reference and the context information. 11. The article of claim 8, further comprising instructions that if executed enable the system to open the note, and display the document using the context information. 12. The article of claim 8, further comprising instructions that if executed enable the system to display the document with a document view substantially similar to a document view recorded when the note was created using the context information. 13. The article of claim 8, further comprising instructions that if executed enable the system to display the document at a specific location within the document using the context information. 14. The article of claim 8, further comprising instructions that if executed enable the system to display a visual indicator with the document indicating the associated note. 15. An apparatus comprising:
a first application program to create notes for an operator; a second application program to display a target document; and a context generation module to generate a context for a note by displaying a document view for the target document using stored context information when the note is displayed. 16. The apparatus of claim 15, comprising a context reference module to generate a context reference for the target document, and associate the context reference with a note. 17. The apparatus of claim 15, comprising a context recording module to store the context information for the target document. 18. The apparatus of claim 15, comprising a context recording module to store the context information for the target document when a context reference is associated with the target document. 19. The apparatus of claim 15, the context generation module to display the document view for the target document in a manner substantially similar to a document view stored when the note was created. 20. The apparatus of claim 15, the context generation module to display the document view for the target document at a specific location within the target document. | Techniques to cross-reference information for application programs are described. An apparatus may comprise a first application program to create notes for an operator, a second application program to display a target document, and a context generation module to generate a context for a note by displaying a document view for the target document using stored context information when the note is displayed. Other embodiments are described and claimed.1. A method, comprising:
creating a note with a first application program; generating a context reference for a document for a second application program; associating the context reference with the note; and storing context information for the document. 2. The method of claim 1, comprising storing the note with the context reference and the context information. 3. The method of claim 1, comprising displaying the note with a visual indicator for the context reference and the context information. 4. The method of claim 1, comprising displaying the document using the context information when the note is opened. 5. The method of claim 1, comprising displaying the document with a document view substantially similar to a document view recorded when the note was created using the context information. 6. The method of claim 1, comprising displaying the document at a specific location within the document using the context information. 7. The method of claim 1, comprising displaying a visual indicator with the document indicating the associated note. 8. An article comprising a storage medium containing instructions that if executed enable a system to:
create a note with a first application program; generate a context reference for a document for a second application program; associate the context reference with the note; and store context information for the document with the note. 9. The article of claim 8, further comprising instructions that if executed enable the system to record the context information for the document once the context reference is associated with the note. 10. The article of claim 8, further comprising instructions that if executed enable the system to display the note with a visual indicator for the context reference and the context information. 11. The article of claim 8, further comprising instructions that if executed enable the system to open the note, and display the document using the context information. 12. The article of claim 8, further comprising instructions that if executed enable the system to display the document with a document view substantially similar to a document view recorded when the note was created using the context information. 13. The article of claim 8, further comprising instructions that if executed enable the system to display the document at a specific location within the document using the context information. 14. The article of claim 8, further comprising instructions that if executed enable the system to display a visual indicator with the document indicating the associated note. 15. An apparatus comprising:
a first application program to create notes for an operator; a second application program to display a target document; and a context generation module to generate a context for a note by displaying a document view for the target document using stored context information when the note is displayed. 16. The apparatus of claim 15, comprising a context reference module to generate a context reference for the target document, and associate the context reference with a note. 17. The apparatus of claim 15, comprising a context recording module to store the context information for the target document. 18. The apparatus of claim 15, comprising a context recording module to store the context information for the target document when a context reference is associated with the target document. 19. The apparatus of claim 15, the context generation module to display the document view for the target document in a manner substantially similar to a document view stored when the note was created. 20. The apparatus of claim 15, the context generation module to display the document view for the target document at a specific location within the target document. | 2,100 |
4,554 | 13,529,800 | 2,118 | A method for saving energy at a network node in an automation network comprising receiving energy saving command data for switching at least one network device to an energy saving state, forwarding the energy saving command data to the network device, evaluating the energy saving command data by the network node, and saving energy at the network node. When the network node receives and/or outputs no data or a reduced volume of data to the network device during the energy saving state, the energy saving is effected by placing at least one portion of the network node into an energy saving state, where the portion is determined by any one of a plurality of network ports, which, because of the energy saving state of the network device, is being used to output and/or receive no data or a reduced volume of data. | 1. A method for saving energy at a network node in an automation network, the method comprising:
receiving energy saving command data for switching at least one network device of network devices connected to network ports at the network node to an energy saving state in which the at least one network device consumes less energy than in an operating state; forwarding the energy saving command data to the at least one network device; evaluating the energy saving command data by the network node; and switching at least a portion of the network node to an energy saving state to save energy at the network node, the network node at least one of receiving and outputting one of no data and a reduced volume of data to the at least one network device when the at least one network node is in the energy saving state; wherein the at least one portion of the network node to be switched to the energy saving sate is determined based on network ports associated with the at least one network device in the energy saving state. 2. The method as claimed in claim 1, further comprising:
receiving and evaluating, at the network node, a response signal in response to the energy saving command data from the at least one network device; wherein the energy saving at the network node is effected only after receipt and evaluation of the at least one response signal. 3. The method as claimed in claim 1, wherein the energy saving command data comprise one of a time period and an end time, which defines a period for which the at least one network device is switched to the energy saving state, and wherein the portion of the network node is switched to the energy saving state for one of a shorter time period or a same time period. 4. The method as claimed in claim 3, wherein, after the time period has elapsed, the network node automatically switches itself at least partially to the operating state, and produces energy saving termination command data which is transmitted to the at least one network device. 5. The method as claimed in claim 1, wherein at least one network port of the network ports includes at least two network devices connected to the at least one network port one of directly and indirectly, and wherein no data or a reduced volume of data is at least one of output and received through the at least one network port only when all of the at least two network devices are in the energy saving state. 6. The method as claimed in claims, further comprising:
receiving energy saving termination command data through a network port of the network ports, the energy saving termination command data, when received by the at least one network device, switching said at least one network device to the operating state with increased energy intake in comparison with the energy saving state; evaluating the energy saving termination command data by the network node; and re-switching on the network node which has at least partially been switched to the energy saving state; forwarding the energy saving termination command data to the at least one network device. 7. The method as claimed in claim 1, wherein the network node includes a buffer store configured to store data which are intended to be forwarded to the at least one network device when the at least one network device is in the energy saving state. 8. The method as claimed in claim 1, wherein the network node stores energy states of the network devices connected to network ports at the network node in a state memory, and wherein the energy state of each respective network device of network devices connected to network ports at the network node is one of the operating state and the energy saving state of the respective network device. 9. The method as claimed in claim 8, further comprising:
requesting an energy state of the at least one network device by a further network device by using energy state request command data which are transmitted through the network node; and reading, by the network node, a state of the network device from the state memory and outputting a response signal to the further network device upon receiving the energy state request command data; wherein the response signal comprises the energy state of the at least one network device. 10. The method as claimed in claim 1, wherein the automation network comprises a further network node connected to the network node by at least one of the network ports;
wherein further network devices are connected to the further network node, and wherein one of no data and a reduced volume of data for the network devices is output to the further network node through the network port only when all further network devices connected to the further network node are in the energy saving state. 11. The method as claimed in claim 1, wherein a connection between the network node and the at least one network device comprises a safety-relevant connection in the automation network; and wherein the safety-relevant connection is maintained irrespective of the energy saving at the network node. 12. A network node for an automation network, comprising:
network ports configured to receive energy saving command data for switching at least one network device to an energy saving state in which the at least one network device consumes less energy in than in an operating state; and a process and memory configured to forward the energy saving command data to the at least one network device, evaluate the energy saving command data, and save energy at the network node by switching at least a portion of the network node to an energy savings state; wherein the network node at least one of receives and outputs one of no data and a reduced volume of data to the at least one network device when in the energy saving state; and the at least a portion of the network node to be switched to the energy saving state being determined based on network ports associated with the at least one network device in the energy saving state. 13. An automation network including at least one network node as claimed in claim 12. 14. An automation network comprising at least one network node as claimed in claim 13. 15. A process in which a computer executes instructions set forth in a computer program executing on a processor which, when used on the computer cause the processor to save energy at a network node in an automation network, the computer program comprising:
program code for receiving energy saving command data for switching at least one network device of network devices connected to network ports at the network node to an energy saving state in which the at least one network device consumes less energy than in an operating state; program code for forwarding the energy saving command data to the at least one network device; program code for evaluating the energy saving command data by the network node; and program code for switching at least a portion of the network node to an energy saving state for saving energy at the network node, the network node at least one of receiving and outputting one of no data and a reduced volume of data to the at least one network device when the at least one network node is in the energy saving state; wherein the at least one portion of the network node to be switched to the energy saving sate is determined based on the ones of the network ports associated with the at least one network device in the energy saving state. | A method for saving energy at a network node in an automation network comprising receiving energy saving command data for switching at least one network device to an energy saving state, forwarding the energy saving command data to the network device, evaluating the energy saving command data by the network node, and saving energy at the network node. When the network node receives and/or outputs no data or a reduced volume of data to the network device during the energy saving state, the energy saving is effected by placing at least one portion of the network node into an energy saving state, where the portion is determined by any one of a plurality of network ports, which, because of the energy saving state of the network device, is being used to output and/or receive no data or a reduced volume of data.1. A method for saving energy at a network node in an automation network, the method comprising:
receiving energy saving command data for switching at least one network device of network devices connected to network ports at the network node to an energy saving state in which the at least one network device consumes less energy than in an operating state; forwarding the energy saving command data to the at least one network device; evaluating the energy saving command data by the network node; and switching at least a portion of the network node to an energy saving state to save energy at the network node, the network node at least one of receiving and outputting one of no data and a reduced volume of data to the at least one network device when the at least one network node is in the energy saving state; wherein the at least one portion of the network node to be switched to the energy saving sate is determined based on network ports associated with the at least one network device in the energy saving state. 2. The method as claimed in claim 1, further comprising:
receiving and evaluating, at the network node, a response signal in response to the energy saving command data from the at least one network device; wherein the energy saving at the network node is effected only after receipt and evaluation of the at least one response signal. 3. The method as claimed in claim 1, wherein the energy saving command data comprise one of a time period and an end time, which defines a period for which the at least one network device is switched to the energy saving state, and wherein the portion of the network node is switched to the energy saving state for one of a shorter time period or a same time period. 4. The method as claimed in claim 3, wherein, after the time period has elapsed, the network node automatically switches itself at least partially to the operating state, and produces energy saving termination command data which is transmitted to the at least one network device. 5. The method as claimed in claim 1, wherein at least one network port of the network ports includes at least two network devices connected to the at least one network port one of directly and indirectly, and wherein no data or a reduced volume of data is at least one of output and received through the at least one network port only when all of the at least two network devices are in the energy saving state. 6. The method as claimed in claims, further comprising:
receiving energy saving termination command data through a network port of the network ports, the energy saving termination command data, when received by the at least one network device, switching said at least one network device to the operating state with increased energy intake in comparison with the energy saving state; evaluating the energy saving termination command data by the network node; and re-switching on the network node which has at least partially been switched to the energy saving state; forwarding the energy saving termination command data to the at least one network device. 7. The method as claimed in claim 1, wherein the network node includes a buffer store configured to store data which are intended to be forwarded to the at least one network device when the at least one network device is in the energy saving state. 8. The method as claimed in claim 1, wherein the network node stores energy states of the network devices connected to network ports at the network node in a state memory, and wherein the energy state of each respective network device of network devices connected to network ports at the network node is one of the operating state and the energy saving state of the respective network device. 9. The method as claimed in claim 8, further comprising:
requesting an energy state of the at least one network device by a further network device by using energy state request command data which are transmitted through the network node; and reading, by the network node, a state of the network device from the state memory and outputting a response signal to the further network device upon receiving the energy state request command data; wherein the response signal comprises the energy state of the at least one network device. 10. The method as claimed in claim 1, wherein the automation network comprises a further network node connected to the network node by at least one of the network ports;
wherein further network devices are connected to the further network node, and wherein one of no data and a reduced volume of data for the network devices is output to the further network node through the network port only when all further network devices connected to the further network node are in the energy saving state. 11. The method as claimed in claim 1, wherein a connection between the network node and the at least one network device comprises a safety-relevant connection in the automation network; and wherein the safety-relevant connection is maintained irrespective of the energy saving at the network node. 12. A network node for an automation network, comprising:
network ports configured to receive energy saving command data for switching at least one network device to an energy saving state in which the at least one network device consumes less energy in than in an operating state; and a process and memory configured to forward the energy saving command data to the at least one network device, evaluate the energy saving command data, and save energy at the network node by switching at least a portion of the network node to an energy savings state; wherein the network node at least one of receives and outputs one of no data and a reduced volume of data to the at least one network device when in the energy saving state; and the at least a portion of the network node to be switched to the energy saving state being determined based on network ports associated with the at least one network device in the energy saving state. 13. An automation network including at least one network node as claimed in claim 12. 14. An automation network comprising at least one network node as claimed in claim 13. 15. A process in which a computer executes instructions set forth in a computer program executing on a processor which, when used on the computer cause the processor to save energy at a network node in an automation network, the computer program comprising:
program code for receiving energy saving command data for switching at least one network device of network devices connected to network ports at the network node to an energy saving state in which the at least one network device consumes less energy than in an operating state; program code for forwarding the energy saving command data to the at least one network device; program code for evaluating the energy saving command data by the network node; and program code for switching at least a portion of the network node to an energy saving state for saving energy at the network node, the network node at least one of receiving and outputting one of no data and a reduced volume of data to the at least one network device when the at least one network node is in the energy saving state; wherein the at least one portion of the network node to be switched to the energy saving sate is determined based on the ones of the network ports associated with the at least one network device in the energy saving state. | 2,100 |
4,555 | 12,700,160 | 2,179 | A robot system that includes a remote control station and a robot that has a camera, a monitor and a microphone. The robot includes a user interface that allows a user to link the remote control station to access the robot. By way of example, the user interface may include a list of remote control stations that can be selected by a user at the robot site to link the robot to the selected control station. The user interface can display a connectivity prompt that allows a user at the robot site to grant access to the robot. The connectivity prompt is generated in response to a request for access by a remote control station. The robot may include a laser pointer and a button that allows a user at the robot site to turn the laser pointer on and off. | 1. A robot system, comprising:
a remote control station; and, a robot that includes a camera, a monitor and a microphone, said robot including a user interface that allows a user to link said remote control station to said robot. 2. The robot system of claim 1, wherein said user interface includes a list of remote control stations that can be selected by the user. 3. The robot system of claim 1, wherein said user interface includes a list of robots that can be selected by the user. 4. The robot system of claim 1, wherein said user interface includes Menu buttons. 5. The robot system of claim 1, wherein said user interface includes a Connect button and a Disconnect button. 6. The robot system of claim 1, wherein said user interface provides a connectivity prompt. 7. The robot system of claim 1, wherein said robot includes a laser pointer and said user interface includes a button to turn said laser pointer on and off. 8. A method for providing a remote control station access to a robot, comprising:
displaying a user interface at a robot; and, selecting an input to link a remote control station to the robot. 9. The method of claim 8, wherein the user interface includes a list of remote control stations and the user selects one of the remote control stations to link the robot to the selected remote control station. 10. The method of claim 8, further comprising displaying on the user interface a list of robots and selecting one of the robots to link the robot to the selected robot. 11. The method of claim 8, wherein the remote control station is selected by manipulating Menu buttons of the user interface. 12. The method of claim 8, further comprising initiating a session by selecting a Connect button of the user interface and terminating the session by selecting a Disconnect button of the user interface. 13. The method of claim 8, wherein the user provides access to the robot by selecting a button displayed by the user interface in a connectivity prompt. 14. The method of claim 8, further comprising selecting a button of a user interface to turn on a laser pointer. 15. A robot system, comprising:
a remote control station; and, a robot that includes a camera, a monitor, a microphone, and a laser pointer, said robot including a user interface that allows a user to allow said remote control station to turn said laser pointer on and off. 16. A robot system, comprising:
a first robot that has a camera and a monitor; and, a second robot that includes a camera, a monitor and a microphone, said second robot including a user interface that allows a user to link said first and second robots. 17. The robot system of claim 16, wherein said user interface includes a list of robots that can be selected by the user. 18. The robot system of claim 16, wherein said user interface includes Menu buttons. 19. The robot system of claim 16, wherein said user interface includes a Connect button and a Disconnect button. 20. The robot system of claim 16, wherein said user interface provides a connectivity prompt. 21. The robot system of claim 16, wherein said robot includes a laser pointer and said user interface includes a button to turn said laser pointer on and off. 22. A method for linking a first robot to a second robot, comprising:
displaying a user interface at a first robot; and, selecting an input to link the first robot to a second robot. 23. The method of claim 22, wherein the user interface includes a list of robots and the user selects one of the robots to link the first and second robots. 24. The method of claim 22, wherein the remote control station is selected by manipulating Menu buttons of the user interface. 25. The method of claim 22, further comprising initiating a session by selecting a Connect button of the user interface and terminating the session by selecting a Disconnect button of the user interface. 27. The method of claim 22, wherein the user provides access to the robot by selecting a button displayed by the user interface in a connectivity prompt. 28. The method of claim 22, further comprising selecting a button of a user interface to turn on a laser pointer. | A robot system that includes a remote control station and a robot that has a camera, a monitor and a microphone. The robot includes a user interface that allows a user to link the remote control station to access the robot. By way of example, the user interface may include a list of remote control stations that can be selected by a user at the robot site to link the robot to the selected control station. The user interface can display a connectivity prompt that allows a user at the robot site to grant access to the robot. The connectivity prompt is generated in response to a request for access by a remote control station. The robot may include a laser pointer and a button that allows a user at the robot site to turn the laser pointer on and off.1. A robot system, comprising:
a remote control station; and, a robot that includes a camera, a monitor and a microphone, said robot including a user interface that allows a user to link said remote control station to said robot. 2. The robot system of claim 1, wherein said user interface includes a list of remote control stations that can be selected by the user. 3. The robot system of claim 1, wherein said user interface includes a list of robots that can be selected by the user. 4. The robot system of claim 1, wherein said user interface includes Menu buttons. 5. The robot system of claim 1, wherein said user interface includes a Connect button and a Disconnect button. 6. The robot system of claim 1, wherein said user interface provides a connectivity prompt. 7. The robot system of claim 1, wherein said robot includes a laser pointer and said user interface includes a button to turn said laser pointer on and off. 8. A method for providing a remote control station access to a robot, comprising:
displaying a user interface at a robot; and, selecting an input to link a remote control station to the robot. 9. The method of claim 8, wherein the user interface includes a list of remote control stations and the user selects one of the remote control stations to link the robot to the selected remote control station. 10. The method of claim 8, further comprising displaying on the user interface a list of robots and selecting one of the robots to link the robot to the selected robot. 11. The method of claim 8, wherein the remote control station is selected by manipulating Menu buttons of the user interface. 12. The method of claim 8, further comprising initiating a session by selecting a Connect button of the user interface and terminating the session by selecting a Disconnect button of the user interface. 13. The method of claim 8, wherein the user provides access to the robot by selecting a button displayed by the user interface in a connectivity prompt. 14. The method of claim 8, further comprising selecting a button of a user interface to turn on a laser pointer. 15. A robot system, comprising:
a remote control station; and, a robot that includes a camera, a monitor, a microphone, and a laser pointer, said robot including a user interface that allows a user to allow said remote control station to turn said laser pointer on and off. 16. A robot system, comprising:
a first robot that has a camera and a monitor; and, a second robot that includes a camera, a monitor and a microphone, said second robot including a user interface that allows a user to link said first and second robots. 17. The robot system of claim 16, wherein said user interface includes a list of robots that can be selected by the user. 18. The robot system of claim 16, wherein said user interface includes Menu buttons. 19. The robot system of claim 16, wherein said user interface includes a Connect button and a Disconnect button. 20. The robot system of claim 16, wherein said user interface provides a connectivity prompt. 21. The robot system of claim 16, wherein said robot includes a laser pointer and said user interface includes a button to turn said laser pointer on and off. 22. A method for linking a first robot to a second robot, comprising:
displaying a user interface at a first robot; and, selecting an input to link the first robot to a second robot. 23. The method of claim 22, wherein the user interface includes a list of robots and the user selects one of the robots to link the first and second robots. 24. The method of claim 22, wherein the remote control station is selected by manipulating Menu buttons of the user interface. 25. The method of claim 22, further comprising initiating a session by selecting a Connect button of the user interface and terminating the session by selecting a Disconnect button of the user interface. 27. The method of claim 22, wherein the user provides access to the robot by selecting a button displayed by the user interface in a connectivity prompt. 28. The method of claim 22, further comprising selecting a button of a user interface to turn on a laser pointer. | 2,100 |
4,556 | 13,601,666 | 2,159 | In one embodiment, a method includes accessing one or more graphs stored in one or more data stores, each graph comprising one or more nodes arranged in a hierarchical format, each node representing one or more data items, each data item having a particular one of a plurality of data types; generating a first query requesting a data structures of a specific data type; retrieving the data structure of the specific data type from the graphs; generating a second query requesting one or more specific data items having the specific data type, the second query being expressed in a format corresponding to the retrieved data structure of the specific data type; and retrieving the specific data items from the graphs. | 1. A computer-implemented method comprising:
accessing one or more graphs stored in one or more data stores, each graph comprising one or more nodes arranged in a hierarchical format, each node representing one or more data items, each data item having a particular one of a plurality of data types; generating a first query requesting a data structures of a specific data type; retrieving the data structure of the specific data type from the graphs; generating a second query requesting one or more specific data items having the specific data type, the second query being expressed in a format corresponding to the retrieved data structure of the specific data type; and retrieving the specific data items from the graphs. 2. The computer-implemented method of claim 1, wherein retrieving the specific data items from the graphs further comprises:
validating the retrieved data items based on the retrieved data structure of the specific data type. 3. The computer-implemented method of claim 1, wherein a data type comprises a hierarchical data structure. 4. The computer-implemented method of claim 1, wherein the retrieved data items are expressed in a JavaScript Object Notation (JSON) format. 5. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
access one or more graphs stored in one or more data stores, each graph comprising one or more nodes arranged in a hierarchical format, each node representing one or more data items, each data item having a particular one of a plurality of data types; generate a first query requesting a data structures of a specific data type; retrieve the data structure of the specific data type from the graphs; generate a second query requesting one or more specific data items having the specific data type, the second query being expressed in a format corresponding to the retrieved data structure of the specific data type; and retrieve the specific data items from the graphs. 6. The media of claim 5, wherein retrieve the specific data items from the graphs further comprises:
validate the retrieved data items based on the retrieved data structure of the specific data type. 7. The media of claim 5, wherein a data type comprises a hierarchical data structure. 8. The media of claim 5, wherein the retrieved data items are expressed in a JavaScript Object Notation (JSON) format. 9. A system comprising:
one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to: access one or more graphs stored in one or more data stores, each graph comprising one or more nodes arranged in a hierarchical format, each node representing one or more data items, each data item having a particular one of a plurality of data types; generate a first query requesting a data structures of a specific data type; retrieve the data structure of the specific data type from the graphs; generate a second query requesting one or more specific data items having the specific data type, the second query being expressed in a format corresponding to the retrieved data structure of the specific data type; and retrieve the specific data items from the graphs. 10. The system of claim 9, wherein retrieve the specific data items from the graphs further comprises:
validate the retrieved data items based on the retrieved data structure of the specific data type. 11. The system of claim 9, wherein a data type comprises a hierarchical data structure. 12. The system of claim 9, wherein the retrieved data items are expressed in a JavaScript Object Notation (JSON) format. | In one embodiment, a method includes accessing one or more graphs stored in one or more data stores, each graph comprising one or more nodes arranged in a hierarchical format, each node representing one or more data items, each data item having a particular one of a plurality of data types; generating a first query requesting a data structures of a specific data type; retrieving the data structure of the specific data type from the graphs; generating a second query requesting one or more specific data items having the specific data type, the second query being expressed in a format corresponding to the retrieved data structure of the specific data type; and retrieving the specific data items from the graphs.1. A computer-implemented method comprising:
accessing one or more graphs stored in one or more data stores, each graph comprising one or more nodes arranged in a hierarchical format, each node representing one or more data items, each data item having a particular one of a plurality of data types; generating a first query requesting a data structures of a specific data type; retrieving the data structure of the specific data type from the graphs; generating a second query requesting one or more specific data items having the specific data type, the second query being expressed in a format corresponding to the retrieved data structure of the specific data type; and retrieving the specific data items from the graphs. 2. The computer-implemented method of claim 1, wherein retrieving the specific data items from the graphs further comprises:
validating the retrieved data items based on the retrieved data structure of the specific data type. 3. The computer-implemented method of claim 1, wherein a data type comprises a hierarchical data structure. 4. The computer-implemented method of claim 1, wherein the retrieved data items are expressed in a JavaScript Object Notation (JSON) format. 5. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
access one or more graphs stored in one or more data stores, each graph comprising one or more nodes arranged in a hierarchical format, each node representing one or more data items, each data item having a particular one of a plurality of data types; generate a first query requesting a data structures of a specific data type; retrieve the data structure of the specific data type from the graphs; generate a second query requesting one or more specific data items having the specific data type, the second query being expressed in a format corresponding to the retrieved data structure of the specific data type; and retrieve the specific data items from the graphs. 6. The media of claim 5, wherein retrieve the specific data items from the graphs further comprises:
validate the retrieved data items based on the retrieved data structure of the specific data type. 7. The media of claim 5, wherein a data type comprises a hierarchical data structure. 8. The media of claim 5, wherein the retrieved data items are expressed in a JavaScript Object Notation (JSON) format. 9. A system comprising:
one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to: access one or more graphs stored in one or more data stores, each graph comprising one or more nodes arranged in a hierarchical format, each node representing one or more data items, each data item having a particular one of a plurality of data types; generate a first query requesting a data structures of a specific data type; retrieve the data structure of the specific data type from the graphs; generate a second query requesting one or more specific data items having the specific data type, the second query being expressed in a format corresponding to the retrieved data structure of the specific data type; and retrieve the specific data items from the graphs. 10. The system of claim 9, wherein retrieve the specific data items from the graphs further comprises:
validate the retrieved data items based on the retrieved data structure of the specific data type. 11. The system of claim 9, wherein a data type comprises a hierarchical data structure. 12. The system of claim 9, wherein the retrieved data items are expressed in a JavaScript Object Notation (JSON) format. | 2,100 |
4,557 | 14,300,525 | 2,175 | A method for displaying an integrated communication history of a user terminal includes transmitting or receiving a content using an integrated communication service, collecting communication history of content transmission or reception using the integrated communication service, and generating a user interface feature based on the communication history. A user terminal to display an integrated communication history includes an integrated communication provider to support an integrated communication service, a communicator to transmit or receive content using the integrated communication service, a communication history manager to collect communication history of content transmission or reception using the integrated communication service, an interface manager to generate a user interface feature based on the communication history, and an image display to display a user interface comprising the user interface feature. | 1. A method for displaying an integrated communication history of a user terminal, the method comprising:
transmitting or receiving a content using an integrated communication service; collecting communication history of content transmission or reception using the integrated communication service; and generating a user interface feature based on the communication history. 2. The method of claim 1, further comprising:
displaying the communication history in association with the user interface feature. 3. The method of claim 1, wherein the communication history comprises content information associated with the transmitted or received content. 4. The method of claim 3, further comprising:
classifying the contents according to a content type based on the content information. 5. The method of claim 1, further comprising:
determining whether an application is running in the user terminal, wherein the application is an application associated with a Rich Communication Suite (RCS). 6. The method of claim 1, wherein the collecting of the communication history comprises:
monitoring communication activities of the user terminal in an integrated communication environment; collecting content information when a communication activity is detected; and generating the communication history using at least one piece of content information. 7. The method of claim 6, wherein content information comprises at least one of a file extension, a file name, a time of transmission or reception, and sender or recipient information. 8. The method of claim 6, wherein the content information is collected by analyzing header information of the content. 9. The method of claim 1, wherein the generating a user interface feature comprises:
loading the communication history; and displaying a user interface comprising a user interface set by an application stored in the user terminal and the generated user interface feature. 10. The method of claim 9, further comprising:
selecting a communication history for loading, wherein the communication history to be loaded is selected based on at least one of a content type, sender information, and information included in an address book. 11. The method of claim 1, wherein the user interface feature comprises at least one of an icon, a text book, a drop down menu, a menu button for performing an operation, and a menu list. 12. The method of claim 1, wherein the user interface feature indicates a type of the content transmitted or received by the user terminal. 13. The method of claim 9, wherein the user interface is displayed to hide locked content. 14. The method of claim 9, wherein the user interface is displayed with respect to at least one of a content type, sender or recipient information associated with the communication history, and a contact stored in the user terminal. 15. The method of claim 1, wherein the integrated communication service includes an RCS service. 16. A user terminal to display an integrated communication history, the user terminal comprising:
an integrated communication provider to support an integrated communication service; a communicator to transmit or receive content using the integrated communication service; a communication history manager to collect communication history of content transmission or reception using the integrated communication service; an interface manager to generate a user interface feature based on the communication history; and an image display to display a user interface comprising the user interface feature. 17. The user terminal of claim 16, wherein the image display displays the communication history in association with the user interface feature. 18. The user terminal of claim 16, wherein the communication history manager monitors communication activities of the user terminal in an integrated communication environment, collects content information when a communication activity is detected, and generates the communication history using at least one piece of content information. 19. The user terminal of claim 16, wherein the interface manager loads the communication history, and the image display displays a user interface set by an application stored in the user terminal and the generated user interface feature. 20. The user terminal of claim 16, wherein the user interface feature indicates a type of the content transmitted or received by the user terminal. 21. The user terminal of claim 16, wherein the integrated communication service includes a Rich Communication Suite (RCS) service. 22. A method for displaying an integrated communication history of a user terminal, the method comprising:
collecting content transmission or reception history in an integrated communication environment; and displaying a user interface comprising information associated with the content transmission or reception history. | A method for displaying an integrated communication history of a user terminal includes transmitting or receiving a content using an integrated communication service, collecting communication history of content transmission or reception using the integrated communication service, and generating a user interface feature based on the communication history. A user terminal to display an integrated communication history includes an integrated communication provider to support an integrated communication service, a communicator to transmit or receive content using the integrated communication service, a communication history manager to collect communication history of content transmission or reception using the integrated communication service, an interface manager to generate a user interface feature based on the communication history, and an image display to display a user interface comprising the user interface feature.1. A method for displaying an integrated communication history of a user terminal, the method comprising:
transmitting or receiving a content using an integrated communication service; collecting communication history of content transmission or reception using the integrated communication service; and generating a user interface feature based on the communication history. 2. The method of claim 1, further comprising:
displaying the communication history in association with the user interface feature. 3. The method of claim 1, wherein the communication history comprises content information associated with the transmitted or received content. 4. The method of claim 3, further comprising:
classifying the contents according to a content type based on the content information. 5. The method of claim 1, further comprising:
determining whether an application is running in the user terminal, wherein the application is an application associated with a Rich Communication Suite (RCS). 6. The method of claim 1, wherein the collecting of the communication history comprises:
monitoring communication activities of the user terminal in an integrated communication environment; collecting content information when a communication activity is detected; and generating the communication history using at least one piece of content information. 7. The method of claim 6, wherein content information comprises at least one of a file extension, a file name, a time of transmission or reception, and sender or recipient information. 8. The method of claim 6, wherein the content information is collected by analyzing header information of the content. 9. The method of claim 1, wherein the generating a user interface feature comprises:
loading the communication history; and displaying a user interface comprising a user interface set by an application stored in the user terminal and the generated user interface feature. 10. The method of claim 9, further comprising:
selecting a communication history for loading, wherein the communication history to be loaded is selected based on at least one of a content type, sender information, and information included in an address book. 11. The method of claim 1, wherein the user interface feature comprises at least one of an icon, a text book, a drop down menu, a menu button for performing an operation, and a menu list. 12. The method of claim 1, wherein the user interface feature indicates a type of the content transmitted or received by the user terminal. 13. The method of claim 9, wherein the user interface is displayed to hide locked content. 14. The method of claim 9, wherein the user interface is displayed with respect to at least one of a content type, sender or recipient information associated with the communication history, and a contact stored in the user terminal. 15. The method of claim 1, wherein the integrated communication service includes an RCS service. 16. A user terminal to display an integrated communication history, the user terminal comprising:
an integrated communication provider to support an integrated communication service; a communicator to transmit or receive content using the integrated communication service; a communication history manager to collect communication history of content transmission or reception using the integrated communication service; an interface manager to generate a user interface feature based on the communication history; and an image display to display a user interface comprising the user interface feature. 17. The user terminal of claim 16, wherein the image display displays the communication history in association with the user interface feature. 18. The user terminal of claim 16, wherein the communication history manager monitors communication activities of the user terminal in an integrated communication environment, collects content information when a communication activity is detected, and generates the communication history using at least one piece of content information. 19. The user terminal of claim 16, wherein the interface manager loads the communication history, and the image display displays a user interface set by an application stored in the user terminal and the generated user interface feature. 20. The user terminal of claim 16, wherein the user interface feature indicates a type of the content transmitted or received by the user terminal. 21. The user terminal of claim 16, wherein the integrated communication service includes a Rich Communication Suite (RCS) service. 22. A method for displaying an integrated communication history of a user terminal, the method comprising:
collecting content transmission or reception history in an integrated communication environment; and displaying a user interface comprising information associated with the content transmission or reception history. | 2,100 |
4,558 | 13,836,745 | 2,157 | Content that is significant to a user may be determined. An indication that a user finds content within a document significant may be received. In response to the received indication, the document may be analyzed to identify a set of topics associated with the content of the document. From the set of topics, a subset of topics responsible for the user finding the document significant may be identified. A user profile associated with the user may be updated based on the subset of topics. | 1. A method for determining content that is significant to a user, the method comprising:
receiving an indication that a user finds content within a document significant; analyzing the document to identify a set of topics associated with the content of the document in response to the received indication; identifying, from the set of topics, a subset of topics responsible for the user finding the document significant; and updating a user profile associated with the user based on the subset of topics. 2. The method of claim 1 wherein the subset of topics comprises a single topic. 3. The method of claim 1 wherein the subset of topics comprises multiple topics. 4. The method of claim 1 further comprising determining content within the document that is related to the subset of topics. 5. The method of claim 4 wherein updating the user profile based on the subset of topics comprises updating the user profile based on the determined content within the document. 6. The method of claim 1 wherein identifying a subset of topics comprises:
enabling the user to perceive the set of topics;
prompting the user to select a particular topic that is related to the indication; and
receiving, from the user, a selection of the particular topic that is related to the indication. 7. The method of claim 1 wherein identifying a subset of topics comprises:
accessing the user profile associated with the user;
determining topics identified as being significant to the user based on the user profile;
comparing the set of topics to the determined topics; and
based on the comparison, identifying the subset of topics. 8. The method of claim 7 wherein the topics previously indicated as being significant to the user were selected by the user. 9. The method of claim 1 wherein identifying the subset of topics comprises:
selecting one of the topics from among the set of topics as a particular topic that is related to the indication;
presenting the particular topic to the user; and
enabling the user to veto the particular topic as the topic that is related to the indication. 10. The method of claim 9 further comprising, as part of the veto, enabling the user to identify a different topic as the particular topic. 11. The method of claim 1 wherein receiving an indication that a user finds content within a document significant includes receiving an indication of selection by a user of a content significance user interface element. 12. The method of claim 11 wherein the content significance user interface element floats within a display that is perceivable to the user. 13. The method of claim 11 wherein the content significance user interface element is included in a toolbar of a browser application. 14. The method of claim 11 wherein the content significance user interface element is configured such that selection of the element indicates that the user is interested in particular content. 15. The method of claim 11 wherein the content significance user interface element is configured such that selection of the element indicates that the user is not interested in particular content. 16. The method of claim 1 wherein analyzing the document to determine more than one topic associated with the content of the document comprises:
determining content being viewed or accessed by the user at the time the indication was received;
determining a type for the viewed or accessed content;
cleaning up the viewed or accessed content based on the type, wherein cleaning up the viewed or accessed content includes removing information that is extraneous to the content actually viewed or accessed by the user; and
determining significant content from the cleaned-up content. 17. The method of claim 16 wherein the content being viewed by the user includes content within the document that was perceivable to the user at the time the indication was received. 18. The method of claim 17 wherein the content that was perceivable to the user includes content that was presented for display to the user. 19. The method of claim 16 wherein the content being accessed by the user includes all content within the document regardless of whether the content was currently perceivable to the user at the time the indication was received. 20. The method of claim 16 wherein the type for the viewed or accessed content is determined based on the method used in determining the content being viewed or accessed by the user at the time the indication was received. 21.-52. (canceled) | Content that is significant to a user may be determined. An indication that a user finds content within a document significant may be received. In response to the received indication, the document may be analyzed to identify a set of topics associated with the content of the document. From the set of topics, a subset of topics responsible for the user finding the document significant may be identified. A user profile associated with the user may be updated based on the subset of topics.1. A method for determining content that is significant to a user, the method comprising:
receiving an indication that a user finds content within a document significant; analyzing the document to identify a set of topics associated with the content of the document in response to the received indication; identifying, from the set of topics, a subset of topics responsible for the user finding the document significant; and updating a user profile associated with the user based on the subset of topics. 2. The method of claim 1 wherein the subset of topics comprises a single topic. 3. The method of claim 1 wherein the subset of topics comprises multiple topics. 4. The method of claim 1 further comprising determining content within the document that is related to the subset of topics. 5. The method of claim 4 wherein updating the user profile based on the subset of topics comprises updating the user profile based on the determined content within the document. 6. The method of claim 1 wherein identifying a subset of topics comprises:
enabling the user to perceive the set of topics;
prompting the user to select a particular topic that is related to the indication; and
receiving, from the user, a selection of the particular topic that is related to the indication. 7. The method of claim 1 wherein identifying a subset of topics comprises:
accessing the user profile associated with the user;
determining topics identified as being significant to the user based on the user profile;
comparing the set of topics to the determined topics; and
based on the comparison, identifying the subset of topics. 8. The method of claim 7 wherein the topics previously indicated as being significant to the user were selected by the user. 9. The method of claim 1 wherein identifying the subset of topics comprises:
selecting one of the topics from among the set of topics as a particular topic that is related to the indication;
presenting the particular topic to the user; and
enabling the user to veto the particular topic as the topic that is related to the indication. 10. The method of claim 9 further comprising, as part of the veto, enabling the user to identify a different topic as the particular topic. 11. The method of claim 1 wherein receiving an indication that a user finds content within a document significant includes receiving an indication of selection by a user of a content significance user interface element. 12. The method of claim 11 wherein the content significance user interface element floats within a display that is perceivable to the user. 13. The method of claim 11 wherein the content significance user interface element is included in a toolbar of a browser application. 14. The method of claim 11 wherein the content significance user interface element is configured such that selection of the element indicates that the user is interested in particular content. 15. The method of claim 11 wherein the content significance user interface element is configured such that selection of the element indicates that the user is not interested in particular content. 16. The method of claim 1 wherein analyzing the document to determine more than one topic associated with the content of the document comprises:
determining content being viewed or accessed by the user at the time the indication was received;
determining a type for the viewed or accessed content;
cleaning up the viewed or accessed content based on the type, wherein cleaning up the viewed or accessed content includes removing information that is extraneous to the content actually viewed or accessed by the user; and
determining significant content from the cleaned-up content. 17. The method of claim 16 wherein the content being viewed by the user includes content within the document that was perceivable to the user at the time the indication was received. 18. The method of claim 17 wherein the content that was perceivable to the user includes content that was presented for display to the user. 19. The method of claim 16 wherein the content being accessed by the user includes all content within the document regardless of whether the content was currently perceivable to the user at the time the indication was received. 20. The method of claim 16 wherein the type for the viewed or accessed content is determined based on the method used in determining the content being viewed or accessed by the user at the time the indication was received. 21.-52. (canceled) | 2,100 |
4,559 | 13,460,274 | 2,141 | Systems and methods are described herein to provide a user-interface to visualize and control a beam request panel for requesting allocation of usage of a shared therapy beam. The user interface allows a user to visualize a beam request queue, to request the shared therapy beam for treatment, to estimate when a beam request will be fulfilled, and to cancel a beam request if needed. | 1. A system comprising:
a plurality of integrated beam request panels, an integrated beam request panel of the plurality of integrated beam request panels being configured to execute:
a beam request interface, the beam request interface being operable to submit a beam request for use of a shared proton beam into a beam request queue; and
a beam request display for displaying an arranged order of beam requests submitted from the plurality of integrated beam request panels, and indicating a position in the beam request queue of the beam request submitted from the beam request interface of the corresponding integrated beam request panel,
wherein the plurality of integrated beam request panels are executed on a plurality of communicatively coupled computing devices. 2. The system according to claim 1, wherein an integrated beam request panel further comprises a calculation engine configured to estimate a time until the shared proton beam is available for a beam request submitted through the beam request interface of the integrated beam request panel. 3. The system according to claim 2, wherein the beam request display of an integrated beam request panel is further operable to display the estimated time until the shared proton beam is available for the beam request submitted through the beam request interface of the integrated beam request panel. 4. The system according to claim 1, wherein the beam request display of an integrated beam request panel is further operable to display an indication that the shared proton beam is available for the beam request submitted through the beam request interface of the integrated beam request panel. 5. The system according to claim 1, wherein the beam request interface of an integrated beam request panel is further operable to submit a priority for a beam request submitted through the beam request interface. 6. The system according to claim 1, wherein the beam request display of an integrated beam request panel is further operable to display a priority corresponding to each beam request in the beam queue. 7. The system according to claim 1, wherein the shared proton beam comprises a shared proton treatment beam used to perform a proton treatment session in a treatment room of a plurality of treatment rooms. 8. The system according to claim 7, wherein the plurality of communicatively coupled computing devices are distributed among the plurality of treatment rooms. 9. The system according to claim 8, wherein a beam request for use of the shared proton beam comprises a beam request for usage of the shared proton beam in the treatment room comprising the computing device executing the integrated beam request panel. 10. The system according to claim 8, wherein the proton treatment comprises directing the proton treatment beam at a field of a plurality of treatment fields, the plurality of treatment fields comprising regions disposed within a target treatment subject. 11. The system according to claim 10, wherein the shared proton beam has a corresponding adjustable dosage. 12. The system according to claim 11, wherein the dosage of the shared proton beam is adjusted based on a treatment plan devised for the target treatment subject. 13. The system according to claim 12, wherein the plurality of treatment fields comprising regions disposed within a target treatment subject correspond to the treatment plan devised for the target treatment subject. 14. A method for implementing an integrated beam-request interface, the method comprising:
receiving, as input, a user actuation in a beam request interface of an integrated beam-request panel, the user actuation comprising a first request for usage of a shared treatment beam; determining a priority corresponding to the first request for usage of the shared treatment beam among a plurality of requests for usage of the shared treatment beam; appending the first request to a position in a beam queue comprising the plurality of requests for usage of the shared treatment beam based on the priority of the first request; generating a visualization of the beam queue; displaying the visualization of the beam queue in a display panel of the integrated beam-request panel; and allocating usage of the shared treatment beam according to the beam queue, wherein the integrated beam-request panel comprises a first instance of a plurality of instances of the integrated beam-request panel executed on a plurality of computing devices in a plurality of treatment rooms. 15. The method according to claim 14 further comprising:
receiving, as input, a user actuation in a beam-request interface of a second instance of the integrated beam-request panel, the user actuation comprising a second request for usage of the shared treatment beam, the second request having a higher priority than the first request;
re-ordering the beam queue such that an order of the beam queue indicates that the second request is to be fulfilled before the first request;
dynamically adjusting the visualization of the beam queue in each instance of the plurality of instances of the beam-request interface to reflect the re-ordered beam queue; and
allocating usage of the shared treatment beam according to the re- ordered beam queue. 16. The method according to claim 14, wherein the generating a visualization of the beam queue comprises automatically generating a customized visualization for each instance of the integrated beam-request panel. 17. The method according to claim 16, wherein the automatically generating a customized visualization for each instance of the integrated beam-request panel comprises automatically generating a customized visualization for each beam-request interface that includes at least one of the following pieces of information:
a respective position of any beam requests submitted by a current user of the beam-request interface in the beam queue; an estimated time remaining until the current user of the beam-request interface is granted usage of the shared treatment beam; an established priority of any beam requests submitted by a current user of the beam-request interface in the beam queue; and a scope of any beam requests submitted by a current user of the beam-request interface in the beam queue. 18. The method according to claim 17, wherein the scope of a beam request comprises one of: a beam request for a single field, a beam request for a plurality of single fields, or a beam request for a group of fields, the group of fields comprising a plurality of associated fields. 19. A computer readable medium containing program instructions embodied therein for causing a computer system to synchronize management of a shared therapy beam among a plurality of distributed display panels, the program instructions comprising:
instructions to implement an instance of a beam-request interface; instructions to receive as input, a user actuation of the instance of the beam-request interface, the user actuation corresponding to a first request for usage of the shared treatment beam; instructions to determine a priority corresponding to the first request for usage of the shared treatment beam; instructions to automatically append, in a beam queue, the first request for usage of the shared treatment beam; instructions to automatically generate a visualization of the beam queue for each instance of a plurality of instances of the beam-request interface; and instructions to automatically distribute usage of the shared treatment beam according to the beam queue. 20. The computer readable medium according to claim 19 further comprising:
instructions to receive, as input, a user actuation in a beam-request interface of a second instance of the integrated beam-request panel, the user actuation comprising a second request for usage of the shared treatment beam, the second request having a higher priority than the first request;
instructions to re-order the beam queue such that an order of the beam queue indicates that the second request is to be fulfilled before the first request;
instruction to dynamically adjust the visualization of the beam queue in each instance of the plurality of instances of the beam-request interface to reflect the re-ordered beam queue; and
instructions to allocate usage of the shared treatment beam according to the re-ordered beam queue. | Systems and methods are described herein to provide a user-interface to visualize and control a beam request panel for requesting allocation of usage of a shared therapy beam. The user interface allows a user to visualize a beam request queue, to request the shared therapy beam for treatment, to estimate when a beam request will be fulfilled, and to cancel a beam request if needed.1. A system comprising:
a plurality of integrated beam request panels, an integrated beam request panel of the plurality of integrated beam request panels being configured to execute:
a beam request interface, the beam request interface being operable to submit a beam request for use of a shared proton beam into a beam request queue; and
a beam request display for displaying an arranged order of beam requests submitted from the plurality of integrated beam request panels, and indicating a position in the beam request queue of the beam request submitted from the beam request interface of the corresponding integrated beam request panel,
wherein the plurality of integrated beam request panels are executed on a plurality of communicatively coupled computing devices. 2. The system according to claim 1, wherein an integrated beam request panel further comprises a calculation engine configured to estimate a time until the shared proton beam is available for a beam request submitted through the beam request interface of the integrated beam request panel. 3. The system according to claim 2, wherein the beam request display of an integrated beam request panel is further operable to display the estimated time until the shared proton beam is available for the beam request submitted through the beam request interface of the integrated beam request panel. 4. The system according to claim 1, wherein the beam request display of an integrated beam request panel is further operable to display an indication that the shared proton beam is available for the beam request submitted through the beam request interface of the integrated beam request panel. 5. The system according to claim 1, wherein the beam request interface of an integrated beam request panel is further operable to submit a priority for a beam request submitted through the beam request interface. 6. The system according to claim 1, wherein the beam request display of an integrated beam request panel is further operable to display a priority corresponding to each beam request in the beam queue. 7. The system according to claim 1, wherein the shared proton beam comprises a shared proton treatment beam used to perform a proton treatment session in a treatment room of a plurality of treatment rooms. 8. The system according to claim 7, wherein the plurality of communicatively coupled computing devices are distributed among the plurality of treatment rooms. 9. The system according to claim 8, wherein a beam request for use of the shared proton beam comprises a beam request for usage of the shared proton beam in the treatment room comprising the computing device executing the integrated beam request panel. 10. The system according to claim 8, wherein the proton treatment comprises directing the proton treatment beam at a field of a plurality of treatment fields, the plurality of treatment fields comprising regions disposed within a target treatment subject. 11. The system according to claim 10, wherein the shared proton beam has a corresponding adjustable dosage. 12. The system according to claim 11, wherein the dosage of the shared proton beam is adjusted based on a treatment plan devised for the target treatment subject. 13. The system according to claim 12, wherein the plurality of treatment fields comprising regions disposed within a target treatment subject correspond to the treatment plan devised for the target treatment subject. 14. A method for implementing an integrated beam-request interface, the method comprising:
receiving, as input, a user actuation in a beam request interface of an integrated beam-request panel, the user actuation comprising a first request for usage of a shared treatment beam; determining a priority corresponding to the first request for usage of the shared treatment beam among a plurality of requests for usage of the shared treatment beam; appending the first request to a position in a beam queue comprising the plurality of requests for usage of the shared treatment beam based on the priority of the first request; generating a visualization of the beam queue; displaying the visualization of the beam queue in a display panel of the integrated beam-request panel; and allocating usage of the shared treatment beam according to the beam queue, wherein the integrated beam-request panel comprises a first instance of a plurality of instances of the integrated beam-request panel executed on a plurality of computing devices in a plurality of treatment rooms. 15. The method according to claim 14 further comprising:
receiving, as input, a user actuation in a beam-request interface of a second instance of the integrated beam-request panel, the user actuation comprising a second request for usage of the shared treatment beam, the second request having a higher priority than the first request;
re-ordering the beam queue such that an order of the beam queue indicates that the second request is to be fulfilled before the first request;
dynamically adjusting the visualization of the beam queue in each instance of the plurality of instances of the beam-request interface to reflect the re-ordered beam queue; and
allocating usage of the shared treatment beam according to the re- ordered beam queue. 16. The method according to claim 14, wherein the generating a visualization of the beam queue comprises automatically generating a customized visualization for each instance of the integrated beam-request panel. 17. The method according to claim 16, wherein the automatically generating a customized visualization for each instance of the integrated beam-request panel comprises automatically generating a customized visualization for each beam-request interface that includes at least one of the following pieces of information:
a respective position of any beam requests submitted by a current user of the beam-request interface in the beam queue; an estimated time remaining until the current user of the beam-request interface is granted usage of the shared treatment beam; an established priority of any beam requests submitted by a current user of the beam-request interface in the beam queue; and a scope of any beam requests submitted by a current user of the beam-request interface in the beam queue. 18. The method according to claim 17, wherein the scope of a beam request comprises one of: a beam request for a single field, a beam request for a plurality of single fields, or a beam request for a group of fields, the group of fields comprising a plurality of associated fields. 19. A computer readable medium containing program instructions embodied therein for causing a computer system to synchronize management of a shared therapy beam among a plurality of distributed display panels, the program instructions comprising:
instructions to implement an instance of a beam-request interface; instructions to receive as input, a user actuation of the instance of the beam-request interface, the user actuation corresponding to a first request for usage of the shared treatment beam; instructions to determine a priority corresponding to the first request for usage of the shared treatment beam; instructions to automatically append, in a beam queue, the first request for usage of the shared treatment beam; instructions to automatically generate a visualization of the beam queue for each instance of a plurality of instances of the beam-request interface; and instructions to automatically distribute usage of the shared treatment beam according to the beam queue. 20. The computer readable medium according to claim 19 further comprising:
instructions to receive, as input, a user actuation in a beam-request interface of a second instance of the integrated beam-request panel, the user actuation comprising a second request for usage of the shared treatment beam, the second request having a higher priority than the first request;
instructions to re-order the beam queue such that an order of the beam queue indicates that the second request is to be fulfilled before the first request;
instruction to dynamically adjust the visualization of the beam queue in each instance of the plurality of instances of the beam-request interface to reflect the re-ordered beam queue; and
instructions to allocate usage of the shared treatment beam according to the re-ordered beam queue. | 2,100 |
4,560 | 14,765,107 | 2,136 | Disclosed herein are techniques for managing the performance of a storage system. A subset of a plurality of storage units is associated with a rule that specifies a number of input and output transactions and a number of bits per time unit. The associations are adjusted in accordance with a performance policy and changes in the subset of the plurality of storage units. | 1. A system comprising:
a plurality of storage units; configurable rules to specify a number of input and output transactions that at least one processor may execute per time unit on a subset of the plurality of storage units and a number of bits that at least one processor may process per time unit on the subset; and a mapping module which, if executed, instructs at least one processor to alter associations between the configurable rules and the subset in accordance with changes in a status of the subset, while maintaining adherence to a predetermined performance policy. 2. The system of claim 1, wherein each configurable rule is associated with a priority such that, when least one processor schedules input and output transactions across the plurality of storage units, the schedule is in accordance with the priority. 3. The system of claim 2, wherein the priority associated with each configurable rule is based on the predetermined performance policy. 4. The system of claim 1, wherein each subset of the plurality of storage units is arranged as a logical storage unit. 5. The system of claim 4, wherein the logical storage unit comprises a volume, a volume set, a domain, a domain set, or a host. 6. A non-transitory computer readable medium having instructions therein which, if executed, cause a processor to:
associate a subset of a plurality of storage units with a rule that specifies a number of input and output transactions that the subset may execute per time unit and a number of bits that the subset may process per time unit; determine a status of the subset; adjust an association between the subset and a rule in accordance with a change in status of the subset; and ensure the adjustment does not violate a predetermined performance policy. 7. The non-transitory computer readable medium of claim 6, wherein each rule is associated with a priority such that a schedule of input and output transactions across the plurality of storage units is in accordance with the priority. 8. The non-transitory computer readable medium of claim 7, wherein the priority associated with each rule is based on the predetermined performance policy. 9. The non-transitory computer readable medium of claim 6, wherein the subset of the plurality of storage units is arranged as a logical storage unit. 10. The non-transitory computer readable medium of claim 9, wherein the logical storage unit comprises a volume, a volume set, a domain, a domain set, or a host. 11. A method comprising
determining, using at least one processor, a performance policy for a plurality of storage units; associating, using at least one processor, a subset of the plurality of storage units with a performance rule that specifies a number of input and output transactions that the subset may execute per time unit and a number of bits that the subset may process per time unit; determining, using at least one processor, whether the performance rule prevents the subset from carrying out an operation; and If it is determined that the performance rule prevents the subset from carrying out the operation, adjusting, using at least one processor, the performance rule such that the subset executes the operation without causing a violation of the performance policy. 12. The method of claim 11, wherein each performance rule is associated with a priority such that a schedule of input and output transactions across the plurality of storage units is in accordance with the priority. 13. The method of claim 12, wherein the priority associated with each rule is based on the performance policy. 14. The method of claim 11, wherein the subset of the plurality of storage units is arranged as a logical storage unit. 15. The method of claim 14, wherein the logical storage unit comprises a volume, a volume set, a domain, a domain set, or a host. | Disclosed herein are techniques for managing the performance of a storage system. A subset of a plurality of storage units is associated with a rule that specifies a number of input and output transactions and a number of bits per time unit. The associations are adjusted in accordance with a performance policy and changes in the subset of the plurality of storage units.1. A system comprising:
a plurality of storage units; configurable rules to specify a number of input and output transactions that at least one processor may execute per time unit on a subset of the plurality of storage units and a number of bits that at least one processor may process per time unit on the subset; and a mapping module which, if executed, instructs at least one processor to alter associations between the configurable rules and the subset in accordance with changes in a status of the subset, while maintaining adherence to a predetermined performance policy. 2. The system of claim 1, wherein each configurable rule is associated with a priority such that, when least one processor schedules input and output transactions across the plurality of storage units, the schedule is in accordance with the priority. 3. The system of claim 2, wherein the priority associated with each configurable rule is based on the predetermined performance policy. 4. The system of claim 1, wherein each subset of the plurality of storage units is arranged as a logical storage unit. 5. The system of claim 4, wherein the logical storage unit comprises a volume, a volume set, a domain, a domain set, or a host. 6. A non-transitory computer readable medium having instructions therein which, if executed, cause a processor to:
associate a subset of a plurality of storage units with a rule that specifies a number of input and output transactions that the subset may execute per time unit and a number of bits that the subset may process per time unit; determine a status of the subset; adjust an association between the subset and a rule in accordance with a change in status of the subset; and ensure the adjustment does not violate a predetermined performance policy. 7. The non-transitory computer readable medium of claim 6, wherein each rule is associated with a priority such that a schedule of input and output transactions across the plurality of storage units is in accordance with the priority. 8. The non-transitory computer readable medium of claim 7, wherein the priority associated with each rule is based on the predetermined performance policy. 9. The non-transitory computer readable medium of claim 6, wherein the subset of the plurality of storage units is arranged as a logical storage unit. 10. The non-transitory computer readable medium of claim 9, wherein the logical storage unit comprises a volume, a volume set, a domain, a domain set, or a host. 11. A method comprising
determining, using at least one processor, a performance policy for a plurality of storage units; associating, using at least one processor, a subset of the plurality of storage units with a performance rule that specifies a number of input and output transactions that the subset may execute per time unit and a number of bits that the subset may process per time unit; determining, using at least one processor, whether the performance rule prevents the subset from carrying out an operation; and If it is determined that the performance rule prevents the subset from carrying out the operation, adjusting, using at least one processor, the performance rule such that the subset executes the operation without causing a violation of the performance policy. 12. The method of claim 11, wherein each performance rule is associated with a priority such that a schedule of input and output transactions across the plurality of storage units is in accordance with the priority. 13. The method of claim 12, wherein the priority associated with each rule is based on the performance policy. 14. The method of claim 11, wherein the subset of the plurality of storage units is arranged as a logical storage unit. 15. The method of claim 14, wherein the logical storage unit comprises a volume, a volume set, a domain, a domain set, or a host. | 2,100 |
4,561 | 13,968,245 | 2,142 | Systems and methods for providing a collaborative browsing capability. A web browser service may be collaboratively browsed by plural client computing devices at an enumerated URL in a collaborative browsing (co-browsing) session. A request made by a web browser in the session may be intercepted by a co-browsing service and forwarded to the web browser service. A response to the request is received by the co-browsing service and communicated all web browsers participating in the co-browsing session. For configured web browsers, a view associated with web browser service may be translated into client computing device specific presentation data for display. | 1. A method for collaborative browsing within a session, comprising:
receiving a first connection to a web browser service from a first client device; receiving an indication to begin a co-browsing session, the co-browsing session including at least the web browser service, the first client device and at least one second client device; receiving subsequent connections to the web browser service from the client device and the second client device, the connections being made to the web browser service at an enumerated Uniform Resource Locator (URL) associated with the remote server; receiving, at a co-browsing service, a request made to the web browser service from one of the first client device and the at least one second client device; sending the request from the co-browsing service to the web browser service; receiving, at the co-browsing service, a response to the request from the web browser service; and communicating the response from the co-browsing service to each of the client device and the second client device. 2. The method of claim 1, further comprising synchronizing display information associated the response received from the web browser service at each of the first client device and the at least one second client device. 3. The method of claim 1, further comprising:
receiving display information associated with the response at a co-browsing translator associated with the co-browsing service; refactoring the display information in accordance with a display area of at least one of the client device and the second client device participating in the co-browsing session; and communicating refactored display information to the at least one of the client device and the second client device as the response. 4. The method of claim 1, further comprising:
connecting to a second web browser service at a second remote server; receiving connections to the second web browser service from the client device and the second client device, the connections being made to the web browser service at a second enumerated Uniform Resource Locator (URL) associated with the remote server; receiving, at the co-browsing service, a second request made to the second web browser service from one of the client device and the second client device; sending the second request from the co-browsing service to the second web browser service; receiving, at the co-browsing service, a second response to the second request from the second web browser service; communicating the second response from the co-browsing service to each of the client device and the second client device; and recombining display information associated with the web browser service and the second web browser service at each of the client device and the second client device. 5. The method of claim 1, further comprising:
proxying the request as an HTTP request at co-browsing proxy associated with the co-browsing service; opening a connection from the co-browsing service to the enumerated URL of the web browser service; and making the HTTP request to the web browser service. 6. A method of collaborative browsing of a web browser service by a plurality of web browsers in a collaborative browsing session, each of the plurality of web browsers being associated with a respective client device, the method comprising:
executing a co-browsing service on a remote access server; receiving, at the co-browsing service, a request for a resource associated with the web browser service, the request being made from at least one web browser of the plurality of web browsers in the collaborative browsing session and being communicated to a URL of the co-browsing service; forwarding the request from the collaborative browsing session to the web browser service; receiving, at the co-browsing service, a response from the web browser service, the response including the resource; and synchronizing, using the co-browsing service, a view of the web browser service at each of the plurality of web browsers such that each of the plurality of web browsers displays substantially a same view of the web browser service. 7. The method of claim 6, wherein the co-browsing service comprises a co-browsing proxy that intercepts the request and response and a co-browsing translator that translates presentation data associated with the web browser service in accordance with a resolution of display of a particular one respective client device. 8. The method of claim 7, further comprising performing translation of the presentation data using information contained in a state model that is communicated between the particular one respective client device and the co-browsing translator. 9. The method of claim 7, wherein one of the plurality of web browsers is a remote access web browser, the method further comprising:
receiving the request from the remote access web browser at the co-browsing translator; forwarding the request to the co-browsing proxy to be communicated to the web browser service; receiving the response at the co-browsing proxy; refactoring a view associated with the response at the co-browsing translator to generate the presentation data; and communicating the presentation data to the remote access web browser. 10. (canceled) 11. The method of claim 9, wherein the collaborative session comprises at least one remote access web browser and at least one non-remote access web browser, wherein refactoring is performed for the at least one remote access web browser, but not for the at least one non-remote access web browser. 12. The method of claim 6, wherein the co-browsing service intercepts Hypertext Transfer Protocol (HTTP) requests and responses from the plurality of web browsers and the web browsing service. 13. The method of claim 12, further comprising:
receiving, at the co-browsing service, a uniform resource locator (URL) in an HTTP request, the URL being associated with the web browser service; opening a connection to the URL; making the HTTP request; and communicating an HTTP response to the HTTP request to the plurality of web browsers. 14. (canceled) 15. The method of claim 6, further comprising joining the plurality of web browsers in the collaborative browsing session at the co-browsing service. 16. (canceled) 17. (canceled) 18. (canceled) 19. (canceled) 20. (canceled) 21. A collaborative browsing service comprising:
a co-browsing proxy that marshall requests and responses between a web browser service and client devices in communication with the web browser service; and a co-browsing translator that provides for refactoring of presentation data associated with the web browser service in accordance with a display area of a particular client device. 22. The collaborative browsing service of claim 21, wherein the co-browsing translator is communicatively connected to the co-browsing proxy, and wherein the co-browsing proxy is communicatively connected to the web browser service. 23. The collaborative browsing service of claim 21, further comprising a state model for communicating state information between the co-browsing translator and the particular client device. 24. (canceled) 25. A method for collaborative browsing within a session between a first client device and at least a second client device, comprising:
receiving connections at a co-browsing service from the first client device and the at least second client device, the co-browsing service comprising:
a co-browsing proxy that marshall requests and responses between a web browser service and client devices in communication with the web browser service; and
a co-browsing translator that provides for translating of presentation data associated with the web browser service in accordance with a display area of a particular client device, wherein the first client device or the at least second client device executing a conventional web browser is connected to the co-browsing proxy, and wherein the first client device or the at least second client device executing a remote access web browser is connected to the co-browsing translator;
receiving a connection at the co-browsing service from the first client device or at least second client device; communicating, by the co-browsing service, a request from any of the first client device or the at least second client to the web service; and communicating, by the co-browsing service, a response to the request from the web service to each of the first client and the at least second client. 26. The method of claim 25, the first client device initiating the collaborative browsing by activating a control in a user interface of the conventional web browser or remote access web browser. 27. The method of claim 25, further comprising synchronizing, using the co-browsing service, a view of the web browser service at the first client device and the at least a second client device. 28. The method of claim 25, further comprising performing the translating of the presentation data using information contained in a state model that is communicated between the first client device or the at least second client device and the co-browsing translator. 29. (canceled) | Systems and methods for providing a collaborative browsing capability. A web browser service may be collaboratively browsed by plural client computing devices at an enumerated URL in a collaborative browsing (co-browsing) session. A request made by a web browser in the session may be intercepted by a co-browsing service and forwarded to the web browser service. A response to the request is received by the co-browsing service and communicated all web browsers participating in the co-browsing session. For configured web browsers, a view associated with web browser service may be translated into client computing device specific presentation data for display.1. A method for collaborative browsing within a session, comprising:
receiving a first connection to a web browser service from a first client device; receiving an indication to begin a co-browsing session, the co-browsing session including at least the web browser service, the first client device and at least one second client device; receiving subsequent connections to the web browser service from the client device and the second client device, the connections being made to the web browser service at an enumerated Uniform Resource Locator (URL) associated with the remote server; receiving, at a co-browsing service, a request made to the web browser service from one of the first client device and the at least one second client device; sending the request from the co-browsing service to the web browser service; receiving, at the co-browsing service, a response to the request from the web browser service; and communicating the response from the co-browsing service to each of the client device and the second client device. 2. The method of claim 1, further comprising synchronizing display information associated the response received from the web browser service at each of the first client device and the at least one second client device. 3. The method of claim 1, further comprising:
receiving display information associated with the response at a co-browsing translator associated with the co-browsing service; refactoring the display information in accordance with a display area of at least one of the client device and the second client device participating in the co-browsing session; and communicating refactored display information to the at least one of the client device and the second client device as the response. 4. The method of claim 1, further comprising:
connecting to a second web browser service at a second remote server; receiving connections to the second web browser service from the client device and the second client device, the connections being made to the web browser service at a second enumerated Uniform Resource Locator (URL) associated with the remote server; receiving, at the co-browsing service, a second request made to the second web browser service from one of the client device and the second client device; sending the second request from the co-browsing service to the second web browser service; receiving, at the co-browsing service, a second response to the second request from the second web browser service; communicating the second response from the co-browsing service to each of the client device and the second client device; and recombining display information associated with the web browser service and the second web browser service at each of the client device and the second client device. 5. The method of claim 1, further comprising:
proxying the request as an HTTP request at co-browsing proxy associated with the co-browsing service; opening a connection from the co-browsing service to the enumerated URL of the web browser service; and making the HTTP request to the web browser service. 6. A method of collaborative browsing of a web browser service by a plurality of web browsers in a collaborative browsing session, each of the plurality of web browsers being associated with a respective client device, the method comprising:
executing a co-browsing service on a remote access server; receiving, at the co-browsing service, a request for a resource associated with the web browser service, the request being made from at least one web browser of the plurality of web browsers in the collaborative browsing session and being communicated to a URL of the co-browsing service; forwarding the request from the collaborative browsing session to the web browser service; receiving, at the co-browsing service, a response from the web browser service, the response including the resource; and synchronizing, using the co-browsing service, a view of the web browser service at each of the plurality of web browsers such that each of the plurality of web browsers displays substantially a same view of the web browser service. 7. The method of claim 6, wherein the co-browsing service comprises a co-browsing proxy that intercepts the request and response and a co-browsing translator that translates presentation data associated with the web browser service in accordance with a resolution of display of a particular one respective client device. 8. The method of claim 7, further comprising performing translation of the presentation data using information contained in a state model that is communicated between the particular one respective client device and the co-browsing translator. 9. The method of claim 7, wherein one of the plurality of web browsers is a remote access web browser, the method further comprising:
receiving the request from the remote access web browser at the co-browsing translator; forwarding the request to the co-browsing proxy to be communicated to the web browser service; receiving the response at the co-browsing proxy; refactoring a view associated with the response at the co-browsing translator to generate the presentation data; and communicating the presentation data to the remote access web browser. 10. (canceled) 11. The method of claim 9, wherein the collaborative session comprises at least one remote access web browser and at least one non-remote access web browser, wherein refactoring is performed for the at least one remote access web browser, but not for the at least one non-remote access web browser. 12. The method of claim 6, wherein the co-browsing service intercepts Hypertext Transfer Protocol (HTTP) requests and responses from the plurality of web browsers and the web browsing service. 13. The method of claim 12, further comprising:
receiving, at the co-browsing service, a uniform resource locator (URL) in an HTTP request, the URL being associated with the web browser service; opening a connection to the URL; making the HTTP request; and communicating an HTTP response to the HTTP request to the plurality of web browsers. 14. (canceled) 15. The method of claim 6, further comprising joining the plurality of web browsers in the collaborative browsing session at the co-browsing service. 16. (canceled) 17. (canceled) 18. (canceled) 19. (canceled) 20. (canceled) 21. A collaborative browsing service comprising:
a co-browsing proxy that marshall requests and responses between a web browser service and client devices in communication with the web browser service; and a co-browsing translator that provides for refactoring of presentation data associated with the web browser service in accordance with a display area of a particular client device. 22. The collaborative browsing service of claim 21, wherein the co-browsing translator is communicatively connected to the co-browsing proxy, and wherein the co-browsing proxy is communicatively connected to the web browser service. 23. The collaborative browsing service of claim 21, further comprising a state model for communicating state information between the co-browsing translator and the particular client device. 24. (canceled) 25. A method for collaborative browsing within a session between a first client device and at least a second client device, comprising:
receiving connections at a co-browsing service from the first client device and the at least second client device, the co-browsing service comprising:
a co-browsing proxy that marshall requests and responses between a web browser service and client devices in communication with the web browser service; and
a co-browsing translator that provides for translating of presentation data associated with the web browser service in accordance with a display area of a particular client device, wherein the first client device or the at least second client device executing a conventional web browser is connected to the co-browsing proxy, and wherein the first client device or the at least second client device executing a remote access web browser is connected to the co-browsing translator;
receiving a connection at the co-browsing service from the first client device or at least second client device; communicating, by the co-browsing service, a request from any of the first client device or the at least second client to the web service; and communicating, by the co-browsing service, a response to the request from the web service to each of the first client and the at least second client. 26. The method of claim 25, the first client device initiating the collaborative browsing by activating a control in a user interface of the conventional web browser or remote access web browser. 27. The method of claim 25, further comprising synchronizing, using the co-browsing service, a view of the web browser service at the first client device and the at least a second client device. 28. The method of claim 25, further comprising performing the translating of the presentation data using information contained in a state model that is communicated between the first client device or the at least second client device and the co-browsing translator. 29. (canceled) | 2,100 |
4,562 | 12,981,366 | 2,166 | A system, method and computer program product for tenant separated data storage for lifecycle management in a multi-tenancy environment is presented. A plurality of data containers is defined in a storage subsystem, each data container comprising a main data storage and a file system data storage for receiving, respectively, main data and file system data, each of the plurality of data containers being separate from all other data containers of the plurality of data containers. For each tenant of a plurality of tenants of a multi-tenancy computing system, main data is stored in the main data storage of one of the plurality of data containers and storing file system data in the file system data storage of the one of the plurality of data containers. For a transaction to be executed with a source tenant, only main data and file system data is accessed from a data container associated with the source tenant. The transaction is executed with the main data and file system data accessed from the data container associated with the source tenant. | 1. A computer-implemented method comprising:
defining a plurality of data containers in a storage subsystem, each data container comprising a main data storage and a file system data storage for receiving, respectively, main data and file system data, each of the plurality of data containers being separate from all other data containers of the plurality of data containers; for each tenant of a plurality of tenants of a multi-tenancy computing system, storing main data in the main data storage of one of the plurality of data containers and storing file system data in the file system data storage of the one of the plurality of data containers; for a transaction to be executed with a source tenant, accessing only main data and file system data from a data container associated with the source tenant; and executing the transaction with the main data and file system data accessed from the data container associated with the source tenant. 2. The computer-implemented method in accordance with claim 1, wherein the transaction is a copy transaction, and wherein executing the transaction includes:
stopping computing by the source tenant; exporting the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting computing by the source tenant. 3. The computer-implemented method in accordance with claim 1, further comprising connecting a plurality of storage subsystems together to form a virtual storage between a plurality of multi-tenant computing systems. 4. The computer-implemented method in accordance with claim 3, wherein the transaction is a copy transaction from the source tenant of a first multi-tenant computing system to a target tenant of a second multi-tenant computing system of the plurality of multi-tenant computing systems, and wherein executing the transaction includes:
stopping computing by the source tenant; exporting, via the virtual storage, the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting computing by the source tenant. 5. The computer-implemented method in accordance with claim 3, wherein the transaction is a backup transaction to backup the source tenant on a backup multi-tenant computing system, and wherein executing the transaction includes:
stopping computing by the source tenant; exporting, via the virtual storage, the main data and file system data accessed from the data container associated with the source tenant to a second data container associated with the source tenant; unmounting the second data container from a source multi-tenant computing system; and mounting the second data container to the backup multi-tenant computing system. 6. The computer-implemented method in accordance with claim 5, wherein the transaction is a restore transaction to restore the source tenant from the source multi-tenant computing system to a target multi-tenant system, and wherein executing the transaction includes:
creating a new data container in the virtual storage; mounting the data container associated with the source tenant to the backup multi-tenant computing system; copying the main data and file system data accessed from the data container associated with the source tenant to the new data container; and restoring the source tenant with the new data container. 7. The computer-implemented method in accordance with claim 1, wherein the main data includes database data, and wherein file system data includes search engine data. 8. A system comprising:
a plurality of data containers defined in a storage subsystem, each data container comprising a main data storage and a file system data storage for receiving, respectively, main data and file system data, each of the plurality of data containers being separate from all other data containers of the plurality of data containers; a plurality of tenants of a multi-tenancy computing system, each tenant storing main data in the main data storage of one of the plurality of data containers and storing file system data in the file system data storage of the one of the plurality of data containers, only main data and file system data from a data container associated with the source tenant being accessed for a transaction to be executed with a source tenant; and one or more processors for executing the transaction with the main data and file system data accessed from the data container associated with the source tenant. 9. The system in accordance with claim 8, wherein the transaction is a copy transaction, and wherein executing the transaction includes:
stopping, using the one or more processors, computing by the source tenant; exporting, using the one or more processors, the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating, using the one or more processors, a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting, using the one or more processors, computing by the source tenant. 10. The system in accordance with claim 8, further comprising connecting a plurality of storage subsystems together to form a virtual storage between a plurality of multi-tenant computing systems. 11. The system in accordance with claim 10, wherein the transaction is a copy transaction from the source tenant of a first multi-tenant computing system to a target tenant of a second multi-tenant computing system of the plurality of multi-tenant computing systems, and wherein executing the transaction includes:
stopping, using the one or more processors, computing by the source tenant; exporting, via the virtual storage and using the one or more processors, the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating, using the one or more processors, a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting, using the one or more processors, computing by the source tenant. 12. The system in accordance with claim 10, wherein the transaction is a backup transaction to backup the source tenant on a backup multi-tenant computing system, and wherein executing the transaction includes the one or more processors:
stopping computing by the source tenant; exporting, via the virtual storage, the main data and file system data accessed from the data container associated with the source tenant to a second data container associated with the source tenant; unmounting the second data container from a source multi-tenant computing system; and mounting the second data container to the backup multi-tenant computing system. 13. The system in accordance with claim 12, wherein the transaction is a restore transaction to restore the source tenant from the source multi-tenant computing system to a target multi-tenant system, and wherein executing the transaction includes the one or more processors:
creating a new data container in the virtual storage; mounting the data container associated with the source tenant to the backup multi-tenant computing system; copying the main data and file system data accessed from the data container associated with the source tenant to the new data container; and restoring the source tenant with the new data container. 14. The system in accordance with claim 8, wherein the main data includes database data, and wherein file system data includes search engine data. 15. A computer program product comprising a non-transitory storage medium readable by at least one processor and storing instructions for execution by the at least one processor for:
defining a plurality of data containers in a storage subsystem, each data container comprising a main data storage and a file system data storage for receiving, respectively, main data and file system data, each of the plurality of data containers being separate from all other data containers of the plurality of data containers; for each tenant of a plurality of tenants of a multi-tenancy computing system, storing main data in the main data storage of one of the plurality of data containers and storing file system data in the file system data storage of the one of the plurality of data containers; connecting a plurality of storage subsystems together to form a virtual storage between a plurality of multi-tenant computing systems; for a transaction to be executed with a source tenant, accessing only main data and file system data from a data container associated with the source tenant; and executing, via the virtual storage, the transaction with the main data and file system data accessed from the data container associated with the source tenant. 16. The computer program product in accordance with claim 15, wherein the transaction is a copy transaction, and wherein executing the transaction includes, by the at least one processor:
stopping computing by the source tenant; exporting the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting computing by the source tenant. 17. The computer program product in accordance with claim 15, wherein the transaction is a copy transaction from the source tenant of a first multi-tenant computing system to a target tenant of a second multi-tenant computing system of the plurality of multi-tenant computing systems, and wherein executing the transaction includes by the at least one processor:
stopping computing by the source tenant; exporting, via the virtual storage, the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting computing by the source tenant. 18. The computer-implemented method in accordance with claim 15, wherein the transaction is a backup transaction to backup the source tenant on a backup multi-tenant computing system, and wherein executing the transaction includes by the at least one processor:
stopping computing by the source tenant; exporting, via the virtual storage, the main data and file system data accessed from the data container associated with the source tenant to a second data container associated with the source tenant; unmounting the second data container from a source multi-tenant computing system; and mounting the second data container to the backup multi-tenant computing system. 19. The computer-implemented method in accordance with claim 18, wherein the transaction is a restore transaction to restore the source tenant from the source multi-tenant computing system to a target multi-tenant system, and wherein executing the transaction includes by the at least one processor:
creating a new data container in the virtual storage; mounting the data container associated with the source tenant to the backup multi-tenant computing system; copying the main data and file system data accessed from the data container associated with the source tenant to the new data container; and restoring the source tenant with the new data container. 20. The computer-implemented method in accordance with claim 15, wherein the main data includes database data, and wherein file system data includes search engine data. | A system, method and computer program product for tenant separated data storage for lifecycle management in a multi-tenancy environment is presented. A plurality of data containers is defined in a storage subsystem, each data container comprising a main data storage and a file system data storage for receiving, respectively, main data and file system data, each of the plurality of data containers being separate from all other data containers of the plurality of data containers. For each tenant of a plurality of tenants of a multi-tenancy computing system, main data is stored in the main data storage of one of the plurality of data containers and storing file system data in the file system data storage of the one of the plurality of data containers. For a transaction to be executed with a source tenant, only main data and file system data is accessed from a data container associated with the source tenant. The transaction is executed with the main data and file system data accessed from the data container associated with the source tenant.1. A computer-implemented method comprising:
defining a plurality of data containers in a storage subsystem, each data container comprising a main data storage and a file system data storage for receiving, respectively, main data and file system data, each of the plurality of data containers being separate from all other data containers of the plurality of data containers; for each tenant of a plurality of tenants of a multi-tenancy computing system, storing main data in the main data storage of one of the plurality of data containers and storing file system data in the file system data storage of the one of the plurality of data containers; for a transaction to be executed with a source tenant, accessing only main data and file system data from a data container associated with the source tenant; and executing the transaction with the main data and file system data accessed from the data container associated with the source tenant. 2. The computer-implemented method in accordance with claim 1, wherein the transaction is a copy transaction, and wherein executing the transaction includes:
stopping computing by the source tenant; exporting the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting computing by the source tenant. 3. The computer-implemented method in accordance with claim 1, further comprising connecting a plurality of storage subsystems together to form a virtual storage between a plurality of multi-tenant computing systems. 4. The computer-implemented method in accordance with claim 3, wherein the transaction is a copy transaction from the source tenant of a first multi-tenant computing system to a target tenant of a second multi-tenant computing system of the plurality of multi-tenant computing systems, and wherein executing the transaction includes:
stopping computing by the source tenant; exporting, via the virtual storage, the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting computing by the source tenant. 5. The computer-implemented method in accordance with claim 3, wherein the transaction is a backup transaction to backup the source tenant on a backup multi-tenant computing system, and wherein executing the transaction includes:
stopping computing by the source tenant; exporting, via the virtual storage, the main data and file system data accessed from the data container associated with the source tenant to a second data container associated with the source tenant; unmounting the second data container from a source multi-tenant computing system; and mounting the second data container to the backup multi-tenant computing system. 6. The computer-implemented method in accordance with claim 5, wherein the transaction is a restore transaction to restore the source tenant from the source multi-tenant computing system to a target multi-tenant system, and wherein executing the transaction includes:
creating a new data container in the virtual storage; mounting the data container associated with the source tenant to the backup multi-tenant computing system; copying the main data and file system data accessed from the data container associated with the source tenant to the new data container; and restoring the source tenant with the new data container. 7. The computer-implemented method in accordance with claim 1, wherein the main data includes database data, and wherein file system data includes search engine data. 8. A system comprising:
a plurality of data containers defined in a storage subsystem, each data container comprising a main data storage and a file system data storage for receiving, respectively, main data and file system data, each of the plurality of data containers being separate from all other data containers of the plurality of data containers; a plurality of tenants of a multi-tenancy computing system, each tenant storing main data in the main data storage of one of the plurality of data containers and storing file system data in the file system data storage of the one of the plurality of data containers, only main data and file system data from a data container associated with the source tenant being accessed for a transaction to be executed with a source tenant; and one or more processors for executing the transaction with the main data and file system data accessed from the data container associated with the source tenant. 9. The system in accordance with claim 8, wherein the transaction is a copy transaction, and wherein executing the transaction includes:
stopping, using the one or more processors, computing by the source tenant; exporting, using the one or more processors, the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating, using the one or more processors, a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting, using the one or more processors, computing by the source tenant. 10. The system in accordance with claim 8, further comprising connecting a plurality of storage subsystems together to form a virtual storage between a plurality of multi-tenant computing systems. 11. The system in accordance with claim 10, wherein the transaction is a copy transaction from the source tenant of a first multi-tenant computing system to a target tenant of a second multi-tenant computing system of the plurality of multi-tenant computing systems, and wherein executing the transaction includes:
stopping, using the one or more processors, computing by the source tenant; exporting, via the virtual storage and using the one or more processors, the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating, using the one or more processors, a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting, using the one or more processors, computing by the source tenant. 12. The system in accordance with claim 10, wherein the transaction is a backup transaction to backup the source tenant on a backup multi-tenant computing system, and wherein executing the transaction includes the one or more processors:
stopping computing by the source tenant; exporting, via the virtual storage, the main data and file system data accessed from the data container associated with the source tenant to a second data container associated with the source tenant; unmounting the second data container from a source multi-tenant computing system; and mounting the second data container to the backup multi-tenant computing system. 13. The system in accordance with claim 12, wherein the transaction is a restore transaction to restore the source tenant from the source multi-tenant computing system to a target multi-tenant system, and wherein executing the transaction includes the one or more processors:
creating a new data container in the virtual storage; mounting the data container associated with the source tenant to the backup multi-tenant computing system; copying the main data and file system data accessed from the data container associated with the source tenant to the new data container; and restoring the source tenant with the new data container. 14. The system in accordance with claim 8, wherein the main data includes database data, and wherein file system data includes search engine data. 15. A computer program product comprising a non-transitory storage medium readable by at least one processor and storing instructions for execution by the at least one processor for:
defining a plurality of data containers in a storage subsystem, each data container comprising a main data storage and a file system data storage for receiving, respectively, main data and file system data, each of the plurality of data containers being separate from all other data containers of the plurality of data containers; for each tenant of a plurality of tenants of a multi-tenancy computing system, storing main data in the main data storage of one of the plurality of data containers and storing file system data in the file system data storage of the one of the plurality of data containers; connecting a plurality of storage subsystems together to form a virtual storage between a plurality of multi-tenant computing systems; for a transaction to be executed with a source tenant, accessing only main data and file system data from a data container associated with the source tenant; and executing, via the virtual storage, the transaction with the main data and file system data accessed from the data container associated with the source tenant. 16. The computer program product in accordance with claim 15, wherein the transaction is a copy transaction, and wherein executing the transaction includes, by the at least one processor:
stopping computing by the source tenant; exporting the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting computing by the source tenant. 17. The computer program product in accordance with claim 15, wherein the transaction is a copy transaction from the source tenant of a first multi-tenant computing system to a target tenant of a second multi-tenant computing system of the plurality of multi-tenant computing systems, and wherein executing the transaction includes by the at least one processor:
stopping computing by the source tenant; exporting, via the virtual storage, the main data and file system data accessed from the data container associated with the source tenant to a data container associated with the target tenant; generating a digital snapshot of the main data and file system data in the data container associated with the target tenant; and restarting computing by the source tenant. 18. The computer-implemented method in accordance with claim 15, wherein the transaction is a backup transaction to backup the source tenant on a backup multi-tenant computing system, and wherein executing the transaction includes by the at least one processor:
stopping computing by the source tenant; exporting, via the virtual storage, the main data and file system data accessed from the data container associated with the source tenant to a second data container associated with the source tenant; unmounting the second data container from a source multi-tenant computing system; and mounting the second data container to the backup multi-tenant computing system. 19. The computer-implemented method in accordance with claim 18, wherein the transaction is a restore transaction to restore the source tenant from the source multi-tenant computing system to a target multi-tenant system, and wherein executing the transaction includes by the at least one processor:
creating a new data container in the virtual storage; mounting the data container associated with the source tenant to the backup multi-tenant computing system; copying the main data and file system data accessed from the data container associated with the source tenant to the new data container; and restoring the source tenant with the new data container. 20. The computer-implemented method in accordance with claim 15, wherein the main data includes database data, and wherein file system data includes search engine data. | 2,100 |
4,563 | 14,346,674 | 2,176 | A document transformation system automatically transforms documents electronically transferred between senders and recipients, even where documents of a given type from a given sender which are assumed to be identically formatted differ in various aspects, for instance in scaling, alignment, concatenating, resizing, etc. Document transformation instructions selected based on sender, recipient, or both specify transformation instructions which include one or more maps, document layouts, page layouts, sections extraction instructions, allowing extraction of data or information, and generation of documents or information in a format specified by recipient. Headers and footers may be extracted, and a remaining body concatenated. The system continues to searching for additional instructions on failure of previous instructions to successfully extract a previous section, without terminating. Documents may be converted from a large variety of file formats into a common file format. Extracted information may be stored in a database. | 1. A method of operating a document transformation system, comprising:
receiving a first document for processing by the document transformation system; determining a first set of instructions stored on at least one nontransistory processor-readable medium of the document transformation system based on at least one aspect of the received first document; based on the first set of instructions which includes at least one set of header specific extraction instructions, at least one set of footer specific extraction instructions and at least one set of line item specific extraction instructions: attempting to extract header data from a first document according to a first one of the at least one set of header specific extraction instructions of the first set of instructions by the at least one processor of the document transformation system; attempting to extract footer data from the first document according to a first one of the at least one set of footer specific extraction instructions of the first set of instructions by the at least one processor of the document transformation system; concatenating remaining data in the first document after extracting all of the header data and all of the footer data from the first document by the at least one processor of the document transformation system; and attempting to extract a number of line items from the first document according to a first one of the set of at least one set of line item specific extraction instructions of the first set of instructions by the at least one processor of the document transformation system. 2. The method of claim 1, further comprising:
determining whether the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was successful; and attempting to extract the header data from the first document according to a second one of the at least one set of header specific extraction instructions if the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was unsuccessful. 3. The method of claim 2, further comprising:
determining if the header data was extracted from the first document successfully by the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions; and concluding that the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was successful if the header data was extracted from the first document without any errors. 4. The method of claim 1, further comprising:
determining whether the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was successful; and attempting to extract the footer data from the first document according to a second one of the at least one set of footer specific extraction instructions if the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was unsuccessful. 5. The method of claim 4, further comprising:
determining if the footer data was extracted from the first document successfully by the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions; and concluding that the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was successful if the footer data was extracted from the first document without any errors. 6. The method of claim 1, further comprising:
determining whether the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was successful; and attempting to extract the line item data from the first document according to a second one of the at least one set of line item specific extraction instructions if the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was unsuccessful. 7. The method of claim 6, further comprising:
determining if the line item data was extracted from the first document successfully by the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions; and concluding that the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was successful if the line item data was extracted from the first document without any errors. 8. The method of claim 1, further comprising:
based on a second set of instructions which includes at least one set of header specific extraction instructions, at least one set of footer specific extraction instructions and at least one set of line item specific extraction instructions: attempting to extract header data from the first document according to a first one of the at least one set of header specific extraction instructions of the second set of instructions; attempting to extract footer data from the first document according to a first one of the at least one set of footer specific extraction instructions of the second set of instructions; concatenating remaining data in the first document after extracting all of the header data and all of the footer data from the first document; and attempting to extract a number of line items from the first document according to a first one of the set of at least one set of line item specific extraction instructions of the second set of instructions. 9. The method of claim 1 wherein concatenating remaining data in the first document includes concatenating remaining data in the first document into a single virtual page. 10. The method of claim 8 wherein concatenating remaining data in the first document into a single virtual page includes concatenating pieces of information from at least two pages of the first document to the single virtual page based on pairs of coordinates to retain a relative positioning of the pieces of information with respect to one another. 11. The method of claim 1, further comprising:
normalizing the first document before attempting to extract any data from the first document. 12. The method of claim 1, further comprising:
converting the first document into a defined transformation file format different from a received file format of the first document before normalizing the first document. 13. The method of claim 1, further comprising:
authenticating an entity that transmitted the first document; and based at least in part on the identity of the entity that transmitted the first document, selecting a first set of transformation instructions which include at least the first set of instructions. 14. The method of claim 13 wherein selecting the first set of file transformation instructions is based at least in part on an identity of an entity that is to receive the first document. 15. The method of claim 14, further comprising:
generating a recipient document formatted according to a format specified by the entity that is to receive the first document; transmitting the recipient document to the entity that is to receive the first document. 16. The method of claim 1, further comprising:
storing one or more pieces of data extracted from the first document to a queryable database stored on at least one non-transitory computer-readable medium. 17. The method of claim 1 wherein the first set of instructions is provided as a first transformation instruction file, the at least one nontransistory processor-readable medium of the document transformation system storing a plurality of stored transformation instruction files which differ from one another in one or more criterion. 18. The method of claim 1 wherein determining a first set of instructions based on at least one aspect of the received first document includes determining the first set of instructions based at least on an identity of at least one of a sender or an intended recipient of the first document. 19. A document transformation system, comprising:
at least one processor coupled to receive a plurality of documents transmitted by at least one send system to at least one recipient system; and at least one non-transitory computer-readable medium that stores processor executable instructions including a first set of instructions which includes at least one set of header specific extraction instructions, at least one set of footer specific extraction instructions and at least one set of line item specific extraction instructions, which when executed by the at least one processor causes the at least one processor to: determine a first set of instructions stored on at least one nontransistory processor-readable medium of the document transformation system based on at least one aspect of a first document of the plurality of documents received by the at least one processor; attempt to extract header data from the first document according to a first one of the at least one set of header specific extraction instructions of the first set of instructions; attempt to extract footer data from the first document according to a first one of the at least one set of footer specific extraction instructions of the first set of instructions; concatenate remaining data in the first document after extracting all of the header data and all of the footer data from the first document; and attempt to extract a number of line items from the first document according to a first one of the set of at least one set of line item specific extraction instructions of the first set of instructions. 20. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
determine whether the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was successful; and
attempt to extract the header data from the first document according to a second one of the at least one set of header specific extraction instructions if the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was unsuccessful. 21. The document transformation system of claim 20 wherein the instructions further cause the at least one processor to:
determine if the header data was extracted from the first document successfully by the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions; and
conclude that the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was successful if the header data was extracted from the first document without any errors. 22. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
determine whether the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was successful; and
attempt to extract the footer data from the first document according to a second one of the at least one set of footer specific extraction instructions if the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was unsuccessful. 23. The document transformation system of claim 22 wherein the instructions further cause the at least one processor to:
determine if the footer data was extracted from the first document successfully by the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions; and
conclude that the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was successful if the footer data was extracted from the first document without any errors. 24. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
determine whether the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was successful; and
attempt to extract the line item data from the first document according to a second one of the at least one set of line item specific extraction instructions if the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was unsuccessful. 25. The document transformation system of claim 24 wherein the instructions further cause the at least one processor to:
determine if the line item data was extracted from the first document successfully by the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions; and
conclude determine that the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was successful if the line item data was extracted from the first document without any errors. 26. The document transformation system of claim 19 wherein the instructions further include a second set of instructions which includes at least one set of header specific extraction instructions, at least one set of footer specific extraction instructions and at least one set of line item specific extraction instructions, execution of the second set of instructions which causes the at least one processor to:
attempt to extract header data from the first document according to a first one of the at least one set of header specific extraction instructions of the second set of instructions;
attempt to extract footer data from the first document according to a first one of the at least one set of footer specific extraction instructions of the second set of instructions;
concatenate remaining data in the first document after extracting all of the header data and all of the footer data from the first document; and
attempt to extract a number of line items from the first document according to a first one of the set of at least one set of line item specific extraction instructions of the second set of instructions. 27. The document transformation system of claim 19 wherein the instructions cause the at least one processor to concatenate remaining data in the first document into a single virtual page. 28. The document transformation system of claim 27 wherein the instructions cause the at least one processor to concatenate pieces of information from at least two pages of the first document to the single virtual page based on pairs of coordinates to retain a relative positioning of the pieces of information with respect to one another. 29. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
normalize the first document before attempting to extract data from the first document. 30. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
convert the first document into a defined transformation file format different from a received file format of the first document before normalizing the first document. 31. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
authenticate an entity that transmitted the first document; and
based at least in part on the identity of the entity that transmitted the first document, select a first set of transformation instructions which include at least the first set of instructions. 32. The document transformation system of claim 31 wherein the at least one processor selects the first set of file transformation instructions based at least in part on an identity of an entity that is to receive the first document. 33. The document transformation system of claim 32 wherein the instructions further cause the at least one processor to:
generate a recipient document formatted according to a format specified by the entity that is to receive the first document;
transmitting the recipient document to the entity that is to receive the first document. 34. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
store one or more pieces of data extracted from the first document to a queryable database stored on at least one non-transitory computer-readable medium. 35. A method of operating a document transformation system, comprising:
successively attempting to extract information from a first section of a first page of a first document according to each of a plurality of sets of first section specific extraction instructions of a first set of instructions until an occurrence of a first of: a) the information from the first section of the first document is successfully extracted or b) extraction of the information from the first section of the first document has been unsuccessfully attempted using each of the plurality of sets of first section specific extraction instructions of the first set of instructions; in response to successfully extracting the information from the first section of the first page of the first document, successively attempting to extract information from a second section of the first page of the first document according to each of a plurality of sets of second section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the second section of the first document is successfully extracted or b) extraction of the information from the second section of the first document has been unsuccessfully attempted using each of the plurality of sets of second section specific extraction instructions of the first set of instructions; and if extraction from the first and second sections has been successful, successively attempting to extract information from a third section of at least the first page of the first document according to each of a plurality of sets of third section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the third section of the first document is successfully extracted or b) extraction of the information from the third section of the first document has been unsuccessfully attempted using each of the plurality of sets of third section specific extraction instructions of the first set of instructions. 36. The method of claim 35, further comprising:
concatenating any information remaining in the first document to a single virtual page after extracting any of the information from each of the first and the second sections of each page of the first document and before successively attempting to extract information from a third section of at least the first page of the first document according to each of a plurality of sets of third section specific extraction instructions. 37. The method of claim 36 wherein the first set of instructions includes a first page layout definition of a plurality of page layout definitions of a number of document layout definitions of at least one map definition in a set of transformation instructions, wherein each of the page layout definitions includes at least one set of first section specific extraction instructions, at least one set of second section specific extraction instructions and at least one set of third section specific extraction instructions, and further comprising:
for each page layout definition, determining whether the page layout definition is appropriate for the first page of the document before successively attempting to extract information from the first section of the first page of the first document according to the set of first section specific extraction instructions. 38. The method of claim 37, further comprising:
determining whether the first document includes a subsequent page; for each page layout definition, determining whether the page layout definition is appropriate for the subsequent page of the first document; successively attempting to extract information from a first section of at least the subsequent page of the first document according to each of a plurality of sets of first section specific extraction instructions of at least one page layout definition until an occurrence of a first of: a) the information from the first section of the subsequent page of the first document is successfully extracted or b) extraction of the information from the first section of the subsequent page of the first document has been unsuccessfully attempted using each of the plurality of sets of first section specific extraction instructions of the at least one set of page layout definition; and in response to successfully extracting the information from the first section of at least the subsequent page of the first document, successively attempting to extract information from a second section of the at least subsequent page of the first document according to each of the plurality of sets of second section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the second section of the at least subsequent page of the first document is successfully extracted or b) extraction of the information from the second section of the at least subsequent page of the first document has been unsuccessfully attempted using each of the plurality of sets of second section specific extraction instructions of the at least one page layout definition. 39. The method of claim 37, further comprising:
determining whether the extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions occurred without any errors; and in response to concluding that extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions did not occur without any errors, determining whether the first set of instructions includes a next page layout definition applicable to the first page of the first document. 40. The method of claim 39, further comprising
determining whether the extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions occurred without any errors includes determining whether a total number of data elements and a respective position of each of the data elements in the document matches a total number of data elements and a respective position of each of the data elements specified in the respective set of first section specific extraction instructions of the first page layout definition. 41. The method of claim 37, further comprising:
determining whether the extraction of the information from the second section of the first document according to at least one of the plurality of sets of second section specific extraction instructions occurred without any errors; and in response to concluding that extraction of the information from the second section of the first document according to at least one of the plurality of sets of second section specific extraction instructions did not occur without any errors, determining whether the first set of instructions includes a next page layout definition applicable to the first page of the first document. 42. The method of claim 35, further comprising:
determining whether all page layout definitions in a document layout definition of a first map definition of the first set of instructions which is applicable to the first page of the first document have been attempted; and in response to concluding that all page layout definitions which are applicable to the first page of the first document have been attempted unsuccessfully, determining whether a second document layout definition of the first set of instructions applicable to the first document is available. 43. A document transformation system, comprising:
at least one processor coupled to receive a plurality of documents transmitted by at least one send system to at least one recipient system; and at least one non-transitory computer-readable medium that stores processor executable instructions which when executed by the at least one processor causes the at least one processor to: successively attempt to extract information from a first section of a first page of a first document according to each of a plurality of sets of first section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the first section of the first page of the first document is successfully extracted or b) extraction of the information from the first section of the first page of the first document has been unsuccessfully attempted using each of the plurality of sets of first section specific extraction instructions of the first set of instructions; in response to successful extraction the information from the first section of the first page of the first document, successively attempt to extract information from a second section of the first page of the first document according to each of a plurality of sets of second section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the second section of the first page of the first document is successfully extracted or b) extraction of the information from the second section of the first page of the first document has been unsuccessfully attempted using each of the plurality of sets of second section specific extraction instructions of the first set of instructions; and if extraction from the first and second sections has been successful, successively attempt to extract information from a third section of at least the first page of the first document according to each of a plurality of sets of third section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the third section of the first document is successfully extracted or b) extraction of the information from the third section of the first document has been unsuccessfully attempted using each of the plurality of sets of third section specific extraction instructions of the first set of mapping instructions. 44. The document transformation system of claim 43 wherein the instructions further cause the at least one processor to:
concatenate any information remaining in the first document to a single first page after extraction of any of the information from each of the first and the second sections of each page of the first document and before the successive attempts to extract information from a third section of at least the first page of the first document according to each of a plurality of sets of third section specific extraction instructions. 45. The document transformation system of claim 44 wherein the instructions include a first page layout definition of a plurality of page layout definitions of a number of document layout definitions of at least one map definition in a set of transformation instructions, wherein each of the page layout definitions includes at least one set of first section specific extraction instructions, at least one set of second section specific extraction instructions and at least one set of third section specific extraction instructions, and further comprising:
for each page layout definition, determine whether the page layout definition is appropriate for the first page of the document before the successive attempts to extract information from the first section of the first page of the first document according to the set of first section specific extraction instructions. 46. The document transformation system of claim 45 wherein the instructions further cause the at least one processor to:
determine whether the first document includes a subsequent page;
for each page layout definition, determine whether the page layout definition is appropriate for the subsequent page of the first document;
successively attempt to extract information from a first section of at least the subsequent page of the first document according to each of a plurality of sets of first section specific extraction instructions of at least one page layout definition until an occurrence of a first of: a) the information from the first section of the subsequent page of the first document is successfully extracted or b) extraction of the information from the first section of the subsequent page of the first document has been unsuccessful attempted using each of the plurality of sets of first section specific extraction instructions of the at least one set of page layout definition; and
in response to successful extraction of the information from the first section of the at least subsequent page of the first document, successively attempt to extract information from a second section of the at least subsequent page of the first document according to each of the plurality of sets of second section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the second section of the at least subsequent page of the first document is successfully extracted or b) extraction of the information from the second section of the at least subsequent page of the first document has been unsuccessfully attempted using each of the plurality of sets of second section specific extraction instructions of the at least one page layout definition. 47. The document transformation system of claim 45 wherein the instructions further cause the at least one processor to:
determine whether the extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions occurred without any errors; and
in response to concluding that extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions did not occur without any errors, determine whether the first set of instructions includes a next page layout definition applicable to the first page of the first document. 48. The document transformation system of claim 47 wherein the instructions further cause the at least one processor to:
determine whether a total number of data elements and a respective position of each of the data elements in the document matches a total number of data elements and a respective position of each of the data elements specified in the respective set of first section specific extraction instructions of the first page layout definition in order to determine whether the extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions occurred without any errors. 49. The document transformation system of claim 45 wherein the instructions further cause the at least one processor to:
determine whether the extraction of the information from the second section of the first document according to at least one of the plurality of sets of second section specific extraction instructions occurred without any errors; and
in response to concluding that extraction of the information from the second section of the first document according to at least one of the plurality of sets of second section specific extraction instructions did not occur without any errors, determine whether the set of instructions includes a next page layout definition applicable to the first page of the first document. 50. The document transformation system of claim 43 wherein the instructions further cause the at least one processor to:
determine whether all page layout definitions in a document layout definition of a first map definition of the first set of instructions which is applicable to the first page of the first document have been attempted; and
in response to concluding that all page layout definitions which are applicable to the first page of the first document have been attempted unsuccessfully, determine whether a second document layout definition of the first set of instructions applicable to the first document is available. 51. A method of operating a document transformation system, comprising:
based on a set of transformation instructions: determining whether to scale at least a portion of a document; determining whether to realign at least a portion of the document; determining whether to concatenate at least a portion of the document; determining whether to resize at least a portion of the document; and performing at least one action on the document based at least in part on an outcome of the determinations. 52. The method of claim 51 wherein determining whether to scale at least a portion of a document includes locating four sides of a page of the document based on a number of anchor elements, and wherein performing at least one action on the document based at least in part on an outcome of the determinations includes scaling at least one element of the document. 53. The method of claim 51 wherein determining whether to realign at least a portion of a document includes locating four sides of a page of the document based on a number of anchor elements, and wherein performing at least one action on the document based at least in part on an outcome of the determinations includes realigning at least one element of the document. 54. The method of claim 51 wherein determining whether to concatenate at least a portion of a document includes searching the document for any wrapped elements, and wherein performing at least one action on the document based at least in part on an outcome of the determinations includes concatenating at least two elements of the document. 55. The method of claim 51 wherein determining whether to resize at least a portion of a document includes searching the document for any overlapping elements, and wherein performing at least one action on the document based at least in part on an outcome of the determinations includes resizing at least one of the elements of the document. 56. The method of claim 51, further comprising:
sorting elements in the document based at least in part on coordinate pairs; and for each line, setting a Y coordinate for all elements on the line to a same value. 57. The method of claim 51, further comprising:
calculating a size of a space that serves as a delimiter between two elements; and reformatting at least one element based on the calculated space. 58. The method of claim 51, further comprising:
searching at least one section of the document for a split value; and splitting the document into at least two separate documents in response to finding at least one split value. 59. A document transformation system, comprising:
at least one processor coupled to receive a plurality of documents transmitted by at least one send system to at least one recipient system; and at least one non-transitory computer-readable medium that stores processor executable instructions including a set of transformation instructions which when executed by the at least one processor causes the at least one processor to: determine whether to scale at least a portion of a document; determine whether to realign at least a portion of the document; determine whether to concatenate at least a portion of the document; determine whether to resize at least a portion of the document; and perform at least one action on the document based at least in part on an outcome of the determinations. 60. The document transformation system of claim 59 wherein the instructions cause the at least one processor to locate four sides of a page of the document based on a number of anchor elements to determine whether to scale at least a portion of the document, and scale at least one element of the document to perform the at least one action on the document based at least in part on the outcome of the determinations. 61. The document transformation system of claim 59 wherein the instructions cause the at least one processor to locate four sides of a page of the document based on a number of anchor elements to determine whether to realign at least a portion of the document, and realign at least one element of the document to perform the at least one action on the document based at least in part on the outcome of the determinations. 62. The document transformation system of claim 59 wherein the instructions cause the at least one processor to search the document for any wrapped elements to determine whether to concatenate at least a portion of the document, and to concatenate at least two elements of the document to perform the at least one action on the document based at least in part on the outcome of the determinations. 63. The document transformation system of claim 59 wherein the instructions cause the at least one processor to search the document for any overlapping elements to determine whether to resize at least a portion of the document, and to resize at least one of the elements of the document to perform the at least one action on the document based at least in part on the outcome of the determinations. 64. The document transformation system of claim 59 wherein the instructions further cause the at least one processor to:
sort elements in the document based at least in part on coordinate pairs; and
for each line, set a Y coordinate for all elements on the line to a same value. 65. The document transformation system of claim 59 wherein the instructions further cause the at least one processor to:
calculate a size of a space that serves as a delimiter between two elements; and
reformat at least one element based on the calculated space. 66. The document transformation system of claim 59 wherein the instructions further cause the at least one processor to:
search at least one section of the document for a split value; and
split the document into at least two separate documents in response to finding at least one split value. 67. A method of operating a document transformation system, the method comprising:
comparing by the at least one processor at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated; determining by the at least one processor whether the at least one piece of information from the transformed document corresponds to the at least one piece of information from the pre-transformation document from which the transformed document was generated; and generating by the at least one processor a notification in response to determining that the at least one piece of information from the transformed document does not correspond to the at least one piece of information from the pre-transformation document from which the transformed document was generated. 68. The method of claim 67, further comprising:
calculating at least a first value based on at least one piece of information extracted from the transformed document, and wherein comparing by the at least one processor at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated includes comparing at least the first value to the at least one piece of information from the pre-transformation document. 69. The method of claim 68 wherein calculating at least the first value based on at least one piece of information extracted from the transformed document includes calculating at least one of a line count, a total value, a sub-total value or a total quantity of items from the transformed document and wherein the at least one piece of information from a pre-transformed document is at least one of a line count, total value, sub-total value or total quantity of items. 70. The method of claim 68, further comprising:
calculating at least a second value based on at least one piece of information from a mid-transformation document, and wherein comparing by at least one processor at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated includes comparing at least the first value to at least the second value. 71. The method of claim 67 wherein determining by the at least one processor whether the at least one piece of information from the transformed document corresponds to the at least one piece of information from the pre-transformation document from which the transformed document was generated includes: determining whether the at least one piece of information from the transformed document matches the at least one piece of information from the pre-transformation document from which the transformed document was generated. 72. The method of claim 67, further comprising:
confirming by the at least one processor that the transformed document has all of a set of mandatory data elements defined for the document transformation. 73. A document transformation system, comprising:
at least one processor coupled to receive a plurality of documents transmitted by at least one send system to at least one recipient system; and at least one non-transitory computer-readable medium that stores processor executable instructions that cause the at least one processor to: compare at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated; determine whether the at least one piece of information from the transformed document corresponds to the at least one piece of information from the pre-transformation document from which the transformed document was generated; generate a notification in response to determining that the at least one piece of information from the transformed document does not correspond to the at least one piece of information from the pre-transformation document from which the transformed document was generated. 74. The document transformation system of claim 73 wherein the at least one processor further calculates at least a first value based on at least one piece of information extracted from the transformed document, and compares at least the first value to the at least one piece of information from the pre-transformation document in order to compare the at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated. 75. The document transformation system of claim 74 wherein the at least one processor further calculates at least one of a line count, a total value, a sub-total value or a total quantity of items from the transformed document. 76. The document transformation system of claim 75 wherein the at least one processor compares at least one of the line count, the total value, the sub-total value or the total quantity of items calculated from the transformed document respectively to at least one of a line count, a total value, a sub-total value or a total quantity of items from the pre-transformation document to compare at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated. 77. The document transformation system of claim 74 wherein the at least one processor further calculates at least a second value based on at least one piece of information from a mid-transformation document, and compares the first value with the second value in order to compare the at least one piece of information from the transformed document to the at least one piece of information from the pre-transformation document from which the transformed document was generated. 78. The document transformation system of claim 74 wherein the at least one processor determines whether the at least one piece of information from the transformed document matches the at least one piece of information from the pre-transformation document from which the transformed document was generated to determine whether the at least one piece of information from the transformed document corresponds to the at least one piece of information from the pre-transformation document from which the transformed document was generated. 79. The document transformation system of claim 73 wherein the at least one processor further:
confirms that the transformed document has all of a set of mandatory data elements defined for the document transformation. | A document transformation system automatically transforms documents electronically transferred between senders and recipients, even where documents of a given type from a given sender which are assumed to be identically formatted differ in various aspects, for instance in scaling, alignment, concatenating, resizing, etc. Document transformation instructions selected based on sender, recipient, or both specify transformation instructions which include one or more maps, document layouts, page layouts, sections extraction instructions, allowing extraction of data or information, and generation of documents or information in a format specified by recipient. Headers and footers may be extracted, and a remaining body concatenated. The system continues to searching for additional instructions on failure of previous instructions to successfully extract a previous section, without terminating. Documents may be converted from a large variety of file formats into a common file format. Extracted information may be stored in a database.1. A method of operating a document transformation system, comprising:
receiving a first document for processing by the document transformation system; determining a first set of instructions stored on at least one nontransistory processor-readable medium of the document transformation system based on at least one aspect of the received first document; based on the first set of instructions which includes at least one set of header specific extraction instructions, at least one set of footer specific extraction instructions and at least one set of line item specific extraction instructions: attempting to extract header data from a first document according to a first one of the at least one set of header specific extraction instructions of the first set of instructions by the at least one processor of the document transformation system; attempting to extract footer data from the first document according to a first one of the at least one set of footer specific extraction instructions of the first set of instructions by the at least one processor of the document transformation system; concatenating remaining data in the first document after extracting all of the header data and all of the footer data from the first document by the at least one processor of the document transformation system; and attempting to extract a number of line items from the first document according to a first one of the set of at least one set of line item specific extraction instructions of the first set of instructions by the at least one processor of the document transformation system. 2. The method of claim 1, further comprising:
determining whether the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was successful; and attempting to extract the header data from the first document according to a second one of the at least one set of header specific extraction instructions if the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was unsuccessful. 3. The method of claim 2, further comprising:
determining if the header data was extracted from the first document successfully by the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions; and concluding that the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was successful if the header data was extracted from the first document without any errors. 4. The method of claim 1, further comprising:
determining whether the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was successful; and attempting to extract the footer data from the first document according to a second one of the at least one set of footer specific extraction instructions if the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was unsuccessful. 5. The method of claim 4, further comprising:
determining if the footer data was extracted from the first document successfully by the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions; and concluding that the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was successful if the footer data was extracted from the first document without any errors. 6. The method of claim 1, further comprising:
determining whether the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was successful; and attempting to extract the line item data from the first document according to a second one of the at least one set of line item specific extraction instructions if the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was unsuccessful. 7. The method of claim 6, further comprising:
determining if the line item data was extracted from the first document successfully by the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions; and concluding that the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was successful if the line item data was extracted from the first document without any errors. 8. The method of claim 1, further comprising:
based on a second set of instructions which includes at least one set of header specific extraction instructions, at least one set of footer specific extraction instructions and at least one set of line item specific extraction instructions: attempting to extract header data from the first document according to a first one of the at least one set of header specific extraction instructions of the second set of instructions; attempting to extract footer data from the first document according to a first one of the at least one set of footer specific extraction instructions of the second set of instructions; concatenating remaining data in the first document after extracting all of the header data and all of the footer data from the first document; and attempting to extract a number of line items from the first document according to a first one of the set of at least one set of line item specific extraction instructions of the second set of instructions. 9. The method of claim 1 wherein concatenating remaining data in the first document includes concatenating remaining data in the first document into a single virtual page. 10. The method of claim 8 wherein concatenating remaining data in the first document into a single virtual page includes concatenating pieces of information from at least two pages of the first document to the single virtual page based on pairs of coordinates to retain a relative positioning of the pieces of information with respect to one another. 11. The method of claim 1, further comprising:
normalizing the first document before attempting to extract any data from the first document. 12. The method of claim 1, further comprising:
converting the first document into a defined transformation file format different from a received file format of the first document before normalizing the first document. 13. The method of claim 1, further comprising:
authenticating an entity that transmitted the first document; and based at least in part on the identity of the entity that transmitted the first document, selecting a first set of transformation instructions which include at least the first set of instructions. 14. The method of claim 13 wherein selecting the first set of file transformation instructions is based at least in part on an identity of an entity that is to receive the first document. 15. The method of claim 14, further comprising:
generating a recipient document formatted according to a format specified by the entity that is to receive the first document; transmitting the recipient document to the entity that is to receive the first document. 16. The method of claim 1, further comprising:
storing one or more pieces of data extracted from the first document to a queryable database stored on at least one non-transitory computer-readable medium. 17. The method of claim 1 wherein the first set of instructions is provided as a first transformation instruction file, the at least one nontransistory processor-readable medium of the document transformation system storing a plurality of stored transformation instruction files which differ from one another in one or more criterion. 18. The method of claim 1 wherein determining a first set of instructions based on at least one aspect of the received first document includes determining the first set of instructions based at least on an identity of at least one of a sender or an intended recipient of the first document. 19. A document transformation system, comprising:
at least one processor coupled to receive a plurality of documents transmitted by at least one send system to at least one recipient system; and at least one non-transitory computer-readable medium that stores processor executable instructions including a first set of instructions which includes at least one set of header specific extraction instructions, at least one set of footer specific extraction instructions and at least one set of line item specific extraction instructions, which when executed by the at least one processor causes the at least one processor to: determine a first set of instructions stored on at least one nontransistory processor-readable medium of the document transformation system based on at least one aspect of a first document of the plurality of documents received by the at least one processor; attempt to extract header data from the first document according to a first one of the at least one set of header specific extraction instructions of the first set of instructions; attempt to extract footer data from the first document according to a first one of the at least one set of footer specific extraction instructions of the first set of instructions; concatenate remaining data in the first document after extracting all of the header data and all of the footer data from the first document; and attempt to extract a number of line items from the first document according to a first one of the set of at least one set of line item specific extraction instructions of the first set of instructions. 20. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
determine whether the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was successful; and
attempt to extract the header data from the first document according to a second one of the at least one set of header specific extraction instructions if the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was unsuccessful. 21. The document transformation system of claim 20 wherein the instructions further cause the at least one processor to:
determine if the header data was extracted from the first document successfully by the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions; and
conclude that the attempt to extract the header data from the first document according to the first one of the at least one set of header specific extraction instructions was successful if the header data was extracted from the first document without any errors. 22. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
determine whether the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was successful; and
attempt to extract the footer data from the first document according to a second one of the at least one set of footer specific extraction instructions if the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was unsuccessful. 23. The document transformation system of claim 22 wherein the instructions further cause the at least one processor to:
determine if the footer data was extracted from the first document successfully by the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions; and
conclude that the attempt to extract the footer data from the first document according to the first one of the at least one set of footer specific extraction instructions was successful if the footer data was extracted from the first document without any errors. 24. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
determine whether the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was successful; and
attempt to extract the line item data from the first document according to a second one of the at least one set of line item specific extraction instructions if the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was unsuccessful. 25. The document transformation system of claim 24 wherein the instructions further cause the at least one processor to:
determine if the line item data was extracted from the first document successfully by the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions; and
conclude determine that the attempt to extract the line item data from the first document according to the first one of the at least one set of line item specific extraction instructions was successful if the line item data was extracted from the first document without any errors. 26. The document transformation system of claim 19 wherein the instructions further include a second set of instructions which includes at least one set of header specific extraction instructions, at least one set of footer specific extraction instructions and at least one set of line item specific extraction instructions, execution of the second set of instructions which causes the at least one processor to:
attempt to extract header data from the first document according to a first one of the at least one set of header specific extraction instructions of the second set of instructions;
attempt to extract footer data from the first document according to a first one of the at least one set of footer specific extraction instructions of the second set of instructions;
concatenate remaining data in the first document after extracting all of the header data and all of the footer data from the first document; and
attempt to extract a number of line items from the first document according to a first one of the set of at least one set of line item specific extraction instructions of the second set of instructions. 27. The document transformation system of claim 19 wherein the instructions cause the at least one processor to concatenate remaining data in the first document into a single virtual page. 28. The document transformation system of claim 27 wherein the instructions cause the at least one processor to concatenate pieces of information from at least two pages of the first document to the single virtual page based on pairs of coordinates to retain a relative positioning of the pieces of information with respect to one another. 29. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
normalize the first document before attempting to extract data from the first document. 30. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
convert the first document into a defined transformation file format different from a received file format of the first document before normalizing the first document. 31. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
authenticate an entity that transmitted the first document; and
based at least in part on the identity of the entity that transmitted the first document, select a first set of transformation instructions which include at least the first set of instructions. 32. The document transformation system of claim 31 wherein the at least one processor selects the first set of file transformation instructions based at least in part on an identity of an entity that is to receive the first document. 33. The document transformation system of claim 32 wherein the instructions further cause the at least one processor to:
generate a recipient document formatted according to a format specified by the entity that is to receive the first document;
transmitting the recipient document to the entity that is to receive the first document. 34. The document transformation system of claim 19 wherein the instructions further cause the at least one processor to:
store one or more pieces of data extracted from the first document to a queryable database stored on at least one non-transitory computer-readable medium. 35. A method of operating a document transformation system, comprising:
successively attempting to extract information from a first section of a first page of a first document according to each of a plurality of sets of first section specific extraction instructions of a first set of instructions until an occurrence of a first of: a) the information from the first section of the first document is successfully extracted or b) extraction of the information from the first section of the first document has been unsuccessfully attempted using each of the plurality of sets of first section specific extraction instructions of the first set of instructions; in response to successfully extracting the information from the first section of the first page of the first document, successively attempting to extract information from a second section of the first page of the first document according to each of a plurality of sets of second section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the second section of the first document is successfully extracted or b) extraction of the information from the second section of the first document has been unsuccessfully attempted using each of the plurality of sets of second section specific extraction instructions of the first set of instructions; and if extraction from the first and second sections has been successful, successively attempting to extract information from a third section of at least the first page of the first document according to each of a plurality of sets of third section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the third section of the first document is successfully extracted or b) extraction of the information from the third section of the first document has been unsuccessfully attempted using each of the plurality of sets of third section specific extraction instructions of the first set of instructions. 36. The method of claim 35, further comprising:
concatenating any information remaining in the first document to a single virtual page after extracting any of the information from each of the first and the second sections of each page of the first document and before successively attempting to extract information from a third section of at least the first page of the first document according to each of a plurality of sets of third section specific extraction instructions. 37. The method of claim 36 wherein the first set of instructions includes a first page layout definition of a plurality of page layout definitions of a number of document layout definitions of at least one map definition in a set of transformation instructions, wherein each of the page layout definitions includes at least one set of first section specific extraction instructions, at least one set of second section specific extraction instructions and at least one set of third section specific extraction instructions, and further comprising:
for each page layout definition, determining whether the page layout definition is appropriate for the first page of the document before successively attempting to extract information from the first section of the first page of the first document according to the set of first section specific extraction instructions. 38. The method of claim 37, further comprising:
determining whether the first document includes a subsequent page; for each page layout definition, determining whether the page layout definition is appropriate for the subsequent page of the first document; successively attempting to extract information from a first section of at least the subsequent page of the first document according to each of a plurality of sets of first section specific extraction instructions of at least one page layout definition until an occurrence of a first of: a) the information from the first section of the subsequent page of the first document is successfully extracted or b) extraction of the information from the first section of the subsequent page of the first document has been unsuccessfully attempted using each of the plurality of sets of first section specific extraction instructions of the at least one set of page layout definition; and in response to successfully extracting the information from the first section of at least the subsequent page of the first document, successively attempting to extract information from a second section of the at least subsequent page of the first document according to each of the plurality of sets of second section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the second section of the at least subsequent page of the first document is successfully extracted or b) extraction of the information from the second section of the at least subsequent page of the first document has been unsuccessfully attempted using each of the plurality of sets of second section specific extraction instructions of the at least one page layout definition. 39. The method of claim 37, further comprising:
determining whether the extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions occurred without any errors; and in response to concluding that extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions did not occur without any errors, determining whether the first set of instructions includes a next page layout definition applicable to the first page of the first document. 40. The method of claim 39, further comprising
determining whether the extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions occurred without any errors includes determining whether a total number of data elements and a respective position of each of the data elements in the document matches a total number of data elements and a respective position of each of the data elements specified in the respective set of first section specific extraction instructions of the first page layout definition. 41. The method of claim 37, further comprising:
determining whether the extraction of the information from the second section of the first document according to at least one of the plurality of sets of second section specific extraction instructions occurred without any errors; and in response to concluding that extraction of the information from the second section of the first document according to at least one of the plurality of sets of second section specific extraction instructions did not occur without any errors, determining whether the first set of instructions includes a next page layout definition applicable to the first page of the first document. 42. The method of claim 35, further comprising:
determining whether all page layout definitions in a document layout definition of a first map definition of the first set of instructions which is applicable to the first page of the first document have been attempted; and in response to concluding that all page layout definitions which are applicable to the first page of the first document have been attempted unsuccessfully, determining whether a second document layout definition of the first set of instructions applicable to the first document is available. 43. A document transformation system, comprising:
at least one processor coupled to receive a plurality of documents transmitted by at least one send system to at least one recipient system; and at least one non-transitory computer-readable medium that stores processor executable instructions which when executed by the at least one processor causes the at least one processor to: successively attempt to extract information from a first section of a first page of a first document according to each of a plurality of sets of first section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the first section of the first page of the first document is successfully extracted or b) extraction of the information from the first section of the first page of the first document has been unsuccessfully attempted using each of the plurality of sets of first section specific extraction instructions of the first set of instructions; in response to successful extraction the information from the first section of the first page of the first document, successively attempt to extract information from a second section of the first page of the first document according to each of a plurality of sets of second section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the second section of the first page of the first document is successfully extracted or b) extraction of the information from the second section of the first page of the first document has been unsuccessfully attempted using each of the plurality of sets of second section specific extraction instructions of the first set of instructions; and if extraction from the first and second sections has been successful, successively attempt to extract information from a third section of at least the first page of the first document according to each of a plurality of sets of third section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the third section of the first document is successfully extracted or b) extraction of the information from the third section of the first document has been unsuccessfully attempted using each of the plurality of sets of third section specific extraction instructions of the first set of mapping instructions. 44. The document transformation system of claim 43 wherein the instructions further cause the at least one processor to:
concatenate any information remaining in the first document to a single first page after extraction of any of the information from each of the first and the second sections of each page of the first document and before the successive attempts to extract information from a third section of at least the first page of the first document according to each of a plurality of sets of third section specific extraction instructions. 45. The document transformation system of claim 44 wherein the instructions include a first page layout definition of a plurality of page layout definitions of a number of document layout definitions of at least one map definition in a set of transformation instructions, wherein each of the page layout definitions includes at least one set of first section specific extraction instructions, at least one set of second section specific extraction instructions and at least one set of third section specific extraction instructions, and further comprising:
for each page layout definition, determine whether the page layout definition is appropriate for the first page of the document before the successive attempts to extract information from the first section of the first page of the first document according to the set of first section specific extraction instructions. 46. The document transformation system of claim 45 wherein the instructions further cause the at least one processor to:
determine whether the first document includes a subsequent page;
for each page layout definition, determine whether the page layout definition is appropriate for the subsequent page of the first document;
successively attempt to extract information from a first section of at least the subsequent page of the first document according to each of a plurality of sets of first section specific extraction instructions of at least one page layout definition until an occurrence of a first of: a) the information from the first section of the subsequent page of the first document is successfully extracted or b) extraction of the information from the first section of the subsequent page of the first document has been unsuccessful attempted using each of the plurality of sets of first section specific extraction instructions of the at least one set of page layout definition; and
in response to successful extraction of the information from the first section of the at least subsequent page of the first document, successively attempt to extract information from a second section of the at least subsequent page of the first document according to each of the plurality of sets of second section specific extraction instructions of the first set of instructions until an occurrence of a first of: a) the information from the second section of the at least subsequent page of the first document is successfully extracted or b) extraction of the information from the second section of the at least subsequent page of the first document has been unsuccessfully attempted using each of the plurality of sets of second section specific extraction instructions of the at least one page layout definition. 47. The document transformation system of claim 45 wherein the instructions further cause the at least one processor to:
determine whether the extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions occurred without any errors; and
in response to concluding that extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions did not occur without any errors, determine whether the first set of instructions includes a next page layout definition applicable to the first page of the first document. 48. The document transformation system of claim 47 wherein the instructions further cause the at least one processor to:
determine whether a total number of data elements and a respective position of each of the data elements in the document matches a total number of data elements and a respective position of each of the data elements specified in the respective set of first section specific extraction instructions of the first page layout definition in order to determine whether the extraction of the information from the first section of the first document according to at least one of the plurality of sets of first section specific extraction instructions occurred without any errors. 49. The document transformation system of claim 45 wherein the instructions further cause the at least one processor to:
determine whether the extraction of the information from the second section of the first document according to at least one of the plurality of sets of second section specific extraction instructions occurred without any errors; and
in response to concluding that extraction of the information from the second section of the first document according to at least one of the plurality of sets of second section specific extraction instructions did not occur without any errors, determine whether the set of instructions includes a next page layout definition applicable to the first page of the first document. 50. The document transformation system of claim 43 wherein the instructions further cause the at least one processor to:
determine whether all page layout definitions in a document layout definition of a first map definition of the first set of instructions which is applicable to the first page of the first document have been attempted; and
in response to concluding that all page layout definitions which are applicable to the first page of the first document have been attempted unsuccessfully, determine whether a second document layout definition of the first set of instructions applicable to the first document is available. 51. A method of operating a document transformation system, comprising:
based on a set of transformation instructions: determining whether to scale at least a portion of a document; determining whether to realign at least a portion of the document; determining whether to concatenate at least a portion of the document; determining whether to resize at least a portion of the document; and performing at least one action on the document based at least in part on an outcome of the determinations. 52. The method of claim 51 wherein determining whether to scale at least a portion of a document includes locating four sides of a page of the document based on a number of anchor elements, and wherein performing at least one action on the document based at least in part on an outcome of the determinations includes scaling at least one element of the document. 53. The method of claim 51 wherein determining whether to realign at least a portion of a document includes locating four sides of a page of the document based on a number of anchor elements, and wherein performing at least one action on the document based at least in part on an outcome of the determinations includes realigning at least one element of the document. 54. The method of claim 51 wherein determining whether to concatenate at least a portion of a document includes searching the document for any wrapped elements, and wherein performing at least one action on the document based at least in part on an outcome of the determinations includes concatenating at least two elements of the document. 55. The method of claim 51 wherein determining whether to resize at least a portion of a document includes searching the document for any overlapping elements, and wherein performing at least one action on the document based at least in part on an outcome of the determinations includes resizing at least one of the elements of the document. 56. The method of claim 51, further comprising:
sorting elements in the document based at least in part on coordinate pairs; and for each line, setting a Y coordinate for all elements on the line to a same value. 57. The method of claim 51, further comprising:
calculating a size of a space that serves as a delimiter between two elements; and reformatting at least one element based on the calculated space. 58. The method of claim 51, further comprising:
searching at least one section of the document for a split value; and splitting the document into at least two separate documents in response to finding at least one split value. 59. A document transformation system, comprising:
at least one processor coupled to receive a plurality of documents transmitted by at least one send system to at least one recipient system; and at least one non-transitory computer-readable medium that stores processor executable instructions including a set of transformation instructions which when executed by the at least one processor causes the at least one processor to: determine whether to scale at least a portion of a document; determine whether to realign at least a portion of the document; determine whether to concatenate at least a portion of the document; determine whether to resize at least a portion of the document; and perform at least one action on the document based at least in part on an outcome of the determinations. 60. The document transformation system of claim 59 wherein the instructions cause the at least one processor to locate four sides of a page of the document based on a number of anchor elements to determine whether to scale at least a portion of the document, and scale at least one element of the document to perform the at least one action on the document based at least in part on the outcome of the determinations. 61. The document transformation system of claim 59 wherein the instructions cause the at least one processor to locate four sides of a page of the document based on a number of anchor elements to determine whether to realign at least a portion of the document, and realign at least one element of the document to perform the at least one action on the document based at least in part on the outcome of the determinations. 62. The document transformation system of claim 59 wherein the instructions cause the at least one processor to search the document for any wrapped elements to determine whether to concatenate at least a portion of the document, and to concatenate at least two elements of the document to perform the at least one action on the document based at least in part on the outcome of the determinations. 63. The document transformation system of claim 59 wherein the instructions cause the at least one processor to search the document for any overlapping elements to determine whether to resize at least a portion of the document, and to resize at least one of the elements of the document to perform the at least one action on the document based at least in part on the outcome of the determinations. 64. The document transformation system of claim 59 wherein the instructions further cause the at least one processor to:
sort elements in the document based at least in part on coordinate pairs; and
for each line, set a Y coordinate for all elements on the line to a same value. 65. The document transformation system of claim 59 wherein the instructions further cause the at least one processor to:
calculate a size of a space that serves as a delimiter between two elements; and
reformat at least one element based on the calculated space. 66. The document transformation system of claim 59 wherein the instructions further cause the at least one processor to:
search at least one section of the document for a split value; and
split the document into at least two separate documents in response to finding at least one split value. 67. A method of operating a document transformation system, the method comprising:
comparing by the at least one processor at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated; determining by the at least one processor whether the at least one piece of information from the transformed document corresponds to the at least one piece of information from the pre-transformation document from which the transformed document was generated; and generating by the at least one processor a notification in response to determining that the at least one piece of information from the transformed document does not correspond to the at least one piece of information from the pre-transformation document from which the transformed document was generated. 68. The method of claim 67, further comprising:
calculating at least a first value based on at least one piece of information extracted from the transformed document, and wherein comparing by the at least one processor at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated includes comparing at least the first value to the at least one piece of information from the pre-transformation document. 69. The method of claim 68 wherein calculating at least the first value based on at least one piece of information extracted from the transformed document includes calculating at least one of a line count, a total value, a sub-total value or a total quantity of items from the transformed document and wherein the at least one piece of information from a pre-transformed document is at least one of a line count, total value, sub-total value or total quantity of items. 70. The method of claim 68, further comprising:
calculating at least a second value based on at least one piece of information from a mid-transformation document, and wherein comparing by at least one processor at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated includes comparing at least the first value to at least the second value. 71. The method of claim 67 wherein determining by the at least one processor whether the at least one piece of information from the transformed document corresponds to the at least one piece of information from the pre-transformation document from which the transformed document was generated includes: determining whether the at least one piece of information from the transformed document matches the at least one piece of information from the pre-transformation document from which the transformed document was generated. 72. The method of claim 67, further comprising:
confirming by the at least one processor that the transformed document has all of a set of mandatory data elements defined for the document transformation. 73. A document transformation system, comprising:
at least one processor coupled to receive a plurality of documents transmitted by at least one send system to at least one recipient system; and at least one non-transitory computer-readable medium that stores processor executable instructions that cause the at least one processor to: compare at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated; determine whether the at least one piece of information from the transformed document corresponds to the at least one piece of information from the pre-transformation document from which the transformed document was generated; generate a notification in response to determining that the at least one piece of information from the transformed document does not correspond to the at least one piece of information from the pre-transformation document from which the transformed document was generated. 74. The document transformation system of claim 73 wherein the at least one processor further calculates at least a first value based on at least one piece of information extracted from the transformed document, and compares at least the first value to the at least one piece of information from the pre-transformation document in order to compare the at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated. 75. The document transformation system of claim 74 wherein the at least one processor further calculates at least one of a line count, a total value, a sub-total value or a total quantity of items from the transformed document. 76. The document transformation system of claim 75 wherein the at least one processor compares at least one of the line count, the total value, the sub-total value or the total quantity of items calculated from the transformed document respectively to at least one of a line count, a total value, a sub-total value or a total quantity of items from the pre-transformation document to compare at least one piece of information from a transformed document to at least one piece of information from a pre-transformation document from which the transformed document was generated. 77. The document transformation system of claim 74 wherein the at least one processor further calculates at least a second value based on at least one piece of information from a mid-transformation document, and compares the first value with the second value in order to compare the at least one piece of information from the transformed document to the at least one piece of information from the pre-transformation document from which the transformed document was generated. 78. The document transformation system of claim 74 wherein the at least one processor determines whether the at least one piece of information from the transformed document matches the at least one piece of information from the pre-transformation document from which the transformed document was generated to determine whether the at least one piece of information from the transformed document corresponds to the at least one piece of information from the pre-transformation document from which the transformed document was generated. 79. The document transformation system of claim 73 wherein the at least one processor further:
confirms that the transformed document has all of a set of mandatory data elements defined for the document transformation. | 2,100 |
4,564 | 13,935,607 | 2,174 | Software development using gestures includes, receiving, in an integrated development environment (IDE), a gesture input through a gesture capture device and matching, using a processor, the gesture input to a selected gesture of a plurality of gestures. Each of the plurality of gestures is mapped to a programmatic action of the IDE. The programmatic action mapped to the selected gesture is determined. Further, the programmatic action mapped to the selected gesture is performed within the IDE. | 1. A method, comprising:
receiving, in an integrated development environment, a gesture input through a gesture capture device; matching, using a processor, the gesture input to a selected gesture of a plurality of gestures, wherein each of the plurality of gestures is mapped to a programmatic action of the integrated development environment; determining the programmatic action mapped to the selected gesture; and performing the programmatic action mapped to the selected gesture within the integrated development environment. 2. The method of claim 1, wherein the selected gesture and the gesture input are a multi-touch gesture. 3. The method of claim 1, wherein the selected gesture is further mapped to a program code template. 4. The method of claim 3, wherein performing the programmatic action mapped to the selected gesture comprises:
inserting program code of the program code template into a current project of the integrated development environment. 5. The method of claim 4, wherein the program code template includes a label, the method further comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to the gesture input. 6. The method of claim 4, wherein the program code template includes a label, the method further comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to a subsequent user input. 7. The method of claim 4, wherein the program code template includes a label, the method further comprising:
replacing the label, within the current project, with content from a clipboard of a data processing system. | Software development using gestures includes, receiving, in an integrated development environment (IDE), a gesture input through a gesture capture device and matching, using a processor, the gesture input to a selected gesture of a plurality of gestures. Each of the plurality of gestures is mapped to a programmatic action of the IDE. The programmatic action mapped to the selected gesture is determined. Further, the programmatic action mapped to the selected gesture is performed within the IDE.1. A method, comprising:
receiving, in an integrated development environment, a gesture input through a gesture capture device; matching, using a processor, the gesture input to a selected gesture of a plurality of gestures, wherein each of the plurality of gestures is mapped to a programmatic action of the integrated development environment; determining the programmatic action mapped to the selected gesture; and performing the programmatic action mapped to the selected gesture within the integrated development environment. 2. The method of claim 1, wherein the selected gesture and the gesture input are a multi-touch gesture. 3. The method of claim 1, wherein the selected gesture is further mapped to a program code template. 4. The method of claim 3, wherein performing the programmatic action mapped to the selected gesture comprises:
inserting program code of the program code template into a current project of the integrated development environment. 5. The method of claim 4, wherein the program code template includes a label, the method further comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to the gesture input. 6. The method of claim 4, wherein the program code template includes a label, the method further comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to a subsequent user input. 7. The method of claim 4, wherein the program code template includes a label, the method further comprising:
replacing the label, within the current project, with content from a clipboard of a data processing system. | 2,100 |
4,565 | 13,928,738 | 2,174 | Software development using gestures includes, receiving, in an integrated development environment (IDE), a gesture input through a gesture capture device and matching, using a processor, the gesture input to a selected gesture of a plurality of gestures. Each of the plurality of gestures is mapped to a programmatic action of the IDE. The programmatic action mapped to the selected gesture is determined. Further, the programmatic action mapped to the selected gesture is performed within the IDE. | 1. A system comprising:
a processor programmed to initiate executable operations comprising: receiving, in an integrated development environment, a gesture input through a gesture capture device; matching the gesture input to a selected gesture of a plurality of gestures, wherein each of the plurality of gestures is mapped to a programmatic action of the integrated development environment; determining the programmatic action mapped to the selected gesture; and performing the programmatic action mapped to the selected gesture within the integrated development environment. 2. The system of claim 1, wherein the selected gesture and the gesture input are a multi-touch gesture. 3. The system of claim 1, wherein the selected gesture is further mapped to a program code template. 4. The system of claim 3, wherein performing the programmatic action mapped to the selected gesture comprises:
inserting program code of the program code template into a current project within the integrated development environment. 5. The system of claim 4, wherein the program code template includes a label, wherein the processor is further programmed to initiate executable operations comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to the gesture input. 6. The method of claim 4, wherein the program code template includes a label, wherein the processor is further programmed to initiate executable operations comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to a subsequent user input. 7. The method of claim 4, wherein the program code template includes a label, wherein the processor is further programmed to initiate executable operations comprising:
replacing the label, within the current project, with content from a clipboard of a data processing system. 8. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method comprising:
receiving, in an integrated development environment and using the processor, a gesture input through a gesture capture device; matching, using the processor, the gesture input to a selected gesture of a plurality of gestures, wherein each of the plurality of gestures is mapped to a programmatic action of the integrated development environment; determining, using the processor, the programmatic action mapped to the selected gesture; and performing, using the processor, the programmatic action mapped to the selected gesture within the integrated development environment. 9. The computer program product of claim 8, wherein the selected gesture and the gesture input are a multi-touch gesture. 10. The computer program product of claim 8, wherein the selected gesture is further mapped to a program code template. 11. The computer program product of claim 10, wherein performing the programmatic action mapped to the selected gesture comprises:
inserting program code of the program code template into a current project within the integrated development environment. 12. The computer program product of claim 11, wherein the program code template includes a label, the method further comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to the gesture input. 13. The computer program product of claim 11, wherein the program code template includes a label, the method further comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to a subsequent user input. 14. The computer program product of claim 11, wherein the program code template includes a label, the method further comprising:
replacing the label, within the current project, with content from a clipboard of a data processing system. | Software development using gestures includes, receiving, in an integrated development environment (IDE), a gesture input through a gesture capture device and matching, using a processor, the gesture input to a selected gesture of a plurality of gestures. Each of the plurality of gestures is mapped to a programmatic action of the IDE. The programmatic action mapped to the selected gesture is determined. Further, the programmatic action mapped to the selected gesture is performed within the IDE.1. A system comprising:
a processor programmed to initiate executable operations comprising: receiving, in an integrated development environment, a gesture input through a gesture capture device; matching the gesture input to a selected gesture of a plurality of gestures, wherein each of the plurality of gestures is mapped to a programmatic action of the integrated development environment; determining the programmatic action mapped to the selected gesture; and performing the programmatic action mapped to the selected gesture within the integrated development environment. 2. The system of claim 1, wherein the selected gesture and the gesture input are a multi-touch gesture. 3. The system of claim 1, wherein the selected gesture is further mapped to a program code template. 4. The system of claim 3, wherein performing the programmatic action mapped to the selected gesture comprises:
inserting program code of the program code template into a current project within the integrated development environment. 5. The system of claim 4, wherein the program code template includes a label, wherein the processor is further programmed to initiate executable operations comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to the gesture input. 6. The method of claim 4, wherein the program code template includes a label, wherein the processor is further programmed to initiate executable operations comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to a subsequent user input. 7. The method of claim 4, wherein the program code template includes a label, wherein the processor is further programmed to initiate executable operations comprising:
replacing the label, within the current project, with content from a clipboard of a data processing system. 8. A computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method comprising:
receiving, in an integrated development environment and using the processor, a gesture input through a gesture capture device; matching, using the processor, the gesture input to a selected gesture of a plurality of gestures, wherein each of the plurality of gestures is mapped to a programmatic action of the integrated development environment; determining, using the processor, the programmatic action mapped to the selected gesture; and performing, using the processor, the programmatic action mapped to the selected gesture within the integrated development environment. 9. The computer program product of claim 8, wherein the selected gesture and the gesture input are a multi-touch gesture. 10. The computer program product of claim 8, wherein the selected gesture is further mapped to a program code template. 11. The computer program product of claim 10, wherein performing the programmatic action mapped to the selected gesture comprises:
inserting program code of the program code template into a current project within the integrated development environment. 12. The computer program product of claim 11, wherein the program code template includes a label, the method further comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to the gesture input. 13. The computer program product of claim 11, wherein the program code template includes a label, the method further comprising:
determining replacement program code for the label; and replacing the label with the replacement program code within the current project; wherein the replacement program code is determined according to a subsequent user input. 14. The computer program product of claim 11, wherein the program code template includes a label, the method further comprising:
replacing the label, within the current project, with content from a clipboard of a data processing system. | 2,100 |
4,566 | 13,566,128 | 2,121 | Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for organizing trained and untrained neural networks. In one aspect, a neural network device includes a collection of node assemblies interconnected by between-assembly links, each node assembly itself comprising a network of nodes interconnected by a plurality of within-assembly links, wherein each of the between-assembly links and the within-assembly links have an associated weight, each weight embodying a strength of connection between the nodes joined by the associated link, the nodes within each assembly being more likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies. | 1. A neural network device implemented in hardware, in software, or in a combination thereof, comprising:
a collection of node assemblies interconnected by between-assembly links, each node assembly itself comprising a network of nodes interconnected by a plurality of within-assembly links, wherein each of the between-assembly links and the within-assembly links have an associated weight, each weight embodying a strength of connection between the nodes joined by the associated link, the nodes within each assembly being more likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies. 2. The neural network device of claim 1, wherein the weights associated with the between-assembly links embody training of the neural device to a particular purpose. 3. The neural network device of claim 2, wherein the within-assembly links embody the training of the neural device to the particular purpose to a lesser extent than the between-assembly links. 4. The neural network device of claim 1, wherein the nodes are connected and the node assemblies formed according to pairwise connectivity profiles. 5. The neural network device of claim 1, wherein the variance in average weight within each of the node assemblies generally decreases for node assemblies having higher numbers of links. 6. The neural network device of claim 1, wherein the average strength of interconnection with each respective node assembly asymptotically approaches a respective limit as the number of links within the respective node assembly exceeds the number of nodes within the respective node assembly. 7. The neural network device of claim 6, wherein the respective limits are substantially identical. 8. The neural network device of claim 1, wherein, for node assemblies having a number of within-assembly links that is smaller than a number of nodes within the same node assembly, magnitudes of the weights of the within-assembly links are associated with distinguishably discrete levels of a set of levels. 9. The neural network device of claim 8, wherein each discrete level is associated with a different number of nodes within the assembly. 10. The neural network device of claim 1, further comprising an adaptor component configured to change the magnitude of each weight of the within-assembly links based on a number of other nodes within the assembly of each within-assembly link. 11. The neural network device of claim 10, wherein the adaptor component is configured to change the magnitude of each weight before the neural network device is trained. 12. The neural network device of claim 1, wherein the neural network device is untrained. 13. The neural network device of claim 1, further comprising an adaptor component configured to change a probability of connection between nodes in each node assembly based on a number of nodes within the node assembly. 14. The neural network device of claim 13, wherein the adaptor component is configured to change the magnitude of each weight before the neural network device is trained. 15. The neural network device of claim 1, wherein the links comprise reciprocal links and non-reciprocal links. 16. The neural network device of claim 15, wherein the non-reciprocal links are about twice as common as the reciprocal links. 17. The neural network device of claim 1, wherein the nodes within each assembly are about twice as likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies. 18. The neural network device of claim 1, wherein a number of node assemblies having between ten and 100 nodes is greater than a number of node assemblies having less than ten and more than 100 nodes. 19. The neural network device of claim 1, wherein there are between ten and 100 node assemblies. 20. A machine-implemented method of forming a neural network device, the method comprising:
forming a network of nodes implemented in hardware, in software, or in a combination thereof; and assigning or reassigning links between nodes of the network by connecting or disconnecting nodes with a probability that embodies a number of common neighbors shared by the nodes. 21. The method of claim 20, further comprising repeating the assigning or reassigning until a quasi steady-state is reached. 22. The method of claim 21, wherein the quasi steady-state comprises a neural network device. 23. The method of claim 20, wherein the nodes are connected according to pairwise connectivity profiles. 24. The method of claim 20, further comprising training the network of nodes. 25. The method of claim 24, wherein training the network of nodes comprises:
weighting links within the node assemblies with relatively stable weights; and weighting links between node assemblies to embody the training while leaving the weights of links within the node assemblies relatively unchanged. 26. The method of claim 20, further comprising assigning weights to each link between first and second nodes based on a number of nodes commonly connected to both the first and second nodes. 27. The method of claim 20, further comprising assigning an initial set of links according to either a random assignment processes or a process in which link assignments are made in accordance with a probability of two nodes being linked. 28. The method of claim 20, wherein the method forms an untrained neural network device. 29. The method of claim 20, further comprising repeating the assigning or reassigning until the number of links within each respective node assembly exceeds the number of nodes within that respective node assembly. 30. The method of claim 29, further comprising weighting links in each of the respective node assemblies with weights that approach limits as the number of links exceeds the number of nodes. 31. The method of claim 30, wherein the limits for node assemblies of different sizes are substantially the same. | Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for organizing trained and untrained neural networks. In one aspect, a neural network device includes a collection of node assemblies interconnected by between-assembly links, each node assembly itself comprising a network of nodes interconnected by a plurality of within-assembly links, wherein each of the between-assembly links and the within-assembly links have an associated weight, each weight embodying a strength of connection between the nodes joined by the associated link, the nodes within each assembly being more likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies.1. A neural network device implemented in hardware, in software, or in a combination thereof, comprising:
a collection of node assemblies interconnected by between-assembly links, each node assembly itself comprising a network of nodes interconnected by a plurality of within-assembly links, wherein each of the between-assembly links and the within-assembly links have an associated weight, each weight embodying a strength of connection between the nodes joined by the associated link, the nodes within each assembly being more likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies. 2. The neural network device of claim 1, wherein the weights associated with the between-assembly links embody training of the neural device to a particular purpose. 3. The neural network device of claim 2, wherein the within-assembly links embody the training of the neural device to the particular purpose to a lesser extent than the between-assembly links. 4. The neural network device of claim 1, wherein the nodes are connected and the node assemblies formed according to pairwise connectivity profiles. 5. The neural network device of claim 1, wherein the variance in average weight within each of the node assemblies generally decreases for node assemblies having higher numbers of links. 6. The neural network device of claim 1, wherein the average strength of interconnection with each respective node assembly asymptotically approaches a respective limit as the number of links within the respective node assembly exceeds the number of nodes within the respective node assembly. 7. The neural network device of claim 6, wherein the respective limits are substantially identical. 8. The neural network device of claim 1, wherein, for node assemblies having a number of within-assembly links that is smaller than a number of nodes within the same node assembly, magnitudes of the weights of the within-assembly links are associated with distinguishably discrete levels of a set of levels. 9. The neural network device of claim 8, wherein each discrete level is associated with a different number of nodes within the assembly. 10. The neural network device of claim 1, further comprising an adaptor component configured to change the magnitude of each weight of the within-assembly links based on a number of other nodes within the assembly of each within-assembly link. 11. The neural network device of claim 10, wherein the adaptor component is configured to change the magnitude of each weight before the neural network device is trained. 12. The neural network device of claim 1, wherein the neural network device is untrained. 13. The neural network device of claim 1, further comprising an adaptor component configured to change a probability of connection between nodes in each node assembly based on a number of nodes within the node assembly. 14. The neural network device of claim 13, wherein the adaptor component is configured to change the magnitude of each weight before the neural network device is trained. 15. The neural network device of claim 1, wherein the links comprise reciprocal links and non-reciprocal links. 16. The neural network device of claim 15, wherein the non-reciprocal links are about twice as common as the reciprocal links. 17. The neural network device of claim 1, wherein the nodes within each assembly are about twice as likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies. 18. The neural network device of claim 1, wherein a number of node assemblies having between ten and 100 nodes is greater than a number of node assemblies having less than ten and more than 100 nodes. 19. The neural network device of claim 1, wherein there are between ten and 100 node assemblies. 20. A machine-implemented method of forming a neural network device, the method comprising:
forming a network of nodes implemented in hardware, in software, or in a combination thereof; and assigning or reassigning links between nodes of the network by connecting or disconnecting nodes with a probability that embodies a number of common neighbors shared by the nodes. 21. The method of claim 20, further comprising repeating the assigning or reassigning until a quasi steady-state is reached. 22. The method of claim 21, wherein the quasi steady-state comprises a neural network device. 23. The method of claim 20, wherein the nodes are connected according to pairwise connectivity profiles. 24. The method of claim 20, further comprising training the network of nodes. 25. The method of claim 24, wherein training the network of nodes comprises:
weighting links within the node assemblies with relatively stable weights; and weighting links between node assemblies to embody the training while leaving the weights of links within the node assemblies relatively unchanged. 26. The method of claim 20, further comprising assigning weights to each link between first and second nodes based on a number of nodes commonly connected to both the first and second nodes. 27. The method of claim 20, further comprising assigning an initial set of links according to either a random assignment processes or a process in which link assignments are made in accordance with a probability of two nodes being linked. 28. The method of claim 20, wherein the method forms an untrained neural network device. 29. The method of claim 20, further comprising repeating the assigning or reassigning until the number of links within each respective node assembly exceeds the number of nodes within that respective node assembly. 30. The method of claim 29, further comprising weighting links in each of the respective node assemblies with weights that approach limits as the number of links exceeds the number of nodes. 31. The method of claim 30, wherein the limits for node assemblies of different sizes are substantially the same. | 2,100 |
4,567 | 14,838,013 | 2,121 | Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for organizing trained and untrained neural networks. In one aspect, a neural network device includes a collection of node assemblies interconnected by between-assembly links, each node assembly itself comprising a network of nodes interconnected by a plurality of within-assembly links, wherein each of the between-assembly links and the within-assembly links have an associated weight, each weight embodying a strength of connection between the nodes joined by the associated link, the nodes within each assembly being more likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies. | 1. A neural network device implemented in hardware, in software, or in a combination thereof, comprising:
a collection of node assemblies interconnected by between-assembly links, each node assembly itself comprising a network of nodes interconnected by a plurality of within-assembly links, wherein each of the between-assembly links and the within-assembly links have an associated weight, each weight embodying a strength of connection between the nodes joined by the associated link, the nodes within each assembly being more likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies. 2. The neural network device of claim 1, wherein the weights associated with the between-assembly links embody training of the neural device to a particular purpose. 3. The neural network device of claim 2, wherein the within-assembly links embody the training of the neural device to the particular purpose to a lesser extent than the between-assembly links. 4. The neural network device of claim 1, wherein the nodes are connected and the node assemblies formed according to pairwise connectivity profiles. 5. The neural network device of claim 1, wherein the variance in average weight within each of the node assemblies generally decreases for node assemblies having higher numbers of links. 6. The neural network device of claim 1, wherein the average strength of interconnection with each respective node assembly asymptotically approaches a respective limit as the number of links within the respective node assembly exceeds the number of nodes within the respective node assembly. 7. The neural network device of claim 6, wherein the respective limits are substantially identical. 8. The neural network device of claim 1, wherein, for node assemblies having a number of within-assembly links that is smaller than a number of nodes within the same node assembly, magnitudes of the weights of the within-assembly links are associated with distinguishably discrete levels of a set of levels. 9. The neural network device of claim 8, wherein each discrete level is associated with a different number of nodes within the assembly. 10. The neural network device of claim 1, further comprising an adaptor component configured to change the magnitude of each weight of the within-assembly links based on a number of other nodes within the assembly of each within-assembly link. 11. The neural network device of claim 10, wherein the adaptor component is configured to change the magnitude of each weight before the neural network device is trained. 12. The neural network device of claim 1, wherein the neural network device is untrained. 13. The neural network device of claim 1, further comprising an adaptor component configured to change a probability of connection between nodes in each node assembly based on a number of nodes within the node assembly. 14. The neural network device of claim 13, wherein the adaptor component is configured to change the magnitude of each weight before the neural network device is trained. 15. The neural network device of claim 1, wherein the links comprise reciprocal links and non-reciprocal links. 16. The neural network device of claim 15, wherein the non-reciprocal links are about twice as common as the reciprocal links. 17. The neural network device of claim 1, wherein the nodes within each assembly are about twice as likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies. 18. The neural network device of claim 1, wherein a number of node assemblies having between ten and 100 nodes is greater than a number of node assemblies having less than ten and more than 100 nodes. 19. The neural network device of claim 1, wherein there are between ten and 100 node assemblies. | Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for organizing trained and untrained neural networks. In one aspect, a neural network device includes a collection of node assemblies interconnected by between-assembly links, each node assembly itself comprising a network of nodes interconnected by a plurality of within-assembly links, wherein each of the between-assembly links and the within-assembly links have an associated weight, each weight embodying a strength of connection between the nodes joined by the associated link, the nodes within each assembly being more likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies.1. A neural network device implemented in hardware, in software, or in a combination thereof, comprising:
a collection of node assemblies interconnected by between-assembly links, each node assembly itself comprising a network of nodes interconnected by a plurality of within-assembly links, wherein each of the between-assembly links and the within-assembly links have an associated weight, each weight embodying a strength of connection between the nodes joined by the associated link, the nodes within each assembly being more likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies. 2. The neural network device of claim 1, wherein the weights associated with the between-assembly links embody training of the neural device to a particular purpose. 3. The neural network device of claim 2, wherein the within-assembly links embody the training of the neural device to the particular purpose to a lesser extent than the between-assembly links. 4. The neural network device of claim 1, wherein the nodes are connected and the node assemblies formed according to pairwise connectivity profiles. 5. The neural network device of claim 1, wherein the variance in average weight within each of the node assemblies generally decreases for node assemblies having higher numbers of links. 6. The neural network device of claim 1, wherein the average strength of interconnection with each respective node assembly asymptotically approaches a respective limit as the number of links within the respective node assembly exceeds the number of nodes within the respective node assembly. 7. The neural network device of claim 6, wherein the respective limits are substantially identical. 8. The neural network device of claim 1, wherein, for node assemblies having a number of within-assembly links that is smaller than a number of nodes within the same node assembly, magnitudes of the weights of the within-assembly links are associated with distinguishably discrete levels of a set of levels. 9. The neural network device of claim 8, wherein each discrete level is associated with a different number of nodes within the assembly. 10. The neural network device of claim 1, further comprising an adaptor component configured to change the magnitude of each weight of the within-assembly links based on a number of other nodes within the assembly of each within-assembly link. 11. The neural network device of claim 10, wherein the adaptor component is configured to change the magnitude of each weight before the neural network device is trained. 12. The neural network device of claim 1, wherein the neural network device is untrained. 13. The neural network device of claim 1, further comprising an adaptor component configured to change a probability of connection between nodes in each node assembly based on a number of nodes within the node assembly. 14. The neural network device of claim 13, wherein the adaptor component is configured to change the magnitude of each weight before the neural network device is trained. 15. The neural network device of claim 1, wherein the links comprise reciprocal links and non-reciprocal links. 16. The neural network device of claim 15, wherein the non-reciprocal links are about twice as common as the reciprocal links. 17. The neural network device of claim 1, wherein the nodes within each assembly are about twice as likely to be connected to other nodes within that assembly than to be connected to nodes within others of the node assemblies. 18. The neural network device of claim 1, wherein a number of node assemblies having between ten and 100 nodes is greater than a number of node assemblies having less than ten and more than 100 nodes. 19. The neural network device of claim 1, wherein there are between ten and 100 node assemblies. | 2,100 |
4,568 | 13,918,790 | 2,176 | A plurality of graphical elements may be represented as a document object model (DOM) having a plurality of nodes, each node representing a different graphical element, the DOM having an ordering of the nodes, each node having a z-value of front or back, indicating that the corresponding graphical element is to be displayed in a front layer for a z-value of front or a back layer for a z-value of back. The z-value of one or more of the plurality of nodes corresponding to one or more graphical elements to be moved to the front layer or back layer may be altered. The DOM can then be reordered so that the one or more graphical elements to be moved to the front layer or back layer are at the front or back of the DOM, while maintaining the ordering between nodes having z-values of front and the ordering between nodes having z-values of back. | 1. A method of altering ordering of graphical elements to be presented on a display, the method comprising:
representing a plurality of graphical elements as a document object model (DOM) having a plurality of nodes, each node representing a different graphical element, the DOM having an ordering of the nodes, each node having a z-value of front or back, indicating that a corresponding graphical element is to be displayed in a front layer for a z-value of front or a back layer for a z-value of back; altering the z-value of one or more of the plurality of nodes corresponding to one or more graphical elements to be moved to the front layer or back layer; and reordering the DOM so that the one or more graphical elements to be moved to the front layer or back layer are at the front or back of the DOM, while maintaining the ordering between nodes having z-values of front and the ordering between nodes having z-values of back. 2. The method of claim 1, wherein the graphical elements are scalable vector graphics (SVG) elements. 3. The method of claim 1, further comprising:
determining whether a number of the one or more of the plurality of nodes corresponding to one or more graphic elements to be moved to the front layer or back layer exceeds a predetermined threshold; and in response to a determination that the number does not exceed the predetermined threshold, reordering the DOM one node at a time. 4. The method of claim 1, further comprising:
determining whether a number of the one or more of the plurality of nodes corresponding to one or more graphic elements to be moved to the front layer or back layer exceeds a predetermined threshold; and in response to a determination that the number exceeds the predetermined threshold, reordering the DOM nodes in bulk. 5. The method of claim 1, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes, moving the remainder of nodes in front of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved. 6. The method of claim 1, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is not greater than the remainder of the nodes, moving the one or more plurality of nodes corresponding to the one or more graphic elements to be moved in front of the remainder of nodes. 7. The method of claim 1, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is back:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than the remainder of the nodes, moving the remainder of nodes behind the one or more plurality of nodes corresponding to the one or more graphic elements to be moved. 8. The method of claim 1, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is not greater than the remainder of the nodes, moving the one or more plurality of nodes corresponding to the one or more graphic elements to be moved behind the remainder of nodes. 9. A system comprising:
a processor operating a DOM parser and an interactivity module; the DOM parser configured to represent a plurality of graphical elements as a document object model (DOM) having a plurality of nodes, each node representing a different graphical element, the DOM having an ordering of the nodes, each node having a z-value of front or back, indicating that a corresponding graphical element is to be displayed in a front layer for a z-value of front or a back layer for a z-value of back; the interactivity module configured to:
alter the z-value of one or more of the plurality of nodes corresponding to one or more graphical elements to be moved to the front layer or back layer; and
reorder the DOM so that the one or more graphical elements to be moved to the front layer or back layer are at the front or back of the DOM, while maintaining the ordering between nodes having z-values of front and the ordering between nodes having z-values of back. 10. The system of claim 9, wherein the interactivity module is located on a web server. 11. The system of claim 10, wherein the web server communicates with a browser on a web client, the browser rendering graphics based on the reordered DOM. 12. The system of claim 11, wherein the interactivity module is located on a client device operating a web browser. 13. A non-transitory computer-readable storage medium comprising instructions that, when executed by at least one processor of a machine, cause the machine to perform operations of altering ordering of graphical elements to be presented on a display, including:
representing a plurality of graphical elements as a document object model (DOM) having a plurality of nodes, each node representing a different graphical element, the DOM having an ordering of the nodes, each node having a z-value of front or back, indicating that a corresponding graphical element is to be displayed in a front layer for a z-value of front or a back layer for a z-value of back; altering the z-value of one or more of the plurality of nodes corresponding to one or more graphical elements to be moved to the front layer or back layer; and reordering the DOM so that the one or more graphical elements to be moved to the front layer or back layer are at the front or back of the DOM, while maintaining the ordering between nodes having z-values of front and the ordering between nodes having z-values of back. 14. The non-transitory computer-readable storage medium of claim 13, wherein the graphical elements are scalable vector graphics (SVG) elements. 15. The non-transitory computer-readable storage medium of claim 13, wherein the operations further comprise:
determining whether a number of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved to the front layer or back layer exceeds a predetermined threshold; and in response to a determination that the number does not exceed the predetermined threshold, reordering the DOM one node at a time. 16. The non-transitory computer-readable storage medium of claim 13, wherein the operations further comprise:
determining whether a number of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved to the front layer or back layer exceeds a predetermined threshold; and in response to a determination that the number exceeds the predetermined threshold, reordering the DOM nodes in bulk. 17. The non-transitory computer-readable storage medium of claim 13, wherein the operations further comprise:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than the remainder of the nodes, moving the remainder of nodes in front of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved. 18. The non-transitory computer-readable storage medium of claim 13, wherein the operations further comprise:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is not greater than the remainder of the nodes, moving the one or more plurality of nodes corresponding to the one or more graphic elements to be moved in front of the remainder of nodes. 19. The non-transitory computer-readable storage medium of claim 13, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is back:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than the remainder of the nodes, moving the remainder of nodes behind the one or more plurality of nodes corresponding to the one or more graphic elements to be moved. 20. The non-transitory computer-readable storage medium of claim 13, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is not greater than the remainder of the nodes, moving the one or more plurality of nodes corresponding to the one or more graphic elements to be moved behind the remainder of nodes. | A plurality of graphical elements may be represented as a document object model (DOM) having a plurality of nodes, each node representing a different graphical element, the DOM having an ordering of the nodes, each node having a z-value of front or back, indicating that the corresponding graphical element is to be displayed in a front layer for a z-value of front or a back layer for a z-value of back. The z-value of one or more of the plurality of nodes corresponding to one or more graphical elements to be moved to the front layer or back layer may be altered. The DOM can then be reordered so that the one or more graphical elements to be moved to the front layer or back layer are at the front or back of the DOM, while maintaining the ordering between nodes having z-values of front and the ordering between nodes having z-values of back.1. A method of altering ordering of graphical elements to be presented on a display, the method comprising:
representing a plurality of graphical elements as a document object model (DOM) having a plurality of nodes, each node representing a different graphical element, the DOM having an ordering of the nodes, each node having a z-value of front or back, indicating that a corresponding graphical element is to be displayed in a front layer for a z-value of front or a back layer for a z-value of back; altering the z-value of one or more of the plurality of nodes corresponding to one or more graphical elements to be moved to the front layer or back layer; and reordering the DOM so that the one or more graphical elements to be moved to the front layer or back layer are at the front or back of the DOM, while maintaining the ordering between nodes having z-values of front and the ordering between nodes having z-values of back. 2. The method of claim 1, wherein the graphical elements are scalable vector graphics (SVG) elements. 3. The method of claim 1, further comprising:
determining whether a number of the one or more of the plurality of nodes corresponding to one or more graphic elements to be moved to the front layer or back layer exceeds a predetermined threshold; and in response to a determination that the number does not exceed the predetermined threshold, reordering the DOM one node at a time. 4. The method of claim 1, further comprising:
determining whether a number of the one or more of the plurality of nodes corresponding to one or more graphic elements to be moved to the front layer or back layer exceeds a predetermined threshold; and in response to a determination that the number exceeds the predetermined threshold, reordering the DOM nodes in bulk. 5. The method of claim 1, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes, moving the remainder of nodes in front of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved. 6. The method of claim 1, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is not greater than the remainder of the nodes, moving the one or more plurality of nodes corresponding to the one or more graphic elements to be moved in front of the remainder of nodes. 7. The method of claim 1, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is back:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than the remainder of the nodes, moving the remainder of nodes behind the one or more plurality of nodes corresponding to the one or more graphic elements to be moved. 8. The method of claim 1, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is not greater than the remainder of the nodes, moving the one or more plurality of nodes corresponding to the one or more graphic elements to be moved behind the remainder of nodes. 9. A system comprising:
a processor operating a DOM parser and an interactivity module; the DOM parser configured to represent a plurality of graphical elements as a document object model (DOM) having a plurality of nodes, each node representing a different graphical element, the DOM having an ordering of the nodes, each node having a z-value of front or back, indicating that a corresponding graphical element is to be displayed in a front layer for a z-value of front or a back layer for a z-value of back; the interactivity module configured to:
alter the z-value of one or more of the plurality of nodes corresponding to one or more graphical elements to be moved to the front layer or back layer; and
reorder the DOM so that the one or more graphical elements to be moved to the front layer or back layer are at the front or back of the DOM, while maintaining the ordering between nodes having z-values of front and the ordering between nodes having z-values of back. 10. The system of claim 9, wherein the interactivity module is located on a web server. 11. The system of claim 10, wherein the web server communicates with a browser on a web client, the browser rendering graphics based on the reordered DOM. 12. The system of claim 11, wherein the interactivity module is located on a client device operating a web browser. 13. A non-transitory computer-readable storage medium comprising instructions that, when executed by at least one processor of a machine, cause the machine to perform operations of altering ordering of graphical elements to be presented on a display, including:
representing a plurality of graphical elements as a document object model (DOM) having a plurality of nodes, each node representing a different graphical element, the DOM having an ordering of the nodes, each node having a z-value of front or back, indicating that a corresponding graphical element is to be displayed in a front layer for a z-value of front or a back layer for a z-value of back; altering the z-value of one or more of the plurality of nodes corresponding to one or more graphical elements to be moved to the front layer or back layer; and reordering the DOM so that the one or more graphical elements to be moved to the front layer or back layer are at the front or back of the DOM, while maintaining the ordering between nodes having z-values of front and the ordering between nodes having z-values of back. 14. The non-transitory computer-readable storage medium of claim 13, wherein the graphical elements are scalable vector graphics (SVG) elements. 15. The non-transitory computer-readable storage medium of claim 13, wherein the operations further comprise:
determining whether a number of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved to the front layer or back layer exceeds a predetermined threshold; and in response to a determination that the number does not exceed the predetermined threshold, reordering the DOM one node at a time. 16. The non-transitory computer-readable storage medium of claim 13, wherein the operations further comprise:
determining whether a number of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved to the front layer or back layer exceeds a predetermined threshold; and in response to a determination that the number exceeds the predetermined threshold, reordering the DOM nodes in bulk. 17. The non-transitory computer-readable storage medium of claim 13, wherein the operations further comprise:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than the remainder of the nodes, moving the remainder of nodes in front of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved. 18. The non-transitory computer-readable storage medium of claim 13, wherein the operations further comprise:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is not greater than the remainder of the nodes, moving the one or more plurality of nodes corresponding to the one or more graphic elements to be moved in front of the remainder of nodes. 19. The non-transitory computer-readable storage medium of claim 13, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is back:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than the remainder of the nodes, moving the remainder of nodes behind the one or more plurality of nodes corresponding to the one or more graphic elements to be moved. 20. The non-transitory computer-readable storage medium of claim 13, wherein the reordering includes:
determining whether the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front or back; in response to a determination that the z-value of the one or more of the plurality of nodes corresponding to the one or more graphic elements to be moved is front:
determining if a number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is greater than a remainder of the nodes; and
in response to a determination that the number of the one or more plurality of nodes corresponding to the one or more graphic elements to be moved is not greater than the remainder of the nodes, moving the one or more plurality of nodes corresponding to the one or more graphic elements to be moved behind the remainder of nodes. | 2,100 |
4,569 | 14,460,552 | 2,184 | Embodiments of a device and method are disclosed. In an embodiment, a CAN device is disclosed. The CAN device includes a transmit data (TXD) input interface, a TXD output interface, a receive data (RXD) input interface, an RXD output interface and a traffic control system connected between the TXD input and output interfaces and between the RXD input and output interfaces. The traffic control system is configured to detect the presence of classic CAN traffic on the RXD input interface and if the presence of classic CAN traffic is detected on the RXD input interface, emulate an error management protocol of a classic CAN controller in response to signals received on the TXD input interface. | 1. A Controller Area Network (CAN) device comprising:
a transmit data (TXD) input interface; a TXD output interface; a receive data (RXD) input interface; an RXD output interface; a traffic control system connected between the TXD input and output interfaces and between the RXD input and output interfaces, and configured to: detect the presence of classic CAN traffic on the RXD input interface; and if the presence of classic CAN traffic is detected on the RXD input interface, emulate an error management protocol of a classic CAN controller in response to signals received on the TXD input interface. 2. The CAN device of claim 1, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on the TXD output interface. 3. The CAN device of claim 1, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on the TXD output interface in response to determining that the classic CAN controller is in an error passive state from the signals received on the TXD input interface. 4. The CAN device of claim 1, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on the TXD output interface in response to determining that the classic CAN controller is in an error passive state from the signals received on the TXD input interface and from signal received on the RXD input interface. 5. The CAN device of claim 1, wherein the traffic control system is further configured to disconnect the TXD output interface from the TXD input interface and to output a dominant TXD on the TXD output interface when the TXD input interface is disconnected from the TXD input interface. 6. The CAN device of claim 1, wherein the traffic control system comprises a CAN protocol controller configured to decode CAN FD traffic received on the RXD input interface. 7. The CAN device of claim 6, wherein the traffic control system further comprises a transmit path multiplexer configured to direct traffic from the TXD input interface to the TXD output interface depending on whether or not CAN FD traffic is detected. 8. The CAN device of claim 6, wherein the traffic control system further comprises a receive path multiplexer configured to direct traffic from the RXD input interface to the RXD output interface depending on whether or not CAN FD traffic is detected. 9. A CAN transceiver device comprising a transmitter, a receiver, and a CAN bus interface, the CAN transceiver further comprising the CAN device of claim 1. 10. A method for controlling Controller Area Network (CAN) traffic, the method comprising:
decoding traffic received on an RXD input interface; monitoring the decoded traffic for the presence of classic CAN traffic; and if the presence of classic CAN traffic is detected on the RXD input interface, then emulating an error management protocol of a classic CAN controller in response to signals received on a TXD input interface. 11. The method of claim 10, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on a TXD output interface. 12. The method of claim 10, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on a TXD output interface in response to determining that the classic CAN controller is in an error passive state from the signals received on the TXD input interface. 13. The method of claim 10, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on a TXD output interface in response to determining that the classic CAN controller is in an error passive state from the signals received on the TXD input interface and from signals received on the RXD input interface. 14. The method of claim 10, further comprising outputting a dominant TXD on the TXD output interface when the TXD input interface is disconnected from the TXD output interface. | Embodiments of a device and method are disclosed. In an embodiment, a CAN device is disclosed. The CAN device includes a transmit data (TXD) input interface, a TXD output interface, a receive data (RXD) input interface, an RXD output interface and a traffic control system connected between the TXD input and output interfaces and between the RXD input and output interfaces. The traffic control system is configured to detect the presence of classic CAN traffic on the RXD input interface and if the presence of classic CAN traffic is detected on the RXD input interface, emulate an error management protocol of a classic CAN controller in response to signals received on the TXD input interface.1. A Controller Area Network (CAN) device comprising:
a transmit data (TXD) input interface; a TXD output interface; a receive data (RXD) input interface; an RXD output interface; a traffic control system connected between the TXD input and output interfaces and between the RXD input and output interfaces, and configured to: detect the presence of classic CAN traffic on the RXD input interface; and if the presence of classic CAN traffic is detected on the RXD input interface, emulate an error management protocol of a classic CAN controller in response to signals received on the TXD input interface. 2. The CAN device of claim 1, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on the TXD output interface. 3. The CAN device of claim 1, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on the TXD output interface in response to determining that the classic CAN controller is in an error passive state from the signals received on the TXD input interface. 4. The CAN device of claim 1, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on the TXD output interface in response to determining that the classic CAN controller is in an error passive state from the signals received on the TXD input interface and from signal received on the RXD input interface. 5. The CAN device of claim 1, wherein the traffic control system is further configured to disconnect the TXD output interface from the TXD input interface and to output a dominant TXD on the TXD output interface when the TXD input interface is disconnected from the TXD input interface. 6. The CAN device of claim 1, wherein the traffic control system comprises a CAN protocol controller configured to decode CAN FD traffic received on the RXD input interface. 7. The CAN device of claim 6, wherein the traffic control system further comprises a transmit path multiplexer configured to direct traffic from the TXD input interface to the TXD output interface depending on whether or not CAN FD traffic is detected. 8. The CAN device of claim 6, wherein the traffic control system further comprises a receive path multiplexer configured to direct traffic from the RXD input interface to the RXD output interface depending on whether or not CAN FD traffic is detected. 9. A CAN transceiver device comprising a transmitter, a receiver, and a CAN bus interface, the CAN transceiver further comprising the CAN device of claim 1. 10. A method for controlling Controller Area Network (CAN) traffic, the method comprising:
decoding traffic received on an RXD input interface; monitoring the decoded traffic for the presence of classic CAN traffic; and if the presence of classic CAN traffic is detected on the RXD input interface, then emulating an error management protocol of a classic CAN controller in response to signals received on a TXD input interface. 11. The method of claim 10, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on a TXD output interface. 12. The method of claim 10, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on a TXD output interface in response to determining that the classic CAN controller is in an error passive state from the signals received on the TXD input interface. 13. The method of claim 10, wherein emulating the error management protocol of a classic CAN controller comprises generating an error frame/flag and transmitting the error frame/flag on a TXD output interface in response to determining that the classic CAN controller is in an error passive state from the signals received on the TXD input interface and from signals received on the RXD input interface. 14. The method of claim 10, further comprising outputting a dominant TXD on the TXD output interface when the TXD input interface is disconnected from the TXD output interface. | 2,100 |
4,570 | 13,623,382 | 2,191 | An apparatus and a method for monitoring an application to be installed on a mobile device are provided. The apparatus includes a display unit, a monitoring unit for determining whether a user has selected an application for installation in the mobile device, the application requiring at least one permission predetermined by the user, and a controller for controlling the mobile device to present an alert to the user when the user selects the application, wherein each of the at least one permission represents an action performed by an application. | 1. A mobile device comprising:
a display unit; a monitoring unit for determining whether a user has selected an application for installation in the mobile device, the application requiring at least one permission predetermined by the user; and a controller for controlling the mobile device to present an alert to the user when the user selects the application, wherein each of the at least one permission represents an action performed by an application. 2. The mobile device of claim 1, wherein the controller controls the display unit to display a dialog box when the user selects the application. 3. The mobile device of claim 1, wherein the controller controls the display unit to display a notification when the user selects the application. 4. The mobile device of claim 1, further comprising:
an application store, wherein the controller controls the mobile device to present the alert to the user when the user selects the application for installation via the application store. 5. The mobile device of claim 1, further comprising:
an input unit; and a storage unit for storing a list of the at least one permission selected by the user for monitoring, wherein the monitoring unit receives user input selecting the at least one permission for monitoring, and stores the list of the at least one permission in the storage unit. 6. The mobile device of claim 5, wherein the at least one permissions are arranged into one or more groups,
wherein the monitoring unit receives user input selecting at least one of the groups, and stores a list of the at least one permission corresponding to the selected groups in the storage unit. 7. A method of managing application downloads in a mobile terminal, the method comprising:
receiving a list of permissions to be monitored; receiving a request to download an application; and when the application requires permissions included on the list of permissions to be monitored, controlling the mobile terminal to present an alert to the user. 8. The method of claim 7, wherein the controlling of the mobile terminal to present the alert to the user comprises controlling the mobile terminal to display a dialog box. 9. The method of claim 7, wherein the controlling of the mobile terminal to present the alert to the user comprises controlling the mobile terminal display all permissions used by the application and to highlight any displayed permissions that are included in the list of permissions to be monitored. 10. The method of claim 7, wherein the receiving of the request to download the application comprises receiving a request to download the application via an application store installed in the mobile device. 11. The method of claim 7, wherein the receiving of the request to download the application comprises receiving a selection of the application via an application store installed in the mobile device. | An apparatus and a method for monitoring an application to be installed on a mobile device are provided. The apparatus includes a display unit, a monitoring unit for determining whether a user has selected an application for installation in the mobile device, the application requiring at least one permission predetermined by the user, and a controller for controlling the mobile device to present an alert to the user when the user selects the application, wherein each of the at least one permission represents an action performed by an application.1. A mobile device comprising:
a display unit; a monitoring unit for determining whether a user has selected an application for installation in the mobile device, the application requiring at least one permission predetermined by the user; and a controller for controlling the mobile device to present an alert to the user when the user selects the application, wherein each of the at least one permission represents an action performed by an application. 2. The mobile device of claim 1, wherein the controller controls the display unit to display a dialog box when the user selects the application. 3. The mobile device of claim 1, wherein the controller controls the display unit to display a notification when the user selects the application. 4. The mobile device of claim 1, further comprising:
an application store, wherein the controller controls the mobile device to present the alert to the user when the user selects the application for installation via the application store. 5. The mobile device of claim 1, further comprising:
an input unit; and a storage unit for storing a list of the at least one permission selected by the user for monitoring, wherein the monitoring unit receives user input selecting the at least one permission for monitoring, and stores the list of the at least one permission in the storage unit. 6. The mobile device of claim 5, wherein the at least one permissions are arranged into one or more groups,
wherein the monitoring unit receives user input selecting at least one of the groups, and stores a list of the at least one permission corresponding to the selected groups in the storage unit. 7. A method of managing application downloads in a mobile terminal, the method comprising:
receiving a list of permissions to be monitored; receiving a request to download an application; and when the application requires permissions included on the list of permissions to be monitored, controlling the mobile terminal to present an alert to the user. 8. The method of claim 7, wherein the controlling of the mobile terminal to present the alert to the user comprises controlling the mobile terminal to display a dialog box. 9. The method of claim 7, wherein the controlling of the mobile terminal to present the alert to the user comprises controlling the mobile terminal display all permissions used by the application and to highlight any displayed permissions that are included in the list of permissions to be monitored. 10. The method of claim 7, wherein the receiving of the request to download the application comprises receiving a request to download the application via an application store installed in the mobile device. 11. The method of claim 7, wherein the receiving of the request to download the application comprises receiving a selection of the application via an application store installed in the mobile device. | 2,100 |
4,571 | 14,289,380 | 2,163 | A method for editing a position of a selected design element in a constraint network. The method includes receiving a selection of a design element in a geometric model from a user. The method also includes searching a database for a positioning group related to the selected design element. The method then includes displaying the positioning group related to the selected design element to the user. The method further includes receiving an updated positioning group from the user. The method finally includes storing the updated positioning group to the database. | 1. A method for editing a position of a selected design element in a constraint network comprising:
receiving a selection of a design element in a geometric model from a user; searching a database for a positioning group related to the selected design element; displaying the positioning group related to the selected design element to the user; receiving an updated positioning group from the user; and storing the updated positioning group to the database. 2. The method for editing a position of a selected design element of claim 1, further comprising:
receiving the constraint network from the user; dividing the constraint network into a plurality of positioning groups; and storing the plurality of positioning groups to the database. 3. The method for editing a position of a selected design element of claim 2, wherein the constraint network comprises a plurality of positioning constraints concerning a plurality of design elements. 4. The method for editing a position of a selected design element of claim 2, wherein dividing the constraint network into the plurality of positioning groups comprises dividing the constraint network by ownership of the positioning groups, minimal number of positioning groups, or smallest positioning groups. 5. The method for editing a position of a selected design element of claim 1, wherein the positioning group contains the selected design element, a plurality of positioning constraints related to the selected design element, and references to a plurality of design elements that are referenced by the plurality of positioning constraints. 6. The method for editing a position of a selected design element of claim 1, wherein searching the database for the positioning group comprises determining if the selected design element is marked selected or referenced by another user. 7. The method for editing a position of a selected design element of claim 1, further comprising:
marking the selected design elements and referenced design elements as selected or referenced by the user until the updated positioning group is stored to the database. 8. A data processing system comprising:
a processor; and an accessible memory, the data processing system particularly configured to receive a selection of a design element in a geometric model from a user;
search a database for a positioning group related to the selected design element;
display the positioning group related to the selected design element to the user;
receive an updated positioning group from the user; and
store the updated positioning group to the database. 9. The data processing system of claim 8, wherein the data processing system is further configured to:
receive the constraint network from a user; divide the constraint network into a plurality of positioning groups; and store the plurality of positioning groups to the database. 10. The data processing system of claim 9, wherein the constraint network comprises a plurality of positioning constraints concerning a plurality of design elements. 11. The data processing system of claim 9, wherein divide the constraint network into the plurality of positioning groups comprises dividing the constraint network by ownership of the positioning groups, minimal number of positioning groups, or smallest positioning groups. 12. The data processing system of claim 8, wherein the positioning group contains the selected design element, a plurality of positioning constraints related to the selected design element, and references to a plurality of design elements that are referenced by the plurality of positioning constraints. 13. The data processing system of claim 8, wherein searching the database for the positioning group comprises determining if the selected design element is marked selected or referenced by another user. 14. The data processing system of claim 8, further comprising:
mark the selected design elements and referenced design elements as selected or referenced by the user until the updated positioning group is stored to the database. 15. A non-transitory computer-readable medium encoded with executable instructions that, when executed, cause one or more data processing systems to:
receive a selection of a design element in a geometric model from a user; search a database for a positioning group related to the selected design element; display the positioning group related to the selected design element to the user; receive an updated positioning group from the user; and store the updated positioning group to the database. 16. The non-transitory computer-readable medium of claim 15, further comprising:
receive the constraint network from a user; divide the constraint network into a plurality of positioning groups; and store the plurality of positioning groups to the database. 17. The non-transitory computer-readable medium of claim 16, wherein the constraint network comprises a plurality of positioning constraints concerning a plurality of design elements. 18. The non-transitory computer-readable medium of claim 16, wherein divide the constraint network into the plurality of positioning groups comprises dividing the constraint network by ownership of the positioning groups, minimal number of positioning groups, or smallest positioning groups. 19. The non-transitory computer-readable medium of claim 15, wherein the positioning group contains the selected design element, a plurality of positioning constraints related to the selected design element, and references to a plurality of design elements that are referenced by the plurality of positioning constraints. 20. The non-transitory computer-readable medium of claim 15, wherein searching the database for the positioning group comprises determining if the selected design element is marked selected or referenced by another user. | A method for editing a position of a selected design element in a constraint network. The method includes receiving a selection of a design element in a geometric model from a user. The method also includes searching a database for a positioning group related to the selected design element. The method then includes displaying the positioning group related to the selected design element to the user. The method further includes receiving an updated positioning group from the user. The method finally includes storing the updated positioning group to the database.1. A method for editing a position of a selected design element in a constraint network comprising:
receiving a selection of a design element in a geometric model from a user; searching a database for a positioning group related to the selected design element; displaying the positioning group related to the selected design element to the user; receiving an updated positioning group from the user; and storing the updated positioning group to the database. 2. The method for editing a position of a selected design element of claim 1, further comprising:
receiving the constraint network from the user; dividing the constraint network into a plurality of positioning groups; and storing the plurality of positioning groups to the database. 3. The method for editing a position of a selected design element of claim 2, wherein the constraint network comprises a plurality of positioning constraints concerning a plurality of design elements. 4. The method for editing a position of a selected design element of claim 2, wherein dividing the constraint network into the plurality of positioning groups comprises dividing the constraint network by ownership of the positioning groups, minimal number of positioning groups, or smallest positioning groups. 5. The method for editing a position of a selected design element of claim 1, wherein the positioning group contains the selected design element, a plurality of positioning constraints related to the selected design element, and references to a plurality of design elements that are referenced by the plurality of positioning constraints. 6. The method for editing a position of a selected design element of claim 1, wherein searching the database for the positioning group comprises determining if the selected design element is marked selected or referenced by another user. 7. The method for editing a position of a selected design element of claim 1, further comprising:
marking the selected design elements and referenced design elements as selected or referenced by the user until the updated positioning group is stored to the database. 8. A data processing system comprising:
a processor; and an accessible memory, the data processing system particularly configured to receive a selection of a design element in a geometric model from a user;
search a database for a positioning group related to the selected design element;
display the positioning group related to the selected design element to the user;
receive an updated positioning group from the user; and
store the updated positioning group to the database. 9. The data processing system of claim 8, wherein the data processing system is further configured to:
receive the constraint network from a user; divide the constraint network into a plurality of positioning groups; and store the plurality of positioning groups to the database. 10. The data processing system of claim 9, wherein the constraint network comprises a plurality of positioning constraints concerning a plurality of design elements. 11. The data processing system of claim 9, wherein divide the constraint network into the plurality of positioning groups comprises dividing the constraint network by ownership of the positioning groups, minimal number of positioning groups, or smallest positioning groups. 12. The data processing system of claim 8, wherein the positioning group contains the selected design element, a plurality of positioning constraints related to the selected design element, and references to a plurality of design elements that are referenced by the plurality of positioning constraints. 13. The data processing system of claim 8, wherein searching the database for the positioning group comprises determining if the selected design element is marked selected or referenced by another user. 14. The data processing system of claim 8, further comprising:
mark the selected design elements and referenced design elements as selected or referenced by the user until the updated positioning group is stored to the database. 15. A non-transitory computer-readable medium encoded with executable instructions that, when executed, cause one or more data processing systems to:
receive a selection of a design element in a geometric model from a user; search a database for a positioning group related to the selected design element; display the positioning group related to the selected design element to the user; receive an updated positioning group from the user; and store the updated positioning group to the database. 16. The non-transitory computer-readable medium of claim 15, further comprising:
receive the constraint network from a user; divide the constraint network into a plurality of positioning groups; and store the plurality of positioning groups to the database. 17. The non-transitory computer-readable medium of claim 16, wherein the constraint network comprises a plurality of positioning constraints concerning a plurality of design elements. 18. The non-transitory computer-readable medium of claim 16, wherein divide the constraint network into the plurality of positioning groups comprises dividing the constraint network by ownership of the positioning groups, minimal number of positioning groups, or smallest positioning groups. 19. The non-transitory computer-readable medium of claim 15, wherein the positioning group contains the selected design element, a plurality of positioning constraints related to the selected design element, and references to a plurality of design elements that are referenced by the plurality of positioning constraints. 20. The non-transitory computer-readable medium of claim 15, wherein searching the database for the positioning group comprises determining if the selected design element is marked selected or referenced by another user. | 2,100 |
4,572 | 12,350,144 | 2,156 | A system, method and computer program product compares data in original and modified versions of spreadsheet or database table documents, and generates a comparison document having indications where changes between the documents are present. The data compared includes formulas or stored procedures that are normally hidden when viewing a spreadsheet or database table document. | 1. A method of comparing spreadsheet or database table documents, the method comprising:
receiving information identifying first and second spreadsheet or database table documents; comparing values of cells of the first document with values of corresponding cells of the second document; detecting whether formulas or stored procedures exist within the first and second documents; comparing any detected formulas or stored procedures of the first document with those of the second document; and generating a comparison document including indications of any changes between the compared corresponding cells, and any detected formulas or stored procedures of the first and second documents. 2. The method of claim 1, wherein at least one detected formula and stored procedure is used to compute contents of at least one of the cells in the first or second document. 3. The method of claim 1, further comprising:
receiving user defined formatting parameters for comparing the cell values and the formulas or stored procedures of the first and second documents. 4. The method of claim 1, further comprising:
receiving user defined parameters for formatting the indication of changes between the compared corresponding cells, formulas or stored procedures of the first and second documents. 5. The method of claim 4, wherein said defined parameters determine the appearance of how the indicated changes are to be displayed in the comparison document. 6. The method of claim 1, further comprising:
displaying changes between the detected formulas or stored procedures of the first and second documents. 7. The method of claim 1, wherein the comparison document includes a presentation of the first spreadsheet or database table document, the second spreadsheet or database table document and a redline version of the comparison of the first and second spreadsheet or database table. 8. The method of claim 7, further comprising:
generating a panel or window for display that enables line-item management of all changes presented in the comparison document. 9. The method of claim 1, further comprising:
receiving a selection of a at least one sheet or table within the first and second documents for comparison, wherein said comparing values of cells, detecting whether formulas or stored procedures exist, and comparing are performed only on a selected sheet or table. 10. The method of claim 1, further comprising:
receiving a selection of one or more area within the first and second documents for comparison, wherein said comparing values of cells, detecting whether formulas or stored procedures exist, and comparing are performed only on a selected area. 11. The method of claim 1, further comprising:
applying a macro to process the first and second document before comparing the cell values and detected formulas of the first and second documents. 12. The method of claim 11, wherein the macro is selected, created, imported or exported before applying the macro to the first and second document. 13. A computer program product containing computer executable instructions, which when executed by a computer, causes the computer to perform a method of comparing spreadsheet or database table documents, comprising the steps of:
receiving information identifying first and second spreadsheet or database table documents; comparing values of cells of the first document with values of corresponding cells of the second document; detecting whether formulas or stored procedures exist within the first and second documents; comparing the detected formulas or stored procedures of the first document with those of the second document; and generating a comparison document including indications of any changes between the compared corresponding cells, and formulas or stored procedures of the first and second documents. 14. A computer implemented system for comparing spreadsheet or database table documents, the system comprising:
a computer having a processor that reads computer executable instructions from a memory for performing the steps of: comparing values of cells of the first document with values of corresponding cells of the second document; detecting whether formulas or stored procedures exist within the first and second documents; comparing any detected formulas or stored procedures of the first document with those of the second document; and generating a comparison document including indications of any changes between the compared corresponding cells, and any detected formulas or stored procedures of the first and second documents. | A system, method and computer program product compares data in original and modified versions of spreadsheet or database table documents, and generates a comparison document having indications where changes between the documents are present. The data compared includes formulas or stored procedures that are normally hidden when viewing a spreadsheet or database table document.1. A method of comparing spreadsheet or database table documents, the method comprising:
receiving information identifying first and second spreadsheet or database table documents; comparing values of cells of the first document with values of corresponding cells of the second document; detecting whether formulas or stored procedures exist within the first and second documents; comparing any detected formulas or stored procedures of the first document with those of the second document; and generating a comparison document including indications of any changes between the compared corresponding cells, and any detected formulas or stored procedures of the first and second documents. 2. The method of claim 1, wherein at least one detected formula and stored procedure is used to compute contents of at least one of the cells in the first or second document. 3. The method of claim 1, further comprising:
receiving user defined formatting parameters for comparing the cell values and the formulas or stored procedures of the first and second documents. 4. The method of claim 1, further comprising:
receiving user defined parameters for formatting the indication of changes between the compared corresponding cells, formulas or stored procedures of the first and second documents. 5. The method of claim 4, wherein said defined parameters determine the appearance of how the indicated changes are to be displayed in the comparison document. 6. The method of claim 1, further comprising:
displaying changes between the detected formulas or stored procedures of the first and second documents. 7. The method of claim 1, wherein the comparison document includes a presentation of the first spreadsheet or database table document, the second spreadsheet or database table document and a redline version of the comparison of the first and second spreadsheet or database table. 8. The method of claim 7, further comprising:
generating a panel or window for display that enables line-item management of all changes presented in the comparison document. 9. The method of claim 1, further comprising:
receiving a selection of a at least one sheet or table within the first and second documents for comparison, wherein said comparing values of cells, detecting whether formulas or stored procedures exist, and comparing are performed only on a selected sheet or table. 10. The method of claim 1, further comprising:
receiving a selection of one or more area within the first and second documents for comparison, wherein said comparing values of cells, detecting whether formulas or stored procedures exist, and comparing are performed only on a selected area. 11. The method of claim 1, further comprising:
applying a macro to process the first and second document before comparing the cell values and detected formulas of the first and second documents. 12. The method of claim 11, wherein the macro is selected, created, imported or exported before applying the macro to the first and second document. 13. A computer program product containing computer executable instructions, which when executed by a computer, causes the computer to perform a method of comparing spreadsheet or database table documents, comprising the steps of:
receiving information identifying first and second spreadsheet or database table documents; comparing values of cells of the first document with values of corresponding cells of the second document; detecting whether formulas or stored procedures exist within the first and second documents; comparing the detected formulas or stored procedures of the first document with those of the second document; and generating a comparison document including indications of any changes between the compared corresponding cells, and formulas or stored procedures of the first and second documents. 14. A computer implemented system for comparing spreadsheet or database table documents, the system comprising:
a computer having a processor that reads computer executable instructions from a memory for performing the steps of: comparing values of cells of the first document with values of corresponding cells of the second document; detecting whether formulas or stored procedures exist within the first and second documents; comparing any detected formulas or stored procedures of the first document with those of the second document; and generating a comparison document including indications of any changes between the compared corresponding cells, and any detected formulas or stored procedures of the first and second documents. | 2,100 |
4,573 | 14,778,042 | 2,112 | Methods, devices, and systems for storage device data access and/or storage device error correction are provided. In one aspect, a storage device data access method comprises generating a parity bit for data to be stored; generating a flag bit that expresses whether a data mask is present or absent in the data to be stored; storing the data, the flag bit, and the parity bit; reading out the data, the flag bit and the parity bit; determining whether the data mask is present or absent based on the read out flag bit; in response to determining that the flag bit expresses the absence of the data mask, detecting and correcting the data using the read out parity bit; otherwise, in response to determining that the flag bit expresses the presence of the data mask, performing no detection or correction on the data. | 1-21. (canceled) 22. A memory data access method comprising:
generating a parity bit for data to be stored; generating a flag bit that expresses whether a data mask is present or absent in the data to be stored; storing the data, the flag bit, and the parity bit; reading out the data, the flag bit and the parity bit; determining whether the data mask is present or absent based on the read out flag bit;
in response to determining that the flag bit expresses the absence of the data mask, detecting and correcting the data using the read out parity bit;
otherwise, in response to determining that the flag bit expresses the presence of the data mask, performing no detection or correction on the data. 23. The method of claim 22, wherein the generated flag bit is stored as an independent part. 24. The method of claim 23, further comprising:
generating a second parity bit for the generated flag bit; and storing the second parity bit together with the generated flag bit. 25. The method of claim 24, further comprising:
after the flag bit and the second parity bit are read out, detecting and correcting the flag bit using the second parity bit. 26. The method of claim 24, wherein an algorithm for generating the parity bit for the data is same as an algorithm for generating the second parity bit for the flag bit. 27. The method of claim 22, wherein the flag bit is stored as one of a particular data bit and a particular parity bit. 28. The method of claim 27, further comprising:
in response to determining that the flag bit expresses the absence of the data mask, removing the flag bit from the one of the particular data bit and the particular parity bit prior to detection and correction on the data. 29. The method of claim 22, wherein generating the parity bit comprises generating the parity code using Hamming Code. 30. A system comprising:
a storage unit; a parity bit generation unit; a flag bit generation unit; a writing unit; a reading unit; and a correction unit, wherein the parity bit generation unit is configured to generate a parity bit for data to be stored, the flag bit generation unit is configured to generate for the data a flag bit that expresses whether a data mask is present or absent in the data, the writing unit is configured to write the data to the storage unit, and the storage unit is configured to store the data, the flag bit, and the parity bit, and wherein the reading unit is configured to read out the stored data, the flag bit, and the parity bit from the storage unit, and wherein the correction unit is configured to:
detect and correct the read out data in response to a determination of the flag bit expressing the absence of the data mask, and
perform no detection or correction on the read out data in response to a determination of the flag bit expressing the presence of the data mask. 31. The system of claim 30, wherein the flag bit is stored in the storage unit as an independent part. 32. The system of claim 31, wherein the flag bit generation unit is configured to generate a second parity bit for the flag bit, and the second parity bit and the flag bit together are stored in the storage unit. 33. The system of claim 32, further comprising a flag bit correction unit configured to use the second parity bit to detect and correct the flag bit after the flag bit and the second parity bit are read out from the storage unit. 34. The system of claim 32, wherein an algorithm for generating the parity bit for the data is same as an algorithm for generating the second parity bit for the flag bit. 35. The system of claim 30, wherein the flag bit is stored in the storage unit as one of a particular data bit and a particular parity bit. 36. The system of claim 35, wherein the correction unit is configured to:
in response to a determination of the flag bit expressing the absence of the data mask, remove the flag bit from the one of the particular data bit and the particular parity bit before detecting and correcting the data. 37. The system of claim 30, wherein the parity bit generation unit is configured to generate the parity bit using Hamming Code. 38. The system of claim 30, configured to be a dynamic random access memory. 39. A memory error correction method comprising:
writing external data; generating a parity bit and a flag bit simultaneously according to a given rule, wherein the parity bit is used to achieve detection and error correction of data reading and the flag bit is used to express whether a data mask is present or absent; storing the external data, the flag bit and the parity bit to a memory; reading out the external data, the flag bit and the parity bit in the memory; determining whether the data mask is present or absent using the flag bit; in response to determining that the flag bit expresses the absence of the data mask, indicating validation of the parity bit and encoding and error correcting the data using the parity bit when the data are read out; otherwise, in response to determining that the flag bit expresses the presence of the data mask, indicating invalidation of the parity bit and performing no decoding or error correction when the data are read out; 40. The memory error correction method of claim 39, wherein, when the external data is 64-bit Hamming code, the parity bit is generated to be 7-bit and the flag bit is generated to be 1-bit and as the 65th bit in a 65-bit data string. 41. The memory error correction method of claim 39, further comprising determining that only 1-bit data is incorrect when the data are read out, and in response:
if the incorrect data is the flag bit or the parity bit, performing no error correction, and if the incorrect data is not the flag bit or the parity bit, determining whether the data mask is present or absent based on the flag bit, and performing error correction on the external data using the parity bit in response to determining that the data mask is absent, otherwise performing no error detection in response to determining that the data mask is present. 42. The memory error correction method of claim 41, further comprising:
in response to determining that two-bit or more data error is present when the data are read out, performing no error correction. | Methods, devices, and systems for storage device data access and/or storage device error correction are provided. In one aspect, a storage device data access method comprises generating a parity bit for data to be stored; generating a flag bit that expresses whether a data mask is present or absent in the data to be stored; storing the data, the flag bit, and the parity bit; reading out the data, the flag bit and the parity bit; determining whether the data mask is present or absent based on the read out flag bit; in response to determining that the flag bit expresses the absence of the data mask, detecting and correcting the data using the read out parity bit; otherwise, in response to determining that the flag bit expresses the presence of the data mask, performing no detection or correction on the data.1-21. (canceled) 22. A memory data access method comprising:
generating a parity bit for data to be stored; generating a flag bit that expresses whether a data mask is present or absent in the data to be stored; storing the data, the flag bit, and the parity bit; reading out the data, the flag bit and the parity bit; determining whether the data mask is present or absent based on the read out flag bit;
in response to determining that the flag bit expresses the absence of the data mask, detecting and correcting the data using the read out parity bit;
otherwise, in response to determining that the flag bit expresses the presence of the data mask, performing no detection or correction on the data. 23. The method of claim 22, wherein the generated flag bit is stored as an independent part. 24. The method of claim 23, further comprising:
generating a second parity bit for the generated flag bit; and storing the second parity bit together with the generated flag bit. 25. The method of claim 24, further comprising:
after the flag bit and the second parity bit are read out, detecting and correcting the flag bit using the second parity bit. 26. The method of claim 24, wherein an algorithm for generating the parity bit for the data is same as an algorithm for generating the second parity bit for the flag bit. 27. The method of claim 22, wherein the flag bit is stored as one of a particular data bit and a particular parity bit. 28. The method of claim 27, further comprising:
in response to determining that the flag bit expresses the absence of the data mask, removing the flag bit from the one of the particular data bit and the particular parity bit prior to detection and correction on the data. 29. The method of claim 22, wherein generating the parity bit comprises generating the parity code using Hamming Code. 30. A system comprising:
a storage unit; a parity bit generation unit; a flag bit generation unit; a writing unit; a reading unit; and a correction unit, wherein the parity bit generation unit is configured to generate a parity bit for data to be stored, the flag bit generation unit is configured to generate for the data a flag bit that expresses whether a data mask is present or absent in the data, the writing unit is configured to write the data to the storage unit, and the storage unit is configured to store the data, the flag bit, and the parity bit, and wherein the reading unit is configured to read out the stored data, the flag bit, and the parity bit from the storage unit, and wherein the correction unit is configured to:
detect and correct the read out data in response to a determination of the flag bit expressing the absence of the data mask, and
perform no detection or correction on the read out data in response to a determination of the flag bit expressing the presence of the data mask. 31. The system of claim 30, wherein the flag bit is stored in the storage unit as an independent part. 32. The system of claim 31, wherein the flag bit generation unit is configured to generate a second parity bit for the flag bit, and the second parity bit and the flag bit together are stored in the storage unit. 33. The system of claim 32, further comprising a flag bit correction unit configured to use the second parity bit to detect and correct the flag bit after the flag bit and the second parity bit are read out from the storage unit. 34. The system of claim 32, wherein an algorithm for generating the parity bit for the data is same as an algorithm for generating the second parity bit for the flag bit. 35. The system of claim 30, wherein the flag bit is stored in the storage unit as one of a particular data bit and a particular parity bit. 36. The system of claim 35, wherein the correction unit is configured to:
in response to a determination of the flag bit expressing the absence of the data mask, remove the flag bit from the one of the particular data bit and the particular parity bit before detecting and correcting the data. 37. The system of claim 30, wherein the parity bit generation unit is configured to generate the parity bit using Hamming Code. 38. The system of claim 30, configured to be a dynamic random access memory. 39. A memory error correction method comprising:
writing external data; generating a parity bit and a flag bit simultaneously according to a given rule, wherein the parity bit is used to achieve detection and error correction of data reading and the flag bit is used to express whether a data mask is present or absent; storing the external data, the flag bit and the parity bit to a memory; reading out the external data, the flag bit and the parity bit in the memory; determining whether the data mask is present or absent using the flag bit; in response to determining that the flag bit expresses the absence of the data mask, indicating validation of the parity bit and encoding and error correcting the data using the parity bit when the data are read out; otherwise, in response to determining that the flag bit expresses the presence of the data mask, indicating invalidation of the parity bit and performing no decoding or error correction when the data are read out; 40. The memory error correction method of claim 39, wherein, when the external data is 64-bit Hamming code, the parity bit is generated to be 7-bit and the flag bit is generated to be 1-bit and as the 65th bit in a 65-bit data string. 41. The memory error correction method of claim 39, further comprising determining that only 1-bit data is incorrect when the data are read out, and in response:
if the incorrect data is the flag bit or the parity bit, performing no error correction, and if the incorrect data is not the flag bit or the parity bit, determining whether the data mask is present or absent based on the flag bit, and performing error correction on the external data using the parity bit in response to determining that the data mask is absent, otherwise performing no error detection in response to determining that the data mask is present. 42. The memory error correction method of claim 41, further comprising:
in response to determining that two-bit or more data error is present when the data are read out, performing no error correction. | 2,100 |
4,574 | 14,321,368 | 2,167 | A multimedia content search module operating in a server device provides localized pronunciations of names for social networking participants. When a participant signs up for a social networking service, the participant creates a social networking profile by inputting personal information such as name as well as geographic information, i.e., a birthplace, place of residence, etc. The server device then determines a pronunciation of the name by searching multimedia content from the participant's geographic region of origin for an instance of the name. The pronunciation is then stored in the participant's social networking profile and provided in response to a request by a user for pronunciation of the social networking participant's name. | 1. A method for generating localized pronunciations of names, the method comprising:
receiving, at one or more processors, a name of a social networking participant and an indication of a geographic region of origin of the social networking participant; identifying, by the one or more processors, multimedia content that includes an instance of the name vocalized at least near the geographic region of origin; storing, by the one or more processors on a computer-readable medium, a reference to the vocalized name in a database record associated with the social networking participant; and providing, by the one or more processors, the vocalized name in response to a request for pronunciation of the social networking participant's name. 2. The method of claim 1, further comprising:
receiving, at the one or more processors, a pronunciation of the name of the social networking participant from the social networking participant; and wherein storing a reference to the vocalized name comprises storing a reference to the pronunciation of the name by the social networking participant. 3. The method of claim 1, wherein identifying multimedia content that includes an instance of the name comprises:
searching, by the one or more processors, a multi-language book database for an instance of the name, wherein the multi-language book database includes a translation into a language corresponding to the geographic region of origin; identifying, by the one or more processors, a translated version of the name into the language corresponding the geographic region of origin; and identifying, by the one or more processors, multimedia content that includes an instance of the translated version of the name vocalized at least near the geographic region of origin. 4. The method of claim 1, wherein the request for pronunciation of the name of the social networking participant is received via a user control on a social networking profile of the social networking participant. 5. The method of claim 1, further comprising:
storing the reference to the vocalized name in a machine-readable knowledge repository in which data that describes attributes of entities is organized according to semantic relations between the entities, each entity corresponding to a geographic region, a name, and having a reference related to a vocalized instance of the name. 6. The method of claim 5, wherein the group of entities includes a plurality of vocalized names corresponding to the geographic region, wherein at least one of the plurality of vocalized names includes at least two instances of the same vocalized name, wherein a first instance is identified from multimedia content and the second instance is received from the user. 7. The method of claim 5, further comprising:
searching, by the one or more processors, the machine-readable knowledge repository for an entity corresponding to the name of the social networking participant and the geographic region of origin of the social networking participant; when there is a match, storing, by the one or more processors on the computer-readable medium, a reference to the vocalized name corresponding to the entity in the database record associated with the social networking participant; and when there is no match, identifying multimedia content that includes an instance of the name vocalized at least near the geographic region of origin. 8. The method of claim 1, wherein receiving an indication of a geographic region of origin of the social networking participant comprises at least one of:
receiving an indication of a birthplace or residence of the social networking participant from a social networking profile; receiving a global positioning system (GPS) location of a mobile device of the social networking participant; or receiving the indication of the geographic region of origin from the social networking participant. 9. The method of claim 1, wherein the multimedia content includes at least one of: music, video, audiobooks, television, movies, or voice recordings. 10. A computing device comprising:
a machine-readable knowledge repository in which data that describes attributes of entities is organized according to semantic relations between the entities, each entity corresponding to a geographic region and a name and having a reference related to a vocalized instance of the name; one or more processors; a non-transitory computer-readable medium storing thereon instructions that, when executed by the one or more processors, cause the computing device to:
receive a name of a social networking participant and an indication of a geographic region of origin of the social networking participant;
identify multimedia content that includes an instance of the name vocalized at least near the geographic region of origin;
store a reference to the vocalized name in a database record of the machine-readable knowledge repository associated with the social networking participant; and
provide the vocalized name in response to a request for pronunciation of the social networking participant's name. 11. The computing device of claim 10, wherein the instructions further cause the computing device to:
search the machine-readable knowledge repository for an entity corresponding to the name of the social networking participant and the geographic region of origin of the social networking participant; and when there is a match, provide the vocalized name corresponding to the entity. 12. The computing device of claim 11, wherein the instructions cause the computing device to identify multimedia content that includes an instance of the name vocalized at least near the geographic region of origin when there is no match in the machine-readable knowledge repository. 13. The computing device of claim 10, wherein at least some of the entities in the machine-readable knowledge repository correspond to the geographic region or origin at varying levels of detail. 14. The computing device of claim 13, wherein the at least some of the entities correspond to at least one of: a country, a continent, a state, a city, or a town. 15. The computing device of claim 10, wherein the instructions further cause the computing device to:
receive a pronunciation of the name of the social networking participant from the social networking participant; and store a reference to the pronunciation of the name in the database record of the machine-readable knowledge repository associated with the social networking participant. 16. The computing device of claim 10, wherein to identify multimedia content that includes an instance of the name the instructions cause the computing device to:
search a multi-language book database for an instance of the name, wherein the multi-language book database includes a translation into a language corresponding to the geographic region of origin; identify a translated version of the name into the language corresponding the geographic region of origin; and identify multimedia content that includes an instance of the translated version of the name vocalized at least near the geographic region of origin. 17. A client device comprising:
an audio speaker; a user interface including a user control for requesting pronunciation of a name displayed on the user interface; one or more processors coupled to the audio speaker and the user interface; and a non-transitory computer-readable memory coupled to the one or more processors and storing thereon instructions that, when executed by the one or more processors, cause the client device to:
transmit a name of a social networking participant and a request for pronunciation of the name of the social networking participant, via the user control, to a server device;
obtain an instance of the name vocalized at least near a geographic region of origin of the social networking participant from the server device; and
provide the vocalized name via the audio speaker. 18. The client device of claim 17, wherein to obtain an instance of the name vocalized at least near the geographic region of origin of the social networking participant, the instructions cause the computing device to:
obtain a pronunciation of the name by the social networking participant. 19. The client device of claim 17, wherein to obtain an instance of the name vocalized at least near the geographic region of origin of the social networking participant, the instructions cause the computing device to:
obtain a vocalized instance of the name from a machine-readable knowledge repository in which data that describes attributes of entities is organized according to semantic relations between the entities, each entity corresponding to a geographic region, a name, and having a reference related to a vocalized instance of the name. 20. The client device of claim 17, wherein the user interface is a user interface for a social networking profile. | A multimedia content search module operating in a server device provides localized pronunciations of names for social networking participants. When a participant signs up for a social networking service, the participant creates a social networking profile by inputting personal information such as name as well as geographic information, i.e., a birthplace, place of residence, etc. The server device then determines a pronunciation of the name by searching multimedia content from the participant's geographic region of origin for an instance of the name. The pronunciation is then stored in the participant's social networking profile and provided in response to a request by a user for pronunciation of the social networking participant's name.1. A method for generating localized pronunciations of names, the method comprising:
receiving, at one or more processors, a name of a social networking participant and an indication of a geographic region of origin of the social networking participant; identifying, by the one or more processors, multimedia content that includes an instance of the name vocalized at least near the geographic region of origin; storing, by the one or more processors on a computer-readable medium, a reference to the vocalized name in a database record associated with the social networking participant; and providing, by the one or more processors, the vocalized name in response to a request for pronunciation of the social networking participant's name. 2. The method of claim 1, further comprising:
receiving, at the one or more processors, a pronunciation of the name of the social networking participant from the social networking participant; and wherein storing a reference to the vocalized name comprises storing a reference to the pronunciation of the name by the social networking participant. 3. The method of claim 1, wherein identifying multimedia content that includes an instance of the name comprises:
searching, by the one or more processors, a multi-language book database for an instance of the name, wherein the multi-language book database includes a translation into a language corresponding to the geographic region of origin; identifying, by the one or more processors, a translated version of the name into the language corresponding the geographic region of origin; and identifying, by the one or more processors, multimedia content that includes an instance of the translated version of the name vocalized at least near the geographic region of origin. 4. The method of claim 1, wherein the request for pronunciation of the name of the social networking participant is received via a user control on a social networking profile of the social networking participant. 5. The method of claim 1, further comprising:
storing the reference to the vocalized name in a machine-readable knowledge repository in which data that describes attributes of entities is organized according to semantic relations between the entities, each entity corresponding to a geographic region, a name, and having a reference related to a vocalized instance of the name. 6. The method of claim 5, wherein the group of entities includes a plurality of vocalized names corresponding to the geographic region, wherein at least one of the plurality of vocalized names includes at least two instances of the same vocalized name, wherein a first instance is identified from multimedia content and the second instance is received from the user. 7. The method of claim 5, further comprising:
searching, by the one or more processors, the machine-readable knowledge repository for an entity corresponding to the name of the social networking participant and the geographic region of origin of the social networking participant; when there is a match, storing, by the one or more processors on the computer-readable medium, a reference to the vocalized name corresponding to the entity in the database record associated with the social networking participant; and when there is no match, identifying multimedia content that includes an instance of the name vocalized at least near the geographic region of origin. 8. The method of claim 1, wherein receiving an indication of a geographic region of origin of the social networking participant comprises at least one of:
receiving an indication of a birthplace or residence of the social networking participant from a social networking profile; receiving a global positioning system (GPS) location of a mobile device of the social networking participant; or receiving the indication of the geographic region of origin from the social networking participant. 9. The method of claim 1, wherein the multimedia content includes at least one of: music, video, audiobooks, television, movies, or voice recordings. 10. A computing device comprising:
a machine-readable knowledge repository in which data that describes attributes of entities is organized according to semantic relations between the entities, each entity corresponding to a geographic region and a name and having a reference related to a vocalized instance of the name; one or more processors; a non-transitory computer-readable medium storing thereon instructions that, when executed by the one or more processors, cause the computing device to:
receive a name of a social networking participant and an indication of a geographic region of origin of the social networking participant;
identify multimedia content that includes an instance of the name vocalized at least near the geographic region of origin;
store a reference to the vocalized name in a database record of the machine-readable knowledge repository associated with the social networking participant; and
provide the vocalized name in response to a request for pronunciation of the social networking participant's name. 11. The computing device of claim 10, wherein the instructions further cause the computing device to:
search the machine-readable knowledge repository for an entity corresponding to the name of the social networking participant and the geographic region of origin of the social networking participant; and when there is a match, provide the vocalized name corresponding to the entity. 12. The computing device of claim 11, wherein the instructions cause the computing device to identify multimedia content that includes an instance of the name vocalized at least near the geographic region of origin when there is no match in the machine-readable knowledge repository. 13. The computing device of claim 10, wherein at least some of the entities in the machine-readable knowledge repository correspond to the geographic region or origin at varying levels of detail. 14. The computing device of claim 13, wherein the at least some of the entities correspond to at least one of: a country, a continent, a state, a city, or a town. 15. The computing device of claim 10, wherein the instructions further cause the computing device to:
receive a pronunciation of the name of the social networking participant from the social networking participant; and store a reference to the pronunciation of the name in the database record of the machine-readable knowledge repository associated with the social networking participant. 16. The computing device of claim 10, wherein to identify multimedia content that includes an instance of the name the instructions cause the computing device to:
search a multi-language book database for an instance of the name, wherein the multi-language book database includes a translation into a language corresponding to the geographic region of origin; identify a translated version of the name into the language corresponding the geographic region of origin; and identify multimedia content that includes an instance of the translated version of the name vocalized at least near the geographic region of origin. 17. A client device comprising:
an audio speaker; a user interface including a user control for requesting pronunciation of a name displayed on the user interface; one or more processors coupled to the audio speaker and the user interface; and a non-transitory computer-readable memory coupled to the one or more processors and storing thereon instructions that, when executed by the one or more processors, cause the client device to:
transmit a name of a social networking participant and a request for pronunciation of the name of the social networking participant, via the user control, to a server device;
obtain an instance of the name vocalized at least near a geographic region of origin of the social networking participant from the server device; and
provide the vocalized name via the audio speaker. 18. The client device of claim 17, wherein to obtain an instance of the name vocalized at least near the geographic region of origin of the social networking participant, the instructions cause the computing device to:
obtain a pronunciation of the name by the social networking participant. 19. The client device of claim 17, wherein to obtain an instance of the name vocalized at least near the geographic region of origin of the social networking participant, the instructions cause the computing device to:
obtain a vocalized instance of the name from a machine-readable knowledge repository in which data that describes attributes of entities is organized according to semantic relations between the entities, each entity corresponding to a geographic region, a name, and having a reference related to a vocalized instance of the name. 20. The client device of claim 17, wherein the user interface is a user interface for a social networking profile. | 2,100 |
4,575 | 13,491,757 | 2,178 | A media and method for detecting third-party content in web pages is provided. Computer software operates on a server or a client-side computer to identify and analyze third-party links and contents in web pages to determine if a third-party content sill exists, is available, has changed, or disrupts a web browser. A third-party link or content can be removed, changed, or replaced. A user can be notified or given an option to handle changed third-party content. The server may remove the third-party link or content by changing an HTML file for the web page. The client-side computer may remove the third-party link or content by dynamically changing the rendered web page before it is displayed to the user. | 1. One or more computer-readable media containing thereon computer-readable code executed by one or more computers for performing a method for handling third-party content in web applications, comprising:
operating a set of software to detect third-party content controlled by third party, wherein the third-party content is embedded in a web page, and the third-party content is accessed or executed from embedded content in the web page rendered by a host application; detecting the third-party content in the web page; downloading the third-party content so that the third-party content is classified; analyzing the third-party content with a classifier; detecting one or more problems with the third-party content as an output of the classifier, wherein the one or more problems include at least one of the third-party content no longer exists, the third-party content is unavailable, the third-party content changes, or the third-party content disrupts the host application; and modifying the web page to remove the one or more problems that are detected before rendering the web page. 2. The media of claim 1, wherein operating the set of software comprises gathering the third-party content controlled by the third party associated with the embedded content in the web page. 3. The media of claim 2, wherein the third party comprises an owner or a controller of the third-party content, and the third party is not the owner nor the controller of the web page. 4. The media of claim 3, wherein the third-party content is selected from a group including one or more links, another web page, an image, a video, an audio, a document, a flash application, a data in an really simple syndication (RSS) feed, an extensible markup language (XML) content, and a Javascript application. 5. The media of claim 1, wherein the set of software resides on a server. 6. The media of claim 1, wherein the set of software resides on a client-side computing device. 7. The media of claim 1, wherein detecting the one or more problems comprises analyzing the third-party content to determine if the set of content no longer exists, if the third-party content is unavailable, if the third-party content changes, or if the third-party content disrupts the host application. 8. The media of claim 7, wherein the host application is a web browser. 9. The media of claim 8, wherein upon a detection of the frame break, the web browser is redirected to another web page. 10. The media of claim 1, wherein modifying the web page comprises modifying one or more hypertext markup languate (HTML) files to remove the embedded content associated with the third-party content. 11. The media of claim 10, wherein modifying the web page comprises at least one of adding other content to the one or more HTML files wherein the other content is associated with another third-party content, or adding the another third-party content directly to the one or more HTML files. 12. The media of claim 1, wherein modifying the web page comprises changing the third-party content or replacing the set of content. 13. The media of claim 12, wherein modifying the web page comprises changing the web page before it is displayed on a computing device of a user. 14. One or more computer-readable media containing thereon computer-readable code executed by one or more computers for performing a method for handling third-party content in web applications, comprising:
operating a set of software to detect third-party content controlled by third party, wherein the third-party content is embedded in a web page, and the third-party content is accessed or executed from embedded content in the web page rendered by a host application; detecting the third-party content in the web page; downloading the third-party content so that the third-party content is classified; analyzing the third-party content with a classifier; detecting one or more problems with the third-party content as an output of the classifier, wherein the one or more problems include at least one of the third-party content no longer exists, the third-party content is unavailable, the third-party content changes, or the third-party content disrupts the host application; and providing to a user at least one of a notification about the one or more problems, an option to display the set of content, and an option to display another set of content before rendering the web page. 15. A method for detecting a validity of third-party content in a web application using a set of computer software, comprising:
periodically, verifying one or more third-party links and one or more third-party content in a web page; searching for the one or more third-party links or the one or more third-party content associated with the web page; downloading the one or more third-party links or the one or more third-party content so that the one or more third-party links or the one or more third-party content are analyzed; analyzing the one or more third-party links or the one or more third-party content to create one or more identifiers for each of the one or more third-party links or the one or more third-party content; creating the one or more identifiers for each of the one or more third-party links or the one or more third-party content; and detecting a change in a link or a content from a comparison of a last identifier associated with a last analysis of the link or the content to the current identifier associated with a current analysis of the link or the content. 16. The method of claim 15, further comprising modifying the link or the content if the last identifier and the current identifier are different. 17. The method of claim 16, wherein the set of computer software operates on one or more servers. 18. The method of claim 17, wherein the set of computer software operates on the one or more servers to determine the last identifier and a set of computer software operates on a computing device of a user to determine the current identifier. | A media and method for detecting third-party content in web pages is provided. Computer software operates on a server or a client-side computer to identify and analyze third-party links and contents in web pages to determine if a third-party content sill exists, is available, has changed, or disrupts a web browser. A third-party link or content can be removed, changed, or replaced. A user can be notified or given an option to handle changed third-party content. The server may remove the third-party link or content by changing an HTML file for the web page. The client-side computer may remove the third-party link or content by dynamically changing the rendered web page before it is displayed to the user.1. One or more computer-readable media containing thereon computer-readable code executed by one or more computers for performing a method for handling third-party content in web applications, comprising:
operating a set of software to detect third-party content controlled by third party, wherein the third-party content is embedded in a web page, and the third-party content is accessed or executed from embedded content in the web page rendered by a host application; detecting the third-party content in the web page; downloading the third-party content so that the third-party content is classified; analyzing the third-party content with a classifier; detecting one or more problems with the third-party content as an output of the classifier, wherein the one or more problems include at least one of the third-party content no longer exists, the third-party content is unavailable, the third-party content changes, or the third-party content disrupts the host application; and modifying the web page to remove the one or more problems that are detected before rendering the web page. 2. The media of claim 1, wherein operating the set of software comprises gathering the third-party content controlled by the third party associated with the embedded content in the web page. 3. The media of claim 2, wherein the third party comprises an owner or a controller of the third-party content, and the third party is not the owner nor the controller of the web page. 4. The media of claim 3, wherein the third-party content is selected from a group including one or more links, another web page, an image, a video, an audio, a document, a flash application, a data in an really simple syndication (RSS) feed, an extensible markup language (XML) content, and a Javascript application. 5. The media of claim 1, wherein the set of software resides on a server. 6. The media of claim 1, wherein the set of software resides on a client-side computing device. 7. The media of claim 1, wherein detecting the one or more problems comprises analyzing the third-party content to determine if the set of content no longer exists, if the third-party content is unavailable, if the third-party content changes, or if the third-party content disrupts the host application. 8. The media of claim 7, wherein the host application is a web browser. 9. The media of claim 8, wherein upon a detection of the frame break, the web browser is redirected to another web page. 10. The media of claim 1, wherein modifying the web page comprises modifying one or more hypertext markup languate (HTML) files to remove the embedded content associated with the third-party content. 11. The media of claim 10, wherein modifying the web page comprises at least one of adding other content to the one or more HTML files wherein the other content is associated with another third-party content, or adding the another third-party content directly to the one or more HTML files. 12. The media of claim 1, wherein modifying the web page comprises changing the third-party content or replacing the set of content. 13. The media of claim 12, wherein modifying the web page comprises changing the web page before it is displayed on a computing device of a user. 14. One or more computer-readable media containing thereon computer-readable code executed by one or more computers for performing a method for handling third-party content in web applications, comprising:
operating a set of software to detect third-party content controlled by third party, wherein the third-party content is embedded in a web page, and the third-party content is accessed or executed from embedded content in the web page rendered by a host application; detecting the third-party content in the web page; downloading the third-party content so that the third-party content is classified; analyzing the third-party content with a classifier; detecting one or more problems with the third-party content as an output of the classifier, wherein the one or more problems include at least one of the third-party content no longer exists, the third-party content is unavailable, the third-party content changes, or the third-party content disrupts the host application; and providing to a user at least one of a notification about the one or more problems, an option to display the set of content, and an option to display another set of content before rendering the web page. 15. A method for detecting a validity of third-party content in a web application using a set of computer software, comprising:
periodically, verifying one or more third-party links and one or more third-party content in a web page; searching for the one or more third-party links or the one or more third-party content associated with the web page; downloading the one or more third-party links or the one or more third-party content so that the one or more third-party links or the one or more third-party content are analyzed; analyzing the one or more third-party links or the one or more third-party content to create one or more identifiers for each of the one or more third-party links or the one or more third-party content; creating the one or more identifiers for each of the one or more third-party links or the one or more third-party content; and detecting a change in a link or a content from a comparison of a last identifier associated with a last analysis of the link or the content to the current identifier associated with a current analysis of the link or the content. 16. The method of claim 15, further comprising modifying the link or the content if the last identifier and the current identifier are different. 17. The method of claim 16, wherein the set of computer software operates on one or more servers. 18. The method of claim 17, wherein the set of computer software operates on the one or more servers to determine the last identifier and a set of computer software operates on a computing device of a user to determine the current identifier. | 2,100 |
4,576 | 14,796,651 | 2,118 | A machine tool with a rotary table includes a disturbance torque calculation unit configured to calculate a disturbance torque imposed on the brake while the rotary table is retained by the brake, a first coefficient storing unit for storing a first coefficient corresponding to a disturbance torque, an accumulation unit configured to, when the disturbance torque is imposed on the brake, find a first coefficient corresponding to the disturbance torque and accumulate a value of the first coefficient, and, an annunciation unit configured to annunciate necessity of a brake replacement when the value of the first coefficient accumulated reaches a predetermined value. | 1. A machine tool with a rotary table configured to index a rotary table with a workpiece mounted thereupon and retain an indexed position by a brake, the machine tool with the rotary table comprising:
a disturbance torque calculation unit configured to calculate a disturbance torque imposed on the brake while the rotary table is retained by the brake; a first coefficient storing unit configured to store a first coefficient corresponding to the disturbance torque; an accumulation unit configured to, when the disturbance torque is imposed on the brake, calculate a disturbance torque using the disturbance torque calculation unit, find a first coefficient corresponding to the disturbance torque based on the disturbance torque calculated and referring to the first coefficient storing unit, and accumulate a value of the first coefficient; and, an annunciation unit configured to annunciate necessity of a brake replacement when the value of the first coefficient accumulated reaches a predetermined value. 2. A machine tool with a rotary table configured to index a rotary table with a workpiece mounted thereupon and retain an indexed position by a brake, the machine tool with the rotary table comprising:
an inertia storing unit configured to preliminary store an inertia of the rotary table corresponding to the workpiece; a second coefficient storing unit configured to store a second coefficient corresponding to size of the inertia; an accumulation unit configured to, when the disturbance torque is imposed on the brake, find a second coefficient corresponding to the inertia based on the inertia stored and referring to the second coefficient storing unit, and accumulate a value of the second coefficient; and, an annunciation unit configured to annunciate necessity of a brake replacement when an accumulated value of the coefficient reaches a predetermined value. 3. A machine tool with a rotary table configured to index a rotary table with a workpiece mounted thereupon and retain an indexed position by a brake, the machine tool with the rotary table comprising:
a disturbance torque calculation unit configured to calculate a disturbance torque imposed on the brake while the rotary table is retained by the brake; an inertia storing unit configured to preliminary store an inertia of the rotary table corresponding to the workpiece; a first coefficient storing unit configured to store a first coefficient corresponding to the disturbance torque; a second coefficient storing unit configured to store a second coefficient corresponding to size of the inertia; an accumulation unit configured to, when the disturbance torque is imposed on the brake, calculate a disturbance torque using the disturbance torque calculation unit, find a first coefficient corresponding to the disturbance torque based on the disturbance torque calculated and referring to the first coefficient storing unit, find a second coefficient corresponding to the inertia based on the inertia stored and referring to the second coefficient storing unit, and accumulate a value of the first coefficient and a value of the second coefficient; and, an annunciation unit configured to annunciate necessity of a brake replacement when the value of the first coefficient accumulated reaches a predetermined value. | A machine tool with a rotary table includes a disturbance torque calculation unit configured to calculate a disturbance torque imposed on the brake while the rotary table is retained by the brake, a first coefficient storing unit for storing a first coefficient corresponding to a disturbance torque, an accumulation unit configured to, when the disturbance torque is imposed on the brake, find a first coefficient corresponding to the disturbance torque and accumulate a value of the first coefficient, and, an annunciation unit configured to annunciate necessity of a brake replacement when the value of the first coefficient accumulated reaches a predetermined value.1. A machine tool with a rotary table configured to index a rotary table with a workpiece mounted thereupon and retain an indexed position by a brake, the machine tool with the rotary table comprising:
a disturbance torque calculation unit configured to calculate a disturbance torque imposed on the brake while the rotary table is retained by the brake; a first coefficient storing unit configured to store a first coefficient corresponding to the disturbance torque; an accumulation unit configured to, when the disturbance torque is imposed on the brake, calculate a disturbance torque using the disturbance torque calculation unit, find a first coefficient corresponding to the disturbance torque based on the disturbance torque calculated and referring to the first coefficient storing unit, and accumulate a value of the first coefficient; and, an annunciation unit configured to annunciate necessity of a brake replacement when the value of the first coefficient accumulated reaches a predetermined value. 2. A machine tool with a rotary table configured to index a rotary table with a workpiece mounted thereupon and retain an indexed position by a brake, the machine tool with the rotary table comprising:
an inertia storing unit configured to preliminary store an inertia of the rotary table corresponding to the workpiece; a second coefficient storing unit configured to store a second coefficient corresponding to size of the inertia; an accumulation unit configured to, when the disturbance torque is imposed on the brake, find a second coefficient corresponding to the inertia based on the inertia stored and referring to the second coefficient storing unit, and accumulate a value of the second coefficient; and, an annunciation unit configured to annunciate necessity of a brake replacement when an accumulated value of the coefficient reaches a predetermined value. 3. A machine tool with a rotary table configured to index a rotary table with a workpiece mounted thereupon and retain an indexed position by a brake, the machine tool with the rotary table comprising:
a disturbance torque calculation unit configured to calculate a disturbance torque imposed on the brake while the rotary table is retained by the brake; an inertia storing unit configured to preliminary store an inertia of the rotary table corresponding to the workpiece; a first coefficient storing unit configured to store a first coefficient corresponding to the disturbance torque; a second coefficient storing unit configured to store a second coefficient corresponding to size of the inertia; an accumulation unit configured to, when the disturbance torque is imposed on the brake, calculate a disturbance torque using the disturbance torque calculation unit, find a first coefficient corresponding to the disturbance torque based on the disturbance torque calculated and referring to the first coefficient storing unit, find a second coefficient corresponding to the inertia based on the inertia stored and referring to the second coefficient storing unit, and accumulate a value of the first coefficient and a value of the second coefficient; and, an annunciation unit configured to annunciate necessity of a brake replacement when the value of the first coefficient accumulated reaches a predetermined value. | 2,100 |
4,577 | 13,470,707 | 2,153 | Methods, systems, and apparatus, including computer program products, for processing search results. A first query suggestion for a search query input is received, and a first set of image search results responsive to the query suggestion is received. Both are provided to a user device in response to the search query input. After providing the first set of image search results to the user device, a signal of user interest is detected in either of the query suggestion or at least one of the image search results. The detection is prior to receiving another search query input subsequent to the search query input. In response to the detection, a second set of image search results is provided to the user device to supplement the first set of image search results previously provided to the user device. The second set of image search results are responsive to the query suggestion. | 1. A computer-implemented method, comprising:
receiving, from a user device, a first search query input comprising one or more characters; receiving a first query suggestion from a query suggestion service, the first query suggestion having been generated based on the first search query input and being different from the first search query input; receiving a first set of image search results, each of the image search results referencing an image responsive to the first query suggestion; providing the first set of the image search results and the first query suggestion to the user device for display on the user device, in response to the first search query input; after providing the first set of image search results to the user device, detecting, by a computer, a signal of user interest in either of the first query suggestion or at least one image search result in the first set of image search results, the detection of the signal of user interest occurring at or before a timeout expiration and being prior to receiving a second search query input subsequent to the first search query input; and in response to detecting the signal of user interest and prior to receiving the second search query input subsequent to the first search query input, providing a second set of image search results to the user device for concurrent display with the first set of image search results previously provided to the user device, the first set of image search results being unmodified, and the second set of image search results being responsive to the first query suggestion. 2. The method of claim 1, wherein the first query suggestion is a highest-ranked query suggestion among a plurality of query suggestions generated based on the first search query input, and ranking of the plurality of query suggestions is based on relative submission frequencies of the plurality of query suggestions in a query log. 3. The method of claim 1, wherein providing the first set of the image search results and the first query suggestion to the user device comprises:
determining a size of available space for presenting image search results in a view port on the user device; determining a first cardinality for the first set of image search results based on the size of the available space, the first cardinality being a value for which each image search result in the first set of image search results can be concurrently displayed in the available space; and selecting a first cardinality of image search results responsive to the first query suggestion for inclusion in the first set of image search results. 4. The method of claim 3, wherein providing a second set of image search results to the user device comprises:
determining a second cardinality for the second set of image search results; and selecting a second cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 5. The method of claim 4, further comprising:
receiving, from the user device, a request for a third set of image search results responsive to the first query suggestion, the request being received after the providing the second set of image search results; and providing the third set of image search results to the user device in response to the request for the third set of image search results. 6. The method of claim 5, wherein providing a third set of image search results to the user device comprises:
determining a third cardinality for the third set of image search results; and selecting a third cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 7. The method of claim 5, wherein the second cardinality is greater than the first cardinality, and the third cardinality is greater than the second cardinality. 8. The method of claim 1, wherein detecting a signal of user interest comprises receiving data from the user device indicating a movement of a cursor in the viewport displaying the first set of image search results. 9. The method of claim 1, wherein detecting a signal of user interest comprises receiving data from the user device indicating a scrolling event that results in a scrolling of a displayed first image search results in the viewport. 10. The method of claim 1, wherein detecting a signal of user interest comprises receiving data from the user device indicating a non-navigating user click received in a view port in which the first image search results are displayed. 11. The method of claim 1, further comprising providing one or more subsequent second sets of image search results, the providing of each of the one or more subsequent second sets of image search results comprising:
after providing any of the second sets of image search results to the user device, detecting another signal of user interest in at least one image search result in any of the first or second sets of image search results previously provided to the user device, the detection of the another signal of user interest being prior to receiving a second search query input subsequent to the first search query input; and in response to detecting the another signal of user interest, providing a subsequent second set of image search results to the user device to supplement the sets of image search results previously provided to the user device, the subsequent second set of image search results being responsive to the first query suggestion. 12. A system, comprising:
a data processing apparatus; and a computer memory apparatus in data communication with the data processing apparatus and storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising:
receiving, from a user device, a first search query input comprising one or more characters;
receiving a first query suggestion from a query suggestion service, the first query suggestion having been generated based on the first search query input and being different from the first search query input;
receiving a first set of image search results, each of the image search results referencing an image responsive to the first query suggestion;
providing the first set of the image search results and the first query suggestion to the user device for display on the user device in response to the first search query input;
after providing the first set of image search results to the user device, detecting a signal of user interest in either of the first query suggestion or at least one image search result in the first set of image search results, the detection of the signal of user interest occurring at or before a timeout expiration and being prior to receiving a second search query input subsequent to the first search query input; and
in response to detecting the signal of user interest and prior to receiving the second search query input subsequent to the first search query input, providing a second set of image search results to the user device for concurrent display with the first set of image search results previously provided to the user device, the first set of image search results being unmodified, and the second set of image search results being responsive to the first query suggestion. 13. The system of claim 12, wherein the first query suggestion is a highest-ranked query suggestion among a plurality of query suggestions generated based on the first search query input, and ranking of the plurality of query suggestions is based on relative submission frequencies of the plurality of query suggestions in a query log. 14. The method of claim 12, wherein providing the first set of the image search results and the first query suggestion to the user device comprises:
determining a size of available space for presenting image search results in a view port on the user device; determining a first cardinality for the first set of image search results based on the size of the available space, the first cardinality being a value for which each image search result in the first set of image search results can be concurrently displayed in the available space; and selecting a first cardinality of image search results responsive to the first query suggestion for inclusion in the first set of image search results. 15. The system of claim 14, wherein providing a second set of image search results to the user device comprises:
determining a second cardinality for the second set of image search results; and selecting a second cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 16. The system of claim 15, wherein the operations further comprise:
receiving, from the user device, a request for a third set of image search results responsive to the first query suggestion, the request being received after the providing the second set of image search results; and providing the third set of image search results to the user device in response to the request for the third set of image search results. 17. The system of claim 16, wherein providing a third set of image search results to the user device comprises:
determining a third cardinality for the third set of image search results; and selecting a third cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 18. The system of claim 16, wherein the second cardinality is greater than the first cardinality, and the third cardinality is greater than the second cardinality. 19. The system of claim 12, wherein detecting a signal of user interest comprises receiving data from the user device indicating a movement of a cursor in the viewport displaying the first set of image search results. 20. The system of claim 12, wherein detecting a signal of user interest comprises receiving data from the user device indicating a scrolling event that results in a scrolling of a displayed first image search results in the viewport. 21. The system of claim 12, wherein detecting a signal of user interest comprises receiving data from the user device indicating a non-navigating user click received in a view port in which the first image search results are displayed. 22. The system of claim 12, wherein the operations further comprise:
providing one or more subsequent second sets of image search results, the providing of each of the one or more subsequent second sets of image search results comprising:
after providing any of the second sets of image search results to the user device, detecting another signal of user interest in at least one image search result in any of the first or second sets of image search results previously provided to the user device, the detection of the another signal of user interest being prior to receiving a second search query input subsequent to the first search query input; and
in response to detecting the another signal of user interest, providing a subsequent second set of image search results to the user device to supplement the sets of image search results previously provided to the user device, the subsequent second set of image search results being responsive to the first query suggestion. 23. A computer memory apparatus storing instructions executable by a data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising:
receiving, from a user device, a first search query input comprising one or more characters; receiving a first query suggestion from a query suggestion service, the first query suggestion having been generated based on the first search query input and being different from the first search query input; receiving a first set of image search results, each of the image search results referencing an image responsive to the first query suggestion; providing the first set of the image search results and the first query suggestion to the user device for display on the user device, in response to the first search query input; after providing the first set of image search results to the user device, detecting a signal of user interest in either of the first query suggestion or at least one image search result in the first set of image search results, the detection of the signal of user interest occurring at or before a timeout expiration and being prior to receiving a second search query input subsequent to the first search query input; and in response to detecting the signal of user interest prior to receiving the second search query input subsequent to the first search query input, providing a second set of image search results to the user device for concurrent display with the first set of image search results previously provided to the user device, the first set of image search results being unmodified, and the second set of image search results being responsive to the first query suggestion. 24. The computer memory apparatus of claim 23, wherein the first query suggestion is a highest-ranked query suggestion among a plurality of query suggestions generated based on the first search query input, and ranking of the plurality of query suggestions is based on relative submission frequencies of the plurality of query suggestions in a query log. 25. The computer memory apparatus of claim 23, wherein providing the first set of the image search results and the first query suggestion to the user device comprises:
determining a size of available space for presenting image search results in a view port on the user device; determining a first cardinality for the first set of image search results based on the size of the available space, the first cardinality being a value for which each image search result in the first set of image search results can be concurrently displayed in the available space; and selecting a first cardinality of image search results responsive to the first query suggestion for inclusion in the first set of image search results. 26. The computer memory apparatus claim 25, wherein providing a second set of image search results to the user device comprises:
determining a second cardinality for the second set of image search results; and selecting a second cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 27. The computer memory apparatus of claim 26, the operations further comprising:
receiving, from the user device, a request for a third set of image search results responsive to the first query suggestion, the request being received after the providing the second set of image search results; and providing the third set of image search results to the user device in response to the request for the third set of image search results. 28. The computer memory apparatus of claim 27, wherein providing a third set of image search results to the user device comprises:
determining a third cardinality for the third set of image search results; and selecting a third cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 29. The computer memory apparatus of claim 28, wherein the second cardinality is greater than the first cardinality, and the third cardinality is greater than the second cardinality. | Methods, systems, and apparatus, including computer program products, for processing search results. A first query suggestion for a search query input is received, and a first set of image search results responsive to the query suggestion is received. Both are provided to a user device in response to the search query input. After providing the first set of image search results to the user device, a signal of user interest is detected in either of the query suggestion or at least one of the image search results. The detection is prior to receiving another search query input subsequent to the search query input. In response to the detection, a second set of image search results is provided to the user device to supplement the first set of image search results previously provided to the user device. The second set of image search results are responsive to the query suggestion.1. A computer-implemented method, comprising:
receiving, from a user device, a first search query input comprising one or more characters; receiving a first query suggestion from a query suggestion service, the first query suggestion having been generated based on the first search query input and being different from the first search query input; receiving a first set of image search results, each of the image search results referencing an image responsive to the first query suggestion; providing the first set of the image search results and the first query suggestion to the user device for display on the user device, in response to the first search query input; after providing the first set of image search results to the user device, detecting, by a computer, a signal of user interest in either of the first query suggestion or at least one image search result in the first set of image search results, the detection of the signal of user interest occurring at or before a timeout expiration and being prior to receiving a second search query input subsequent to the first search query input; and in response to detecting the signal of user interest and prior to receiving the second search query input subsequent to the first search query input, providing a second set of image search results to the user device for concurrent display with the first set of image search results previously provided to the user device, the first set of image search results being unmodified, and the second set of image search results being responsive to the first query suggestion. 2. The method of claim 1, wherein the first query suggestion is a highest-ranked query suggestion among a plurality of query suggestions generated based on the first search query input, and ranking of the plurality of query suggestions is based on relative submission frequencies of the plurality of query suggestions in a query log. 3. The method of claim 1, wherein providing the first set of the image search results and the first query suggestion to the user device comprises:
determining a size of available space for presenting image search results in a view port on the user device; determining a first cardinality for the first set of image search results based on the size of the available space, the first cardinality being a value for which each image search result in the first set of image search results can be concurrently displayed in the available space; and selecting a first cardinality of image search results responsive to the first query suggestion for inclusion in the first set of image search results. 4. The method of claim 3, wherein providing a second set of image search results to the user device comprises:
determining a second cardinality for the second set of image search results; and selecting a second cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 5. The method of claim 4, further comprising:
receiving, from the user device, a request for a third set of image search results responsive to the first query suggestion, the request being received after the providing the second set of image search results; and providing the third set of image search results to the user device in response to the request for the third set of image search results. 6. The method of claim 5, wherein providing a third set of image search results to the user device comprises:
determining a third cardinality for the third set of image search results; and selecting a third cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 7. The method of claim 5, wherein the second cardinality is greater than the first cardinality, and the third cardinality is greater than the second cardinality. 8. The method of claim 1, wherein detecting a signal of user interest comprises receiving data from the user device indicating a movement of a cursor in the viewport displaying the first set of image search results. 9. The method of claim 1, wherein detecting a signal of user interest comprises receiving data from the user device indicating a scrolling event that results in a scrolling of a displayed first image search results in the viewport. 10. The method of claim 1, wherein detecting a signal of user interest comprises receiving data from the user device indicating a non-navigating user click received in a view port in which the first image search results are displayed. 11. The method of claim 1, further comprising providing one or more subsequent second sets of image search results, the providing of each of the one or more subsequent second sets of image search results comprising:
after providing any of the second sets of image search results to the user device, detecting another signal of user interest in at least one image search result in any of the first or second sets of image search results previously provided to the user device, the detection of the another signal of user interest being prior to receiving a second search query input subsequent to the first search query input; and in response to detecting the another signal of user interest, providing a subsequent second set of image search results to the user device to supplement the sets of image search results previously provided to the user device, the subsequent second set of image search results being responsive to the first query suggestion. 12. A system, comprising:
a data processing apparatus; and a computer memory apparatus in data communication with the data processing apparatus and storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising:
receiving, from a user device, a first search query input comprising one or more characters;
receiving a first query suggestion from a query suggestion service, the first query suggestion having been generated based on the first search query input and being different from the first search query input;
receiving a first set of image search results, each of the image search results referencing an image responsive to the first query suggestion;
providing the first set of the image search results and the first query suggestion to the user device for display on the user device in response to the first search query input;
after providing the first set of image search results to the user device, detecting a signal of user interest in either of the first query suggestion or at least one image search result in the first set of image search results, the detection of the signal of user interest occurring at or before a timeout expiration and being prior to receiving a second search query input subsequent to the first search query input; and
in response to detecting the signal of user interest and prior to receiving the second search query input subsequent to the first search query input, providing a second set of image search results to the user device for concurrent display with the first set of image search results previously provided to the user device, the first set of image search results being unmodified, and the second set of image search results being responsive to the first query suggestion. 13. The system of claim 12, wherein the first query suggestion is a highest-ranked query suggestion among a plurality of query suggestions generated based on the first search query input, and ranking of the plurality of query suggestions is based on relative submission frequencies of the plurality of query suggestions in a query log. 14. The method of claim 12, wherein providing the first set of the image search results and the first query suggestion to the user device comprises:
determining a size of available space for presenting image search results in a view port on the user device; determining a first cardinality for the first set of image search results based on the size of the available space, the first cardinality being a value for which each image search result in the first set of image search results can be concurrently displayed in the available space; and selecting a first cardinality of image search results responsive to the first query suggestion for inclusion in the first set of image search results. 15. The system of claim 14, wherein providing a second set of image search results to the user device comprises:
determining a second cardinality for the second set of image search results; and selecting a second cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 16. The system of claim 15, wherein the operations further comprise:
receiving, from the user device, a request for a third set of image search results responsive to the first query suggestion, the request being received after the providing the second set of image search results; and providing the third set of image search results to the user device in response to the request for the third set of image search results. 17. The system of claim 16, wherein providing a third set of image search results to the user device comprises:
determining a third cardinality for the third set of image search results; and selecting a third cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 18. The system of claim 16, wherein the second cardinality is greater than the first cardinality, and the third cardinality is greater than the second cardinality. 19. The system of claim 12, wherein detecting a signal of user interest comprises receiving data from the user device indicating a movement of a cursor in the viewport displaying the first set of image search results. 20. The system of claim 12, wherein detecting a signal of user interest comprises receiving data from the user device indicating a scrolling event that results in a scrolling of a displayed first image search results in the viewport. 21. The system of claim 12, wherein detecting a signal of user interest comprises receiving data from the user device indicating a non-navigating user click received in a view port in which the first image search results are displayed. 22. The system of claim 12, wherein the operations further comprise:
providing one or more subsequent second sets of image search results, the providing of each of the one or more subsequent second sets of image search results comprising:
after providing any of the second sets of image search results to the user device, detecting another signal of user interest in at least one image search result in any of the first or second sets of image search results previously provided to the user device, the detection of the another signal of user interest being prior to receiving a second search query input subsequent to the first search query input; and
in response to detecting the another signal of user interest, providing a subsequent second set of image search results to the user device to supplement the sets of image search results previously provided to the user device, the subsequent second set of image search results being responsive to the first query suggestion. 23. A computer memory apparatus storing instructions executable by a data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising:
receiving, from a user device, a first search query input comprising one or more characters; receiving a first query suggestion from a query suggestion service, the first query suggestion having been generated based on the first search query input and being different from the first search query input; receiving a first set of image search results, each of the image search results referencing an image responsive to the first query suggestion; providing the first set of the image search results and the first query suggestion to the user device for display on the user device, in response to the first search query input; after providing the first set of image search results to the user device, detecting a signal of user interest in either of the first query suggestion or at least one image search result in the first set of image search results, the detection of the signal of user interest occurring at or before a timeout expiration and being prior to receiving a second search query input subsequent to the first search query input; and in response to detecting the signal of user interest prior to receiving the second search query input subsequent to the first search query input, providing a second set of image search results to the user device for concurrent display with the first set of image search results previously provided to the user device, the first set of image search results being unmodified, and the second set of image search results being responsive to the first query suggestion. 24. The computer memory apparatus of claim 23, wherein the first query suggestion is a highest-ranked query suggestion among a plurality of query suggestions generated based on the first search query input, and ranking of the plurality of query suggestions is based on relative submission frequencies of the plurality of query suggestions in a query log. 25. The computer memory apparatus of claim 23, wherein providing the first set of the image search results and the first query suggestion to the user device comprises:
determining a size of available space for presenting image search results in a view port on the user device; determining a first cardinality for the first set of image search results based on the size of the available space, the first cardinality being a value for which each image search result in the first set of image search results can be concurrently displayed in the available space; and selecting a first cardinality of image search results responsive to the first query suggestion for inclusion in the first set of image search results. 26. The computer memory apparatus claim 25, wherein providing a second set of image search results to the user device comprises:
determining a second cardinality for the second set of image search results; and selecting a second cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 27. The computer memory apparatus of claim 26, the operations further comprising:
receiving, from the user device, a request for a third set of image search results responsive to the first query suggestion, the request being received after the providing the second set of image search results; and providing the third set of image search results to the user device in response to the request for the third set of image search results. 28. The computer memory apparatus of claim 27, wherein providing a third set of image search results to the user device comprises:
determining a third cardinality for the third set of image search results; and selecting a third cardinality of additional image search results responsive to the first query suggestion for inclusion in the second set of image search results. 29. The computer memory apparatus of claim 28, wherein the second cardinality is greater than the first cardinality, and the third cardinality is greater than the second cardinality. | 2,100 |
4,578 | 13,901,522 | 2,174 | Described herein are techniques for a computing device executing a windowing system that automatically maintains a tiled arrangement of application windows on a first display and on a second display. A user interface element has indicia of applications that can be used to open the applications. Responsive to a first user input the user interface element is displayed on the first display, and while the user interface element is displayed on the first display, the windowing system maintains two or more of the application windows in a tiled arrangement on the second display. The user interface element may be part of a system user interface and may be implemented in a variety of ways. For example, it may be a full-screen set of application representations, possibly user selected, or a list of recently used applications, or a list of open applications, etc. | 1. A method of managing windows for a computing device, the method comprising:
executing a windowing system that automatically maintains a tiled arrangement of application windows for applications executing on the computing device, the windowing system enabling tiled display of the application windows on a first display connected with the computing device and on a second display connected with the computing device, wherein when one or more application windows are displayed by the windowing system on either of the displays those application windows substantially fully occupy the displays on which they are displayed; executing an application launcher on the computing device, the application launcher comprising indicia of applications on the computing device, wherein responsive to a first user input the application launcher is displayed on the first display; and while the application launcher is displayed on the first display, maintaining, by the windowing system, two or more of the application windows in a tiled arrangement on the second display. 2. A method according to claim 1, further comprising, responsive to second user input, displaying the application launcher, an application switcher, or dashboard of information on the second display and concurrently maintaining tiled arrangement of one or more of the application windows in a tiled arrangement on the first display. 3. A method according to claim 1, wherein the application launcher at one time is able to be displayed on the first display and is able to be displayed on the second display, according to invoking user input. 4. A method according to claim 3, wherein the application launcher when displayed substantially fully occupies whichever of the displays that it is displayed on. 5. A method according to claim 1, wherein the application launcher comprises a plurality of graphics representing respective applications and when a graphic is selected a corresponding application is launched and a corresponding application window substantially fully occupies whichever display was displaying the application launcher when the graphic was selected. 6. A method according to claim 5, wherein when the application window is closed or moved to another display, the application launcher is again displayed on the same display. 7. A method according to claim 1, wherein the application launcher comprises a list of recently used applications, the application launcher is able to be displayed on both the first display and the second display, and is only able to be displayed on one display at a time. 8. A method according to claim 1, wherein neither display is managed as a main display but rather each display is equally capable of displaying the application launcher while the other display displays one or more application windows. 9. A computing device comprising a processor, storage, and a first display, the storage storing a windowing system that when executed by the processor displays application windows of applications executing by the processor, the computing device further comprising:
the windowing system, when executing, being capable of displaying application windows on the first display and on a second display when a second display is locally connected with the computing device, the windowing system further comprising a user interface element, wherein the windowing system displays application windows on either display such that when an application window is displayed on either display the application window either substantially fully occupies that display or the application window and any other application windows on that display substantially fully occupy that display; and the user interface element, which at one time is capable of being displayed on the first display and is capable of being displayed on the second display, being configured to respond to user interactions with the user interface element by displaying application windows on whichever display is currently displaying the user interface element. 10. A computing device according to claim 9, wherein the windowing system allows the user to direct input to both of the displays and allows the user to move application windows from one display to the other. 11. A computing device according to claim 9, wherein when the user interface element is being displayed on one display: the user is able to interact with any application windows displayed on the other display, the user is able to interact with the user interface element without disrupting display of any application windows displayed on the other display, and the user is able to interact with the user interface element to trigger the display of application windows. 12. A computing device according to claim 9, wherein when an application window is displayed responsive to a user interaction with the user interface element, the user interface element is undisplayed and the application window is displayed on the display where the user interface element was interacted with, the application window being displayed such that the application window substantially fully occupies the display where the user interface element was interacted with. 13. A computing device according to claim 9, wherein the user interface element comprises application icons for launching corresponding applications. 14. A computing device according to claim 13, wherein the user interface element comprises a full-screen window that also displays content updates received by the computing device via a network. 15. A computing device according to claim 9, wherein the application windows are not able to overlap per the windowing system, and wherein the computing device further comprises a window-containing window that contains application windows that are allowed to overlap, the window-containing window invocable by interaction with the user interface element and the window-containing window not being allowed to overlap with application windows not contained therein. 16. One or more computer storage devices storing information to enable a computing device to perform a process, the process comprising:
executing applications having respective application windows displayable by a windowing system executing on the computing device; displaying a first application window on a first display connected with the computing device and displaying a second application window on a second display connected with the computing device, each application window substantially fully occupying the display on which it is displayed; enabling a user to direct input to the first display to interact with the first application window while concurrently enabling the user to direct input to the second display to interact with the second application window; providing an application-list comprising a set of application representations that when displayed can be interacted with by the user to open application windows of respectively represented applications, the application-list able to be displayed, at any given time, responsive to user input, by either (i) only one display at a time or (ii) by both displays at a time; responsive to user input directed to an arbitrary one of the displays, displaying the application-list over either the first application window or the second application window, according to which one of the displays the user input is directed to; and responsive to further user input selecting one of the application representations: undisplaying the application-list and displaying a third application window corresponding to the selected application representation on the one of the displays while maintaining the displaying of the first or second application window on the display other than the one of the displays. 17. A storage device according to claim 16, wherein which application representations are included in the application-list is dynamically determined according to interactive openings or closings of application windows on the first display and on the second display. 18. A storage device according to claim 17, wherein the application representations represent applications recently used by the user but not currently displayed. 19. A storage device according to claim 16, wherein the further user input comprises a drag input that drags the selected application representation from the application-list and the process further comprises enabling the user to interactively drag the application representation to determine either which display will display the third application window or where on either display the third application window will be displayed. 20. A storage device according to claim 19, the process further comprising enabling, by the windowing system, interactive dragging of application windows between the first display and the second display. | Described herein are techniques for a computing device executing a windowing system that automatically maintains a tiled arrangement of application windows on a first display and on a second display. A user interface element has indicia of applications that can be used to open the applications. Responsive to a first user input the user interface element is displayed on the first display, and while the user interface element is displayed on the first display, the windowing system maintains two or more of the application windows in a tiled arrangement on the second display. The user interface element may be part of a system user interface and may be implemented in a variety of ways. For example, it may be a full-screen set of application representations, possibly user selected, or a list of recently used applications, or a list of open applications, etc.1. A method of managing windows for a computing device, the method comprising:
executing a windowing system that automatically maintains a tiled arrangement of application windows for applications executing on the computing device, the windowing system enabling tiled display of the application windows on a first display connected with the computing device and on a second display connected with the computing device, wherein when one or more application windows are displayed by the windowing system on either of the displays those application windows substantially fully occupy the displays on which they are displayed; executing an application launcher on the computing device, the application launcher comprising indicia of applications on the computing device, wherein responsive to a first user input the application launcher is displayed on the first display; and while the application launcher is displayed on the first display, maintaining, by the windowing system, two or more of the application windows in a tiled arrangement on the second display. 2. A method according to claim 1, further comprising, responsive to second user input, displaying the application launcher, an application switcher, or dashboard of information on the second display and concurrently maintaining tiled arrangement of one or more of the application windows in a tiled arrangement on the first display. 3. A method according to claim 1, wherein the application launcher at one time is able to be displayed on the first display and is able to be displayed on the second display, according to invoking user input. 4. A method according to claim 3, wherein the application launcher when displayed substantially fully occupies whichever of the displays that it is displayed on. 5. A method according to claim 1, wherein the application launcher comprises a plurality of graphics representing respective applications and when a graphic is selected a corresponding application is launched and a corresponding application window substantially fully occupies whichever display was displaying the application launcher when the graphic was selected. 6. A method according to claim 5, wherein when the application window is closed or moved to another display, the application launcher is again displayed on the same display. 7. A method according to claim 1, wherein the application launcher comprises a list of recently used applications, the application launcher is able to be displayed on both the first display and the second display, and is only able to be displayed on one display at a time. 8. A method according to claim 1, wherein neither display is managed as a main display but rather each display is equally capable of displaying the application launcher while the other display displays one or more application windows. 9. A computing device comprising a processor, storage, and a first display, the storage storing a windowing system that when executed by the processor displays application windows of applications executing by the processor, the computing device further comprising:
the windowing system, when executing, being capable of displaying application windows on the first display and on a second display when a second display is locally connected with the computing device, the windowing system further comprising a user interface element, wherein the windowing system displays application windows on either display such that when an application window is displayed on either display the application window either substantially fully occupies that display or the application window and any other application windows on that display substantially fully occupy that display; and the user interface element, which at one time is capable of being displayed on the first display and is capable of being displayed on the second display, being configured to respond to user interactions with the user interface element by displaying application windows on whichever display is currently displaying the user interface element. 10. A computing device according to claim 9, wherein the windowing system allows the user to direct input to both of the displays and allows the user to move application windows from one display to the other. 11. A computing device according to claim 9, wherein when the user interface element is being displayed on one display: the user is able to interact with any application windows displayed on the other display, the user is able to interact with the user interface element without disrupting display of any application windows displayed on the other display, and the user is able to interact with the user interface element to trigger the display of application windows. 12. A computing device according to claim 9, wherein when an application window is displayed responsive to a user interaction with the user interface element, the user interface element is undisplayed and the application window is displayed on the display where the user interface element was interacted with, the application window being displayed such that the application window substantially fully occupies the display where the user interface element was interacted with. 13. A computing device according to claim 9, wherein the user interface element comprises application icons for launching corresponding applications. 14. A computing device according to claim 13, wherein the user interface element comprises a full-screen window that also displays content updates received by the computing device via a network. 15. A computing device according to claim 9, wherein the application windows are not able to overlap per the windowing system, and wherein the computing device further comprises a window-containing window that contains application windows that are allowed to overlap, the window-containing window invocable by interaction with the user interface element and the window-containing window not being allowed to overlap with application windows not contained therein. 16. One or more computer storage devices storing information to enable a computing device to perform a process, the process comprising:
executing applications having respective application windows displayable by a windowing system executing on the computing device; displaying a first application window on a first display connected with the computing device and displaying a second application window on a second display connected with the computing device, each application window substantially fully occupying the display on which it is displayed; enabling a user to direct input to the first display to interact with the first application window while concurrently enabling the user to direct input to the second display to interact with the second application window; providing an application-list comprising a set of application representations that when displayed can be interacted with by the user to open application windows of respectively represented applications, the application-list able to be displayed, at any given time, responsive to user input, by either (i) only one display at a time or (ii) by both displays at a time; responsive to user input directed to an arbitrary one of the displays, displaying the application-list over either the first application window or the second application window, according to which one of the displays the user input is directed to; and responsive to further user input selecting one of the application representations: undisplaying the application-list and displaying a third application window corresponding to the selected application representation on the one of the displays while maintaining the displaying of the first or second application window on the display other than the one of the displays. 17. A storage device according to claim 16, wherein which application representations are included in the application-list is dynamically determined according to interactive openings or closings of application windows on the first display and on the second display. 18. A storage device according to claim 17, wherein the application representations represent applications recently used by the user but not currently displayed. 19. A storage device according to claim 16, wherein the further user input comprises a drag input that drags the selected application representation from the application-list and the process further comprises enabling the user to interactively drag the application representation to determine either which display will display the third application window or where on either display the third application window will be displayed. 20. A storage device according to claim 19, the process further comprising enabling, by the windowing system, interactive dragging of application windows between the first display and the second display. | 2,100 |
4,579 | 14,445,047 | 2,139 | A system and method for a solid state drive comprising a system controller and one or more extender devices coupled to the system controller is disclosed, where each extender device is coupled to a plurality of NAND storage devices and each NAND storage device comprising a plurality of NAND flash memory cells. | 1. A solid state drive, comprising:
a system controller; one or more extender devices coupled to the system controller, each extender device coupled to a plurality of NAND storage devices, and each NAND storage device comprising a plurality of NAND flash memory cells; wherein the system controller provides one or more signals to at least one of the extender devices for identification of the extender device. 2. The solid state drive of claim 1, wherein the drive comprises at least two extender devices that are connected in serial. 3. The solid state drive of claim 1, wherein the drive comprises at least two extender devices that are connected in parallel. 4. The solid state drive of claim 1, wherein each extender device provides one or more shared signals to a plurality of NAND storage devices and one or more non-shared signals to each of the plurality of NAND storage devices. 5. The solid state drive of claim 1, wherein the system controller provides one or more signals to a first extender device for identification of the first extender device, and the first extender device provides the one or more signals to a second extender device for identification of the second extender device. 6. The solid state drive of claim 1, wherein each extender device is connected to eight NAND storage devices. 7. The solid state drive of claim 4, the system controller provides the one or more shared signals to one or more of the extender devices. 8. A solid state drive, comprising:
a system controller; one or more extender devices coupled to the system controller, each extender device coupled to a plurality of NAND storage devices, and each NAND storage device comprising a plurality of NAND flash memory cells; and a spare extender device coupled to the system controller and coupled to a plurality of spare NAND storage devices, and each spare NAND storage device comprising a plurality of NAND flash memory cells, wherein a spare NAND storage device is utilized in place of a failed NAND storage device; 9. The solid state drive of claim 8, wherein the drive comprises at least two extender devices that are connected in serial. 10. The solid state drive of claim 8, wherein the drive comprises at least two extender devices that are connected in parallel. 11. The solid state drive of claim 8, wherein each extender device provides one or more shared signals to a plurality of NAND storage devices and one or more non-shared signals to each of the plurality of NAND storage devices. 12. The solid state drive of claim 8, wherein the system controller provides one or more signals to a first extender device for identification of the first extender device, and the first extender device provides the one or more signals to a second extender device for identification of the second extender device. 13. The solid state drive of claim 8, wherein each extender device is connected to eight NAND storage devices. 14. The solid state drive of claim 11, the system controller provides the shared signal to one or more of the extender devices. 15. The solid state drive of claim 8, wherein the storage controller provides a mapping from the failed NAND storage device to a spare NAND storage device. 16. A method of initializing a solid state drive comprising a system controller, one or more extender devices coupled to the system controller, each extender device coupled to a plurality of NAND storage devices, and each NAND storage device comprising a plurality of NAND flash memory cells, the method comprising:
performing an extender device initialization routine comprising:
sending one or more signals to the extender device; and
assigning a unique identification number to the extender device; and
repeating the performing step for all extender devices coupled to the system controller. 17. The method of claim 16, wherein the solid state drive comprises at least two extender devices that are connected in serial. 18. The method of claim 16, wherein the solid state drive comprises at least two extender devices that are connected in parallel. 19. The method of claim 16, further comprising:
an extender device providing one or more shared signals to a plurality of NAND storage devices and one or more non-shared signals to each of the plurality of NAND storage devices. 20. The method of claim 16, wherein each extender device is connected to eight NAND storage devices. 21. The method of claim 19, further comprising:
the system controller providing the shared signal to the extender device. | A system and method for a solid state drive comprising a system controller and one or more extender devices coupled to the system controller is disclosed, where each extender device is coupled to a plurality of NAND storage devices and each NAND storage device comprising a plurality of NAND flash memory cells.1. A solid state drive, comprising:
a system controller; one or more extender devices coupled to the system controller, each extender device coupled to a plurality of NAND storage devices, and each NAND storage device comprising a plurality of NAND flash memory cells; wherein the system controller provides one or more signals to at least one of the extender devices for identification of the extender device. 2. The solid state drive of claim 1, wherein the drive comprises at least two extender devices that are connected in serial. 3. The solid state drive of claim 1, wherein the drive comprises at least two extender devices that are connected in parallel. 4. The solid state drive of claim 1, wherein each extender device provides one or more shared signals to a plurality of NAND storage devices and one or more non-shared signals to each of the plurality of NAND storage devices. 5. The solid state drive of claim 1, wherein the system controller provides one or more signals to a first extender device for identification of the first extender device, and the first extender device provides the one or more signals to a second extender device for identification of the second extender device. 6. The solid state drive of claim 1, wherein each extender device is connected to eight NAND storage devices. 7. The solid state drive of claim 4, the system controller provides the one or more shared signals to one or more of the extender devices. 8. A solid state drive, comprising:
a system controller; one or more extender devices coupled to the system controller, each extender device coupled to a plurality of NAND storage devices, and each NAND storage device comprising a plurality of NAND flash memory cells; and a spare extender device coupled to the system controller and coupled to a plurality of spare NAND storage devices, and each spare NAND storage device comprising a plurality of NAND flash memory cells, wherein a spare NAND storage device is utilized in place of a failed NAND storage device; 9. The solid state drive of claim 8, wherein the drive comprises at least two extender devices that are connected in serial. 10. The solid state drive of claim 8, wherein the drive comprises at least two extender devices that are connected in parallel. 11. The solid state drive of claim 8, wherein each extender device provides one or more shared signals to a plurality of NAND storage devices and one or more non-shared signals to each of the plurality of NAND storage devices. 12. The solid state drive of claim 8, wherein the system controller provides one or more signals to a first extender device for identification of the first extender device, and the first extender device provides the one or more signals to a second extender device for identification of the second extender device. 13. The solid state drive of claim 8, wherein each extender device is connected to eight NAND storage devices. 14. The solid state drive of claim 11, the system controller provides the shared signal to one or more of the extender devices. 15. The solid state drive of claim 8, wherein the storage controller provides a mapping from the failed NAND storage device to a spare NAND storage device. 16. A method of initializing a solid state drive comprising a system controller, one or more extender devices coupled to the system controller, each extender device coupled to a plurality of NAND storage devices, and each NAND storage device comprising a plurality of NAND flash memory cells, the method comprising:
performing an extender device initialization routine comprising:
sending one or more signals to the extender device; and
assigning a unique identification number to the extender device; and
repeating the performing step for all extender devices coupled to the system controller. 17. The method of claim 16, wherein the solid state drive comprises at least two extender devices that are connected in serial. 18. The method of claim 16, wherein the solid state drive comprises at least two extender devices that are connected in parallel. 19. The method of claim 16, further comprising:
an extender device providing one or more shared signals to a plurality of NAND storage devices and one or more non-shared signals to each of the plurality of NAND storage devices. 20. The method of claim 16, wherein each extender device is connected to eight NAND storage devices. 21. The method of claim 19, further comprising:
the system controller providing the shared signal to the extender device. | 2,100 |
4,580 | 14,581,797 | 2,161 | Query conditions are received in a cache from a query optimizer of a Database Management System (DBMS). Dynamic statistics for the query conditions are maintained in the cache. Actual statistics are received in the cache after the query conditions are executed in the DBMS. Entropy-based estimated selectivity values for executing the query conditions are provided to the query optimizer to develop a query plan for executing queries having the query conditions. The entropy-based estimated selectivity values based, at least in part, on the dynamic statistics and the actual statistics. | 1. A method, comprising:
(a) receiving, in a cache, a query condition on a column of a table; (b) determining whether a selectivity value for the query condition exists in the cache; and (c) returning the selectivity value and a total number of rows for the table when the selectivity value exists in cache otherwise returning an entropy-based estimated selectivity value for the query condition and an entropy-based estimated total number of rows in the table. 2. The method of claim 1 further comprising:
(d) receiving, in a cache, statistics, after the query condition is executed against the column of the table, the statics are actual values obtained after the query condition is executed;
(e) determining whether to store the statistics, discard the statistics, or store some portion of the statistics in the cache; and
(f) using the statistics or the portion of the statistics and updating an entropy-based estimation procedure that produces the entropy-based estimated selectivity value and the entropy-based estimated total number of rows when the statistics or the portion of the statistics are stored in the cache. 3. The method of claim 2 further comprising, (g) repeating (a)-(f) for a new query condition on a new column of a new table. 4. The method of claim 3 further comprising, (h) maintaining a size of the cache to a predefined number of entries. 5. The method of claim 4 further comprising, (i) keeping most frequently accessed entries in the cache when some of the entries are removed to maintain the predefined number of entries. 6. The method of claim 5 further comprising, (j) updating the entropy-based estimation procedure when a total number of previous query conditions processed is less than two times the predefined number of entries for the cache. 7. The method of claim 6 further comprising, (k) updating the entropy-based estimation procedure when the total number of previous query conditions processed is greater than two times the predefined number of entries for the cache with a probability of the predefined number of entries divided by the total number of previous query conditions processed. 8. The method of claim 7 further comprising, (I) calculating, when the cache has the predefined number of entries, an importance factor for each entry in the cache and retaining entries with higher estimation of error rates in providing the corresponding entropy-based estimated selectivity value to reduce future estimation error rates. 9. The method of claim 1, wherein (a) further includes setting the entry-based estimated selectivity value to a predefined value when the query condition is a first query condition received in the cache. 10. The method of claim 1, wherein (a) further includes identifying the table as a foreign table external to a Database Management System that executes the query condition. 11. The method of claim 1, wherein (a) further includes receiving the query condition from a query optimizer that develops a query plan for executing a query having the query condition in a Database Management System (DBMS). 12. The method of claim 1, wherein (c) further includes providing the selectivity value and a total number of rows for the table or the entropy-based estimated selectivity value for the query condition and the entropy-based estimated total number of rows in the table to a query optimizer that executes in a Database Management System (DBMS). 13. A method, comprising:
receiving, in a cache, a query condition from a query optimizer; maintaining, in the cache, dynamic statistics necessary for providing the query optimizer with a selectivity value for the query optimizer to develop a query plan for a query associated with the query condition; using, in the cache, an entropy-based estimation procedure to resolve the selectivity value; and providing, from the cache, the selectivity value to the query optimizer. 14. The method of claim 13 further comprising, dynamically update the entropy-based estimation procedure as additional query conditions are processed. 15. The method of claim 13 further comprising, receiving actual statistics associated executing the query condition and dynamically updating the entropy-based estimation procedure based on the actual statistics. 16. The method of claim 13 further comprising, determining to dynamically evaluate all statistics and potentially dynamically updating the entropy-based estimation procedure based on a cache size relative to a total number of previously processed query conditions. 17. The method of claim 13 further comprising, dynamically calculating an estimation error rate for each entry in the cache when the cache is at capacity and retaining those entries with estimation error rates that exceed a predefined threshold as other entries are potentially removed to fee space in the cache. 18. The method of claim 17, wherein dynamically calculating further includes retaining, in cache, particular entries from the other entries that have a frequency of access in the cache that exceeds another predefined threshold. 19. The method of claim 13, wherein receiving further includes identifying the query condition as a condition against a single column of a table. 20. The method of claim 19, wherein identifying further includes recognizing the table as a foreign table that is external to a Database Management System (DBMS) that executes the query using the query plan provided from the query optimizer, the DBMS lacks foreign table statistics that can be provided to the query optimizer. 21. A system, comprising:
a processor; a cache memory; and a cache manager configured to: i) execute on the processor, ii) manage the cache memory, and iii) provide a query optimizer with an entropy-based estimated selectivity value for query conditions by using statistics retained in the cache memory and by using actual statistics received after the query conditions are executed. 22. The system of claim 21, wherein the system is integrated into a Database Management System (DBMS). | Query conditions are received in a cache from a query optimizer of a Database Management System (DBMS). Dynamic statistics for the query conditions are maintained in the cache. Actual statistics are received in the cache after the query conditions are executed in the DBMS. Entropy-based estimated selectivity values for executing the query conditions are provided to the query optimizer to develop a query plan for executing queries having the query conditions. The entropy-based estimated selectivity values based, at least in part, on the dynamic statistics and the actual statistics.1. A method, comprising:
(a) receiving, in a cache, a query condition on a column of a table; (b) determining whether a selectivity value for the query condition exists in the cache; and (c) returning the selectivity value and a total number of rows for the table when the selectivity value exists in cache otherwise returning an entropy-based estimated selectivity value for the query condition and an entropy-based estimated total number of rows in the table. 2. The method of claim 1 further comprising:
(d) receiving, in a cache, statistics, after the query condition is executed against the column of the table, the statics are actual values obtained after the query condition is executed;
(e) determining whether to store the statistics, discard the statistics, or store some portion of the statistics in the cache; and
(f) using the statistics or the portion of the statistics and updating an entropy-based estimation procedure that produces the entropy-based estimated selectivity value and the entropy-based estimated total number of rows when the statistics or the portion of the statistics are stored in the cache. 3. The method of claim 2 further comprising, (g) repeating (a)-(f) for a new query condition on a new column of a new table. 4. The method of claim 3 further comprising, (h) maintaining a size of the cache to a predefined number of entries. 5. The method of claim 4 further comprising, (i) keeping most frequently accessed entries in the cache when some of the entries are removed to maintain the predefined number of entries. 6. The method of claim 5 further comprising, (j) updating the entropy-based estimation procedure when a total number of previous query conditions processed is less than two times the predefined number of entries for the cache. 7. The method of claim 6 further comprising, (k) updating the entropy-based estimation procedure when the total number of previous query conditions processed is greater than two times the predefined number of entries for the cache with a probability of the predefined number of entries divided by the total number of previous query conditions processed. 8. The method of claim 7 further comprising, (I) calculating, when the cache has the predefined number of entries, an importance factor for each entry in the cache and retaining entries with higher estimation of error rates in providing the corresponding entropy-based estimated selectivity value to reduce future estimation error rates. 9. The method of claim 1, wherein (a) further includes setting the entry-based estimated selectivity value to a predefined value when the query condition is a first query condition received in the cache. 10. The method of claim 1, wherein (a) further includes identifying the table as a foreign table external to a Database Management System that executes the query condition. 11. The method of claim 1, wherein (a) further includes receiving the query condition from a query optimizer that develops a query plan for executing a query having the query condition in a Database Management System (DBMS). 12. The method of claim 1, wherein (c) further includes providing the selectivity value and a total number of rows for the table or the entropy-based estimated selectivity value for the query condition and the entropy-based estimated total number of rows in the table to a query optimizer that executes in a Database Management System (DBMS). 13. A method, comprising:
receiving, in a cache, a query condition from a query optimizer; maintaining, in the cache, dynamic statistics necessary for providing the query optimizer with a selectivity value for the query optimizer to develop a query plan for a query associated with the query condition; using, in the cache, an entropy-based estimation procedure to resolve the selectivity value; and providing, from the cache, the selectivity value to the query optimizer. 14. The method of claim 13 further comprising, dynamically update the entropy-based estimation procedure as additional query conditions are processed. 15. The method of claim 13 further comprising, receiving actual statistics associated executing the query condition and dynamically updating the entropy-based estimation procedure based on the actual statistics. 16. The method of claim 13 further comprising, determining to dynamically evaluate all statistics and potentially dynamically updating the entropy-based estimation procedure based on a cache size relative to a total number of previously processed query conditions. 17. The method of claim 13 further comprising, dynamically calculating an estimation error rate for each entry in the cache when the cache is at capacity and retaining those entries with estimation error rates that exceed a predefined threshold as other entries are potentially removed to fee space in the cache. 18. The method of claim 17, wherein dynamically calculating further includes retaining, in cache, particular entries from the other entries that have a frequency of access in the cache that exceeds another predefined threshold. 19. The method of claim 13, wherein receiving further includes identifying the query condition as a condition against a single column of a table. 20. The method of claim 19, wherein identifying further includes recognizing the table as a foreign table that is external to a Database Management System (DBMS) that executes the query using the query plan provided from the query optimizer, the DBMS lacks foreign table statistics that can be provided to the query optimizer. 21. A system, comprising:
a processor; a cache memory; and a cache manager configured to: i) execute on the processor, ii) manage the cache memory, and iii) provide a query optimizer with an entropy-based estimated selectivity value for query conditions by using statistics retained in the cache memory and by using actual statistics received after the query conditions are executed. 22. The system of claim 21, wherein the system is integrated into a Database Management System (DBMS). | 2,100 |
4,581 | 14,088,401 | 2,156 | A method for performing a comparison between first and second points in time snapshots of a file system entity, the method may include: (I) receiving by a storage system a command that was sent from a host computer, the command is network file system protocol compliant, wherein the command comprises (i) an operation code, and (ii) information about a virtual path, the virtual path that comprises (ii.a) first fields that comprise snapshot comparison parameters indicative of the first and second points in time snapshots of the file system entity, and (ii.b) a second field of a content that indicates that the command is a request to compare between the first and second points in time snapshots of the file system entity; (II) identifying, by a file system application hosted by the storage system and in response to the content of the second field of the virtual path, the command as including a request to compare between the first and second points in time snapshots of the file system entity; (III) comparing by the file system application the first and second points in time snapshots of the file system entity to provide a comparison result that is network file system protocol compliant; and (IV) sending by the storage system the comparison result to the host computer. | 1. A method for performing a comparison between first and second points in time snapshots of a file system entity, the method comprises:
receiving by a storage system a command that was sent from a host computer, the command is network file system protocol compliant, wherein the command comprises (i) an operation code, and (ii) information about a virtual path, the virtual path that comprises (ii.a) first fields that comprise snapshot comparison parameters indicative of the first and second points in time snapshots of the file system entity, and (ii.b) a second field of a content that indicates that the command is a request to compare between the first and second points in time snapshots of the file system entity; identifying, by a file system application hosted by the storage system and in response to the content of the second field of the virtual path, the command as including a request to compare between the first and second points in time snapshots of the file system entity; comparing by the file system application the first and second points in time snapshots of the file system entity to provide a comparison result that is network file system protocol compliant; and sending by the storage system the comparison result to the host computer. 2. The method according to claim 1 wherein the network file protocol does not comprise a snapshot comparison operation code for requesting a comparison between different points in time snapshots of the file system entity. 3. The method according to claim 1 comprising ignoring the operation code of the command. 4. The method according to claim 1 wherein the comparison result embeds a text file. 5. The method according to claim 1 wherein the file system entity is the file system. 6. The method according to claim 1 wherein the file system entity is a directory of the file system. 7. The method according to claim 1 comprising receiving by the storage system multiple commands that were sent from the host computer, each of the multiple commands is network file system protocol compliant, wherein each of the multiple commands comprises an operation code, and wherein the information about the virtual path is distributed between the multiple commands. 8. A non-transitory computer readable medium that stores instructions that once executed by the computer cause the computer of a storage system to execute the stages of:
receiving a command that was sent from a host computer to a storage system, the command is network file system protocol compliant, wherein command comprises (i) an operational code, and (ii) information about a virtual path that comprises (ii.a) first fields that comprise snapshot comparison parameters indicative of the first and second points in time snapshots of the file system entity, and (ii.b) a second field of a content that indicates that the command is a request to compare between the first and second points in time snapshots of the file system entity; identifying, in response to the content of the second field of the virtual path, the command as including a request to compare between the first and second points in time snapshots of the file system entity; comparing by the file system application the first and second points in time snapshots of the file system entity to provide a comparison result that is network file system protocol compliant; and sending the comparison result to the user device. 9. The non-transitory computer readable medium according to claim 8 wherein the network file protocol does not comprise a snapshot comparison operation code for requesting a comparison between different points in time snapshots of the file system entity. 10. The non-transitory computer readable medium according to claim 8 that stores instructions for ignoring the operation code of the command. 11. The non-transitory computer readable medium according to claim 8 wherein the comparison result is embeds a text file. 12. The non-transitory computer readable medium according to claim 8 wherein the file system entity is the file system. 13. The non-transitory computer readable medium according to claim 8 wherein the file system entity is a directory of the file system. 14. The non-transitory computer readable medium according to claim 8 that stores instructions for receiving by the storage system multiple commands that were sent from the host computer, each of the multiple commands is network file system protocol compliant, wherein each of the multiple commands comprises an operation code, and wherein the information about the virtual path is distributed between the multiple commands. 15. A storage system that comprises:
a file system interface that is arranged to receive a command that was sent from a host computer to a storage system, the command is network file system protocol compliant, wherein command comprises (i) an operational code, and (ii) information about a virtual path that comprises (ii.a) first fields that comprise snapshot comparison parameters indicative of the first and second points in time snapshots of the file system entity, and (ii.b) a second field of a content that indicates that the command is a request to compare between the first and second points in time snapshots of the file system entity; and a computer that is arranged to:
identify, in response to the content of the second field of the virtual path, the command as including a request to compare between the first and second points in time snapshots of the file system entity;
compare the first and second points in time snapshots of the file system entity to provide a comparison result that is network file system protocol compliant; and
wherein the file system interface is further arranged to send the comparison result to the user device. 16. The storage system according to claim 15 wherein the network file protocol does not comprise a snapshot comparison operation code for requesting a comparison between different points in time snapshots of the file system entity. 17. The storage system according to claim 15 that stores instructions for ignoring the operation code of the command. 18. The storage system according to claim 15 wherein the comparison result embeds a text file. 19. The storage system according to claim 15 wherein the file system entity is the file system. 20. The storage system according to claim 15 wherein the file system entity is a directory of the file system. 21. The storage system according to claim 15 wherein the file system interface may be arranged to receive multiple commands that were sent from the host computer, each of the multiple commands is network file system protocol compliant, wherein each of the multiple commands comprises an operation code, and wherein the information about the virtual path is distributed between the multiple commands. | A method for performing a comparison between first and second points in time snapshots of a file system entity, the method may include: (I) receiving by a storage system a command that was sent from a host computer, the command is network file system protocol compliant, wherein the command comprises (i) an operation code, and (ii) information about a virtual path, the virtual path that comprises (ii.a) first fields that comprise snapshot comparison parameters indicative of the first and second points in time snapshots of the file system entity, and (ii.b) a second field of a content that indicates that the command is a request to compare between the first and second points in time snapshots of the file system entity; (II) identifying, by a file system application hosted by the storage system and in response to the content of the second field of the virtual path, the command as including a request to compare between the first and second points in time snapshots of the file system entity; (III) comparing by the file system application the first and second points in time snapshots of the file system entity to provide a comparison result that is network file system protocol compliant; and (IV) sending by the storage system the comparison result to the host computer.1. A method for performing a comparison between first and second points in time snapshots of a file system entity, the method comprises:
receiving by a storage system a command that was sent from a host computer, the command is network file system protocol compliant, wherein the command comprises (i) an operation code, and (ii) information about a virtual path, the virtual path that comprises (ii.a) first fields that comprise snapshot comparison parameters indicative of the first and second points in time snapshots of the file system entity, and (ii.b) a second field of a content that indicates that the command is a request to compare between the first and second points in time snapshots of the file system entity; identifying, by a file system application hosted by the storage system and in response to the content of the second field of the virtual path, the command as including a request to compare between the first and second points in time snapshots of the file system entity; comparing by the file system application the first and second points in time snapshots of the file system entity to provide a comparison result that is network file system protocol compliant; and sending by the storage system the comparison result to the host computer. 2. The method according to claim 1 wherein the network file protocol does not comprise a snapshot comparison operation code for requesting a comparison between different points in time snapshots of the file system entity. 3. The method according to claim 1 comprising ignoring the operation code of the command. 4. The method according to claim 1 wherein the comparison result embeds a text file. 5. The method according to claim 1 wherein the file system entity is the file system. 6. The method according to claim 1 wherein the file system entity is a directory of the file system. 7. The method according to claim 1 comprising receiving by the storage system multiple commands that were sent from the host computer, each of the multiple commands is network file system protocol compliant, wherein each of the multiple commands comprises an operation code, and wherein the information about the virtual path is distributed between the multiple commands. 8. A non-transitory computer readable medium that stores instructions that once executed by the computer cause the computer of a storage system to execute the stages of:
receiving a command that was sent from a host computer to a storage system, the command is network file system protocol compliant, wherein command comprises (i) an operational code, and (ii) information about a virtual path that comprises (ii.a) first fields that comprise snapshot comparison parameters indicative of the first and second points in time snapshots of the file system entity, and (ii.b) a second field of a content that indicates that the command is a request to compare between the first and second points in time snapshots of the file system entity; identifying, in response to the content of the second field of the virtual path, the command as including a request to compare between the first and second points in time snapshots of the file system entity; comparing by the file system application the first and second points in time snapshots of the file system entity to provide a comparison result that is network file system protocol compliant; and sending the comparison result to the user device. 9. The non-transitory computer readable medium according to claim 8 wherein the network file protocol does not comprise a snapshot comparison operation code for requesting a comparison between different points in time snapshots of the file system entity. 10. The non-transitory computer readable medium according to claim 8 that stores instructions for ignoring the operation code of the command. 11. The non-transitory computer readable medium according to claim 8 wherein the comparison result is embeds a text file. 12. The non-transitory computer readable medium according to claim 8 wherein the file system entity is the file system. 13. The non-transitory computer readable medium according to claim 8 wherein the file system entity is a directory of the file system. 14. The non-transitory computer readable medium according to claim 8 that stores instructions for receiving by the storage system multiple commands that were sent from the host computer, each of the multiple commands is network file system protocol compliant, wherein each of the multiple commands comprises an operation code, and wherein the information about the virtual path is distributed between the multiple commands. 15. A storage system that comprises:
a file system interface that is arranged to receive a command that was sent from a host computer to a storage system, the command is network file system protocol compliant, wherein command comprises (i) an operational code, and (ii) information about a virtual path that comprises (ii.a) first fields that comprise snapshot comparison parameters indicative of the first and second points in time snapshots of the file system entity, and (ii.b) a second field of a content that indicates that the command is a request to compare between the first and second points in time snapshots of the file system entity; and a computer that is arranged to:
identify, in response to the content of the second field of the virtual path, the command as including a request to compare between the first and second points in time snapshots of the file system entity;
compare the first and second points in time snapshots of the file system entity to provide a comparison result that is network file system protocol compliant; and
wherein the file system interface is further arranged to send the comparison result to the user device. 16. The storage system according to claim 15 wherein the network file protocol does not comprise a snapshot comparison operation code for requesting a comparison between different points in time snapshots of the file system entity. 17. The storage system according to claim 15 that stores instructions for ignoring the operation code of the command. 18. The storage system according to claim 15 wherein the comparison result embeds a text file. 19. The storage system according to claim 15 wherein the file system entity is the file system. 20. The storage system according to claim 15 wherein the file system entity is a directory of the file system. 21. The storage system according to claim 15 wherein the file system interface may be arranged to receive multiple commands that were sent from the host computer, each of the multiple commands is network file system protocol compliant, wherein each of the multiple commands comprises an operation code, and wherein the information about the virtual path is distributed between the multiple commands. | 2,100 |
4,582 | 13,829,001 | 2,116 | This working apparatus for a component or a board includes a head unit and a control portion. The control portion performs control of calculating a rotation angle in a horizontal plane of the head unit from displacement of the center of a first imaging portion and displacement of the center of a second imaging portion and correcting the center position of a working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion due to the rotation angle, a first amount of displacement in a first direction in the horizontal plane being not induced by rotation of the center of the working mechanism portion, and a second amount of displacement in a second direction in the horizontal plane being not induced by the rotation of the center of the working mechanism portion when moving the head unit. | 1. A working apparatus for a component or a board, comprising:
a head unit including a first imaging portion, a second imaging portion, and a working mechanism portion arranged at a position other than on a straight line passing through a center of the first imaging portion and a center of the second imaging portion in a plan view; and a control portion performing control of moving the head unit in a horizontal plane, wherein the control portion is configured to perform control of calculating a rotation angle in the horizontal plane of the head unit from displacement of the center of the first imaging portion and displacement of the center of the second imaging portion and correcting a center position of the working mechanism portion on the basis of an amount of rotation-induced displacement of a center of the working mechanism portion due to the rotation angle, a first amount of displacement in a first direction in the horizontal plane being not induced by rotation of the center of the working mechanism portion, and a second amount of displacement in a second direction orthogonal to the first direction in the horizontal plane being not induced by the rotation of the center of the working mechanism portion when moving the head unit. 2. The working apparatus for a component or a board according to claim 1, wherein
the control portion is configured to perform control of correcting the center position of the working mechanism portion and moving the head unit on the basis of the rotation angle in the horizontal plane of the head unit, the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion, when an operation on the component or the board is performed with the head unit. 3. The working apparatus for a component or a board according to claim 2, wherein
the control portion is configured to perform control of correcting the center position of the working mechanism portion and moving the head unit on the basis of the rotation angle in the horizontal plane of the head unit, the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion, each time a single operation on the individual component or the individual board is performed. 4. The working apparatus for a component or a board according to claim 2, wherein
the control portion is configured to perform arithmetic processing for correcting the center position of the working mechanism portion and perform control of moving the head unit on the basis of the rotation angle in the horizontal plane of the head unit, the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion. 5. The working apparatus for a component or a board according to claim 1, wherein
the amount of rotation-induced displacement includes: a first amount of rotation-induced displacement in the first direction of the center position of the working mechanism portion based on the rotation angle and distances in the first and second directions from the center position of the working mechanism portion to a center position of the first imaging portion or the second imaging portion, and a second amount of rotation-induced displacement in the second direction of the center position of the working mechanism portion based on the rotation angle and the distances in the first and second directions from the center position of the working mechanism portion to the center position of the first imaging portion or the second imaging portion, and the control portion is configured to perform control of correcting the center position of the working mechanism portion on the basis of a first correction amount in the first direction of the center position of the working mechanism portion based on the first amount of rotation-induced displacement and the first amount of displacement and a second correction amount in the second direction of the center position of the working mechanism portion based on the second amount of rotation-induced displacement and the second amount of displacement. 6. The working apparatus for a component or a board according to claim 5, wherein
the first correction amount is a sum of the first amount of rotation-induced displacement and the first amount of displacement, and the second correction amount is a sum of the second amount of rotation-induced displacement and the second amount of displacement. 7. The working apparatus for a component or a board according to claim 5, wherein
the control portion is configured to perform control of moving the center position of the working mechanism portion to position coordinates obtained by subtracting the first correction amount in the first direction and the second correction amount in the second direction from theoretical position coordinates of the center position of the working mechanism portion, respectively, when moving the head unit. 8. The working apparatus for a component or a board according to claim 1, further comprising a correction table to which the control portion refers for an amount of displacement of actual position coordinates of the center of the first imaging portion with respect to theoretical position coordinates of the center of the first imaging portion and an amount of displacement of actual position coordinates of the center of the second imaging portion with respect to theoretical position coordinates of the center of the second imaging portion when moving the head unit in the horizontal plane, wherein
the control portion is configured to perform control of calculating the rotation angle in the horizontal plane of the head unit from the displacement of the center of the first imaging portion and the displacement of the center of the second imaging portion grasped on the basis of the correction table and correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion due to the rotation angle, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion when moving the head unit. 9. The working apparatus for a component or a board according to claim 8, wherein
the correction table includes a first correction table in which the amount of displacement of the actual position coordinates of the center of the first imaging portion with respect to the theoretical position coordinates of the center of the first imaging portion is defined and a second correction table in which the amount of displacement of the actual position coordinates of the center of the second imaging portion with respect to the theoretical position coordinates of the center of the second imaging portion is defined, and the amount of rotation-induced displacement is calculated with the first correction table and the second correction table while the first amount of displacement and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion are calculated with the first correction table or the second correction table. 10. The working apparatus for a component or a board according to claim 1, further comprising a moving mechanism portion so configured that the head unit is movable in the horizontal plane, wherein
the control portion is configured to perform control of calculating the rotation angle in the horizontal plane of the head unit from the displacement of the center of the first imaging portion and the displacement of the center of the second imaging portion resulting from distortion of the moving mechanism portion and correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion due to the rotation angle, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion when moving the head unit by the moving mechanism portion. 11. The working apparatus for a component or a board according to claim 10, wherein
the moving mechanism portion includes a rail member extending in the first direction to move the head unit along the first direction, and the control portion is configured to perform control of calculating the rotation angle in the horizontal plane of the head unit from the displacement of the center of the first imaging portion and the displacement of the center of the second imaging portion resulting from deformation of the rail member in the second direction and correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion due to the rotation angle, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion when moving the head unit. 12. The working apparatus for a component or a board according to claim 1, wherein
a plurality of the working mechanism portions are provided on the head unit, and the control portion is configured to perform control of calculating the rotation angle in the horizontal plane of the head unit from the displacement of the center of the first imaging portion and the displacement of the center of the second imaging portion for each of the plurality of working mechanism portions and individually correcting each of center positions of the working mechanism portions on the basis of the amount of rotation-induced displacement of each of centers of the working mechanism portions due to the rotation angle, the first amount of displacement being not induced by the rotation of each of the centers of the working mechanism portions, and the second amount of displacement being not induced by the rotation of each of the centers of the working mechanism portions when moving the head unit. 13. The working apparatus for a component or a board according to claim 1, wherein
the head unit is configured to be movable along the first direction, the first imaging portion and the second imaging portion are arranged at positions aligned in the first direction, the first amount of displacement and the second amount of displacement of the working mechanism portion each include a first component based on displacement of a center position of the first imaging portion or the second imaging portion from theoretical position coordinates of the center position of the first imaging portion or the second imaging portion, and the control portion is configured to perform control of correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion, the rotation angle in the horizontal plane of the head unit, the first amount of displacement including the first component, being not induced by the rotation, and the second amount of displacement including the first component, being not induced by the rotation. 14. The working apparatus for a component or a board according to claim 1, wherein
the head unit is configured to be movable along the first direction, the second imaging portion is arranged at a different position in the second direction with respect to the first imaging portion, the first amount of displacement and the second amount of displacement of the working mechanism portion each include a second component based on positional displacement of the second imaging portion along the second direction with respect to the first imaging portion in addition to the first component based on the displacement of a center position of the first imaging portion or the second imaging portion from the theoretical position coordinates of the center position of the first imaging portion or the second imaging portion, and the control portion is configured to perform control of correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion, the rotation angle in the horizontal plane of the head unit, the first amount of displacement including the first and second components, being not induced by the rotation, and the second amount of displacement including the first and second components, being not induced by the rotation. 15. The working apparatus for a component or a board according to claim 1, wherein
the head unit further includes a slide guide portion provided to be movable along the first direction and guiding movement of the head unit in the first direction, a center position of the slide guide portion rotationally displaced along with rotation of a center position of the first imaging portion or the second imaging portion is grasped on the basis of the rotation angle and positional relation between the slide guide portion and the first imaging portion or the second imaging portion, and the amount of rotation-induced displacement is calculated on the basis of the rotation angle and positional relation between the grasped center position of the slide guide portion and the center position of the working mechanism portion, and the control portion is configured to perform control of correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation, and the second amount of displacement being not induced by the rotation. 16. A component mounting apparatus comprising:
a head unit including a first imaging portion, a second imaging portion, and a suction nozzle arranged at a position other than on a straight line passing through a center of the first imaging portion and a center of the second imaging portion in a plan view; and a control portion performing control of moving the head unit in a horizontal plane, wherein the control portion is configured to perform control of calculating a rotation angle in the horizontal plane of the head unit from displacement of the center of the first imaging portion and displacement of the center of the second imaging portion and correcting a center position of the suction nozzle on the basis of an amount of rotation-induced displacement of a center of the suction nozzle due to the rotation angle, a first amount of displacement in a first direction in the horizontal plane being not induced by rotation of the center of the suction nozzle, and a second amount of displacement in a second direction orthogonal to the first direction in the horizontal plane being not induced by the rotation of the center of the suction nozzle when moving the head unit. 17. The component mounting apparatus according to claim 16, wherein
the control portion is configured to perform control of correcting the center position of the suction nozzle and moving the head unit on the basis of the rotation angle in the horizontal plane of the head unit, the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation of the center of the suction nozzle, and the second amount of displacement being not induced by the rotation of the center of the suction nozzle, when a component mounting operation is performed with the head unit. 18. The component mounting apparatus according to claim 16, wherein
the amount of rotation-induced displacement includes: a first amount of rotation-induced displacement in the first direction of the center position of the suction nozzle based on the rotation angle and distances in the first and second directions from the center position of the suction nozzle to a center position of the first imaging portion or the second imaging portion, and a second amount of rotation-induced displacement in the second direction of the center position of the suction nozzle based on the rotation angle and the distances in the first and second directions from the center position of the suction nozzle to the center position of the first imaging portion or the second imaging portion, and the control portion is configured to perform control of correcting the center position of the suction nozzle on the basis of a first correction amount in the first direction of the center position of the suction nozzle based on the first amount of rotation-induced displacement and the first amount of displacement and a second correction amount in the second direction of the center position of the suction nozzle based on the second amount of rotation-induced displacement and the second amount of displacement. 19. The component mounting apparatus according to claim 16, wherein
the head unit is configured to be movable along the first direction, the second imaging portion is arranged at a different position in the second direction with respect to the first imaging portion, the first amount of displacement and the second amount of displacement of the suction nozzle each include a second component based on positional displacement of the second imaging portion along the second direction with respect to the first imaging portion in addition to a first component based on displacement of a center position of the first imaging portion or the second imaging portion from theoretical position coordinates of the center position of the first imaging portion or the second imaging portion, and the control portion is configured to perform control of correcting the center position of the suction nozzle on the basis of the amount of rotation-induced displacement of the center of the suction nozzle, the rotation angle in the horizontal plane of the head unit, the first amount of displacement including the first and second components, being not induced by the rotation, and the second amount of displacement including the first and second components, being not induced by the rotation. 20. The component mounting apparatus according to claim 16, wherein
the head unit further includes a slide guide portion provided to be movable along the first direction and guiding movement of the head unit in the first direction, a center position of the slide guide portion rotationally displaced along with rotation of a center position of the first imaging portion or the second imaging portion is grasped on the basis of the rotation angle and positional relation between the slide guide portion and the first imaging portion or the second imaging portion, and the amount of rotation-induced displacement is calculated on the basis of the rotation angle and positional relation between the grasped center position of the slide guide portion and the center position of the suction nozzle, and the control portion is configured to perform control of correcting the center position of the suction nozzle on the basis of the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation, and the second amount of displacement being not induced by the rotation. | This working apparatus for a component or a board includes a head unit and a control portion. The control portion performs control of calculating a rotation angle in a horizontal plane of the head unit from displacement of the center of a first imaging portion and displacement of the center of a second imaging portion and correcting the center position of a working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion due to the rotation angle, a first amount of displacement in a first direction in the horizontal plane being not induced by rotation of the center of the working mechanism portion, and a second amount of displacement in a second direction in the horizontal plane being not induced by the rotation of the center of the working mechanism portion when moving the head unit.1. A working apparatus for a component or a board, comprising:
a head unit including a first imaging portion, a second imaging portion, and a working mechanism portion arranged at a position other than on a straight line passing through a center of the first imaging portion and a center of the second imaging portion in a plan view; and a control portion performing control of moving the head unit in a horizontal plane, wherein the control portion is configured to perform control of calculating a rotation angle in the horizontal plane of the head unit from displacement of the center of the first imaging portion and displacement of the center of the second imaging portion and correcting a center position of the working mechanism portion on the basis of an amount of rotation-induced displacement of a center of the working mechanism portion due to the rotation angle, a first amount of displacement in a first direction in the horizontal plane being not induced by rotation of the center of the working mechanism portion, and a second amount of displacement in a second direction orthogonal to the first direction in the horizontal plane being not induced by the rotation of the center of the working mechanism portion when moving the head unit. 2. The working apparatus for a component or a board according to claim 1, wherein
the control portion is configured to perform control of correcting the center position of the working mechanism portion and moving the head unit on the basis of the rotation angle in the horizontal plane of the head unit, the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion, when an operation on the component or the board is performed with the head unit. 3. The working apparatus for a component or a board according to claim 2, wherein
the control portion is configured to perform control of correcting the center position of the working mechanism portion and moving the head unit on the basis of the rotation angle in the horizontal plane of the head unit, the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion, each time a single operation on the individual component or the individual board is performed. 4. The working apparatus for a component or a board according to claim 2, wherein
the control portion is configured to perform arithmetic processing for correcting the center position of the working mechanism portion and perform control of moving the head unit on the basis of the rotation angle in the horizontal plane of the head unit, the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion. 5. The working apparatus for a component or a board according to claim 1, wherein
the amount of rotation-induced displacement includes: a first amount of rotation-induced displacement in the first direction of the center position of the working mechanism portion based on the rotation angle and distances in the first and second directions from the center position of the working mechanism portion to a center position of the first imaging portion or the second imaging portion, and a second amount of rotation-induced displacement in the second direction of the center position of the working mechanism portion based on the rotation angle and the distances in the first and second directions from the center position of the working mechanism portion to the center position of the first imaging portion or the second imaging portion, and the control portion is configured to perform control of correcting the center position of the working mechanism portion on the basis of a first correction amount in the first direction of the center position of the working mechanism portion based on the first amount of rotation-induced displacement and the first amount of displacement and a second correction amount in the second direction of the center position of the working mechanism portion based on the second amount of rotation-induced displacement and the second amount of displacement. 6. The working apparatus for a component or a board according to claim 5, wherein
the first correction amount is a sum of the first amount of rotation-induced displacement and the first amount of displacement, and the second correction amount is a sum of the second amount of rotation-induced displacement and the second amount of displacement. 7. The working apparatus for a component or a board according to claim 5, wherein
the control portion is configured to perform control of moving the center position of the working mechanism portion to position coordinates obtained by subtracting the first correction amount in the first direction and the second correction amount in the second direction from theoretical position coordinates of the center position of the working mechanism portion, respectively, when moving the head unit. 8. The working apparatus for a component or a board according to claim 1, further comprising a correction table to which the control portion refers for an amount of displacement of actual position coordinates of the center of the first imaging portion with respect to theoretical position coordinates of the center of the first imaging portion and an amount of displacement of actual position coordinates of the center of the second imaging portion with respect to theoretical position coordinates of the center of the second imaging portion when moving the head unit in the horizontal plane, wherein
the control portion is configured to perform control of calculating the rotation angle in the horizontal plane of the head unit from the displacement of the center of the first imaging portion and the displacement of the center of the second imaging portion grasped on the basis of the correction table and correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion due to the rotation angle, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion when moving the head unit. 9. The working apparatus for a component or a board according to claim 8, wherein
the correction table includes a first correction table in which the amount of displacement of the actual position coordinates of the center of the first imaging portion with respect to the theoretical position coordinates of the center of the first imaging portion is defined and a second correction table in which the amount of displacement of the actual position coordinates of the center of the second imaging portion with respect to the theoretical position coordinates of the center of the second imaging portion is defined, and the amount of rotation-induced displacement is calculated with the first correction table and the second correction table while the first amount of displacement and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion are calculated with the first correction table or the second correction table. 10. The working apparatus for a component or a board according to claim 1, further comprising a moving mechanism portion so configured that the head unit is movable in the horizontal plane, wherein
the control portion is configured to perform control of calculating the rotation angle in the horizontal plane of the head unit from the displacement of the center of the first imaging portion and the displacement of the center of the second imaging portion resulting from distortion of the moving mechanism portion and correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion due to the rotation angle, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion when moving the head unit by the moving mechanism portion. 11. The working apparatus for a component or a board according to claim 10, wherein
the moving mechanism portion includes a rail member extending in the first direction to move the head unit along the first direction, and the control portion is configured to perform control of calculating the rotation angle in the horizontal plane of the head unit from the displacement of the center of the first imaging portion and the displacement of the center of the second imaging portion resulting from deformation of the rail member in the second direction and correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion due to the rotation angle, the first amount of displacement being not induced by the rotation of the center of the working mechanism portion, and the second amount of displacement being not induced by the rotation of the center of the working mechanism portion when moving the head unit. 12. The working apparatus for a component or a board according to claim 1, wherein
a plurality of the working mechanism portions are provided on the head unit, and the control portion is configured to perform control of calculating the rotation angle in the horizontal plane of the head unit from the displacement of the center of the first imaging portion and the displacement of the center of the second imaging portion for each of the plurality of working mechanism portions and individually correcting each of center positions of the working mechanism portions on the basis of the amount of rotation-induced displacement of each of centers of the working mechanism portions due to the rotation angle, the first amount of displacement being not induced by the rotation of each of the centers of the working mechanism portions, and the second amount of displacement being not induced by the rotation of each of the centers of the working mechanism portions when moving the head unit. 13. The working apparatus for a component or a board according to claim 1, wherein
the head unit is configured to be movable along the first direction, the first imaging portion and the second imaging portion are arranged at positions aligned in the first direction, the first amount of displacement and the second amount of displacement of the working mechanism portion each include a first component based on displacement of a center position of the first imaging portion or the second imaging portion from theoretical position coordinates of the center position of the first imaging portion or the second imaging portion, and the control portion is configured to perform control of correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion, the rotation angle in the horizontal plane of the head unit, the first amount of displacement including the first component, being not induced by the rotation, and the second amount of displacement including the first component, being not induced by the rotation. 14. The working apparatus for a component or a board according to claim 1, wherein
the head unit is configured to be movable along the first direction, the second imaging portion is arranged at a different position in the second direction with respect to the first imaging portion, the first amount of displacement and the second amount of displacement of the working mechanism portion each include a second component based on positional displacement of the second imaging portion along the second direction with respect to the first imaging portion in addition to the first component based on the displacement of a center position of the first imaging portion or the second imaging portion from the theoretical position coordinates of the center position of the first imaging portion or the second imaging portion, and the control portion is configured to perform control of correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement of the center of the working mechanism portion, the rotation angle in the horizontal plane of the head unit, the first amount of displacement including the first and second components, being not induced by the rotation, and the second amount of displacement including the first and second components, being not induced by the rotation. 15. The working apparatus for a component or a board according to claim 1, wherein
the head unit further includes a slide guide portion provided to be movable along the first direction and guiding movement of the head unit in the first direction, a center position of the slide guide portion rotationally displaced along with rotation of a center position of the first imaging portion or the second imaging portion is grasped on the basis of the rotation angle and positional relation between the slide guide portion and the first imaging portion or the second imaging portion, and the amount of rotation-induced displacement is calculated on the basis of the rotation angle and positional relation between the grasped center position of the slide guide portion and the center position of the working mechanism portion, and the control portion is configured to perform control of correcting the center position of the working mechanism portion on the basis of the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation, and the second amount of displacement being not induced by the rotation. 16. A component mounting apparatus comprising:
a head unit including a first imaging portion, a second imaging portion, and a suction nozzle arranged at a position other than on a straight line passing through a center of the first imaging portion and a center of the second imaging portion in a plan view; and a control portion performing control of moving the head unit in a horizontal plane, wherein the control portion is configured to perform control of calculating a rotation angle in the horizontal plane of the head unit from displacement of the center of the first imaging portion and displacement of the center of the second imaging portion and correcting a center position of the suction nozzle on the basis of an amount of rotation-induced displacement of a center of the suction nozzle due to the rotation angle, a first amount of displacement in a first direction in the horizontal plane being not induced by rotation of the center of the suction nozzle, and a second amount of displacement in a second direction orthogonal to the first direction in the horizontal plane being not induced by the rotation of the center of the suction nozzle when moving the head unit. 17. The component mounting apparatus according to claim 16, wherein
the control portion is configured to perform control of correcting the center position of the suction nozzle and moving the head unit on the basis of the rotation angle in the horizontal plane of the head unit, the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation of the center of the suction nozzle, and the second amount of displacement being not induced by the rotation of the center of the suction nozzle, when a component mounting operation is performed with the head unit. 18. The component mounting apparatus according to claim 16, wherein
the amount of rotation-induced displacement includes: a first amount of rotation-induced displacement in the first direction of the center position of the suction nozzle based on the rotation angle and distances in the first and second directions from the center position of the suction nozzle to a center position of the first imaging portion or the second imaging portion, and a second amount of rotation-induced displacement in the second direction of the center position of the suction nozzle based on the rotation angle and the distances in the first and second directions from the center position of the suction nozzle to the center position of the first imaging portion or the second imaging portion, and the control portion is configured to perform control of correcting the center position of the suction nozzle on the basis of a first correction amount in the first direction of the center position of the suction nozzle based on the first amount of rotation-induced displacement and the first amount of displacement and a second correction amount in the second direction of the center position of the suction nozzle based on the second amount of rotation-induced displacement and the second amount of displacement. 19. The component mounting apparatus according to claim 16, wherein
the head unit is configured to be movable along the first direction, the second imaging portion is arranged at a different position in the second direction with respect to the first imaging portion, the first amount of displacement and the second amount of displacement of the suction nozzle each include a second component based on positional displacement of the second imaging portion along the second direction with respect to the first imaging portion in addition to a first component based on displacement of a center position of the first imaging portion or the second imaging portion from theoretical position coordinates of the center position of the first imaging portion or the second imaging portion, and the control portion is configured to perform control of correcting the center position of the suction nozzle on the basis of the amount of rotation-induced displacement of the center of the suction nozzle, the rotation angle in the horizontal plane of the head unit, the first amount of displacement including the first and second components, being not induced by the rotation, and the second amount of displacement including the first and second components, being not induced by the rotation. 20. The component mounting apparatus according to claim 16, wherein
the head unit further includes a slide guide portion provided to be movable along the first direction and guiding movement of the head unit in the first direction, a center position of the slide guide portion rotationally displaced along with rotation of a center position of the first imaging portion or the second imaging portion is grasped on the basis of the rotation angle and positional relation between the slide guide portion and the first imaging portion or the second imaging portion, and the amount of rotation-induced displacement is calculated on the basis of the rotation angle and positional relation between the grasped center position of the slide guide portion and the center position of the suction nozzle, and the control portion is configured to perform control of correcting the center position of the suction nozzle on the basis of the amount of rotation-induced displacement, the first amount of displacement being not induced by the rotation, and the second amount of displacement being not induced by the rotation. | 2,100 |
4,583 | 13,734,168 | 2,144 | A translation management system in a computer environment. A preferred embodiment of the invention automatically detects when a document, data stream, or non-text file in the master language has been updated and notifies the user which corresponding documents, data streams, or non-text files in the other languages require translation which are then staged and dynamically routed and sequenced to individual translation resources where the actual translation is performed. Management status, reporting, scheduling, and accounting information is sent to the user as the translation process ensues. The user is notified of the completion of translation and the invention coordinates the delivery of the translated documents, data streams, or non-text files back to the user's site for installation and optional review. The invention makes a variety of translation resources instantly available to the user which include both automated translation tools as well as human translators. The translation resources are connected to the invention using a flexible architecture that can be deployed on intranets as well as the Internet. | 1.-10. (canceled) 11. A method comprising:
configuring an intermediate server to listen for requests at a first network location and to receive a request, at the first network location, for content served by a web server, wherein the web server is configured to listen for requests at a second network location; and configuring the intermediate server to respond to the request for the content with a localized version of the content, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 12. The method of claim 11, wherein configuring the intermediate server to receive the request, at the first network location, for the content comprises configuring the intermediate server to listen to a non-standard web server HTTP port. 13. The method of claim 11, further comprising:
configuring the intermediate server to direct the request to the web server at the second network location. 14. The method of claim 13, wherein configuring the intermediate server to direct the request to the web server at the second network location comprises:
configuring the intermediate server to direct the request to the web server at HTTP port 80. 15. The method of claim 11, further comprising:
receiving, by the intermediate server, the request for the content; and responding to the request for the content with the localized version of the content, wherein the localized version of the content is provided from a cache at the intermediate server. 16. The method of claim 11, further comprising:
receiving, by the intermediate server, the request for the content; retrieving the content from the web server; and caching the content at the intermediate server. 17. The method of claim 11, further comprising:
receiving, by the intermediate server, the request for the content; retrieving the content from the web server; and responding to the request with the retrieved content. 18. The method of claim 11, further comprising:
receiving, by the intermediate server, the request for the content; retrieving the content from the web server; and responding to the request with the localized version of the content. 19. The method of claim 11, further comprising:
identifying, by the intermediate server, a language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 20. The method of claim 11, wherein configuring the intermediate server to respond to the request for the content with the localized version of the content comprises configuring the intermediate server to respond to the request for the content with a translated version of the content. 21. A computer-readable storage device having instructions stored thereon, execution of which, by a computing device, causes the computing device to perform operations comprising:
configuring an intermediate server to listen for requests at a first network location and to receive a request, at the first network location, for content served by a web server, wherein the web server is configured to listen for requests at a second network location; and configuring the intermediate server to respond to the request for the content with a localized version of the content; wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 22. The computer-readable storage device of claim 21, wherein configuring the intermediate server to receive the request, at the first network location, for the content comprises configuring the intermediate server to listen to a non-standard web server HTTP port. 23. The computer-readable storage device of claim 21, further comprising:
configuring the intermediate server to direct the request to the web server at the second network location. 24. The computer-readable storage device of claim 23, wherein configuring the intermediate server to direct the request to the web server at the second network location comprises:
configuring the intermediate server to direct the request to the web server at HTTP port 80. 25. The computer-readable storage device of claim 21, the operations further comprising:
receiving, by the intermediate server, the request for the content; and responding to the request for the content with the localized version of the content, wherein the localized version of the content is provided from a cache at the intermediate server. 26. The computer-readable storage device of claim 21, the operations further comprising:
receiving, by the intermediate server, the request for the content by the intermediate server; retrieving the content from the web server; and caching the content at the intermediate server. 27. The computer-readable storage device of claim 21, the operations further comprising:
receiving, by the intermediate server, the request for the content by the intermediate server; retrieving the content from the web server; and responding to the request with the retrieved content. 28. The computer-readable storage device of claim 21, the operations further comprising:
receiving, by the intermediate server, the request for the content by the intermediate server; retrieving the content from the web server; and responding to the request with the localized version of the content. 29. The computer-readable storage device of claim 21, the operations further comprising:
identifying, by the intermediate server, a language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 30. The computer-readable storage device of claim 21, wherein configuring the intermediate server to respond to the request for the content with the localized version of the content comprises configuring the intermediate server to respond to the request for the content with a translated version of the content. 31. A system comprising:
a memory configured to store instructions comprising:
instructions for configuring an intermediate server to listen for requests at a first network location and to receive a request, at the first network location for content served by a web server, wherein the web server is configured to listen for requests at a second network location, and
instructions for configuring the intermediate server to respond to the request for the content with a localized version of the content,
wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content; and
one or more processors configured to process the instructions. 32. The system of claim 31, wherein the instructions for configuring the intermediate server to receive the request, at the first network location, for the content comprise instructions for configuring the intermediate server to listen to a non-standard web server HTTP port. 33. The system of claim 31, the instructions further comprising:
instructions for configuring the intermediate server to direct the request to the web server at the second network location. 34. The system of claim 33, wherein the instructions for configuring the intermediate server to direct the request to the web server at the second network location comprise:
instructions for configuring the intermediate server to direct the request to the web server at HTTP port 80. 35. The system of claim 31, the instructions further comprising:
instructions for receiving, by the intermediate server, the request for the content; and instructions for responding to the request for the content with the localized version of the content, wherein the localized version of the content is provided from a cache at the intermediate server. 36. The system of claim 31, the instructions further comprising:
instructions for receiving, by the intermediate server, the request for the content; instructions for retrieving the content from the web server; and instructions for caching the content at the intermediate server. 37. The system of claim 31, the instructions further comprising:
instructions for receiving, by the intermediate server, the request for the content; instructions for retrieving the content from the web server; and instructions for responding to the request with the retieved content. 38. The system of claim 31, the instructions further comprising:
instructions for receiving, by the intermediate server, the request for the content; instructions for retrieving the content from the web server; and instructions for responding to the request with the localized version of the content. 39. The system of claim 31, further comprising:
instructions for identifying, by the intermediate server, a language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 40. The system of claim 31, wherein the instructions for configuring the intermediate server to respond to the request for the content with the localized version of the content comprise instructions for configuring the intermediate server to respond to the request for the content with a translated version of the content. | A translation management system in a computer environment. A preferred embodiment of the invention automatically detects when a document, data stream, or non-text file in the master language has been updated and notifies the user which corresponding documents, data streams, or non-text files in the other languages require translation which are then staged and dynamically routed and sequenced to individual translation resources where the actual translation is performed. Management status, reporting, scheduling, and accounting information is sent to the user as the translation process ensues. The user is notified of the completion of translation and the invention coordinates the delivery of the translated documents, data streams, or non-text files back to the user's site for installation and optional review. The invention makes a variety of translation resources instantly available to the user which include both automated translation tools as well as human translators. The translation resources are connected to the invention using a flexible architecture that can be deployed on intranets as well as the Internet.1.-10. (canceled) 11. A method comprising:
configuring an intermediate server to listen for requests at a first network location and to receive a request, at the first network location, for content served by a web server, wherein the web server is configured to listen for requests at a second network location; and configuring the intermediate server to respond to the request for the content with a localized version of the content, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 12. The method of claim 11, wherein configuring the intermediate server to receive the request, at the first network location, for the content comprises configuring the intermediate server to listen to a non-standard web server HTTP port. 13. The method of claim 11, further comprising:
configuring the intermediate server to direct the request to the web server at the second network location. 14. The method of claim 13, wherein configuring the intermediate server to direct the request to the web server at the second network location comprises:
configuring the intermediate server to direct the request to the web server at HTTP port 80. 15. The method of claim 11, further comprising:
receiving, by the intermediate server, the request for the content; and responding to the request for the content with the localized version of the content, wherein the localized version of the content is provided from a cache at the intermediate server. 16. The method of claim 11, further comprising:
receiving, by the intermediate server, the request for the content; retrieving the content from the web server; and caching the content at the intermediate server. 17. The method of claim 11, further comprising:
receiving, by the intermediate server, the request for the content; retrieving the content from the web server; and responding to the request with the retrieved content. 18. The method of claim 11, further comprising:
receiving, by the intermediate server, the request for the content; retrieving the content from the web server; and responding to the request with the localized version of the content. 19. The method of claim 11, further comprising:
identifying, by the intermediate server, a language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 20. The method of claim 11, wherein configuring the intermediate server to respond to the request for the content with the localized version of the content comprises configuring the intermediate server to respond to the request for the content with a translated version of the content. 21. A computer-readable storage device having instructions stored thereon, execution of which, by a computing device, causes the computing device to perform operations comprising:
configuring an intermediate server to listen for requests at a first network location and to receive a request, at the first network location, for content served by a web server, wherein the web server is configured to listen for requests at a second network location; and configuring the intermediate server to respond to the request for the content with a localized version of the content; wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 22. The computer-readable storage device of claim 21, wherein configuring the intermediate server to receive the request, at the first network location, for the content comprises configuring the intermediate server to listen to a non-standard web server HTTP port. 23. The computer-readable storage device of claim 21, further comprising:
configuring the intermediate server to direct the request to the web server at the second network location. 24. The computer-readable storage device of claim 23, wherein configuring the intermediate server to direct the request to the web server at the second network location comprises:
configuring the intermediate server to direct the request to the web server at HTTP port 80. 25. The computer-readable storage device of claim 21, the operations further comprising:
receiving, by the intermediate server, the request for the content; and responding to the request for the content with the localized version of the content, wherein the localized version of the content is provided from a cache at the intermediate server. 26. The computer-readable storage device of claim 21, the operations further comprising:
receiving, by the intermediate server, the request for the content by the intermediate server; retrieving the content from the web server; and caching the content at the intermediate server. 27. The computer-readable storage device of claim 21, the operations further comprising:
receiving, by the intermediate server, the request for the content by the intermediate server; retrieving the content from the web server; and responding to the request with the retrieved content. 28. The computer-readable storage device of claim 21, the operations further comprising:
receiving, by the intermediate server, the request for the content by the intermediate server; retrieving the content from the web server; and responding to the request with the localized version of the content. 29. The computer-readable storage device of claim 21, the operations further comprising:
identifying, by the intermediate server, a language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 30. The computer-readable storage device of claim 21, wherein configuring the intermediate server to respond to the request for the content with the localized version of the content comprises configuring the intermediate server to respond to the request for the content with a translated version of the content. 31. A system comprising:
a memory configured to store instructions comprising:
instructions for configuring an intermediate server to listen for requests at a first network location and to receive a request, at the first network location for content served by a web server, wherein the web server is configured to listen for requests at a second network location, and
instructions for configuring the intermediate server to respond to the request for the content with a localized version of the content,
wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content; and
one or more processors configured to process the instructions. 32. The system of claim 31, wherein the instructions for configuring the intermediate server to receive the request, at the first network location, for the content comprise instructions for configuring the intermediate server to listen to a non-standard web server HTTP port. 33. The system of claim 31, the instructions further comprising:
instructions for configuring the intermediate server to direct the request to the web server at the second network location. 34. The system of claim 33, wherein the instructions for configuring the intermediate server to direct the request to the web server at the second network location comprise:
instructions for configuring the intermediate server to direct the request to the web server at HTTP port 80. 35. The system of claim 31, the instructions further comprising:
instructions for receiving, by the intermediate server, the request for the content; and instructions for responding to the request for the content with the localized version of the content, wherein the localized version of the content is provided from a cache at the intermediate server. 36. The system of claim 31, the instructions further comprising:
instructions for receiving, by the intermediate server, the request for the content; instructions for retrieving the content from the web server; and instructions for caching the content at the intermediate server. 37. The system of claim 31, the instructions further comprising:
instructions for receiving, by the intermediate server, the request for the content; instructions for retrieving the content from the web server; and instructions for responding to the request with the retieved content. 38. The system of claim 31, the instructions further comprising:
instructions for receiving, by the intermediate server, the request for the content; instructions for retrieving the content from the web server; and instructions for responding to the request with the localized version of the content. 39. The system of claim 31, further comprising:
instructions for identifying, by the intermediate server, a language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 40. The system of claim 31, wherein the instructions for configuring the intermediate server to respond to the request for the content with the localized version of the content comprise instructions for configuring the intermediate server to respond to the request for the content with a translated version of the content. | 2,100 |
4,584 | 13,902,666 | 2,157 | In an example embodiment, a tri-state variable associated with a table in a database indicates whether the table is automatically sorted at runtime or left unsorted. The value of the tri-state variable also indicates whether code associated with the table assumes the table will be sorted at runtime. In a situation where two parties have code that utilize the table, when the first ensures its code to no longer assumes the table will be sorted, they may set the value of the tri-state variable from automatic sorting enforced to automatic sorting recommended. In this state the table will still be automatically sorted at runtime. When the second ensures its code no longer assumes the table will be sorted, they may set the value of the tri-state variable from automatic sorting recommended to no automatic sort at which time the table is left unsorted. | 1. A method comprising:
identifying a value of a tri-state variable associated with a data structure,
the data structure utilized by a sequence of instructions executable on a processor,
the value of the tri-state variable being selected from the group consisting of a function enforced state, a function recommended state, and a function not provided state;
when the value of the tri-state variable is the function enforced state, providing a function upon execution of the sequence of instructions; when the value of the tri-state variable is the function recommended state, providing the function upon execution of the sequence of instructions; and when the value of the tri-state variable is the function not provided state, not providing the function upon execution of the sequence of instructions. 2. The method of claim 1, further comprising enforcing a set of state transition rules on the value of the tri-state variable. 3. The method of claim 2 wherein the set of state transition rules comprises:
when the value of the tri-state variable is the function enforced state, precluding changes to the value of the tri-state variable by entities other than a first entity until the first entity to changes the value of the tri-state variable from the function enforced state to the function recommended state; and
when the value of the tri-state variable is the function recommended state, allowing entities other than the first entity to change the value of the tri-state variable from the function recommended state to the function not provided state. 4. The method of claim 2 further comprising issuing a warning if an entity attempts to violate the state transition rules. 5. The method of claim 1, wherein the sequence of instructions is provided by a first entity and wherein changing the value of the tri-state variable from the function enforced state to the function recommended state may only be performed by the first entity. 6. The method of claim 4, wherein the data structure is utilized by a second sequence of instructions provided by a second entity and wherein the value of the tri-state variable may be changed from the function recommended state to the function not provided state by the second entity. 7. The method of claim 1, further comprising setting the value of the tri-state variable to indicate whether the sequence of instructions assumes the function will be provided. 8. The method of claim 1, wherein the value of the tri-state variable is set at the time the sequence of instructions are created or modified. 9. A system comprising:
memory; a computer processor coupled to the memory; instructions stored in the memory and executable by the processor, the instructions configuring the system to:
associate a tri-state variable with a table for use in a database, the tri-state variable having a value selected from the group consisting of an automatic sort enforced state, an automatic sort recommended state, and an automatic sort not provided state, the value of the tri-state variable determining whether automatic sorting is performed on the table at run time;
receive a request to change the value of the tri-state variable from a current value to a next value; and
enforce a set of state transition rules in order to determine whether to change the value of the tri-state variable from the current value to the next value, the state transition rules being dependent upon the entity, the current value, and the next value. 10. The system of claim 9, wherein the tri-state variable is associated with a table definition that defines the table. 11. The system of claim 10, wherein the table definition defines the table in a database independent manner and wherein the table definition resides in a data dictionary. 12. The system of claim 9, wherein the set of state transition rules comprises:
when the request is associated with a first entity and when the current value is the automatic sort enforced state and when the next value is the automatic sort recommended state, setting the value to the next value; and when the request is associated with a second entity and when the current value is the automatic sort recommended state and when the next value is the automatic sort not provided state, setting the value to the next value. 13. The system of claim 12, wherein the set of state transition rules further comprises:
when the request is associated with the first entity and when the current value is the automatic sort recommended state and when the next value is the automatic sort enforced state, issuing a warning and setting the value to the next value; and when the request is associated with the first entity and when the current value is the automatic sort not provided state and when the next value is the automatic sort recommended state and when the current value was set based on a request by the second entity, leaving the value at the current value. 14. The system of claim 9, wherein automatic sort is provided by a runtime environment when value of the tri-state variable is automatic sort enforced or automatic sort recommended and wherein automatic sort is not provided by the runtime environment when the value of the tri-state variable is automatic sort not provided. 15. A machine-readable storage medium comprising instructions that, when executed by at least one processor of a machine, configure the machine to:
receive a request to modify a value of a tri-state variable associated with a data structure from a current value to a next value, the current value and the next value being selected from a group consisting of a function enforced state, a function recommended state, and a function not provided state; when the current value is the function enforced state, and when the next value is the function recommended state, set the value of the tri-state variable to the next value; when the current value is the function recommended state, and when the next value is the function not provided state, set the value of the tri-state variable to the next value; and when the current value is the function not provided state and when the next value is the function enforced state, issue a warning. 16. The machine-readable storage medium of claim 15, wherein the instructions further configure the machine to issue a warning when the current value is the function not provided state and when the next value is the function recommended state. 17. The machine-readable storage medium of claim 15, wherein the instructions further configure the machine to issue a warning when the current value is the function recommended state and when the next value is the function enforced state. 18. The machine-readable storage medium of claim 15, wherein the instructions further configure the machine to set the value of the tri-state variable to the next value when the current value is the function enforced state and when the next value is the function not provided state. 19. The machine-readable storage medium of claim 15, wherein the instructions further configure the machine to:
identify an entity associated with the request to modify the value of the tri-state variable; and wherein when the current value is the function enforced state, and when the next value is the function recommended state, the instructions configure the machine to set the value of the tri-state variable to the next value when the entity associated with the request is a first entity; and wherein when the current value is the function recommended state, and when the next value is the function not provided state, the instructions configure the machine to set the value of the tri-state variable to the next value when the entity associated with the request is the first entity or a second entity. 20. The machine-readable storage medium of claim 19, wherein the data structure is a table. | In an example embodiment, a tri-state variable associated with a table in a database indicates whether the table is automatically sorted at runtime or left unsorted. The value of the tri-state variable also indicates whether code associated with the table assumes the table will be sorted at runtime. In a situation where two parties have code that utilize the table, when the first ensures its code to no longer assumes the table will be sorted, they may set the value of the tri-state variable from automatic sorting enforced to automatic sorting recommended. In this state the table will still be automatically sorted at runtime. When the second ensures its code no longer assumes the table will be sorted, they may set the value of the tri-state variable from automatic sorting recommended to no automatic sort at which time the table is left unsorted.1. A method comprising:
identifying a value of a tri-state variable associated with a data structure,
the data structure utilized by a sequence of instructions executable on a processor,
the value of the tri-state variable being selected from the group consisting of a function enforced state, a function recommended state, and a function not provided state;
when the value of the tri-state variable is the function enforced state, providing a function upon execution of the sequence of instructions; when the value of the tri-state variable is the function recommended state, providing the function upon execution of the sequence of instructions; and when the value of the tri-state variable is the function not provided state, not providing the function upon execution of the sequence of instructions. 2. The method of claim 1, further comprising enforcing a set of state transition rules on the value of the tri-state variable. 3. The method of claim 2 wherein the set of state transition rules comprises:
when the value of the tri-state variable is the function enforced state, precluding changes to the value of the tri-state variable by entities other than a first entity until the first entity to changes the value of the tri-state variable from the function enforced state to the function recommended state; and
when the value of the tri-state variable is the function recommended state, allowing entities other than the first entity to change the value of the tri-state variable from the function recommended state to the function not provided state. 4. The method of claim 2 further comprising issuing a warning if an entity attempts to violate the state transition rules. 5. The method of claim 1, wherein the sequence of instructions is provided by a first entity and wherein changing the value of the tri-state variable from the function enforced state to the function recommended state may only be performed by the first entity. 6. The method of claim 4, wherein the data structure is utilized by a second sequence of instructions provided by a second entity and wherein the value of the tri-state variable may be changed from the function recommended state to the function not provided state by the second entity. 7. The method of claim 1, further comprising setting the value of the tri-state variable to indicate whether the sequence of instructions assumes the function will be provided. 8. The method of claim 1, wherein the value of the tri-state variable is set at the time the sequence of instructions are created or modified. 9. A system comprising:
memory; a computer processor coupled to the memory; instructions stored in the memory and executable by the processor, the instructions configuring the system to:
associate a tri-state variable with a table for use in a database, the tri-state variable having a value selected from the group consisting of an automatic sort enforced state, an automatic sort recommended state, and an automatic sort not provided state, the value of the tri-state variable determining whether automatic sorting is performed on the table at run time;
receive a request to change the value of the tri-state variable from a current value to a next value; and
enforce a set of state transition rules in order to determine whether to change the value of the tri-state variable from the current value to the next value, the state transition rules being dependent upon the entity, the current value, and the next value. 10. The system of claim 9, wherein the tri-state variable is associated with a table definition that defines the table. 11. The system of claim 10, wherein the table definition defines the table in a database independent manner and wherein the table definition resides in a data dictionary. 12. The system of claim 9, wherein the set of state transition rules comprises:
when the request is associated with a first entity and when the current value is the automatic sort enforced state and when the next value is the automatic sort recommended state, setting the value to the next value; and when the request is associated with a second entity and when the current value is the automatic sort recommended state and when the next value is the automatic sort not provided state, setting the value to the next value. 13. The system of claim 12, wherein the set of state transition rules further comprises:
when the request is associated with the first entity and when the current value is the automatic sort recommended state and when the next value is the automatic sort enforced state, issuing a warning and setting the value to the next value; and when the request is associated with the first entity and when the current value is the automatic sort not provided state and when the next value is the automatic sort recommended state and when the current value was set based on a request by the second entity, leaving the value at the current value. 14. The system of claim 9, wherein automatic sort is provided by a runtime environment when value of the tri-state variable is automatic sort enforced or automatic sort recommended and wherein automatic sort is not provided by the runtime environment when the value of the tri-state variable is automatic sort not provided. 15. A machine-readable storage medium comprising instructions that, when executed by at least one processor of a machine, configure the machine to:
receive a request to modify a value of a tri-state variable associated with a data structure from a current value to a next value, the current value and the next value being selected from a group consisting of a function enforced state, a function recommended state, and a function not provided state; when the current value is the function enforced state, and when the next value is the function recommended state, set the value of the tri-state variable to the next value; when the current value is the function recommended state, and when the next value is the function not provided state, set the value of the tri-state variable to the next value; and when the current value is the function not provided state and when the next value is the function enforced state, issue a warning. 16. The machine-readable storage medium of claim 15, wherein the instructions further configure the machine to issue a warning when the current value is the function not provided state and when the next value is the function recommended state. 17. The machine-readable storage medium of claim 15, wherein the instructions further configure the machine to issue a warning when the current value is the function recommended state and when the next value is the function enforced state. 18. The machine-readable storage medium of claim 15, wherein the instructions further configure the machine to set the value of the tri-state variable to the next value when the current value is the function enforced state and when the next value is the function not provided state. 19. The machine-readable storage medium of claim 15, wherein the instructions further configure the machine to:
identify an entity associated with the request to modify the value of the tri-state variable; and wherein when the current value is the function enforced state, and when the next value is the function recommended state, the instructions configure the machine to set the value of the tri-state variable to the next value when the entity associated with the request is a first entity; and wherein when the current value is the function recommended state, and when the next value is the function not provided state, the instructions configure the machine to set the value of the tri-state variable to the next value when the entity associated with the request is the first entity or a second entity. 20. The machine-readable storage medium of claim 19, wherein the data structure is a table. | 2,100 |
4,585 | 14,146,114 | 2,128 | In one embodiment, the invention comprises: defining a first volume in a layer of a semiconductor device; calculating a probability of finding at least one dopant atom in the first volume, based on a dopant distribution of the layer; in the case that the calculated probability is equal to or greater than a pre-determined threshold, defining at least one additional volume in the layer substantially equal to the first volume; and in the case that the calculated probability is less than the pre-determined threshold: aggregating the first volume with a second volume adjacent the first volume, the second volume being substantially equal to the first volume; and recalculating a probability of finding at least one dopant atom in the aggregated first and second volumes, based on the dopant distribution of the layer. | 1. A method of modeling random dopant fluctuations (RDF) in a semiconductor device, the method comprising:
defining a first volume in a layer of a semiconductor device; calculating a probability of finding at least one dopant atom in the first volume, based on a dopant distribution of the layer; in the case that the calculated probability is equal to or greater than a pre-determined threshold, defining at least one additional volume in the layer substantially equal to the first volume; and in the case that the calculated probability is less than the pre-determined threshold:
aggregating the first volume with a second volume adjacent the first volume, the second volume being substantially equal to the first volume; and
recalculating a probability of finding at least one dopant atom in the aggregated first and second volumes, based on the dopant distribution of the layer. 2. The method of claim 1, further comprising:
in the case that the recalculated probability is equal to or greater than the pre-determined threshold, defining at least one additional volume in the layer substantially equal to the aggregated first and second volumes. 3. The method of claim 2, further comprising:
determining a revised dopant distribution for the layer based on the recalculated probability using a Poisson distribution; and applying the revised dopant distribution to each of the first and second volumes. 4. The method of claim 1, further comprising:
in the case that the recalculated probability is less than the pre-determined threshold:
reaggregating an additional volume with the previously aggregated volumes, the additional volume being adjacent to at least one of the volumes making up the previously aggregated volumes; and
further recalculating a probability of finding at least one dopant atom in the aggregated additional volume and the previously aggregated volumes based on the dopant distribution of the layer. 5. The method of claim 4, wherein the additional volume is substantially equal to at least one of the already aggregated volumes. 6. The method of claim 4, further comprising:
in the case that the further recalculated probability is less than the pre-determined threshold:
iteratively looping the reaggregating and further recalculating steps until the further recalculated probability is equal to or greater than the pre-determined threshold; and
defining at least one additional volume in the layer substantially equal to the reaggregated volumes. 7. The method of claim 6, further comprising:
determining a revised dopant distribution for the layer based on the further recalculated probability using a Poisson distribution; and applying the revised dopant distribution to each volume making up the reaggregated volumes. 8. The method of claim 1, further comprising:
choosing, as the first volume, a node of a finite element mesh applied to the layer. 9. The method of claim 8, wherein the node is expected to have a lowest dopant concentration of the layer, based on the dopant distribution. 10. The method of claim 9, wherein the second volume has a dopant concentration greater than or equal to the dopant concentration of the first volume. 11. The method of claim 6, wherein applying the revised dopant distribution includes recalculating a probability of finding at least one dopant atom in the first volume, based on the revised dopant distribution. 12. A computer program product for modeling random dopant fluctuations (RDF) in a semiconductor device, the computer program product comprising a computer-readable storage medium having program code embodied therewith, the program code being executable by a processor of a computing device to perform a method comprising:
defining a first volume in a layer of a semiconductor device; calculating a probability of finding at least one dopant atom in the first volume, based on a dopant distribution of the layer; in the case that the calculated probability is equal to or greater than a pre-determined threshold, defining at least one additional volume in the layer substantially equal to the first volume; and in the case that the calculated probability is less than the pre-determined threshold:
aggregating the first volume with a second volume adjacent the first volume, the second volume being substantially equal to the first volume; and
recalculating a probability of finding at least one dopant atom in the aggregated first and second volumes, based on the dopant distribution of the layer. 13. The computer program product of claim 12, wherein the method further comprises:
in the case that the recalculated probability is equal to or greater than the pre-determined threshold, defining at least one additional volume in the layer substantially equal to the aggregated first and second volumes. 14. The computer program product of claim 13, wherein the method further comprises:
determining a revised dopant distribution for the layer based on the recalculated probability using a Poisson distribution; and applying the revised dopant distribution to each of the first and second volumes. 15. The computer program product of claim 12, wherein the method further comprises:
in the case that the recalculated probability is less than the pre-determined threshold:
reaggregating an additional volume with the previously aggregated volumes, the additional volume being adjacent to at least one of the volumes making up the previously aggregated volumes; and
further recalculating a probability of finding at least one dopant atom in the aggregated additional volume and the previously aggregated volumes based on the dopant distribution of the layer. 16. The computer program product of claim 15, wherein the additional volume is substantially equal to at least one of the already aggregated volumes. 17. The computer program product of claim 15, wherein the method further comprises:
in the case that the further recalculated probability is less than the pre-determined threshold:
iteratively looping the reaggregating and further recalculating steps until the further recalculated probability is equal to or greater than the pre-determined threshold; and
defining at least one additional volume in the layer substantially equal to the reaggregated volumes. 18. The computer program product of claim 17, wherein the method further comprises:
determining a revised dopant distribution for the layer based on the further recalculated probability using a Poisson distribution; and applying the revised dopant distribution to each volume making up the reaggregated volumes. 19. The computer program product of claim 12, wherein the method further comprises:
choosing, as the first volume, a node of a finite element mesh applied to the layer. 20. The computer program product of claim 19, wherein the second volume has a dopant concentration greater than or equal to the dopant concentration of the first volume. | In one embodiment, the invention comprises: defining a first volume in a layer of a semiconductor device; calculating a probability of finding at least one dopant atom in the first volume, based on a dopant distribution of the layer; in the case that the calculated probability is equal to or greater than a pre-determined threshold, defining at least one additional volume in the layer substantially equal to the first volume; and in the case that the calculated probability is less than the pre-determined threshold: aggregating the first volume with a second volume adjacent the first volume, the second volume being substantially equal to the first volume; and recalculating a probability of finding at least one dopant atom in the aggregated first and second volumes, based on the dopant distribution of the layer.1. A method of modeling random dopant fluctuations (RDF) in a semiconductor device, the method comprising:
defining a first volume in a layer of a semiconductor device; calculating a probability of finding at least one dopant atom in the first volume, based on a dopant distribution of the layer; in the case that the calculated probability is equal to or greater than a pre-determined threshold, defining at least one additional volume in the layer substantially equal to the first volume; and in the case that the calculated probability is less than the pre-determined threshold:
aggregating the first volume with a second volume adjacent the first volume, the second volume being substantially equal to the first volume; and
recalculating a probability of finding at least one dopant atom in the aggregated first and second volumes, based on the dopant distribution of the layer. 2. The method of claim 1, further comprising:
in the case that the recalculated probability is equal to or greater than the pre-determined threshold, defining at least one additional volume in the layer substantially equal to the aggregated first and second volumes. 3. The method of claim 2, further comprising:
determining a revised dopant distribution for the layer based on the recalculated probability using a Poisson distribution; and applying the revised dopant distribution to each of the first and second volumes. 4. The method of claim 1, further comprising:
in the case that the recalculated probability is less than the pre-determined threshold:
reaggregating an additional volume with the previously aggregated volumes, the additional volume being adjacent to at least one of the volumes making up the previously aggregated volumes; and
further recalculating a probability of finding at least one dopant atom in the aggregated additional volume and the previously aggregated volumes based on the dopant distribution of the layer. 5. The method of claim 4, wherein the additional volume is substantially equal to at least one of the already aggregated volumes. 6. The method of claim 4, further comprising:
in the case that the further recalculated probability is less than the pre-determined threshold:
iteratively looping the reaggregating and further recalculating steps until the further recalculated probability is equal to or greater than the pre-determined threshold; and
defining at least one additional volume in the layer substantially equal to the reaggregated volumes. 7. The method of claim 6, further comprising:
determining a revised dopant distribution for the layer based on the further recalculated probability using a Poisson distribution; and applying the revised dopant distribution to each volume making up the reaggregated volumes. 8. The method of claim 1, further comprising:
choosing, as the first volume, a node of a finite element mesh applied to the layer. 9. The method of claim 8, wherein the node is expected to have a lowest dopant concentration of the layer, based on the dopant distribution. 10. The method of claim 9, wherein the second volume has a dopant concentration greater than or equal to the dopant concentration of the first volume. 11. The method of claim 6, wherein applying the revised dopant distribution includes recalculating a probability of finding at least one dopant atom in the first volume, based on the revised dopant distribution. 12. A computer program product for modeling random dopant fluctuations (RDF) in a semiconductor device, the computer program product comprising a computer-readable storage medium having program code embodied therewith, the program code being executable by a processor of a computing device to perform a method comprising:
defining a first volume in a layer of a semiconductor device; calculating a probability of finding at least one dopant atom in the first volume, based on a dopant distribution of the layer; in the case that the calculated probability is equal to or greater than a pre-determined threshold, defining at least one additional volume in the layer substantially equal to the first volume; and in the case that the calculated probability is less than the pre-determined threshold:
aggregating the first volume with a second volume adjacent the first volume, the second volume being substantially equal to the first volume; and
recalculating a probability of finding at least one dopant atom in the aggregated first and second volumes, based on the dopant distribution of the layer. 13. The computer program product of claim 12, wherein the method further comprises:
in the case that the recalculated probability is equal to or greater than the pre-determined threshold, defining at least one additional volume in the layer substantially equal to the aggregated first and second volumes. 14. The computer program product of claim 13, wherein the method further comprises:
determining a revised dopant distribution for the layer based on the recalculated probability using a Poisson distribution; and applying the revised dopant distribution to each of the first and second volumes. 15. The computer program product of claim 12, wherein the method further comprises:
in the case that the recalculated probability is less than the pre-determined threshold:
reaggregating an additional volume with the previously aggregated volumes, the additional volume being adjacent to at least one of the volumes making up the previously aggregated volumes; and
further recalculating a probability of finding at least one dopant atom in the aggregated additional volume and the previously aggregated volumes based on the dopant distribution of the layer. 16. The computer program product of claim 15, wherein the additional volume is substantially equal to at least one of the already aggregated volumes. 17. The computer program product of claim 15, wherein the method further comprises:
in the case that the further recalculated probability is less than the pre-determined threshold:
iteratively looping the reaggregating and further recalculating steps until the further recalculated probability is equal to or greater than the pre-determined threshold; and
defining at least one additional volume in the layer substantially equal to the reaggregated volumes. 18. The computer program product of claim 17, wherein the method further comprises:
determining a revised dopant distribution for the layer based on the further recalculated probability using a Poisson distribution; and applying the revised dopant distribution to each volume making up the reaggregated volumes. 19. The computer program product of claim 12, wherein the method further comprises:
choosing, as the first volume, a node of a finite element mesh applied to the layer. 20. The computer program product of claim 19, wherein the second volume has a dopant concentration greater than or equal to the dopant concentration of the first volume. | 2,100 |
4,586 | 14,607,352 | 2,129 | A hot spot methodology incorporates wafer physical measurement with digital simulation for identifying and monitoring critical hot spots. Wafer physical data are collected from the processed wafer of the semiconductor device on a plurality of target locations. Hot spot candidates and corresponding simulation data are generated by digital simulation based on models and verifications of optical proximity and lithographic process correction according to the design data of a semiconductor device. Data analytics provides data correlation between the collected wafer physical data and the simulation data. Data analytics further performs data correction on the simulation data according to the wafer physical data that have best correlation with the simulation data to better predict critical hot spots. | 1. A method of incorporating wafer physical measurement with digital simulation for identifying critical hot spots in manufacturing a semiconductor device, comprising the steps of:
collecting a plurality of physical data from a plurality of locations on a processed wafer of a semiconductor device; generating a plurality of simulation data of a plurality of hot spot candidates based on digital simulation according to chip design data of the semiconductor device; and determining a plurality of critical hot spots by performing data analytics based on the physical data and the simulation data; wherein the data analytics in the step of determining critical hot spots includes data correlation between the physical data and the simulation data, and data correction of the simulation data according to the physical data that are most correlated with the simulation data. 2. The method as claimed in claim 1, wherein the step of collecting a plurality of physical data includes:
preparing a plurality of critical dimension targets on the plurality of locations according to the chip design data of the semiconductor device; and measuring critical dimension data of the plurality of critical dimension targets on the processed wafer. 3. The method as claimed in claim 2, wherein the step of generating a plurality of simulation data of hot spot candidates includes predicting edge placement error data by the digital simulation and selecting the hot spot candidates according to the predicted edge placement error data, and the data analytics in the step of determining a plurality of critical hot spots is accomplished by data correlation between the measured critical dimension data and the predicted edge placement error data, and data correction of the predicted edge placement error data is based on the measured critical dimension data that are most correlated with the predicted edge placement error data. 4. The method as claimed in claim 3, wherein the data correlation between the measured critical dimension data and the predicted edge placement error data is based on location proximity, and the data correction of the predicted edge placement error data is accomplished by calibrating the predicted edge placement error data according to the measured critical dimension data of the critical dimension targets whose locations have closest proximity with the locations corresponding to the predicted edge placement error data. 5. The method as claimed in claim 3, wherein determining a plurality of critical hot spots by performing data analytics further incorporates design clips extracted from the chip design data for the critical dimension targets and locations corresponding to the predicted edge placement error data. 6. The method as claimed in claim 5, wherein the data correlation between the measured critical dimension data and the predicted edge placement error data is based on design clips and the data correction of the predicted edge placement error data is accomplished by calibrating the predicted edge placement error data according to the measured critical dimension data of the critical dimension targets whose design clips have best correlation with the design clips corresponding to the predicted edge placement error data. 7. The method as claimed in claim 6, wherein the data correlation based on design clips is performed by correlating design features extracted from the design clips. 8. The method as claimed in claim 6, wherein the data correlation based on design clips is performed by correlating simulated images modelled and rendered from the design clips. 9. The method as claimed in claim 6, wherein the data correlation based on design clips is performed by correlating image characteristics extracted from simulated images modelled and rendered from the design clips. 10. The method as claimed in claim 6, wherein the design clips of the critical dimension targets and the design clips corresponding to the predicted edge placement error data include the design clips of at least one layer underneath a current layer of the semiconductor device. 11. The method as claimed in claim 6, wherein the design clips of the critical dimension targets include the design clips of a predetermined size of neighborhood of the locations of the critical dimension targets, and the design clips corresponding to the predicted edge placement error data include the design clips of a predetermined size of neighborhood of the locations corresponding to the predicted edge placement error data. 12. The method as claimed in claim 3, wherein the step of collecting a plurality of physical data further includes collecting physical images in a predetermined size of neighborhood of the locations of the critical dimension targets, and the data correlation between the measured critical dimension data and the predicted edge placement error data is based on correlating the physical images of the critical dimension targets with simulated images modelled and rendered from design clips extracted from the chip design data corresponding to the predicted edge placement error data. 13. The method as claimed in claim 12, wherein correlating the physical images with the simulated images is accomplished by correlating design features extracted from the physical images or the simulated images. 14. The method as claimed in claim 12, wherein correlating the physical images with the simulated images is accomplished by correlating polygon characteristics extracted from the physical images or the simulated images. 15. The method as claimed in claim 12, wherein correlating the physical images with the simulated images is accomplished by correlating image characteristics extracted from the physical images or the simulated images. 16. A method of identifying and monitoring critical hot spots in manufacturing a semiconductor device, comprising the steps of:
collecting a plurality of physical data from a plurality of locations on a processed wafer of a semiconductor device; generating a plurality of simulation data of a plurality of hot spot candidates based on digital simulation according to chip design data of the semiconductor device; determining a plurality of critical hot spots by performing data analytics based on the physical data and the simulation data; and inspecting the plurality of critical hot spots on the processed wafer of the semiconductor device; wherein the data analytics in the step of determining critical hot spots includes data correlation between the physical data and the simulation data, and data correction of the simulation data according to the physical data that are most correlated with the simulation data. 17. The method as claimed in claim 16, wherein the step of collecting a plurality of physical data includes:
preparing a plurality of critical dimension targets on the plurality of locations according to the chip design data of the semiconductor device; and measuring critical dimension data of the plurality of critical dimension targets on the processed wafer. 18. The method as claimed in claim 17, wherein the step of generating a plurality of simulation data of hot spot candidates includes predicting edge placement error data by the digital simulation and selecting the hot spot candidates according to the predicted edge placement error data, and the data analytics in the step of determining a plurality of critical hot spots is accomplished by data correlation between the measured critical dimension data and the predicted edge placement error data, and data correction of the predicted edge placement error data is based on the measured critical dimension data that are most correlated with the predicted edge placement error data. 19. The method as claimed in claim 18, wherein the step of determining a plurality of critical hot spots is executed in-line along with the step of measuring critical dimension data to dynamically determine the plurality of critical hot spots for inspection and monitoring while critical dimension data measurement is ongoing on a same processed wafer. 20. The method as claimed in claim 16, wherein the step of inspecting the plurality of critical hot spots and the step of collecting a plurality of physical data are performed on a same wafer process monitoring tool without unloading the processed wafer. 21. The method as claimed in claim 16, wherein the physical data collected from the plurality of locations on the processed wafer and results of inspecting the plurality of critical hot spots are fed back for tuning model and recipe of optical proximity correction for the chip design data. 22. The method as claimed in claim 16, wherein the physical data collected from the plurality of locations on the processed wafer and results of inspecting the plurality of critical hot spots are fed back for tuning design for manufacture model and recipe in lithographic process of manufacturing the semiconductor device. | A hot spot methodology incorporates wafer physical measurement with digital simulation for identifying and monitoring critical hot spots. Wafer physical data are collected from the processed wafer of the semiconductor device on a plurality of target locations. Hot spot candidates and corresponding simulation data are generated by digital simulation based on models and verifications of optical proximity and lithographic process correction according to the design data of a semiconductor device. Data analytics provides data correlation between the collected wafer physical data and the simulation data. Data analytics further performs data correction on the simulation data according to the wafer physical data that have best correlation with the simulation data to better predict critical hot spots.1. A method of incorporating wafer physical measurement with digital simulation for identifying critical hot spots in manufacturing a semiconductor device, comprising the steps of:
collecting a plurality of physical data from a plurality of locations on a processed wafer of a semiconductor device; generating a plurality of simulation data of a plurality of hot spot candidates based on digital simulation according to chip design data of the semiconductor device; and determining a plurality of critical hot spots by performing data analytics based on the physical data and the simulation data; wherein the data analytics in the step of determining critical hot spots includes data correlation between the physical data and the simulation data, and data correction of the simulation data according to the physical data that are most correlated with the simulation data. 2. The method as claimed in claim 1, wherein the step of collecting a plurality of physical data includes:
preparing a plurality of critical dimension targets on the plurality of locations according to the chip design data of the semiconductor device; and measuring critical dimension data of the plurality of critical dimension targets on the processed wafer. 3. The method as claimed in claim 2, wherein the step of generating a plurality of simulation data of hot spot candidates includes predicting edge placement error data by the digital simulation and selecting the hot spot candidates according to the predicted edge placement error data, and the data analytics in the step of determining a plurality of critical hot spots is accomplished by data correlation between the measured critical dimension data and the predicted edge placement error data, and data correction of the predicted edge placement error data is based on the measured critical dimension data that are most correlated with the predicted edge placement error data. 4. The method as claimed in claim 3, wherein the data correlation between the measured critical dimension data and the predicted edge placement error data is based on location proximity, and the data correction of the predicted edge placement error data is accomplished by calibrating the predicted edge placement error data according to the measured critical dimension data of the critical dimension targets whose locations have closest proximity with the locations corresponding to the predicted edge placement error data. 5. The method as claimed in claim 3, wherein determining a plurality of critical hot spots by performing data analytics further incorporates design clips extracted from the chip design data for the critical dimension targets and locations corresponding to the predicted edge placement error data. 6. The method as claimed in claim 5, wherein the data correlation between the measured critical dimension data and the predicted edge placement error data is based on design clips and the data correction of the predicted edge placement error data is accomplished by calibrating the predicted edge placement error data according to the measured critical dimension data of the critical dimension targets whose design clips have best correlation with the design clips corresponding to the predicted edge placement error data. 7. The method as claimed in claim 6, wherein the data correlation based on design clips is performed by correlating design features extracted from the design clips. 8. The method as claimed in claim 6, wherein the data correlation based on design clips is performed by correlating simulated images modelled and rendered from the design clips. 9. The method as claimed in claim 6, wherein the data correlation based on design clips is performed by correlating image characteristics extracted from simulated images modelled and rendered from the design clips. 10. The method as claimed in claim 6, wherein the design clips of the critical dimension targets and the design clips corresponding to the predicted edge placement error data include the design clips of at least one layer underneath a current layer of the semiconductor device. 11. The method as claimed in claim 6, wherein the design clips of the critical dimension targets include the design clips of a predetermined size of neighborhood of the locations of the critical dimension targets, and the design clips corresponding to the predicted edge placement error data include the design clips of a predetermined size of neighborhood of the locations corresponding to the predicted edge placement error data. 12. The method as claimed in claim 3, wherein the step of collecting a plurality of physical data further includes collecting physical images in a predetermined size of neighborhood of the locations of the critical dimension targets, and the data correlation between the measured critical dimension data and the predicted edge placement error data is based on correlating the physical images of the critical dimension targets with simulated images modelled and rendered from design clips extracted from the chip design data corresponding to the predicted edge placement error data. 13. The method as claimed in claim 12, wherein correlating the physical images with the simulated images is accomplished by correlating design features extracted from the physical images or the simulated images. 14. The method as claimed in claim 12, wherein correlating the physical images with the simulated images is accomplished by correlating polygon characteristics extracted from the physical images or the simulated images. 15. The method as claimed in claim 12, wherein correlating the physical images with the simulated images is accomplished by correlating image characteristics extracted from the physical images or the simulated images. 16. A method of identifying and monitoring critical hot spots in manufacturing a semiconductor device, comprising the steps of:
collecting a plurality of physical data from a plurality of locations on a processed wafer of a semiconductor device; generating a plurality of simulation data of a plurality of hot spot candidates based on digital simulation according to chip design data of the semiconductor device; determining a plurality of critical hot spots by performing data analytics based on the physical data and the simulation data; and inspecting the plurality of critical hot spots on the processed wafer of the semiconductor device; wherein the data analytics in the step of determining critical hot spots includes data correlation between the physical data and the simulation data, and data correction of the simulation data according to the physical data that are most correlated with the simulation data. 17. The method as claimed in claim 16, wherein the step of collecting a plurality of physical data includes:
preparing a plurality of critical dimension targets on the plurality of locations according to the chip design data of the semiconductor device; and measuring critical dimension data of the plurality of critical dimension targets on the processed wafer. 18. The method as claimed in claim 17, wherein the step of generating a plurality of simulation data of hot spot candidates includes predicting edge placement error data by the digital simulation and selecting the hot spot candidates according to the predicted edge placement error data, and the data analytics in the step of determining a plurality of critical hot spots is accomplished by data correlation between the measured critical dimension data and the predicted edge placement error data, and data correction of the predicted edge placement error data is based on the measured critical dimension data that are most correlated with the predicted edge placement error data. 19. The method as claimed in claim 18, wherein the step of determining a plurality of critical hot spots is executed in-line along with the step of measuring critical dimension data to dynamically determine the plurality of critical hot spots for inspection and monitoring while critical dimension data measurement is ongoing on a same processed wafer. 20. The method as claimed in claim 16, wherein the step of inspecting the plurality of critical hot spots and the step of collecting a plurality of physical data are performed on a same wafer process monitoring tool without unloading the processed wafer. 21. The method as claimed in claim 16, wherein the physical data collected from the plurality of locations on the processed wafer and results of inspecting the plurality of critical hot spots are fed back for tuning model and recipe of optical proximity correction for the chip design data. 22. The method as claimed in claim 16, wherein the physical data collected from the plurality of locations on the processed wafer and results of inspecting the plurality of critical hot spots are fed back for tuning design for manufacture model and recipe in lithographic process of manufacturing the semiconductor device. | 2,100 |
4,587 | 13,874,327 | 2,153 | The subject matter described herein relates to implementation of a dictionary in a column-based, in-memory database where values are not stored directly, rather, for each column, a dictionary is created with all distinct values. For each row, a reference to the corresponding value in the dictionary is stored. In one aspect, data is stored in a memory structure organized in a column store format defined by a plurality of columns and a plurality of rows. A dictionary for each column in the memory structure is generated. The dictionary has distinct values for each column. A reference to the dictionary is generated for each column in the memory structure. The dictionary and the reference to the dictionary are stored in the memory structure. | 1. A method comprising:
storing, by one or more processors, data in a memory structure organized in a column store format defined by a plurality of columns and a plurality of rows; generating, by the one or more processors, a dictionary for each column in the memory structure, the dictionary having distinct values for each column; generating, by the one or more processors, a reference to the dictionary for each column in the memory structure; and storing the dictionary and the reference to the dictionary in the memory structure. 2. The method in accordance with claim 1, further comprising:
defining, by the one or more processors, a block of memory for each dictionary; and compressing, by the one or more processors, the block of memory for each dictionary. 3. The method in accordance with claim 2, wherein the block comprises:
a reference term; a bitvector representing a character position in each dictionary; a reference to a dictionary for all non-constant character positions; and a bit array having bitstrings of all coded terms associated with non-constant characters in a group of dictionaries. 4. The method in accordance with claim 3, further comprising building, by the one or more processors, a dictionary for all positions in the block other than the reference term. 5. A computer program product comprising a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
storing data in a memory structure organized in a column store format defined by a plurality of columns and a plurality of rows; generating a dictionary for each column in the memory structure, the dictionary having distinct values for each column; generating a reference to the dictionary for each column in the memory structure; and storing the dictionary and the reference to the dictionary in the memory structure. 6. The computer program product in accordance with claim 5, wherein the instructions further cause the at least one programmable processor to perform operations comprising:
defining a block of memory for each dictionary; and compressing the block of memory for each dictionary. 7. The computer program product in accordance with claim 6, wherein the block comprises:
a reference term; a bitvector representing a character position in each dictionary; a reference to a dictionary for all non-constant character positions; and a bit array having bitstrings of all coded terms associated with non-constant characters in a group of dictionaries. 8. The computer program product in accordance with claim 7, wherein the instructions further cause the at least one programmable processor to perform operations comprising building a dictionary for all positions in the block other than the reference term. 9. A system comprising:
at least one programmable processor; and a machine-readable medium storing instructions that, when executed by the at least one processor, cause the at least one programmable processor to perform operations comprising: store data in a memory structure organized in a column store format defined by a plurality of columns and a plurality of rows; generate a dictionary for each column in the memory structure, the dictionary having distinct values for each column; generate a reference to the dictionary for each column in the memory structure; and store the dictionary and the reference to the dictionary in the memory structure. 10. The system in accordance with claim 5, wherein the instructions further cause the at least one programmable processor to:
define a block of memory for each dictionary; and compress the block of memory for each dictionary. 11. The system in accordance with claim 10, wherein the block comprises:
a reference term; a bitvector representing a character position in each dictionary; a reference to a dictionary for all non-constant character positions; and a bit array having bitstrings of all coded terms associated with non-constant characters in a group of dictionaries. 12. The system in accordance with claim 11, wherein the instructions further cause the at least one programmable processor to build a dictionary for all positions in the block other than the reference term. | The subject matter described herein relates to implementation of a dictionary in a column-based, in-memory database where values are not stored directly, rather, for each column, a dictionary is created with all distinct values. For each row, a reference to the corresponding value in the dictionary is stored. In one aspect, data is stored in a memory structure organized in a column store format defined by a plurality of columns and a plurality of rows. A dictionary for each column in the memory structure is generated. The dictionary has distinct values for each column. A reference to the dictionary is generated for each column in the memory structure. The dictionary and the reference to the dictionary are stored in the memory structure.1. A method comprising:
storing, by one or more processors, data in a memory structure organized in a column store format defined by a plurality of columns and a plurality of rows; generating, by the one or more processors, a dictionary for each column in the memory structure, the dictionary having distinct values for each column; generating, by the one or more processors, a reference to the dictionary for each column in the memory structure; and storing the dictionary and the reference to the dictionary in the memory structure. 2. The method in accordance with claim 1, further comprising:
defining, by the one or more processors, a block of memory for each dictionary; and compressing, by the one or more processors, the block of memory for each dictionary. 3. The method in accordance with claim 2, wherein the block comprises:
a reference term; a bitvector representing a character position in each dictionary; a reference to a dictionary for all non-constant character positions; and a bit array having bitstrings of all coded terms associated with non-constant characters in a group of dictionaries. 4. The method in accordance with claim 3, further comprising building, by the one or more processors, a dictionary for all positions in the block other than the reference term. 5. A computer program product comprising a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
storing data in a memory structure organized in a column store format defined by a plurality of columns and a plurality of rows; generating a dictionary for each column in the memory structure, the dictionary having distinct values for each column; generating a reference to the dictionary for each column in the memory structure; and storing the dictionary and the reference to the dictionary in the memory structure. 6. The computer program product in accordance with claim 5, wherein the instructions further cause the at least one programmable processor to perform operations comprising:
defining a block of memory for each dictionary; and compressing the block of memory for each dictionary. 7. The computer program product in accordance with claim 6, wherein the block comprises:
a reference term; a bitvector representing a character position in each dictionary; a reference to a dictionary for all non-constant character positions; and a bit array having bitstrings of all coded terms associated with non-constant characters in a group of dictionaries. 8. The computer program product in accordance with claim 7, wherein the instructions further cause the at least one programmable processor to perform operations comprising building a dictionary for all positions in the block other than the reference term. 9. A system comprising:
at least one programmable processor; and a machine-readable medium storing instructions that, when executed by the at least one processor, cause the at least one programmable processor to perform operations comprising: store data in a memory structure organized in a column store format defined by a plurality of columns and a plurality of rows; generate a dictionary for each column in the memory structure, the dictionary having distinct values for each column; generate a reference to the dictionary for each column in the memory structure; and store the dictionary and the reference to the dictionary in the memory structure. 10. The system in accordance with claim 5, wherein the instructions further cause the at least one programmable processor to:
define a block of memory for each dictionary; and compress the block of memory for each dictionary. 11. The system in accordance with claim 10, wherein the block comprises:
a reference term; a bitvector representing a character position in each dictionary; a reference to a dictionary for all non-constant character positions; and a bit array having bitstrings of all coded terms associated with non-constant characters in a group of dictionaries. 12. The system in accordance with claim 11, wherein the instructions further cause the at least one programmable processor to build a dictionary for all positions in the block other than the reference term. | 2,100 |
4,588 | 13,734,153 | 2,144 | A translation management system in a computer environment. A preferred embodiment of the invention automatically detects when a document, data stream, or non-text file in the master language has been updated and notifies the user which corresponding documents, data streams, or non-text files in the other languages require translation which are then staged and dynamically routed and sequenced to individual translation resources where the actual translation is performed. Management status, reporting, scheduling, and accounting information is sent to the user as the translation process ensues. The user is notified of the completion of translation and the invention coordinates the delivery of the translated documents, data streams, or non-text files back to the user's site for installation and optional review. The invention makes a variety of translation resources instantly available to the user which include both automated translation tools as well as human translators. The translation resources are connected to the invention using a flexible architecture that can be deployed on intranets as well as the Internet. | 1.-10. (canceled) 11. A method comprising:
receiving, by an intermediate server, a request for content served by a web server; identifying, by the intermediate server, a language associated with the request; determining, by the intermediate server, that the identified language is a language of a cached version of the content; and responding to the request, by the intermediate server, with the cached version of the content in the identified language, wherein the cached version of the content is provided from a cache at the intermediate server. 12. The method of claim 11, wherein responding to the request with the cached version of the content comprises:
sending the cached version of the content to a browser making the request, wherein the cached version of the content was cached at the intermediate server in response to a previous request. 13. The method of claim 11, wherein identifying the language associated with the request comprises identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 14. The method of claim 11, further comprising:
retrieving an updated version of the content from the web server. 15. The method of claim 14, further comprising:
generating a localized version of the updated version of the content; and caching the localized version of the updated version of the content at the intermediate server. 16. The method of claim 11, wherein receiving, by the intermediate server, the request for the content served by the web server comprises receiving, by the intermediate server at a first network location, the request for the content served by the web server, the method further comprising:
retrieving the content from the web server at a second network location. 17. The method of claim 16, further comprising:
configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 18. The method of claim 11, further comprising:
retrieving a copy of the content from the web server; generating a localized version of the content based on the language associated with the request; and caching the localized version of the content at the intermediate server. 19. The method of claim 18, further comprising:
identifying a geographic region associated with the request, wherein generating the localized version of the content is further based on the identified geographic region. 20. The method of claim 18, wherein generating the localized version of the content comprises generating a translated version of the content. 21. A computer-readable storage device having instructions stored thereon, execution of which, by a computing device, causes the computing device to perform operations comprising:
receiving, by an intermediate server, a request for content served by a web server; identifying, by the intermediate server, a language associated with the request; determining, by the intermediate server, that the identified language is a language of a cached version of the content; and responding to the request, by the intermediate server, with the cached version of the content in the identified language, wherein the cached version of the content is provided from a cache at the intermediate server. 22. The computer-readable storage device of claim 21, wherein responding to the request with the cached version of the content comprises:
sending the cached version of the content to a browser making the request, wherein the cached version of the content was cached at the intermediate server in response to a previous request. 23. The computer-readable storage device of claim 21, wherein identifying the language associated with the request comprises identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 24. The computer-readable storage device of claim 21, the operations further comprising:
retrieving an updated version of the content from the web server. 25. The computer-readable storage device of claim 24, the operations further comprising:
generating a localized version of the updated version of the content; and caching the localized version of the updated version of the content at the intermediate server. 26. The computer-readable storage device of claim 21, wherein receiving, by the intermediate server, the request for the content served by the web server comprises receiving, by the intermediate server at a first network location, the request for the content served by the web server, the operations further comprising:
retrieving the content from the web server at a second network location. 27. The computer-readable storage device of claim 26, the operations further comprising:
configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 28. The computer-readable storage device of claim 21, the operations further comprising:
retrieving a copy of the content from the web server; generating a localized version of the content based on the language associated with the request; and caching the localized version of the content at the intermediate server. 29. The computer-readable storage device of claim 28, the operations further comprising:
identifying a geographic region associated with the request, wherein generating the localized version of the content is further based on the identified geographic region. 30. The computer-readable storage device of claim 28, wherein generating the localized version of the content comprises generating a translated version of the content. 31. A system comprising:
a memory configured to store instructions comprising:
instructions for receiving, by an intermediate server, a request for content served by a web server,
instructions for identifying, by the intermediate server, a language associated with the request,
instructions for determining, by the intermediate server, that the identified language is a language of a cached version of the content, and
instructions for responding to the request, by the intermediate server, with the cached version of the content in the identified language, wherein the cached version of the content is provided from a cache at the intermediate server; and
one or more processors configured to process the instructions. 32. The system of claim 31, wherein the instructions for responding to the request with the cached version of the content comprise:
instructions for sending the cached version of the content to a browser making the request, wherein the cached version of the content was cached at the intermediate server in response to a previous request. 33. The system of claim 31, wherein the instructions for identifying the language associated with the request comprise instructions for identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 34. The system of claim 31, the instructions further comprising:
instructions for retrieving an updated version of the content from the web server. 35. The system of claim 34, the instructions further comprising:
instructions for generating a localized version of the updated version of the content; and instructions for caching the localized version of the updated version of the content at the intermediate server. 36. The system of claim 31, wherein the instructions for receiving, by the intermediate server, the request for the content served by the web server comprise instructions for receiving, by the intermediate server at a first network location, the request for the content served by the web server, the system further comprising:
instructions for retrieving the content from the web server at a second network location. 37. The system of claim 36, the instructions further comprising:
instructions for configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 38. The system of claim 31, the instructions further comprising:
instructions for retrieving a copy of the content from the web server; instructions for generating a localized version of the content based on the language associated with the request; and instructions for caching the localized version of the content at the intermediate server. 39. The system of claim 38, the instructions further comprising:
instructions for identifying a geographic region associated with the request, wherein generating the localized version of the content is further based on the identified geographic region. 40. The system of claim 38, wherein the instructions for generating the localized version of the content comprise instructions for generating a translated version of the content. | A translation management system in a computer environment. A preferred embodiment of the invention automatically detects when a document, data stream, or non-text file in the master language has been updated and notifies the user which corresponding documents, data streams, or non-text files in the other languages require translation which are then staged and dynamically routed and sequenced to individual translation resources where the actual translation is performed. Management status, reporting, scheduling, and accounting information is sent to the user as the translation process ensues. The user is notified of the completion of translation and the invention coordinates the delivery of the translated documents, data streams, or non-text files back to the user's site for installation and optional review. The invention makes a variety of translation resources instantly available to the user which include both automated translation tools as well as human translators. The translation resources are connected to the invention using a flexible architecture that can be deployed on intranets as well as the Internet.1.-10. (canceled) 11. A method comprising:
receiving, by an intermediate server, a request for content served by a web server; identifying, by the intermediate server, a language associated with the request; determining, by the intermediate server, that the identified language is a language of a cached version of the content; and responding to the request, by the intermediate server, with the cached version of the content in the identified language, wherein the cached version of the content is provided from a cache at the intermediate server. 12. The method of claim 11, wherein responding to the request with the cached version of the content comprises:
sending the cached version of the content to a browser making the request, wherein the cached version of the content was cached at the intermediate server in response to a previous request. 13. The method of claim 11, wherein identifying the language associated with the request comprises identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 14. The method of claim 11, further comprising:
retrieving an updated version of the content from the web server. 15. The method of claim 14, further comprising:
generating a localized version of the updated version of the content; and caching the localized version of the updated version of the content at the intermediate server. 16. The method of claim 11, wherein receiving, by the intermediate server, the request for the content served by the web server comprises receiving, by the intermediate server at a first network location, the request for the content served by the web server, the method further comprising:
retrieving the content from the web server at a second network location. 17. The method of claim 16, further comprising:
configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 18. The method of claim 11, further comprising:
retrieving a copy of the content from the web server; generating a localized version of the content based on the language associated with the request; and caching the localized version of the content at the intermediate server. 19. The method of claim 18, further comprising:
identifying a geographic region associated with the request, wherein generating the localized version of the content is further based on the identified geographic region. 20. The method of claim 18, wherein generating the localized version of the content comprises generating a translated version of the content. 21. A computer-readable storage device having instructions stored thereon, execution of which, by a computing device, causes the computing device to perform operations comprising:
receiving, by an intermediate server, a request for content served by a web server; identifying, by the intermediate server, a language associated with the request; determining, by the intermediate server, that the identified language is a language of a cached version of the content; and responding to the request, by the intermediate server, with the cached version of the content in the identified language, wherein the cached version of the content is provided from a cache at the intermediate server. 22. The computer-readable storage device of claim 21, wherein responding to the request with the cached version of the content comprises:
sending the cached version of the content to a browser making the request, wherein the cached version of the content was cached at the intermediate server in response to a previous request. 23. The computer-readable storage device of claim 21, wherein identifying the language associated with the request comprises identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 24. The computer-readable storage device of claim 21, the operations further comprising:
retrieving an updated version of the content from the web server. 25. The computer-readable storage device of claim 24, the operations further comprising:
generating a localized version of the updated version of the content; and caching the localized version of the updated version of the content at the intermediate server. 26. The computer-readable storage device of claim 21, wherein receiving, by the intermediate server, the request for the content served by the web server comprises receiving, by the intermediate server at a first network location, the request for the content served by the web server, the operations further comprising:
retrieving the content from the web server at a second network location. 27. The computer-readable storage device of claim 26, the operations further comprising:
configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 28. The computer-readable storage device of claim 21, the operations further comprising:
retrieving a copy of the content from the web server; generating a localized version of the content based on the language associated with the request; and caching the localized version of the content at the intermediate server. 29. The computer-readable storage device of claim 28, the operations further comprising:
identifying a geographic region associated with the request, wherein generating the localized version of the content is further based on the identified geographic region. 30. The computer-readable storage device of claim 28, wherein generating the localized version of the content comprises generating a translated version of the content. 31. A system comprising:
a memory configured to store instructions comprising:
instructions for receiving, by an intermediate server, a request for content served by a web server,
instructions for identifying, by the intermediate server, a language associated with the request,
instructions for determining, by the intermediate server, that the identified language is a language of a cached version of the content, and
instructions for responding to the request, by the intermediate server, with the cached version of the content in the identified language, wherein the cached version of the content is provided from a cache at the intermediate server; and
one or more processors configured to process the instructions. 32. The system of claim 31, wherein the instructions for responding to the request with the cached version of the content comprise:
instructions for sending the cached version of the content to a browser making the request, wherein the cached version of the content was cached at the intermediate server in response to a previous request. 33. The system of claim 31, wherein the instructions for identifying the language associated with the request comprise instructions for identifying the language associated with the request based on at least one of a cookie, a source address associated with the request, or a browser setting. 34. The system of claim 31, the instructions further comprising:
instructions for retrieving an updated version of the content from the web server. 35. The system of claim 34, the instructions further comprising:
instructions for generating a localized version of the updated version of the content; and instructions for caching the localized version of the updated version of the content at the intermediate server. 36. The system of claim 31, wherein the instructions for receiving, by the intermediate server, the request for the content served by the web server comprise instructions for receiving, by the intermediate server at a first network location, the request for the content served by the web server, the system further comprising:
instructions for retrieving the content from the web server at a second network location. 37. The system of claim 36, the instructions further comprising:
instructions for configuring the intermediate server to listen for a request at the first network location, wherein direct access to the web server at the second network location is usable to retrieve an unlocalized version of the content. 38. The system of claim 31, the instructions further comprising:
instructions for retrieving a copy of the content from the web server; instructions for generating a localized version of the content based on the language associated with the request; and instructions for caching the localized version of the content at the intermediate server. 39. The system of claim 38, the instructions further comprising:
instructions for identifying a geographic region associated with the request, wherein generating the localized version of the content is further based on the identified geographic region. 40. The system of claim 38, wherein the instructions for generating the localized version of the content comprise instructions for generating a translated version of the content. | 2,100 |
4,589 | 14,675,355 | 2,119 | A system can include a bed having a mattress, a sensor, and the data processing device. The sensor is configured to sense a feature of the mattress and transmit readings to a data processing device. The data processing device includes a processor and is configured to receive the readings from the sensor and determine if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep. The data processing device is configured to transmit a command to a peripheral controller responsive to determining that the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep. | 1. A system comprising:
a mattress; a sensor configured to:
sense a feature of the mattress; and
transmit readings to a data processing device; and
the data processing device comprising a processor and configured to:
receive the readings from the sensor;
determine if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep; and
responsive to determining that the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep, transmit a command to a peripheral controller. 2. The system of claim 1, wherein the data processing device is further configured to:
responsive to determining that the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep, transmit a command to a user interface device. 3. The system of claim 1, wherein:
the mattress is an air mattress having an air chamber; the sensor is a pressure sensor in fluid communication with the air chamber; and the feature of the mattress is air pressure. 4. The system of claim 1, the system further comprising:
the peripheral controller configured to:
receive the command from the data processing device; and
responsive to receiving the command, modify a state of a peripheral device according to the command. 5. The method of claim 4, wherein the command includes instructions to at least one of the group consisting of turning the peripheral device on, turning the peripheral device off, dimming the peripheral device, and changing the temperature of the peripheral device. 6. The system of claim 1, wherein:
the data processing device is further configured to:
store the reading from the sensor; and
generate, based on the stored readings from the sensor, a model of the user's sleep behavior; and
to determine if the readings ii) indicate the user intends to sleep, the data processing device is further configured to compare some of the readings from the sensor with the model of the user's sleep behavior. 7. The system of claim 6, wherein:
the data processing device is further configured to access historical sensor data from a cloud service; and to generate, based on the stored readings from the sensor, a model of the user's sleep behavior, the data processing device is further configured combine the historical sensor data with the stored readings from the sensor. 8. The system of claim 6, wherein:
the data processing device is further configured to:
determine that, based on the model of the user's sleep behavior, the user is likely to sleep within a threshold time in the future; and
responsive to determining that the user is likely to sleep within a threshold time in the future, transmit a second command to the peripheral controller. 9. The system of claim 8, wherein the system further comprises:
the peripheral controller is further configured to:
receive the second command from the data processing device; and
responsive to receiving the second command, modify a state of a peripheral device according to the second command. 10. The system of claim 8, wherein the command comprises instructions to turn off the peripheral device and the second command comprises instructions to turn on the peripheral device. 11. The system of claim 1, wherein the data processing device is further configured to:
responsive to determining that the readings do not i) indicate user presence on the mattress and ii) indicate the user intends to sleep, not transmitting the command to the peripheral controller. 12. The system of claim 1, wherein the data processing device is further configured to:
responsive to determining that the readings i) do indicate user presence on the mattress and ii) do not indicate the user intends to sleep for at least a threshold period of time, not transmitting the command to the peripheral controller. 13. The system of claim 1, wherein:
the data processing device is further configured to:
identify a first time range during which the user would be expected to sleep once presence of the user is detected on the mattress during the first time range;
transmit the command to the peripheral controller if the data processing device determines that the readings indicate user presence on the mattress during the first time range; and not transmit the command to the peripheral controller if the data processing device determines that the readings indicate user presence on the mattress outside of the first time range. 14. A method performed by data processing apparatus, the method comprising:
receiving, from a sensor configured to sense a feature of a mattress, readings; determining if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep; and responsive to determining that the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep, transmitting a command to a peripheral controller. 15. The method of claim 14, the method further comprising:
receiving, at the peripheral controller, the command; and responsive to receiving the command, modifying a state of a peripheral device according to the command. 16. The method of claim 14, the method further comprising:
storing the readings from the sensor; and generating, based on the stored readings from the sensor, a model of the user's sleep behavior; wherein determining if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep comprises comparing some of the readings from the sensor with the model of the user's sleep behavior. 17. The method of claim 16, the method further comprising:
accessing historical sensor data from a cloud service; and combining the historical sensor data with the stored readings from the sensor. 18. The method of claim 16, the method further comprising:
determining that, based on the model of the user's sleep behavior, the user is likely to sleep within a threshold time in the future; and responsive to determining that the user is likely to sleep within a threshold time in the future, transmitting a second command to the peripheral controller, wherein the command comprises instructions to turn off the peripheral device and the second command comprises instructions to turn on the peripheral device. 19. The method of claim 16, the method further comprising:
determining at a second time that the readings i) indicate a user presence on the mattress and ii) do not indicate the user intends to sleep; and responsive to determining that the readings i) indicate a user presence on the mattress and ii) do not indicate the user intends to sleep, not transmitting a command to a peripheral controller. 20. A system comprising:
means for supporting a user on a mattress; a sensor configured to:
sense a feature of the mattress; and
transmit readings to a data processing device; and
the data processing device comprising a processor and configured to:
receive the readings from the sensor;
determine if the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep; and
responsive to determining that the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep, transmit a command to a peripheral controller. 21. The system of claim 20, the system further comprising:
the peripheral controller configured to:
receive the command from the data processing device; and
responsive to receiving the command, modify a state of a peripheral device according to the command. 22. The system of claim 20, wherein the data processing device is further configured to:
responsive to determining that the readings do not i) indicate user presence on the mattress and ii) indicate the user intends to sleep, not transmitting the command to the peripheral controller. 23. The system of claim 1, wherein, to determine if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep, the data processing device is further configured to compare the user presence on the mattress with a model of the user's sleep. 24. The method of claim 14, wherein determining if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep comprises comparing the user presence on the mattress with a model of the user's sleep. 25. The system of claim 20, wherein, to determine if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep, the data processing device is further configured to compare the user presence on the mattress with a model of the user's sleep. 26. The system of claim 23, wherein the model of the user's sleep comprises data indicative of a sleep schedule that identifies time-windows of likely sleep; and
wherein, to compare the user presence on the mattress with a model of the user's sleep, the data processing device is further configured to: determine a time that the readings indicate a user presence in on the mattress; compare the time with the data indicative of the sleep schedule; and determine if the time matches one of the time-windows of likely sleep of the sleep schedule. 27. The method of claim 24, wherein the model of the user's sleep comprises data indicative of a sleep schedule that identifies time-windows of likely sleep; and
comparing the user presence on the mattress with a model of the user's sleep comprises:
determining a time that the readings indicate a user presence in on the mattress;
comparing the time with the data indicative of the sleep schedule; and
determining if the time matches one of the time-windows of likely sleep of the sleep schedule. 28. The system of claim 25, wherein the model of the user's sleep comprises data indicative of a sleep schedule that identifies time-windows of likely sleep; and
wherein, to comparing the user presence on the mattress with a model of the user's sleep, the data processing device is further configured to: determine a time that the readings indicate a user presence in on the mattress; compare the time with the data indicative of the sleep schedule; and determine if the time matches one of the time-windows of likely sleep of the sleep schedule. | A system can include a bed having a mattress, a sensor, and the data processing device. The sensor is configured to sense a feature of the mattress and transmit readings to a data processing device. The data processing device includes a processor and is configured to receive the readings from the sensor and determine if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep. The data processing device is configured to transmit a command to a peripheral controller responsive to determining that the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep.1. A system comprising:
a mattress; a sensor configured to:
sense a feature of the mattress; and
transmit readings to a data processing device; and
the data processing device comprising a processor and configured to:
receive the readings from the sensor;
determine if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep; and
responsive to determining that the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep, transmit a command to a peripheral controller. 2. The system of claim 1, wherein the data processing device is further configured to:
responsive to determining that the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep, transmit a command to a user interface device. 3. The system of claim 1, wherein:
the mattress is an air mattress having an air chamber; the sensor is a pressure sensor in fluid communication with the air chamber; and the feature of the mattress is air pressure. 4. The system of claim 1, the system further comprising:
the peripheral controller configured to:
receive the command from the data processing device; and
responsive to receiving the command, modify a state of a peripheral device according to the command. 5. The method of claim 4, wherein the command includes instructions to at least one of the group consisting of turning the peripheral device on, turning the peripheral device off, dimming the peripheral device, and changing the temperature of the peripheral device. 6. The system of claim 1, wherein:
the data processing device is further configured to:
store the reading from the sensor; and
generate, based on the stored readings from the sensor, a model of the user's sleep behavior; and
to determine if the readings ii) indicate the user intends to sleep, the data processing device is further configured to compare some of the readings from the sensor with the model of the user's sleep behavior. 7. The system of claim 6, wherein:
the data processing device is further configured to access historical sensor data from a cloud service; and to generate, based on the stored readings from the sensor, a model of the user's sleep behavior, the data processing device is further configured combine the historical sensor data with the stored readings from the sensor. 8. The system of claim 6, wherein:
the data processing device is further configured to:
determine that, based on the model of the user's sleep behavior, the user is likely to sleep within a threshold time in the future; and
responsive to determining that the user is likely to sleep within a threshold time in the future, transmit a second command to the peripheral controller. 9. The system of claim 8, wherein the system further comprises:
the peripheral controller is further configured to:
receive the second command from the data processing device; and
responsive to receiving the second command, modify a state of a peripheral device according to the second command. 10. The system of claim 8, wherein the command comprises instructions to turn off the peripheral device and the second command comprises instructions to turn on the peripheral device. 11. The system of claim 1, wherein the data processing device is further configured to:
responsive to determining that the readings do not i) indicate user presence on the mattress and ii) indicate the user intends to sleep, not transmitting the command to the peripheral controller. 12. The system of claim 1, wherein the data processing device is further configured to:
responsive to determining that the readings i) do indicate user presence on the mattress and ii) do not indicate the user intends to sleep for at least a threshold period of time, not transmitting the command to the peripheral controller. 13. The system of claim 1, wherein:
the data processing device is further configured to:
identify a first time range during which the user would be expected to sleep once presence of the user is detected on the mattress during the first time range;
transmit the command to the peripheral controller if the data processing device determines that the readings indicate user presence on the mattress during the first time range; and not transmit the command to the peripheral controller if the data processing device determines that the readings indicate user presence on the mattress outside of the first time range. 14. A method performed by data processing apparatus, the method comprising:
receiving, from a sensor configured to sense a feature of a mattress, readings; determining if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep; and responsive to determining that the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep, transmitting a command to a peripheral controller. 15. The method of claim 14, the method further comprising:
receiving, at the peripheral controller, the command; and responsive to receiving the command, modifying a state of a peripheral device according to the command. 16. The method of claim 14, the method further comprising:
storing the readings from the sensor; and generating, based on the stored readings from the sensor, a model of the user's sleep behavior; wherein determining if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep comprises comparing some of the readings from the sensor with the model of the user's sleep behavior. 17. The method of claim 16, the method further comprising:
accessing historical sensor data from a cloud service; and combining the historical sensor data with the stored readings from the sensor. 18. The method of claim 16, the method further comprising:
determining that, based on the model of the user's sleep behavior, the user is likely to sleep within a threshold time in the future; and responsive to determining that the user is likely to sleep within a threshold time in the future, transmitting a second command to the peripheral controller, wherein the command comprises instructions to turn off the peripheral device and the second command comprises instructions to turn on the peripheral device. 19. The method of claim 16, the method further comprising:
determining at a second time that the readings i) indicate a user presence on the mattress and ii) do not indicate the user intends to sleep; and responsive to determining that the readings i) indicate a user presence on the mattress and ii) do not indicate the user intends to sleep, not transmitting a command to a peripheral controller. 20. A system comprising:
means for supporting a user on a mattress; a sensor configured to:
sense a feature of the mattress; and
transmit readings to a data processing device; and
the data processing device comprising a processor and configured to:
receive the readings from the sensor;
determine if the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep; and
responsive to determining that the readings i) indicate user presence on the mattress and ii) indicate the user intends to sleep, transmit a command to a peripheral controller. 21. The system of claim 20, the system further comprising:
the peripheral controller configured to:
receive the command from the data processing device; and
responsive to receiving the command, modify a state of a peripheral device according to the command. 22. The system of claim 20, wherein the data processing device is further configured to:
responsive to determining that the readings do not i) indicate user presence on the mattress and ii) indicate the user intends to sleep, not transmitting the command to the peripheral controller. 23. The system of claim 1, wherein, to determine if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep, the data processing device is further configured to compare the user presence on the mattress with a model of the user's sleep. 24. The method of claim 14, wherein determining if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep comprises comparing the user presence on the mattress with a model of the user's sleep. 25. The system of claim 20, wherein, to determine if the readings i) indicate a user presence on the mattress and ii) indicate the user intends to sleep, the data processing device is further configured to compare the user presence on the mattress with a model of the user's sleep. 26. The system of claim 23, wherein the model of the user's sleep comprises data indicative of a sleep schedule that identifies time-windows of likely sleep; and
wherein, to compare the user presence on the mattress with a model of the user's sleep, the data processing device is further configured to: determine a time that the readings indicate a user presence in on the mattress; compare the time with the data indicative of the sleep schedule; and determine if the time matches one of the time-windows of likely sleep of the sleep schedule. 27. The method of claim 24, wherein the model of the user's sleep comprises data indicative of a sleep schedule that identifies time-windows of likely sleep; and
comparing the user presence on the mattress with a model of the user's sleep comprises:
determining a time that the readings indicate a user presence in on the mattress;
comparing the time with the data indicative of the sleep schedule; and
determining if the time matches one of the time-windows of likely sleep of the sleep schedule. 28. The system of claim 25, wherein the model of the user's sleep comprises data indicative of a sleep schedule that identifies time-windows of likely sleep; and
wherein, to comparing the user presence on the mattress with a model of the user's sleep, the data processing device is further configured to: determine a time that the readings indicate a user presence in on the mattress; compare the time with the data indicative of the sleep schedule; and determine if the time matches one of the time-windows of likely sleep of the sleep schedule. | 2,100 |
4,590 | 14,936,060 | 2,127 | An inductor simulation method and nonlinear equivalent circuit model enabling dynamic simulation of nonlinear characteristics when a direct current is superimposed with high precision. An equivalent circuit of an inductor is represented using a series circuit of passive circuit elements. Characteristic change ratios of the passive circuit elements when a direct current is superimposed are expressed as an approximate function on the basis of actually measured values. A reference current measured by each of voltage source models is referred to by a control voltage source connected in series to the passive circuit elements. The characteristic change ratios are calculated in accordance with the reference current Iref. Difference voltages are generated on the basis of the characteristic change ratios and voltages occurring when no direct current is superimposed, they are superimposed on the voltages V L1 and V R1 occurring when no direct current is superimposed, thereby simulating the nonlinear characteristics. | 1. An inductor simulation method for simulating nonlinear characteristics of an inductor, comprising:
representing an equivalent circuit of the inductor by using a passive circuit element; expressing a characteristic change ratio of the passive circuit element when a direct current is superimposed as an approximate function that uses a current as a variable, based on actually measured values; and referring to the current flowing in the inductor, generating a difference voltage between a voltage occurring in the passive circuit element when a direct current is superimposed and a voltage occurring in the passive circuit element when no direct current is superimposed, based on the characteristic change ratio calculated in accordance with the referred current by using the approximate function and based on the voltage occurring when no direct current is superimposed, by using a control voltage source connected in series to the passive circuit element whose characteristics are changed by the superimposition of a direct current, and superimposes the difference voltage on the voltage occurring when no direct current is superimposed, thereby simulating the nonlinear characteristics of the inductor when the direct current is superimposed. 2. An inductor nonlinear equivalent circuit model comprising:
a passive circuit element that represents an equivalent circuit of an inductor; a current referring element configured to refer to a current flowing in the inductor; and a control voltage source configured to generate a difference voltage between a voltage occurring in the passive circuit element when a direct current is superimposed and a voltage occurring in the passive circuit element when no direct current is superimposed, based on a characteristic change ratio of the passive circuit element when a direct current is superimposed which is calculated in accordance with the current referred to by the current referring element and by using an approximate function expressed with a current as a variable from actually measured values, and based on the voltage occurring when no direct current is superimposed, the control voltage source being connected in series to the passive circuit element whose characteristics are changed by the superimposition of a direct current. 3. The inductor simulation method of claim 1, wherein the difference voltage is given as a function form of the following expression:
ΔV=V 0×(exp(f(x))−1)
where the difference voltage is ΔV, the voltage occurring when no direct current is superimposed is V0, and the approximate function is the function exp(f(x)) using the referred current x as a variable. 4. The inductor simulation method of claim 1, wherein the approximate function is given by an even function in a polynomial form that includes no odd number exponents. 5. The inductor simulation method of claim 1, wherein the current flowing in the inductor is referred to at an input terminal or at an output terminal of the equivalent circuit, and the voltage occurring when no direct current is superimposed is referred to at both terminals of the passive circuit element. 6. The inductor simulation method of claim 1, wherein the passive circuit element connected in series to the control voltage source is a single inductive element, or a series circuit of an inductive element and a resistive element, or a series circuit of an inductive element, a resistive element, and a capacitive element. 7. The inductor simulation method of claim 1, wherein a plurality of series circuits, each constituted by the control voltage source and the passive circuit element, form a parallel circuit. 8. The inductor simulation method of claim 1, wherein the equivalent circuit includes the passive circuit element whose characteristics are not changed by the superimposition of a direct current. 9. An inductor simulation method for simulating nonlinear characteristics of an inductor when a direct current is superimposed, comprising: using the inductor nonlinear equivalent circuit model of claim 2. 10. A computer program for implementing the inductor simulation method of claim 1, the computer program comprising:
a first step of inputting a type of the inductor; a second step of inputting a voltage to be applied to the inductor or a current to be flowed to the inductor; and a third step of making reference to the current flowing in the inductor in accordance with the voltage or the current input in the second step, generating the difference voltage by the control voltage source, based on the characteristic change ratio calculated by using the approximate function prepared in advance for the inductor of the type input in the first step in accordance with the referred current and based on the voltage occurring when no direct current is superimposed, superimposing the difference voltage on the voltage occurring when no direct current is superimposed, thereby simulating the nonlinear characteristics of the inductor when the direct current is superimposed. 11. A method of using the computer program of claim 10 by accessing a server having the computer program over the Internet network and using the computer program from a terminal connected to the Internet network. 12. The inductor nonlinear equivalent circuit model of claim 2, wherein the difference voltage is given as a function form of the following expression:
ΔV=V 0×(exp(f(x))−1)
where the difference voltage is ΔV, the voltage occurring when no direct current is superimposed is V0, and the approximate function is the function exp(f(x)) using the referred current x as a variable. 13. The inductor nonlinear equivalent circuit model of claim 2, wherein the approximate function is given by an even function in a polynomial form that includes no odd number exponents. 14. The inductor nonlinear equivalent circuit model of claim 2, wherein the current flowing in the inductor is referred to at an input terminal or at an output terminal of the equivalent circuit, and the voltage occurring when no direct current is superimposed is referred to at both terminals of the passive circuit element. 15. The inductor nonlinear equivalent circuit model of claim 2, wherein the passive circuit element connected in series to the control voltage source is a single inductive element, or a series circuit of an inductive element and a resistive element, or a series circuit of an inductive element, a resistive element, and a capacitive element. 16. The inductor nonlinear equivalent circuit model of claim 2, wherein a plurality of series circuits, each constituted by the control voltage source and the passive circuit element, form a parallel circuit. 17. The inductor nonlinear equivalent circuit model of claim 2, wherein the equivalent circuit includes the passive circuit element whose characteristics are not changed by the superimposition of a direct current. | An inductor simulation method and nonlinear equivalent circuit model enabling dynamic simulation of nonlinear characteristics when a direct current is superimposed with high precision. An equivalent circuit of an inductor is represented using a series circuit of passive circuit elements. Characteristic change ratios of the passive circuit elements when a direct current is superimposed are expressed as an approximate function on the basis of actually measured values. A reference current measured by each of voltage source models is referred to by a control voltage source connected in series to the passive circuit elements. The characteristic change ratios are calculated in accordance with the reference current Iref. Difference voltages are generated on the basis of the characteristic change ratios and voltages occurring when no direct current is superimposed, they are superimposed on the voltages V L1 and V R1 occurring when no direct current is superimposed, thereby simulating the nonlinear characteristics.1. An inductor simulation method for simulating nonlinear characteristics of an inductor, comprising:
representing an equivalent circuit of the inductor by using a passive circuit element; expressing a characteristic change ratio of the passive circuit element when a direct current is superimposed as an approximate function that uses a current as a variable, based on actually measured values; and referring to the current flowing in the inductor, generating a difference voltage between a voltage occurring in the passive circuit element when a direct current is superimposed and a voltage occurring in the passive circuit element when no direct current is superimposed, based on the characteristic change ratio calculated in accordance with the referred current by using the approximate function and based on the voltage occurring when no direct current is superimposed, by using a control voltage source connected in series to the passive circuit element whose characteristics are changed by the superimposition of a direct current, and superimposes the difference voltage on the voltage occurring when no direct current is superimposed, thereby simulating the nonlinear characteristics of the inductor when the direct current is superimposed. 2. An inductor nonlinear equivalent circuit model comprising:
a passive circuit element that represents an equivalent circuit of an inductor; a current referring element configured to refer to a current flowing in the inductor; and a control voltage source configured to generate a difference voltage between a voltage occurring in the passive circuit element when a direct current is superimposed and a voltage occurring in the passive circuit element when no direct current is superimposed, based on a characteristic change ratio of the passive circuit element when a direct current is superimposed which is calculated in accordance with the current referred to by the current referring element and by using an approximate function expressed with a current as a variable from actually measured values, and based on the voltage occurring when no direct current is superimposed, the control voltage source being connected in series to the passive circuit element whose characteristics are changed by the superimposition of a direct current. 3. The inductor simulation method of claim 1, wherein the difference voltage is given as a function form of the following expression:
ΔV=V 0×(exp(f(x))−1)
where the difference voltage is ΔV, the voltage occurring when no direct current is superimposed is V0, and the approximate function is the function exp(f(x)) using the referred current x as a variable. 4. The inductor simulation method of claim 1, wherein the approximate function is given by an even function in a polynomial form that includes no odd number exponents. 5. The inductor simulation method of claim 1, wherein the current flowing in the inductor is referred to at an input terminal or at an output terminal of the equivalent circuit, and the voltage occurring when no direct current is superimposed is referred to at both terminals of the passive circuit element. 6. The inductor simulation method of claim 1, wherein the passive circuit element connected in series to the control voltage source is a single inductive element, or a series circuit of an inductive element and a resistive element, or a series circuit of an inductive element, a resistive element, and a capacitive element. 7. The inductor simulation method of claim 1, wherein a plurality of series circuits, each constituted by the control voltage source and the passive circuit element, form a parallel circuit. 8. The inductor simulation method of claim 1, wherein the equivalent circuit includes the passive circuit element whose characteristics are not changed by the superimposition of a direct current. 9. An inductor simulation method for simulating nonlinear characteristics of an inductor when a direct current is superimposed, comprising: using the inductor nonlinear equivalent circuit model of claim 2. 10. A computer program for implementing the inductor simulation method of claim 1, the computer program comprising:
a first step of inputting a type of the inductor; a second step of inputting a voltage to be applied to the inductor or a current to be flowed to the inductor; and a third step of making reference to the current flowing in the inductor in accordance with the voltage or the current input in the second step, generating the difference voltage by the control voltage source, based on the characteristic change ratio calculated by using the approximate function prepared in advance for the inductor of the type input in the first step in accordance with the referred current and based on the voltage occurring when no direct current is superimposed, superimposing the difference voltage on the voltage occurring when no direct current is superimposed, thereby simulating the nonlinear characteristics of the inductor when the direct current is superimposed. 11. A method of using the computer program of claim 10 by accessing a server having the computer program over the Internet network and using the computer program from a terminal connected to the Internet network. 12. The inductor nonlinear equivalent circuit model of claim 2, wherein the difference voltage is given as a function form of the following expression:
ΔV=V 0×(exp(f(x))−1)
where the difference voltage is ΔV, the voltage occurring when no direct current is superimposed is V0, and the approximate function is the function exp(f(x)) using the referred current x as a variable. 13. The inductor nonlinear equivalent circuit model of claim 2, wherein the approximate function is given by an even function in a polynomial form that includes no odd number exponents. 14. The inductor nonlinear equivalent circuit model of claim 2, wherein the current flowing in the inductor is referred to at an input terminal or at an output terminal of the equivalent circuit, and the voltage occurring when no direct current is superimposed is referred to at both terminals of the passive circuit element. 15. The inductor nonlinear equivalent circuit model of claim 2, wherein the passive circuit element connected in series to the control voltage source is a single inductive element, or a series circuit of an inductive element and a resistive element, or a series circuit of an inductive element, a resistive element, and a capacitive element. 16. The inductor nonlinear equivalent circuit model of claim 2, wherein a plurality of series circuits, each constituted by the control voltage source and the passive circuit element, form a parallel circuit. 17. The inductor nonlinear equivalent circuit model of claim 2, wherein the equivalent circuit includes the passive circuit element whose characteristics are not changed by the superimposition of a direct current. | 2,100 |
4,591 | 14,661,376 | 2,183 | A technique for efficient calling of functions on a processor generates an executable program having a function call by analysing an interface for the function that defines an argument expression and an internal value used solely within the function, and an argument declaration defining an argument value to be provided to the function when the program is run. A data structure is generated including the internal value and a resolved argument value derived from the argument expression and the argument value. A single instruction is encoded in the program to utilise the data structure. When the program is executed on a processor, the single instruction causes the processor to load the argument value and internal value from the data structure into registers in the processor, prior to evaluating the function. The function can then be executed without further register loads being performed. | 1. A method of executing a program comprising a function call on a processor, the method comprising:
executing a single instruction to cause the processor to load a plurality of values stored in a data structure relating to the function at an address in a memory into a plurality of registers in the processor, prior to evaluating the function; and evaluating the function using the data in the plurality of registers, wherein the data structure comprises at least one argument value for the function and at least one internal value used solely within the function. 2. The method according to claim 1, wherein evaluating the function requires no further loads from the memory to the registers. 3. The method according to claim 1, wherein executing the single instruction causes the processor to load the plurality of values from the memory into a plurality of registers as a single operation, such that at least a portion of the loads are performed concurrently. 4. The method according to claim 1, wherein the processor is a very long instruction word processor, and the single instruction further causes the processor to call the function once the stored values are loaded into the registers. 5. The method according to claim 1, further comprising executing the function call immediately subsequent to loading the stored values. 6. The method according to claim 1, wherein the data structure is stored in a contiguous block of the memory, starting at the address. 7. The method according to claim 1, wherein the argument value is a constant or a symbol defined previously in the program, and the internal value is a constant. 8. A processor, comprising:
an execution unit configured to execute instructions in a program; a memory interface arranged to enable the execution unit to read a data structure relating to a function from an address in a memory, the data structure comprising at least one argument value for the function and at least one internal value used solely within the function; and a plurality of registers accessible by the execution unit, wherein the execution unit is configured to: execute a single instruction to load the at least one argument value and at least one internal value into the plurality of registers, prior to evaluating the function; and evaluate the function using the data in the plurality of registers. 9. The processor according to claim 8, wherein the processor is a special-purpose processor configured to operate in conjunction with a host processor. 10. The processor according to claim 9, wherein the data structure is written to the memory by the host processor. 11. The processor according to claim 9, wherein the special-purpose processor is a very long instruction word processor or a multiple instruction multiple data processor. 12. A non-transitory computer readable storage medium having stored thereon computer readable instructions that, when executed at a computer system for generating a representation of a digital circuit from definitions of circuit elements and data defining rules for combining those circuit elements, cause the computer system to generate a processor as set forth in claim 8. 13. A method of generating an executable program from a code file, wherein the program is arranged to evaluate a function when executed on a processor, the method comprising:
analysing data describing a programmatic interface for the function, the interface defining an argument expression and an internal value used solely within the function; reading from the code file an argument declaration defining an argument value to be provided to the function when the program is executed on the processor; generating a data structure comprising the internal value and a resolved argument value derived from the argument expression and the argument value from the code file; and encoding in the executable program a single instruction to cause the processor to load the internal value and resolved argument value from the data structure into a specified plurality of registers on the processor, prior to evaluating the function. 14. The method according to claim 13, wherein generating the data structure comprises evaluating the argument expression using the argument value as an input. 15. The method according to claim 13, wherein the argument expression is an equality and the resolved argument value is equal to the argument value from the code file. 16. The method according to claim 13, wherein the interface further defines a first register location on the processor where the resolved argument value is to be loaded when the program is executed on the processor, and a second register location on the processor where the internal value is to be loaded when the program is executed on the processor. 17. The method according to claim 16, wherein encoding the single instruction further comprises generating a register mask from the first register location and the second register location, and encoding the register mask in the single instruction as the specified plurality of registers. 18. The method according to claim 13, wherein the data structure is generated such that the internal value and a resolved argument value are stored in a contiguous block of memory. 19. The method according to claim 13, further comprising outputting the executable program in a text format and embedding the instructions within a further program suitable for execution on a host processor. 20. A non-transitory computer readable storage medium having encoded thereon computer executable instructions that when executed cause at least one processor to:
analyze data describing a programmatic interface for a function, the interface defining an argument expression and an internal value used solely within the function; read from a code file an argument declaration defining an argument value to be provided to the function when an executable program calling the function is executed on at least one processor; generate a data structure comprising the internal value and a resolved argument value derived from the argument expression and the argument value from the code file; and encode in the executable program a single instruction to cause at least one processor to load the internal value and resolved argument value from the data structure into a specified plurality of registers on at least one processor, prior to evaluating the function. | A technique for efficient calling of functions on a processor generates an executable program having a function call by analysing an interface for the function that defines an argument expression and an internal value used solely within the function, and an argument declaration defining an argument value to be provided to the function when the program is run. A data structure is generated including the internal value and a resolved argument value derived from the argument expression and the argument value. A single instruction is encoded in the program to utilise the data structure. When the program is executed on a processor, the single instruction causes the processor to load the argument value and internal value from the data structure into registers in the processor, prior to evaluating the function. The function can then be executed without further register loads being performed.1. A method of executing a program comprising a function call on a processor, the method comprising:
executing a single instruction to cause the processor to load a plurality of values stored in a data structure relating to the function at an address in a memory into a plurality of registers in the processor, prior to evaluating the function; and evaluating the function using the data in the plurality of registers, wherein the data structure comprises at least one argument value for the function and at least one internal value used solely within the function. 2. The method according to claim 1, wherein evaluating the function requires no further loads from the memory to the registers. 3. The method according to claim 1, wherein executing the single instruction causes the processor to load the plurality of values from the memory into a plurality of registers as a single operation, such that at least a portion of the loads are performed concurrently. 4. The method according to claim 1, wherein the processor is a very long instruction word processor, and the single instruction further causes the processor to call the function once the stored values are loaded into the registers. 5. The method according to claim 1, further comprising executing the function call immediately subsequent to loading the stored values. 6. The method according to claim 1, wherein the data structure is stored in a contiguous block of the memory, starting at the address. 7. The method according to claim 1, wherein the argument value is a constant or a symbol defined previously in the program, and the internal value is a constant. 8. A processor, comprising:
an execution unit configured to execute instructions in a program; a memory interface arranged to enable the execution unit to read a data structure relating to a function from an address in a memory, the data structure comprising at least one argument value for the function and at least one internal value used solely within the function; and a plurality of registers accessible by the execution unit, wherein the execution unit is configured to: execute a single instruction to load the at least one argument value and at least one internal value into the plurality of registers, prior to evaluating the function; and evaluate the function using the data in the plurality of registers. 9. The processor according to claim 8, wherein the processor is a special-purpose processor configured to operate in conjunction with a host processor. 10. The processor according to claim 9, wherein the data structure is written to the memory by the host processor. 11. The processor according to claim 9, wherein the special-purpose processor is a very long instruction word processor or a multiple instruction multiple data processor. 12. A non-transitory computer readable storage medium having stored thereon computer readable instructions that, when executed at a computer system for generating a representation of a digital circuit from definitions of circuit elements and data defining rules for combining those circuit elements, cause the computer system to generate a processor as set forth in claim 8. 13. A method of generating an executable program from a code file, wherein the program is arranged to evaluate a function when executed on a processor, the method comprising:
analysing data describing a programmatic interface for the function, the interface defining an argument expression and an internal value used solely within the function; reading from the code file an argument declaration defining an argument value to be provided to the function when the program is executed on the processor; generating a data structure comprising the internal value and a resolved argument value derived from the argument expression and the argument value from the code file; and encoding in the executable program a single instruction to cause the processor to load the internal value and resolved argument value from the data structure into a specified plurality of registers on the processor, prior to evaluating the function. 14. The method according to claim 13, wherein generating the data structure comprises evaluating the argument expression using the argument value as an input. 15. The method according to claim 13, wherein the argument expression is an equality and the resolved argument value is equal to the argument value from the code file. 16. The method according to claim 13, wherein the interface further defines a first register location on the processor where the resolved argument value is to be loaded when the program is executed on the processor, and a second register location on the processor where the internal value is to be loaded when the program is executed on the processor. 17. The method according to claim 16, wherein encoding the single instruction further comprises generating a register mask from the first register location and the second register location, and encoding the register mask in the single instruction as the specified plurality of registers. 18. The method according to claim 13, wherein the data structure is generated such that the internal value and a resolved argument value are stored in a contiguous block of memory. 19. The method according to claim 13, further comprising outputting the executable program in a text format and embedding the instructions within a further program suitable for execution on a host processor. 20. A non-transitory computer readable storage medium having encoded thereon computer executable instructions that when executed cause at least one processor to:
analyze data describing a programmatic interface for a function, the interface defining an argument expression and an internal value used solely within the function; read from a code file an argument declaration defining an argument value to be provided to the function when an executable program calling the function is executed on at least one processor; generate a data structure comprising the internal value and a resolved argument value derived from the argument expression and the argument value from the code file; and encode in the executable program a single instruction to cause at least one processor to load the internal value and resolved argument value from the data structure into a specified plurality of registers on at least one processor, prior to evaluating the function. | 2,100 |
4,592 | 11,620,999 | 2,153 | A portable device uses a microphone to listen to ambient audio, ascertains a corresponding identifier, and uses the identifier to enable one or more further functions. One of these can be internet search. Such functionality can also be based on digital data—without requiring a microphone-equipped device. | 1. A method comprising:
capturing ambient audio with a microphone, and producing audio data therefrom; providing the audio data to a processor; receiving from the processor an identifier corresponding to the audio data; and by reference to said received identifier, initiating a search using a general purpose internet search engine for information related to the audio; wherein a search is initiated with a general purpose internet search engine without entry of text keywords by a user. 2. The method of claim 1 that further includes, at the processing device, performing an algorithmic operation on the provided audio data, thereby producing the identifier corresponding thereto. 3. The method of claim 1 that includes presenting a textual listing of results to a user. 4. The method of claim 1 that includes:
by reference to the received identifier, ascertaining an identity of the audio; and initiating a search using a general purpose internet search engine for information related to the identified audio. 5. The method of claim 4 in which said ascertaining comprises accessing a store of metadata associated with the identifier, and obtaining data therefrom. 6. The method of claim 1 that includes:
presenting a menu of options on a display of a portable wireless device, at least one of said options relating to search; and initiating a search in response to a user selection of a search-related option from said menu. 7. The method of claim 6 that includes:
in a database, locating a data record corresponding to said identifier; and by reference to information obtained from said data record, determining options to be presented on said menu. 8. A method of internet search comprising:
receiving an identifier corresponding to audio data; by reference to the identifier, ascertaining an identity of a related content object; and initiating a search using a general purpose internet search engine for information related to the identified content object; wherein a search is initiated with a general purpose internet search engine without entry of text keywords by a user. 9. The method of claim 8 that further includes:
obtaining a digital representation associated with an audio content object; and deriving the identifier from said digital representation. 10. The method of claim 9 in which said deriving comprises decoding steganographically-encoded digital watermark data from said digital representation. 11. The method of claim 9 in which said obtaining comprises capturing ambient audio using a microphone. 12. The method of claim 8 in which said receiving comprises receiving a digital object identifier issued by a central organization which uniquely identifies a content object. 13. The method of claim 8 that includes initiating a search of Yahoo for entries related to the identified content object. 14. The method of claim 8 that includes presenting a textual listing of results to a user. 15. The method of claim 8 in which said ascertaining comprises accessing a store of metadata associated with the identifier, and obtaining data therefrom. 16. The method of claim 8 that includes:
presenting a menu of options on a display of a portable wireless device, at least one of said options relating to search; and initiating a search in response to a user selection of a search-related option from said menu. 17. The method of claim 16 that includes:
in a database, locating a data record corresponding to said identifier; and by reference to information obtained from said data record, determining options to be presented on said menu. 18. A method comprising:
receiving an identifier corresponding to audio data; by reference to said identifier, identifying a remote meta data repository related to a content object; and collecting meta data located at said identified repository with a search engine. 19. The method of claim 18 that further comprises:
in a database, locating a data record corresponding to said identifier; and by reference to information obtained from said data record, identifying the remote meta data repository. | A portable device uses a microphone to listen to ambient audio, ascertains a corresponding identifier, and uses the identifier to enable one or more further functions. One of these can be internet search. Such functionality can also be based on digital data—without requiring a microphone-equipped device.1. A method comprising:
capturing ambient audio with a microphone, and producing audio data therefrom; providing the audio data to a processor; receiving from the processor an identifier corresponding to the audio data; and by reference to said received identifier, initiating a search using a general purpose internet search engine for information related to the audio; wherein a search is initiated with a general purpose internet search engine without entry of text keywords by a user. 2. The method of claim 1 that further includes, at the processing device, performing an algorithmic operation on the provided audio data, thereby producing the identifier corresponding thereto. 3. The method of claim 1 that includes presenting a textual listing of results to a user. 4. The method of claim 1 that includes:
by reference to the received identifier, ascertaining an identity of the audio; and initiating a search using a general purpose internet search engine for information related to the identified audio. 5. The method of claim 4 in which said ascertaining comprises accessing a store of metadata associated with the identifier, and obtaining data therefrom. 6. The method of claim 1 that includes:
presenting a menu of options on a display of a portable wireless device, at least one of said options relating to search; and initiating a search in response to a user selection of a search-related option from said menu. 7. The method of claim 6 that includes:
in a database, locating a data record corresponding to said identifier; and by reference to information obtained from said data record, determining options to be presented on said menu. 8. A method of internet search comprising:
receiving an identifier corresponding to audio data; by reference to the identifier, ascertaining an identity of a related content object; and initiating a search using a general purpose internet search engine for information related to the identified content object; wherein a search is initiated with a general purpose internet search engine without entry of text keywords by a user. 9. The method of claim 8 that further includes:
obtaining a digital representation associated with an audio content object; and deriving the identifier from said digital representation. 10. The method of claim 9 in which said deriving comprises decoding steganographically-encoded digital watermark data from said digital representation. 11. The method of claim 9 in which said obtaining comprises capturing ambient audio using a microphone. 12. The method of claim 8 in which said receiving comprises receiving a digital object identifier issued by a central organization which uniquely identifies a content object. 13. The method of claim 8 that includes initiating a search of Yahoo for entries related to the identified content object. 14. The method of claim 8 that includes presenting a textual listing of results to a user. 15. The method of claim 8 in which said ascertaining comprises accessing a store of metadata associated with the identifier, and obtaining data therefrom. 16. The method of claim 8 that includes:
presenting a menu of options on a display of a portable wireless device, at least one of said options relating to search; and initiating a search in response to a user selection of a search-related option from said menu. 17. The method of claim 16 that includes:
in a database, locating a data record corresponding to said identifier; and by reference to information obtained from said data record, determining options to be presented on said menu. 18. A method comprising:
receiving an identifier corresponding to audio data; by reference to said identifier, identifying a remote meta data repository related to a content object; and collecting meta data located at said identified repository with a search engine. 19. The method of claim 18 that further comprises:
in a database, locating a data record corresponding to said identifier; and by reference to information obtained from said data record, identifying the remote meta data repository. | 2,100 |
4,593 | 12,539,502 | 2,184 | Particular embodiments generally relate to an implementation of a build engine. In one embodiment, a method for implementing a build engine includes receiving at least one menu that includes one or more sections, wherein each of the one or more sections indicates one or more libraries, and wherein each of the one or more libraries is associated with one or more software components. The method also includes parsing each of the one or more sections to determine the one or more libraries and the one or more software components. The method also includes building, by a computer processor, executable software code based on the one or more libraries and the one or more of the software components. | 1. A method for implementing a build engine, the method comprising:
receiving at least one menu that includes one or more sections, wherein each of the one or more sections indicates one or more libraries, and wherein each of the one or more libraries is associated with one or more software components; parsing each of the one or more sections to determine the one or more libraries and the one or more software components; and building, by a computer processor, executable software code based on the one or more libraries and the one or more of the software components. 2. The method of claim 1, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library. 3. The method of claim 1, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library, and wherein the core section comprises:
a parse indicator that indicates if the core section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more core software components to be archived in the core library. 4. The method of claim 1, wherein the one or more sections comprise at least one extension section that indicates one or more extension software components to be archived in an extension library. 5. The method of claim 1, wherein the one or more sections comprise at least one extension section, and wherein each of the extension sections comprises:
a parse indicator that indicates if the extension section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more extension software components to be archived in an extension library. 6. The method of claim 1, wherein the at least one menu indicates one or more additional menus to be parsed during the executable software code building step. 7. The method of claim 1, wherein the at least one menu and associated component configuration files are independent of a location of source code associated with the one or more software components. 8. An apparatus comprising:
one or more computer processors; and logic encoded in one or more computer-readable storage media for execution by the one or more computer processors and when executed operable to: receive at least one menu that includes one or more sections, wherein each of the one or more sections indicates one or more libraries, and wherein each of the one or more libraries is associated with one or more software components; parse each of the one or more sections to determine the one or more libraries and the one or more software components; and build executable software code based on the one or more libraries and the one or more of the software components. 9. The apparatus of claim 8, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library. 10. The apparatus of claim 8, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library, and wherein the core section comprises:
a parse indicator that indicates if the core section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more core software components to be archived in the core library. 11. The apparatus of claim 8, wherein the one or more sections comprise at least one extension section that indicates one or more extension software components to be archived in an extension library. 12. The apparatus of claim 8, wherein the one or more sections comprise at least one extension section, and wherein each of the extension sections comprises:
a parse indicator that indicates if the extension section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more extension software components to be archived in an extension library. 13. The apparatus of claim 8, wherein the at least one menu indicates one or more additional menus to be parsed during the executable software code building step. 14. The apparatus of claim 8, wherein the at least one menu and associated component configuration files are independent of a location of source code associated with the one or more software components. 15. A computer-readable storage medium including logic for execution by one or more computer processors and when executed operable to:
receive at least one menu that includes one or more sections, wherein each of the one or more sections indicates one or more libraries, and wherein each of the one or more libraries is associated with one or more software components; parse each of the one or more sections to determine the one or more libraries and the one or more software components; and build executable software code based on the one or more libraries and the one or more of the software components. 16. The computer-readable storage medium of claim 15, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library. 17. The computer-readable storage medium of claim 15, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library, and wherein the core section comprises:
a parse indicator that indicates if the core section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more core software components to be archived in the core library. 18. The computer-readable storage medium of claim 15, wherein the one or more sections comprise at least one extension section that indicates one or more extension software components to be archived in an extension library. 19. The computer-readable storage medium of claim 15, wherein one or more sections comprise at least one extension section, and wherein each of the extension sections comprises:
a parse indicator that indicates if the extension section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more extension software components to be archived in an extension library. 20. The computer-readable storage medium of claim 15, wherein the at least one menu indicates one or more additional menus to be parsed during the executable software code building step. | Particular embodiments generally relate to an implementation of a build engine. In one embodiment, a method for implementing a build engine includes receiving at least one menu that includes one or more sections, wherein each of the one or more sections indicates one or more libraries, and wherein each of the one or more libraries is associated with one or more software components. The method also includes parsing each of the one or more sections to determine the one or more libraries and the one or more software components. The method also includes building, by a computer processor, executable software code based on the one or more libraries and the one or more of the software components.1. A method for implementing a build engine, the method comprising:
receiving at least one menu that includes one or more sections, wherein each of the one or more sections indicates one or more libraries, and wherein each of the one or more libraries is associated with one or more software components; parsing each of the one or more sections to determine the one or more libraries and the one or more software components; and building, by a computer processor, executable software code based on the one or more libraries and the one or more of the software components. 2. The method of claim 1, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library. 3. The method of claim 1, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library, and wherein the core section comprises:
a parse indicator that indicates if the core section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more core software components to be archived in the core library. 4. The method of claim 1, wherein the one or more sections comprise at least one extension section that indicates one or more extension software components to be archived in an extension library. 5. The method of claim 1, wherein the one or more sections comprise at least one extension section, and wherein each of the extension sections comprises:
a parse indicator that indicates if the extension section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more extension software components to be archived in an extension library. 6. The method of claim 1, wherein the at least one menu indicates one or more additional menus to be parsed during the executable software code building step. 7. The method of claim 1, wherein the at least one menu and associated component configuration files are independent of a location of source code associated with the one or more software components. 8. An apparatus comprising:
one or more computer processors; and logic encoded in one or more computer-readable storage media for execution by the one or more computer processors and when executed operable to: receive at least one menu that includes one or more sections, wherein each of the one or more sections indicates one or more libraries, and wherein each of the one or more libraries is associated with one or more software components; parse each of the one or more sections to determine the one or more libraries and the one or more software components; and build executable software code based on the one or more libraries and the one or more of the software components. 9. The apparatus of claim 8, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library. 10. The apparatus of claim 8, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library, and wherein the core section comprises:
a parse indicator that indicates if the core section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more core software components to be archived in the core library. 11. The apparatus of claim 8, wherein the one or more sections comprise at least one extension section that indicates one or more extension software components to be archived in an extension library. 12. The apparatus of claim 8, wherein the one or more sections comprise at least one extension section, and wherein each of the extension sections comprises:
a parse indicator that indicates if the extension section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more extension software components to be archived in an extension library. 13. The apparatus of claim 8, wherein the at least one menu indicates one or more additional menus to be parsed during the executable software code building step. 14. The apparatus of claim 8, wherein the at least one menu and associated component configuration files are independent of a location of source code associated with the one or more software components. 15. A computer-readable storage medium including logic for execution by one or more computer processors and when executed operable to:
receive at least one menu that includes one or more sections, wherein each of the one or more sections indicates one or more libraries, and wherein each of the one or more libraries is associated with one or more software components; parse each of the one or more sections to determine the one or more libraries and the one or more software components; and build executable software code based on the one or more libraries and the one or more of the software components. 16. The computer-readable storage medium of claim 15, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library. 17. The computer-readable storage medium of claim 15, wherein the one or more sections comprise a core section that indicates one or more core software components to be archived in a core library, and wherein the core section comprises:
a parse indicator that indicates if the core section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more core software components to be archived in the core library. 18. The computer-readable storage medium of claim 15, wherein the one or more sections comprise at least one extension section that indicates one or more extension software components to be archived in an extension library. 19. The computer-readable storage medium of claim 15, wherein one or more sections comprise at least one extension section, and wherein each of the extension sections comprises:
a parse indicator that indicates if the extension section is to be parsed; a script indicator that indicates a build script path; and a components indicator that indicates one or more extension software components to be archived in an extension library. 20. The computer-readable storage medium of claim 15, wherein the at least one menu indicates one or more additional menus to be parsed during the executable software code building step. | 2,100 |
4,594 | 13,223,413 | 2,169 | A system includes a toolbar configured to receive a knowledge nugget relating to a software architecture. The knowledge nugget includes information relating to the software architecture, an identification of the creator of the knowledge nugget, a link to information relating to the knowledge nugget, a blog relating to the knowledge nugget, a tag to enable search and retrieval of the knowledge nugget, and a point of contact for discussion relating to the knowledge nugget. The toolbar is further configured to analyze the knowledge nugget, and to store the knowledge nugget in a transient database or a permanent database as a function of the analysis. | 1. A system comprising:
a computer processor configured to display a toolbar, the toolbar configured to enable the processor to:
receive a knowledge nugget relating to a software architecture, the knowledge nugget comprising information relating to one or more of the software architecture, an identification of the creator of the knowledge nugget, a link to information relating to the knowledge nugget, a blog relating to the knowledge nugget, a tag to enable search and retrieval of the knowledge nugget, and a point of contact for discussion relating to the knowledge nugget;
analyze the knowledge nugget; and
store the knowledge nugget in a transient database or a permanent database as a function of the analysis. 2. The system of claim 1, wherein the knowledge nugget comprises generic knowledge relating to the software architecture, and wherein the computer processor is configured to store the generic knowledge in the transient database. 3. The system of claim 1, wherein the creator comprises one or more of a software architect or lead designer of the software architecture. 4. The system of claim 1, wherein the computer processor is configured to connect a plurality of software systems and to act as a single point of entry for the plurality of software systems. 5. The system of claim 1, wherein the computer processor is configured to handle the reception of the knowledge nugget as temporary content, and wherein the analyzing and storing comprise a purification and refining of the knowledge nugget. 6. The system of claim 1, wherein the information relating to the software architecture comprises standards, design and design patterns, intellectual property, and evaluations of the software architecture. 7. The system of claim 1, wherein the computer processor is configured to store the knowledge nugget in the permanent database when the creator of the knowledge nugget is a software architect or lead designer of the software architecture. 8. The system of claim 1, wherein the computer processor is configured such that only a specific person or persons can update or refine a knowledge nugget stored in the permanent database. 9. The system of claim 1, wherein the knowledge nugget comprises information for use in connection with a marketing phase, a design phase, a document creation phase, a knowledge generation phase, and an implementation phase of a software development lifecycle. 10. The system of claim 1, wherein the analysis comprises one or more of a statistical method and a polling among a plurality of persons. 11. The system of claim 10, wherein the computer processor is configured to display statistics and polling data relating to a knowledge nugget. 12. The system of claim 1, wherein the computer processor is configured to search the permanent database and to block searching of the transient database. 13. The system of claim 1, wherein the computer processor is configured to manage the analysis of the knowledge nugget by collecting input from a plurality of persons regarding the import and accuracy of the knowledge nugget. 14. The system of claim 13, wherein, based on the input from the plurality of persons regarding the import and accuracy of the knowledge nugget, the knowledge nugget is stored in the transient database or the knowledge nugget is stored in the permanent database. 15. The system of claim 1, wherein the computer processor is configured to select one or more persons to oversee the analysis of the knowledge nugget. 16. The system of claim 1, wherein the computer processor is embedded within a software development system, and wherein the computer processor is configured to handle actions relating to development of a software architecture and a software product development process. 17. The system of claim 1, wherein the toolbar comprises a plug-in to a software architecture system, a software product development system, or a collaborative system. 18. The system of claim 1, wherein the toolbar is embedded in an application configured to execute on the computer processor. 19. A computer-readable medium comprising instructions that when executed by a processor executes a process comprising:
receiving a knowledge nugget relating to a software architecture, the knowledge nugget comprising information relating to one or more of the software architecture, an identification of the creator of the knowledge nugget, a link to information relating to the knowledge nugget, a blog relating to the knowledge nugget, a tag to enable search and retrieval of the knowledge nugget, and a point of contact for discussion relating to the knowledge nugget; analyzing the knowledge nugget; and storing the knowledge nugget in a transient database or a permanent database as a function of the analysis. 20. The computer-readable medium of claim 19, comprising instructions for connecting a plurality of software systems and to act as a single point of entry for the plurality of software systems. 21. The computer-readable medium of claim 19, comprising instructions for handling the reception of the knowledge nugget as temporary content, wherein the instructions for analyzing and storing comprise a purification and refining of the knowledge nugget. 22. The computer-readable medium of claim 19, wherein the information relating to the software architecture comprises standards, design and design patterns, intellectual property, and evaluations of the software architecture. 23. The computer-readable medium of claim 19, comprising instructions for managing the analysis of the knowledge nugget by collecting input from a plurality of persons regarding the import and accuracy of the knowledge nugget; and
instructions for storing the knowledge nugget in the transient database or the permanent database as a function of the input from the plurality of persons regarding the import and accuracy of the knowledge nugget. 24. The computer-readable medium of claim 19, wherein the instructions are embedded within a software development system, and comprising instructions for handling actions relating to development of a software architecture and a software product development process. 25. The computer-readable medium of claim 19, wherein the toolbar comprises a plug-in to a software architecture system, a software product development system, or a collaborative system. 26. The computer-readable medium of claim 19, wherein the toolbar is embedded in a software application. 27. A process comprising:
receiving into a computer storage medium a knowledge nugget relating to a software architecture, the knowledge nugget comprising information relating to one or more of the software architecture, an identification of the creator of the knowledge nugget, a link to information relating to the knowledge nugget, a blog relating to the knowledge nugget, a tag to enable search and retrieval of the knowledge nugget, and a point of contact for discussion relating to the knowledge nugget;
analyzing with a computer processor the knowledge nugget; and
storing the knowledge nugget in a transient database or a permanent database as a function of the analysis. | A system includes a toolbar configured to receive a knowledge nugget relating to a software architecture. The knowledge nugget includes information relating to the software architecture, an identification of the creator of the knowledge nugget, a link to information relating to the knowledge nugget, a blog relating to the knowledge nugget, a tag to enable search and retrieval of the knowledge nugget, and a point of contact for discussion relating to the knowledge nugget. The toolbar is further configured to analyze the knowledge nugget, and to store the knowledge nugget in a transient database or a permanent database as a function of the analysis.1. A system comprising:
a computer processor configured to display a toolbar, the toolbar configured to enable the processor to:
receive a knowledge nugget relating to a software architecture, the knowledge nugget comprising information relating to one or more of the software architecture, an identification of the creator of the knowledge nugget, a link to information relating to the knowledge nugget, a blog relating to the knowledge nugget, a tag to enable search and retrieval of the knowledge nugget, and a point of contact for discussion relating to the knowledge nugget;
analyze the knowledge nugget; and
store the knowledge nugget in a transient database or a permanent database as a function of the analysis. 2. The system of claim 1, wherein the knowledge nugget comprises generic knowledge relating to the software architecture, and wherein the computer processor is configured to store the generic knowledge in the transient database. 3. The system of claim 1, wherein the creator comprises one or more of a software architect or lead designer of the software architecture. 4. The system of claim 1, wherein the computer processor is configured to connect a plurality of software systems and to act as a single point of entry for the plurality of software systems. 5. The system of claim 1, wherein the computer processor is configured to handle the reception of the knowledge nugget as temporary content, and wherein the analyzing and storing comprise a purification and refining of the knowledge nugget. 6. The system of claim 1, wherein the information relating to the software architecture comprises standards, design and design patterns, intellectual property, and evaluations of the software architecture. 7. The system of claim 1, wherein the computer processor is configured to store the knowledge nugget in the permanent database when the creator of the knowledge nugget is a software architect or lead designer of the software architecture. 8. The system of claim 1, wherein the computer processor is configured such that only a specific person or persons can update or refine a knowledge nugget stored in the permanent database. 9. The system of claim 1, wherein the knowledge nugget comprises information for use in connection with a marketing phase, a design phase, a document creation phase, a knowledge generation phase, and an implementation phase of a software development lifecycle. 10. The system of claim 1, wherein the analysis comprises one or more of a statistical method and a polling among a plurality of persons. 11. The system of claim 10, wherein the computer processor is configured to display statistics and polling data relating to a knowledge nugget. 12. The system of claim 1, wherein the computer processor is configured to search the permanent database and to block searching of the transient database. 13. The system of claim 1, wherein the computer processor is configured to manage the analysis of the knowledge nugget by collecting input from a plurality of persons regarding the import and accuracy of the knowledge nugget. 14. The system of claim 13, wherein, based on the input from the plurality of persons regarding the import and accuracy of the knowledge nugget, the knowledge nugget is stored in the transient database or the knowledge nugget is stored in the permanent database. 15. The system of claim 1, wherein the computer processor is configured to select one or more persons to oversee the analysis of the knowledge nugget. 16. The system of claim 1, wherein the computer processor is embedded within a software development system, and wherein the computer processor is configured to handle actions relating to development of a software architecture and a software product development process. 17. The system of claim 1, wherein the toolbar comprises a plug-in to a software architecture system, a software product development system, or a collaborative system. 18. The system of claim 1, wherein the toolbar is embedded in an application configured to execute on the computer processor. 19. A computer-readable medium comprising instructions that when executed by a processor executes a process comprising:
receiving a knowledge nugget relating to a software architecture, the knowledge nugget comprising information relating to one or more of the software architecture, an identification of the creator of the knowledge nugget, a link to information relating to the knowledge nugget, a blog relating to the knowledge nugget, a tag to enable search and retrieval of the knowledge nugget, and a point of contact for discussion relating to the knowledge nugget; analyzing the knowledge nugget; and storing the knowledge nugget in a transient database or a permanent database as a function of the analysis. 20. The computer-readable medium of claim 19, comprising instructions for connecting a plurality of software systems and to act as a single point of entry for the plurality of software systems. 21. The computer-readable medium of claim 19, comprising instructions for handling the reception of the knowledge nugget as temporary content, wherein the instructions for analyzing and storing comprise a purification and refining of the knowledge nugget. 22. The computer-readable medium of claim 19, wherein the information relating to the software architecture comprises standards, design and design patterns, intellectual property, and evaluations of the software architecture. 23. The computer-readable medium of claim 19, comprising instructions for managing the analysis of the knowledge nugget by collecting input from a plurality of persons regarding the import and accuracy of the knowledge nugget; and
instructions for storing the knowledge nugget in the transient database or the permanent database as a function of the input from the plurality of persons regarding the import and accuracy of the knowledge nugget. 24. The computer-readable medium of claim 19, wherein the instructions are embedded within a software development system, and comprising instructions for handling actions relating to development of a software architecture and a software product development process. 25. The computer-readable medium of claim 19, wherein the toolbar comprises a plug-in to a software architecture system, a software product development system, or a collaborative system. 26. The computer-readable medium of claim 19, wherein the toolbar is embedded in a software application. 27. A process comprising:
receiving into a computer storage medium a knowledge nugget relating to a software architecture, the knowledge nugget comprising information relating to one or more of the software architecture, an identification of the creator of the knowledge nugget, a link to information relating to the knowledge nugget, a blog relating to the knowledge nugget, a tag to enable search and retrieval of the knowledge nugget, and a point of contact for discussion relating to the knowledge nugget;
analyzing with a computer processor the knowledge nugget; and
storing the knowledge nugget in a transient database or a permanent database as a function of the analysis. | 2,100 |
4,595 | 12,424,284 | 2,131 | An information handling system (IHS) includes a processor with a cache memory system. The processor includes a processor core with an L1 cache memory that couples to an L2 cache memory. The processor includes an arbitration mechanism that controls load and store requests to the L2 cache memory. The arbitration mechanism includes control logic that enables a load request to interrupt a store request that the L2 cache memory is currently servicing. When the L2 cache memory finishes servicing the interrupting load request, the L2 cache memory may return to servicing the interrupted store request at the point of interruption. | 1. A method comprising:
requesting, by a processor element, access to a cache memory to conduct operations in the cache memory, the operations including load operations and store operations; interrupting, by control logic, a store operation in progress in the cache memory when the processor element sends a load operation to the cache memory; performing, by the cache memory, the load operation; and scheduling, by the control logic, the store operation for access to the cache memory to conduct a remainder of the store operation after the load operation completes. 2. The method of claim 1, further comprising arbitrating, by an arbitration mechanism, to determine an order in which the cache memory performs load and store operations. 3. The method of claim 1, wherein the cache memory is an L2 cache memory. 4. The method of claim 1, wherein the processor element is a processor core that includes an L1 cache memory. 5. The method of claim 3, wherein the L2 cache memory is a store-in cache memory. 6. A method comprising:
sending, by a processor element, a plurality of requests for memory operations to a cache memory, the memory operations including load operations and store operations; receiving, by control logic for the cache memory, a request for a first load operation; performing, by the cache memory, the first load operation that the request for a first load operation specifies; receiving, by the control logic for the cache memory, a request for a first store operation; commencing, by the cache memory, performance of the first store operation that the request for first store operation specifies such that the first store operation is in progress; receiving, by the cache memory, a request for a second load operation while the first store operation is in progress in the cache memory; and interrupting, by the control logic, the in progress first store operation to perform the second load operation. 7. The method of claim 6, further comprising delaying, by the control logic, performance of a remaining portion of the first store operation until performance of the second load operation completes. 8. The method of claim 6, further comprising arbitrating, by an arbitration mechanism, to determine an order in which the cache memory performs the load and store operations. 9. The method of claim 6, wherein the cache memory is an L2 cache memory. 10. The method of claim 6, wherein the processor element is a processor core that includes an L1 cache memory. 11. A cache memory system comprising:
a processor element; a cache memory, coupled to the processor element, that receives a request from the processor element to conduct operations in the cache memory, the operations including load operations and store operations; the cache memory including control logic that interrupts a store operation in progress in the cache memory when the processor element sends a load operation to the cache memory, such that the cache memory performs the load operation instead of a remainder of the store operation, wherein the control logic schedules the remainder of the store operation for completion by the cache memory after the load operation completes. 12. The cache memory system of claim 11, further comprising an arbitration mechanism that arbitrates to determine an order in which the cache memory performs load and store operations. 13. The cache memory system of claim 11, wherein the cache memory is an L2 cache memory. 14. The cache memory system of claim 11, wherein the processor element is a processor core that includes an L1 cache memory. 15. The cache memory system of claim 13, wherein the L2 cache memory is a store-in cache memory 16. A information handling system (IHS), comprising:
a processor element; a cache memory, coupled to the processor element, that receives a request from the processor element to conduct operations in the cache memory, the operations including load operations and store operations; the cache memory including control logic that interrupts a store operation in progress in the cache memory when the processor element sends a load operation to the cache memory, such that the cache memory performs the load operation instead of a remainder of the store operation, wherein the control logic schedules the remainder of the store operation for completion by the cache memory after the load operation completes; and a system memory coupled to the cache memory. 17. The information handling system (IHS) of claim 16, further comprising an arbitration mechanism that arbitrates to determine an order in which the cache memory performs load and store operations. 18. The information handling system (IHS) of claim 16, wherein the cache memory is an L2 cache memory. 19. The information handling system (IHS) of claim 16, wherein the processor element is a processor core that includes an L1 cache memory. 20. The information handling system (IHS) of claim 18, wherein the L2 cache memory is a store-in cache memory. | An information handling system (IHS) includes a processor with a cache memory system. The processor includes a processor core with an L1 cache memory that couples to an L2 cache memory. The processor includes an arbitration mechanism that controls load and store requests to the L2 cache memory. The arbitration mechanism includes control logic that enables a load request to interrupt a store request that the L2 cache memory is currently servicing. When the L2 cache memory finishes servicing the interrupting load request, the L2 cache memory may return to servicing the interrupted store request at the point of interruption.1. A method comprising:
requesting, by a processor element, access to a cache memory to conduct operations in the cache memory, the operations including load operations and store operations; interrupting, by control logic, a store operation in progress in the cache memory when the processor element sends a load operation to the cache memory; performing, by the cache memory, the load operation; and scheduling, by the control logic, the store operation for access to the cache memory to conduct a remainder of the store operation after the load operation completes. 2. The method of claim 1, further comprising arbitrating, by an arbitration mechanism, to determine an order in which the cache memory performs load and store operations. 3. The method of claim 1, wherein the cache memory is an L2 cache memory. 4. The method of claim 1, wherein the processor element is a processor core that includes an L1 cache memory. 5. The method of claim 3, wherein the L2 cache memory is a store-in cache memory. 6. A method comprising:
sending, by a processor element, a plurality of requests for memory operations to a cache memory, the memory operations including load operations and store operations; receiving, by control logic for the cache memory, a request for a first load operation; performing, by the cache memory, the first load operation that the request for a first load operation specifies; receiving, by the control logic for the cache memory, a request for a first store operation; commencing, by the cache memory, performance of the first store operation that the request for first store operation specifies such that the first store operation is in progress; receiving, by the cache memory, a request for a second load operation while the first store operation is in progress in the cache memory; and interrupting, by the control logic, the in progress first store operation to perform the second load operation. 7. The method of claim 6, further comprising delaying, by the control logic, performance of a remaining portion of the first store operation until performance of the second load operation completes. 8. The method of claim 6, further comprising arbitrating, by an arbitration mechanism, to determine an order in which the cache memory performs the load and store operations. 9. The method of claim 6, wherein the cache memory is an L2 cache memory. 10. The method of claim 6, wherein the processor element is a processor core that includes an L1 cache memory. 11. A cache memory system comprising:
a processor element; a cache memory, coupled to the processor element, that receives a request from the processor element to conduct operations in the cache memory, the operations including load operations and store operations; the cache memory including control logic that interrupts a store operation in progress in the cache memory when the processor element sends a load operation to the cache memory, such that the cache memory performs the load operation instead of a remainder of the store operation, wherein the control logic schedules the remainder of the store operation for completion by the cache memory after the load operation completes. 12. The cache memory system of claim 11, further comprising an arbitration mechanism that arbitrates to determine an order in which the cache memory performs load and store operations. 13. The cache memory system of claim 11, wherein the cache memory is an L2 cache memory. 14. The cache memory system of claim 11, wherein the processor element is a processor core that includes an L1 cache memory. 15. The cache memory system of claim 13, wherein the L2 cache memory is a store-in cache memory 16. A information handling system (IHS), comprising:
a processor element; a cache memory, coupled to the processor element, that receives a request from the processor element to conduct operations in the cache memory, the operations including load operations and store operations; the cache memory including control logic that interrupts a store operation in progress in the cache memory when the processor element sends a load operation to the cache memory, such that the cache memory performs the load operation instead of a remainder of the store operation, wherein the control logic schedules the remainder of the store operation for completion by the cache memory after the load operation completes; and a system memory coupled to the cache memory. 17. The information handling system (IHS) of claim 16, further comprising an arbitration mechanism that arbitrates to determine an order in which the cache memory performs load and store operations. 18. The information handling system (IHS) of claim 16, wherein the cache memory is an L2 cache memory. 19. The information handling system (IHS) of claim 16, wherein the processor element is a processor core that includes an L1 cache memory. 20. The information handling system (IHS) of claim 18, wherein the L2 cache memory is a store-in cache memory. | 2,100 |
4,596 | 13,409,369 | 2,125 | A signature module calculates a signature during the execution of a program by a central processing unit based on program instructions to the central processing unit, and stores the signature in a signature register of the signature module. The signature module includes: a calculation unit configured to generate a signature value based on program instructions executed on the central processing unit; and an instruction information interface configured to receive at least one item of instruction information from the central processing unit which indicates whether an instruction currently being executed by the central processing unit was jumped to indirectly or directly. | 1. A device for executing a program, the device comprising:
a central processing unit; and a signature module configured to calculate a signature on the basis of instructions and to store the signature in a signature register, wherein calls of interrupt routines or subroutines occur during execution of the program by the central processing unit, wherein the device for executing the program is configured if a call of an interrupt routine takes place, to read out the signature assigned to the interrupted program from the signature module by means of a program instruction of the interrupt routine and to store the signature, and to write the stored signature to the signature module before leaving the interrupt routine by means of a program instruction of the interrupt routine, or if a call of a subroutine takes place, to adapt the signature in the signature register to a signature of the subroutine before the call of the subroutine by means of a program instruction that brings about a relative change in the signature, and, after a return from the subroutine, by means of a further program instruction that brings about a relative change in the signature, to adapt the signature in the signature register to a signature of the program section from which the call of the subroutine took place. 2. The device as claimed in claim 1, wherein the device for executing the program is further configured to carry out a check of the signature during the execution of the called interrupt routine or the called subroutine. 3. The device as claimed in claim 1, wherein the device for executing the program is further configured to activate a signature calculation for the interrupt routine or the subroutine. 4. The device as claimed in claim 1, wherein the device for executing the program is further configured to save, by means of a program instruction, a state of the signature module for a routine being executed at the point in time of the call of the interrupt routine or of the subroutine, and, before leaving the interrupt routine or the subroutine, to reestablish the state of the signature module for the routine being executed at the point in time of the call of the interrupt routine or of the subroutine, by means of a program instruction. 5. The device as claimed in claim 1, wherein, before a call of the subroutine takes place, the signature is updated by the corresponding program instruction for adapting the signature, such that, upon proper calling of the subroutine, the signature upon the call of the subroutine matches a start reference signature value assigned to a start of the subroutine. 6. The device as claimed in claim 1, wherein, after a return from the subroutine, the signature is updated by the corresponding program instruction for the relative change in the signature in such a way that, upon proper returning from the subroutine to the program, the signature at a defined point of the program matches a reference signature value of the program assigned to the defined point. 7. The device as claimed in claim 6, wherein the return from the subroutine is assigned an end reference signature value which the signature in the signature register matches upon proper execution of the subroutine and which is also assigned to a return destination in the calling program section as reference signature value, wherein the signature in the signature register remains the same upon the return and is checked by the calling program section or is updated by means of a relative change in the signature in such a way that at a point in the calling program section a resulting signature value, upon proper execution, matches a second reference signature value assigned to the point in the calling program section. 8. The device as claimed in claim 7, wherein the start reference signature value and/or the end reference signature value are derived as a function of an address or of a name of the subroutine. 9. The device as claimed in claim 7, wherein the start reference signature value and/or the end reference signature value are chosen randomly, differently in pairs, identically for groups of functions or identically in each case for all functions. 10. The device as claimed in claim 1, wherein the device for executing the program is further configured to update the signature in the context of the interrupt routine or the subroutine by means of a program instruction, such that, upon proper execution of the interrupt routine or of the subroutine, the signature at a defined point of the interrupt routine or of the subroutine matches a reference signature value assigned to the defined point of the interrupt routine or of the subroutine. 11. The device as claimed in claim 1, wherein the subroutine is called in the form of an indirect function call, and wherein the signature is adapted by determining an update value on the basis of a unique identifier of the subroutine and modifying the signature by means of the update value. 12. The device as claimed in claim 11, wherein the unique identifier of the indirectly called subroutine is based on at least one of: a memory address of the subroutine; a name of the subroutine; a result of an assignment mapping for the identifier; an entry in an assignment table for the identifier; and a fixed constant, which is identical for all indirectly called functions. 13. The device as claimed in claim 11, wherein the update value is determined by the evaluation of at least one of an evaluation of an update value mapping and an evaluation of an update value table. 14. The device as claimed in claim 1, wherein the signature module comprises the signature register. 15. The device as claimed in claim 1, wherein the signature module comprises a signature calculation unit configured to provide the signature which is stored in the signature register. 16. The device as claimed in claim 15, wherein the signature module comprises an interrupt information interface with the central processing unit configured to receive interrupt information from the central processing unit and an interrupt information evaluation unit configured to set an activity state of the signature calculation unit, such that the signature calculation unit is active when at least one first condition of the interrupt information is present, and that the signature calculation unit is inactive when at least one second condition is present, and the signature register maintains a signature determined last by the calculation unit over a corresponding inactivity period. 17. A device comprising a signature module configured to calculate a signature during execution of a program by a central processing unit based on program instructions to the central processing unit and to store the signature in a signature register of the signature module, the signature module comprising:
a calculation unit configured to generate a signature value based on program instructions executed on the central processing unit; an interrupt information interface configured to receive interrupt information from the central processing unit; and an interrupt information evaluation unit configured to determine an activity state of the calculation unit based on the interrupt information, such that the calculation unit is active when at least one first condition of the interrupt information is met, in order, in the course of an interrupt routine being carried out, to calculate a signature based on program instructions of the interrupt routine and to store it in the signature register, and that the calculation unit is inactive when at least one second condition is met, and the signature register maintains a signature determined last by the calculation unit. 18. The device as claimed in claim 17, wherein the interrupt information comprises an interrupt identifier indicating which interrupt is currently being executed on the central processing unit. 19. The device as claimed in claim 18, wherein the interrupt information evaluation unit comprises an identifier register configured to store a configured interrupt identifier indicating that the calculation unit is active for a current interrupt routine having a corresponding interrupt identifier. 20. The device as claimed in claim 19, wherein the interrupt information evaluation unit comprises a comparator configured to compare the interrupt identifier and the configured interrupt identifier. 21. The device as claimed in claim 19, wherein the identifier register is configured to store a configured activity state of the calculation unit, which state is taken into account when determining an activity state of the calculation unit. 22. The device as claimed in claim 19, further comprising a configuration interface configured to configure the identifier register by means of a program instruction. 23. A signature module configured to calculate a signature during the execution of a program by a central processing unit based on program instructions to the central processing unit and to store the signature in a signature register of the signature module, the signature module comprising:
a calculation unit configured to generate a signature value based on program instructions executed on the central processing unit; and an instruction information interface configured to receive at least one item of instruction information from the central processing unit which indicates whether an instruction currently being executed by the central processing unit was jumped to indirectly or directly. 24. The signature module as claimed in claim 23, wherein the signature module is configured to take account of the information provided via the instruction information interface in the signature calculation. 25. A method for calculating a signature based on instructions executed by a central processing unit during execution of a program, and for storing the signature in a signature register of a signature module, wherein interrupt requests or calls of subroutines occur during the execution of the program by the central processing unit, the method comprising:
reading out, if an interrupt request is received, the signature assigned to the interrupted program from the signature module by means of a program instruction of an interrupt routine assigned to the interrupt request, storing the signature by means of a program instruction of the interrupt routine, writing the stored signature to the signature module by means of a program instruction of the interrupt routine before leaving the interrupt routine, or, if a call of a subroutine takes place, adapting the signature in the signature register to a signature of the subroutine by means of a program instruction that brings about a relative change in the signature, before the call of the subroutine; and adapting the signature in the signature register to a signature of a program section of the program from which the subroutine was called, by means of a further program instruction that brings about a relative change in the signature, after a return from the subroutine to the program section. 26. The method as claimed in claim 25, further comprising checking the signature during execution of the called interrupt routine or the called subroutine. 27. The method as claimed in claim 25, further comprising activating a signature calculation for the interrupt routine or the subroutine. 28. The method as claimed in claim 25, further comprising:
saving a state of the signature module for a routine that is being executed at the point in time of the call of the interrupt routine or of the subroutine, by means of a program instruction; and reestablishing, by means of a program instruction before leaving the interrupt routine or if the return from the subroutine takes place, the state of the signature module for the routine being executed at the point in time of the call of the interrupt routine or subroutine. 29. The method as claimed in claim 25, wherein, if the return from the subroutine takes place, the signature is updated by the corresponding program instruction for adapting the signature in such a way that, upon proper return from the subroutine to the program, the signature at a defined point of the program matches a reference signature value of the program that is assigned to the defined point. 30. The method as claimed in claim 25, wherein after the return from the subroutine, the signature is updated by the corresponding program instruction for the relative change in the signature in such a way that, upon proper returning from the subroutine to the program, the signature at a defined point of the program matches a reference signature value of the program assigned to the defined point. 31. The method as claimed in claim 30, wherein the return from the subroutine is assigned an end reference signature value, which the signature in the signature register matches upon proper execution of the subroutine and which is also assigned to a return destination in the calling program section as reference signature value, wherein the signature in the signature register remains the same upon the return and is updated by the calling program section by means of a relative change in the signature in such a way that at a point in the calling program section a resulting signature value, upon proper execution, matches a second reference signature value assigned to the point in the calling program section. 32. The method as claimed in claim 31, wherein the start reference signature value and/or the end reference signature value are derived as a function of an address or of a name of the subroutine. 33. The method as claimed in claim 31, wherein the start reference signature value and/or the end reference signature value are chosen randomly or are identical in each case for all functions. 34. The method as claimed in claim 25, further comprising updating the signature in the context of the interrupt routine or the subroutine by means of a program instruction, such that, upon proper execution of the interrupt routine or of the subroutine, the signature at a defined point of the interrupt routine or of the subroutine matches a reference signature value assigned to the defined point of the interrupt routine or of the subroutine. 35. The method as claimed in claim 25, wherein the subroutine is called in the form of an indirect function call, and wherein the signature is adapted by determining an update value on the basis of a unique identifier of the subroutine and modifying the signature by means of the update value. 36. The method as claimed in claim 35, wherein the unique identifier of the indirectly called subroutine is based on at least one of: a memory address of the subroutine; a name of the subroutine; a result of an assignment mapping for the identifier; an entry in an assignment table for the identifier; and a fixed constant, which is identical for all indirectly called functions. 37. The method as claimed in claim 35, wherein determining the update value comprises the evaluation of at least one of an evaluation of an update value mapping and an evaluation of an update value table. 38. The method as claimed in claim 25, further comprising:
receiving interrupt information from the central processing unit via an interrupt information interface of the signature module; setting an activity state of the signature calculation, such that the signature calculation is active when at least one first condition is present, and that the signature calculation is inactive when at least one second condition is present; and maintaining a signature determined last over a corresponding inactivity period, if the signature calculation is inactive. 39. The method as claimed in claim 38, further comprising evaluating an interrupt identifier indicating which interrupt is currently being executed on the central processing unit. 40. The method as claimed in claim 39, further comprising storing a configured interrupt identifier in an identifier register of an interrupt information evaluation unit, wherein the configured interrupt identifier indicates that the signature calculation is active for a current interrupt routine having a corresponding interrupt identifier. 41. The method as claimed in claim 40, further comprising comparing the interrupt identifier and the configured interrupt identifier in order to conclude about the activity state of the signature calculation from a result of the comparison. 42. The method as claimed in claim 40, further comprising storing a configured activity state of the signature calculation, the state being taken into account when determining the activity state of the signature calculation. 43. The method as claimed in claim 40, further comprising configuring an identifier register by means of a program instruction. 44. The method as claimed in claim 25, further comprising receiving an interrupt request and executing a corresponding context change before storing the signature assigned to the interrupted program. | A signature module calculates a signature during the execution of a program by a central processing unit based on program instructions to the central processing unit, and stores the signature in a signature register of the signature module. The signature module includes: a calculation unit configured to generate a signature value based on program instructions executed on the central processing unit; and an instruction information interface configured to receive at least one item of instruction information from the central processing unit which indicates whether an instruction currently being executed by the central processing unit was jumped to indirectly or directly.1. A device for executing a program, the device comprising:
a central processing unit; and a signature module configured to calculate a signature on the basis of instructions and to store the signature in a signature register, wherein calls of interrupt routines or subroutines occur during execution of the program by the central processing unit, wherein the device for executing the program is configured if a call of an interrupt routine takes place, to read out the signature assigned to the interrupted program from the signature module by means of a program instruction of the interrupt routine and to store the signature, and to write the stored signature to the signature module before leaving the interrupt routine by means of a program instruction of the interrupt routine, or if a call of a subroutine takes place, to adapt the signature in the signature register to a signature of the subroutine before the call of the subroutine by means of a program instruction that brings about a relative change in the signature, and, after a return from the subroutine, by means of a further program instruction that brings about a relative change in the signature, to adapt the signature in the signature register to a signature of the program section from which the call of the subroutine took place. 2. The device as claimed in claim 1, wherein the device for executing the program is further configured to carry out a check of the signature during the execution of the called interrupt routine or the called subroutine. 3. The device as claimed in claim 1, wherein the device for executing the program is further configured to activate a signature calculation for the interrupt routine or the subroutine. 4. The device as claimed in claim 1, wherein the device for executing the program is further configured to save, by means of a program instruction, a state of the signature module for a routine being executed at the point in time of the call of the interrupt routine or of the subroutine, and, before leaving the interrupt routine or the subroutine, to reestablish the state of the signature module for the routine being executed at the point in time of the call of the interrupt routine or of the subroutine, by means of a program instruction. 5. The device as claimed in claim 1, wherein, before a call of the subroutine takes place, the signature is updated by the corresponding program instruction for adapting the signature, such that, upon proper calling of the subroutine, the signature upon the call of the subroutine matches a start reference signature value assigned to a start of the subroutine. 6. The device as claimed in claim 1, wherein, after a return from the subroutine, the signature is updated by the corresponding program instruction for the relative change in the signature in such a way that, upon proper returning from the subroutine to the program, the signature at a defined point of the program matches a reference signature value of the program assigned to the defined point. 7. The device as claimed in claim 6, wherein the return from the subroutine is assigned an end reference signature value which the signature in the signature register matches upon proper execution of the subroutine and which is also assigned to a return destination in the calling program section as reference signature value, wherein the signature in the signature register remains the same upon the return and is checked by the calling program section or is updated by means of a relative change in the signature in such a way that at a point in the calling program section a resulting signature value, upon proper execution, matches a second reference signature value assigned to the point in the calling program section. 8. The device as claimed in claim 7, wherein the start reference signature value and/or the end reference signature value are derived as a function of an address or of a name of the subroutine. 9. The device as claimed in claim 7, wherein the start reference signature value and/or the end reference signature value are chosen randomly, differently in pairs, identically for groups of functions or identically in each case for all functions. 10. The device as claimed in claim 1, wherein the device for executing the program is further configured to update the signature in the context of the interrupt routine or the subroutine by means of a program instruction, such that, upon proper execution of the interrupt routine or of the subroutine, the signature at a defined point of the interrupt routine or of the subroutine matches a reference signature value assigned to the defined point of the interrupt routine or of the subroutine. 11. The device as claimed in claim 1, wherein the subroutine is called in the form of an indirect function call, and wherein the signature is adapted by determining an update value on the basis of a unique identifier of the subroutine and modifying the signature by means of the update value. 12. The device as claimed in claim 11, wherein the unique identifier of the indirectly called subroutine is based on at least one of: a memory address of the subroutine; a name of the subroutine; a result of an assignment mapping for the identifier; an entry in an assignment table for the identifier; and a fixed constant, which is identical for all indirectly called functions. 13. The device as claimed in claim 11, wherein the update value is determined by the evaluation of at least one of an evaluation of an update value mapping and an evaluation of an update value table. 14. The device as claimed in claim 1, wherein the signature module comprises the signature register. 15. The device as claimed in claim 1, wherein the signature module comprises a signature calculation unit configured to provide the signature which is stored in the signature register. 16. The device as claimed in claim 15, wherein the signature module comprises an interrupt information interface with the central processing unit configured to receive interrupt information from the central processing unit and an interrupt information evaluation unit configured to set an activity state of the signature calculation unit, such that the signature calculation unit is active when at least one first condition of the interrupt information is present, and that the signature calculation unit is inactive when at least one second condition is present, and the signature register maintains a signature determined last by the calculation unit over a corresponding inactivity period. 17. A device comprising a signature module configured to calculate a signature during execution of a program by a central processing unit based on program instructions to the central processing unit and to store the signature in a signature register of the signature module, the signature module comprising:
a calculation unit configured to generate a signature value based on program instructions executed on the central processing unit; an interrupt information interface configured to receive interrupt information from the central processing unit; and an interrupt information evaluation unit configured to determine an activity state of the calculation unit based on the interrupt information, such that the calculation unit is active when at least one first condition of the interrupt information is met, in order, in the course of an interrupt routine being carried out, to calculate a signature based on program instructions of the interrupt routine and to store it in the signature register, and that the calculation unit is inactive when at least one second condition is met, and the signature register maintains a signature determined last by the calculation unit. 18. The device as claimed in claim 17, wherein the interrupt information comprises an interrupt identifier indicating which interrupt is currently being executed on the central processing unit. 19. The device as claimed in claim 18, wherein the interrupt information evaluation unit comprises an identifier register configured to store a configured interrupt identifier indicating that the calculation unit is active for a current interrupt routine having a corresponding interrupt identifier. 20. The device as claimed in claim 19, wherein the interrupt information evaluation unit comprises a comparator configured to compare the interrupt identifier and the configured interrupt identifier. 21. The device as claimed in claim 19, wherein the identifier register is configured to store a configured activity state of the calculation unit, which state is taken into account when determining an activity state of the calculation unit. 22. The device as claimed in claim 19, further comprising a configuration interface configured to configure the identifier register by means of a program instruction. 23. A signature module configured to calculate a signature during the execution of a program by a central processing unit based on program instructions to the central processing unit and to store the signature in a signature register of the signature module, the signature module comprising:
a calculation unit configured to generate a signature value based on program instructions executed on the central processing unit; and an instruction information interface configured to receive at least one item of instruction information from the central processing unit which indicates whether an instruction currently being executed by the central processing unit was jumped to indirectly or directly. 24. The signature module as claimed in claim 23, wherein the signature module is configured to take account of the information provided via the instruction information interface in the signature calculation. 25. A method for calculating a signature based on instructions executed by a central processing unit during execution of a program, and for storing the signature in a signature register of a signature module, wherein interrupt requests or calls of subroutines occur during the execution of the program by the central processing unit, the method comprising:
reading out, if an interrupt request is received, the signature assigned to the interrupted program from the signature module by means of a program instruction of an interrupt routine assigned to the interrupt request, storing the signature by means of a program instruction of the interrupt routine, writing the stored signature to the signature module by means of a program instruction of the interrupt routine before leaving the interrupt routine, or, if a call of a subroutine takes place, adapting the signature in the signature register to a signature of the subroutine by means of a program instruction that brings about a relative change in the signature, before the call of the subroutine; and adapting the signature in the signature register to a signature of a program section of the program from which the subroutine was called, by means of a further program instruction that brings about a relative change in the signature, after a return from the subroutine to the program section. 26. The method as claimed in claim 25, further comprising checking the signature during execution of the called interrupt routine or the called subroutine. 27. The method as claimed in claim 25, further comprising activating a signature calculation for the interrupt routine or the subroutine. 28. The method as claimed in claim 25, further comprising:
saving a state of the signature module for a routine that is being executed at the point in time of the call of the interrupt routine or of the subroutine, by means of a program instruction; and reestablishing, by means of a program instruction before leaving the interrupt routine or if the return from the subroutine takes place, the state of the signature module for the routine being executed at the point in time of the call of the interrupt routine or subroutine. 29. The method as claimed in claim 25, wherein, if the return from the subroutine takes place, the signature is updated by the corresponding program instruction for adapting the signature in such a way that, upon proper return from the subroutine to the program, the signature at a defined point of the program matches a reference signature value of the program that is assigned to the defined point. 30. The method as claimed in claim 25, wherein after the return from the subroutine, the signature is updated by the corresponding program instruction for the relative change in the signature in such a way that, upon proper returning from the subroutine to the program, the signature at a defined point of the program matches a reference signature value of the program assigned to the defined point. 31. The method as claimed in claim 30, wherein the return from the subroutine is assigned an end reference signature value, which the signature in the signature register matches upon proper execution of the subroutine and which is also assigned to a return destination in the calling program section as reference signature value, wherein the signature in the signature register remains the same upon the return and is updated by the calling program section by means of a relative change in the signature in such a way that at a point in the calling program section a resulting signature value, upon proper execution, matches a second reference signature value assigned to the point in the calling program section. 32. The method as claimed in claim 31, wherein the start reference signature value and/or the end reference signature value are derived as a function of an address or of a name of the subroutine. 33. The method as claimed in claim 31, wherein the start reference signature value and/or the end reference signature value are chosen randomly or are identical in each case for all functions. 34. The method as claimed in claim 25, further comprising updating the signature in the context of the interrupt routine or the subroutine by means of a program instruction, such that, upon proper execution of the interrupt routine or of the subroutine, the signature at a defined point of the interrupt routine or of the subroutine matches a reference signature value assigned to the defined point of the interrupt routine or of the subroutine. 35. The method as claimed in claim 25, wherein the subroutine is called in the form of an indirect function call, and wherein the signature is adapted by determining an update value on the basis of a unique identifier of the subroutine and modifying the signature by means of the update value. 36. The method as claimed in claim 35, wherein the unique identifier of the indirectly called subroutine is based on at least one of: a memory address of the subroutine; a name of the subroutine; a result of an assignment mapping for the identifier; an entry in an assignment table for the identifier; and a fixed constant, which is identical for all indirectly called functions. 37. The method as claimed in claim 35, wherein determining the update value comprises the evaluation of at least one of an evaluation of an update value mapping and an evaluation of an update value table. 38. The method as claimed in claim 25, further comprising:
receiving interrupt information from the central processing unit via an interrupt information interface of the signature module; setting an activity state of the signature calculation, such that the signature calculation is active when at least one first condition is present, and that the signature calculation is inactive when at least one second condition is present; and maintaining a signature determined last over a corresponding inactivity period, if the signature calculation is inactive. 39. The method as claimed in claim 38, further comprising evaluating an interrupt identifier indicating which interrupt is currently being executed on the central processing unit. 40. The method as claimed in claim 39, further comprising storing a configured interrupt identifier in an identifier register of an interrupt information evaluation unit, wherein the configured interrupt identifier indicates that the signature calculation is active for a current interrupt routine having a corresponding interrupt identifier. 41. The method as claimed in claim 40, further comprising comparing the interrupt identifier and the configured interrupt identifier in order to conclude about the activity state of the signature calculation from a result of the comparison. 42. The method as claimed in claim 40, further comprising storing a configured activity state of the signature calculation, the state being taken into account when determining the activity state of the signature calculation. 43. The method as claimed in claim 40, further comprising configuring an identifier register by means of a program instruction. 44. The method as claimed in claim 25, further comprising receiving an interrupt request and executing a corresponding context change before storing the signature assigned to the interrupted program. | 2,100 |
4,597 | 13,873,587 | 2,124 | A method of building a classification model using a SVM training module comprising, with a processor, computing a mean value of a number of training vectors received by the processor, subtracting the mean value of the number of training vectors from each training vector received by the processor to obtain a number of difference vectors, applying a hash function to each of the difference vectors to obtain a number of hashed vectors, and applying a linear training formula to the hashed vectors to obtain a classifier model. Classifying a sample vector comprises, with a processor, subtracting a mean value of a number of support vector machine training vectors from the sample vector to obtain a sample difference vector, with a processor, applying a hash function to the sample difference vector to obtain a hashed sample vector, and classifying the hashed sample vector using a classifier model. | 1. A method of building a classification model using a SVM training module comprising:
with a processor: computing a mean value of a number of training vectors received by the processor; subtracting the mean value of the number of training vectors from each training vector received by the processor to obtain a number of difference vectors; applying a hash function to each of the difference vectors to obtain a number of hashed vectors; and applying a linear training formula to the hashed vectors to obtain a classifier model. 2. The method of claim 1, further comprising classifying a sample vector received by the processor by:
subtracting the mean value of the number of training vectors from the sample vector to obtain a sample difference vector; applying the hash function to the sample difference vector to obtain a hashed sample vector; and classifying the hashed sample vector using the classifier model. 3. The method of claim 1, in which the hash function is a concomitant rank order (CRO) hash function. 4. The method of claim 1, in which the linear training formula is Liblinear. 5. The method of claim 1, in which computing a mean value of a number of training vectors comprises adding a number of training vectors together and then dividing a resulting vector by the number of training vectors. 6. A computer program product for building a classification model, the computer program product comprising:
a computer readable storage medium comprising computer usable program code embodied therewith, the computer usable program code comprising:
computer usable program code to, when executed by a processor, compute a mean value of a number of training vectors received by the processor;
computer usable program code to, when executed by a processor, subtract the mean value of the number of training vectors from each training vector received by the processor to obtain a number of difference vectors;
computer usable program code to, when executed by a processor, apply a hash function to each of the difference vectors to obtain a number of hashed vector; and
computer usable program code to, when executed by a processor, apply a linear training formula to the hashed vectors to obtain a classifier model. 7. The computer program product of claim 6, further comprising:
computer usable program code to, when executed by a processor, subtract the mean value of the number of training vectors from the sample vector to obtain a sample difference vector; computer usable program code to, when executed by a processor, apply the hash function to the sample difference vector to obtain a hashed sample vector; and computer usable program code to, when executed by a processor, classify the hashed sample vector using the classifier model. 8. The computer program product of claim 6, in which the hash function is a concomitant rank order (CRO) hash function. 9. The computer program product of claim 6, in which the linear training formula is Liblinear. 10. The computer program product of claim 6, in which the computer usable program code to compute a mean value of a number of training vectors comprises computer usable program code to, when executed by a processor, add a number of training vectors together and then dividing a resulting vector by the number of training vectors. 11. A method of classifying a sample vector extracted from input data using a support vector machine, comprising:
with a processor, subtracting a mean value of a number of support vector machine training vectors from the sample vector to obtain a sample difference vector; with a processor, applying a hash function to the sample difference vector to obtain a hashed sample vector; and classifying the hashed sample vector using a classifier model. 12. The method of claim 11, in which the mean value of a number of support vector machine training vectors is obtained previous to classifying the sample vector by adding the number of support vector machine training vectors together and dividing the resulting vector by the number of training vectors. 13. The method of claim 11, in which the hash function is a concomitant rank order (CRO) hash function. 14. The method of claim 13, in which the concomitant rank order (CRO) hash function maps k dimensional real vectors to sparse U dimensional vectors. 15. The method of claim 11, in which the input data is a digital picture. | A method of building a classification model using a SVM training module comprising, with a processor, computing a mean value of a number of training vectors received by the processor, subtracting the mean value of the number of training vectors from each training vector received by the processor to obtain a number of difference vectors, applying a hash function to each of the difference vectors to obtain a number of hashed vectors, and applying a linear training formula to the hashed vectors to obtain a classifier model. Classifying a sample vector comprises, with a processor, subtracting a mean value of a number of support vector machine training vectors from the sample vector to obtain a sample difference vector, with a processor, applying a hash function to the sample difference vector to obtain a hashed sample vector, and classifying the hashed sample vector using a classifier model.1. A method of building a classification model using a SVM training module comprising:
with a processor: computing a mean value of a number of training vectors received by the processor; subtracting the mean value of the number of training vectors from each training vector received by the processor to obtain a number of difference vectors; applying a hash function to each of the difference vectors to obtain a number of hashed vectors; and applying a linear training formula to the hashed vectors to obtain a classifier model. 2. The method of claim 1, further comprising classifying a sample vector received by the processor by:
subtracting the mean value of the number of training vectors from the sample vector to obtain a sample difference vector; applying the hash function to the sample difference vector to obtain a hashed sample vector; and classifying the hashed sample vector using the classifier model. 3. The method of claim 1, in which the hash function is a concomitant rank order (CRO) hash function. 4. The method of claim 1, in which the linear training formula is Liblinear. 5. The method of claim 1, in which computing a mean value of a number of training vectors comprises adding a number of training vectors together and then dividing a resulting vector by the number of training vectors. 6. A computer program product for building a classification model, the computer program product comprising:
a computer readable storage medium comprising computer usable program code embodied therewith, the computer usable program code comprising:
computer usable program code to, when executed by a processor, compute a mean value of a number of training vectors received by the processor;
computer usable program code to, when executed by a processor, subtract the mean value of the number of training vectors from each training vector received by the processor to obtain a number of difference vectors;
computer usable program code to, when executed by a processor, apply a hash function to each of the difference vectors to obtain a number of hashed vector; and
computer usable program code to, when executed by a processor, apply a linear training formula to the hashed vectors to obtain a classifier model. 7. The computer program product of claim 6, further comprising:
computer usable program code to, when executed by a processor, subtract the mean value of the number of training vectors from the sample vector to obtain a sample difference vector; computer usable program code to, when executed by a processor, apply the hash function to the sample difference vector to obtain a hashed sample vector; and computer usable program code to, when executed by a processor, classify the hashed sample vector using the classifier model. 8. The computer program product of claim 6, in which the hash function is a concomitant rank order (CRO) hash function. 9. The computer program product of claim 6, in which the linear training formula is Liblinear. 10. The computer program product of claim 6, in which the computer usable program code to compute a mean value of a number of training vectors comprises computer usable program code to, when executed by a processor, add a number of training vectors together and then dividing a resulting vector by the number of training vectors. 11. A method of classifying a sample vector extracted from input data using a support vector machine, comprising:
with a processor, subtracting a mean value of a number of support vector machine training vectors from the sample vector to obtain a sample difference vector; with a processor, applying a hash function to the sample difference vector to obtain a hashed sample vector; and classifying the hashed sample vector using a classifier model. 12. The method of claim 11, in which the mean value of a number of support vector machine training vectors is obtained previous to classifying the sample vector by adding the number of support vector machine training vectors together and dividing the resulting vector by the number of training vectors. 13. The method of claim 11, in which the hash function is a concomitant rank order (CRO) hash function. 14. The method of claim 13, in which the concomitant rank order (CRO) hash function maps k dimensional real vectors to sparse U dimensional vectors. 15. The method of claim 11, in which the input data is a digital picture. | 2,100 |
4,598 | 14,086,433 | 2,199 | The present invention discloses a method and apparatus for function calling that eliminates or reduces errors caused by calling convention mismatch by preparing a number of candidate code modules during program compiling and inserting them in a compiled program. A library of compiled candidate code modules is thus included in the complied program, which allows the user to call a function by specifying a function to be called and a library where it belongs in the source program, without need to know the calling convention thereof or to focus on the call execution process. This ensures the matching of calling convention between the caller and callee of the function while being transparent to users, so as to avoid problems caused by calling convention inconsistency. | 1. A method for function calling, comprising:
in response to detection of a function call in a program, obtaining a plurality of candidate code modules for executing the function call, the plurality of candidate code modules complying with a plurality of calling conventions respectively; obtaining a specific calling convention used by a called function; according to the specific calling convention obtained, selecting from the plurality of candidate code modules a code module which complies with the specific calling convention to execute the function call. 2. The method according to claim 1, wherein obtaining a plurality of candidate code modules comprises, in response to the called function being a function from an external function library, obtaining the plurality of candidate code modules. 3. The method according to claim 1, wherein at least one of the plurality of candidate code modules comprises: a prologue for performing the preparatory work before the function call; a main body for executing the function call; and an epilogue for performing clean up after the function call. 4. The method according to claim 1, wherein obtaining the specific calling convention used by a called function comprises, querying load information of the called function in the program runtime to determine the specific calling convention. 5. The method according to claim 4, wherein querying load information of the called function in the program runtime to determine the specific calling convention comprises:
issuing a query request to the program runtime, which includes identification information of the called function; in response to the query request, obtaining a decorated name of the called function; and determining the specific calling convention corresponding to the called function based on the decorated name. 6. The method according to claim 5, wherein obtaining a decorated name of the called function comprises:
performing name demangling based on the identification information of the called function to obtain an original function name; and obtaining the decorated name of the called function in the function library based on the original function name. 7. The method according to claim 4, wherein obtaining the specific calling convention further comprises recording the determined specific calling convention, in order to directly obtain the specific calling convention when the called function is called again. 8. The method according to claim 7, wherein recording the determined specific calling convention comprises: recording an index corresponding to the specific calling convention, and modifying a first address, which points to a code segment for querying the load information, to a second address, which points to a code module corresponding to the index of the specific calling convention among the plurality of code modules. 9. An apparatus for function calling, comprising:
a code module obtaining unit configured to, in response to detection of a function call in a program, obtain a plurality of candidate code modules for executing the function call, the plurality of candidate code modules complying with a plurality of calling conventions respectively; a calling convention obtaining unit configured to obtain a specific calling convention used by a called function; and a code module selection unit configured to, according to the specific calling convention obtained, select from the plurality of candidate code modules a code module which complies with the specific calling convention to execute the function call. 10. The apparatus according to claim 9, wherein the code module obtaining unit is configured to, in response to the called function being a function from an external function library, obtain the plurality of candidate code modules. 11. The apparatus according to claim 9, wherein at least one of the plurality of candidate code modules comprises: a prologue for performing the preparatory work before the function call; a main body for executing the function call; and an epilogue for performing clean up after the function call. 12. The apparatus according to claim 9, wherein the calling convention obtaining unit comprises a calling convention determination sub-unit configured to determine the specific calling convention by querying load information of the called function in the program runtime. 13. The apparatus according to claim 12, wherein the calling convention determination sub-unit is configured to:
issue a query request to the program runtime, which includes identification information of the called function; in response to the query request, obtain a decorated name of the called function; and determine the specific calling convention corresponding to the called function based on the decorated name. 14. The apparatus according to claim 13, wherein the calling convention determination sub-unit is configured to:
perform name demangling based on the identification information of the called function to obtain an original function name; and obtain the decorated name of the called function in the function library based on the original function name. 15. The apparatus according to claim 12, wherein the calling convention obtaining unit further comprises a recording sub-unit configured to record the determined specific calling convention, in order to directly obtain the specific calling convention when the called function is called again. 16. The apparatus according to claim 15, wherein the recording sub-unit is configured to record an index corresponding to the specific calling convention, and modify a first address, which points to a code segment for querying the load information, to a second address, which points to code module corresponding to the index of the specific calling convention among the plurality of code modules. 17. A computer program product for calling functions, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a computer to perform a method comprising:
in response to detection of a function call in a program, obtaining a plurality of candidate code modules for executing the function call, the plurality of candidate code modules complying with a plurality of calling conventions respectively; obtaining a specific calling convention used by a called function; according to the specific calling convention obtained, selecting from the plurality of candidate code modules a code module which complies with the specific calling convention to execute the function call. 18. The computer program product according to claim 17, wherein obtaining a plurality of candidate code modules comprises, in response to the called function being a function from an external function library, obtaining the plurality of candidate code modules. 19. The computer program product according to claim 17, wherein at least one of the plurality of candidate code modules comprises: a prologue for performing the preparatory work before the function call; a main body for executing the function call; and an epilogue for performing clean up after the function call. 20. The computer program product according to claim 17, wherein obtaining the specific calling convention used by a called function comprises, querying load information of the called function in the program runtime to determine the specific calling convention. | The present invention discloses a method and apparatus for function calling that eliminates or reduces errors caused by calling convention mismatch by preparing a number of candidate code modules during program compiling and inserting them in a compiled program. A library of compiled candidate code modules is thus included in the complied program, which allows the user to call a function by specifying a function to be called and a library where it belongs in the source program, without need to know the calling convention thereof or to focus on the call execution process. This ensures the matching of calling convention between the caller and callee of the function while being transparent to users, so as to avoid problems caused by calling convention inconsistency.1. A method for function calling, comprising:
in response to detection of a function call in a program, obtaining a plurality of candidate code modules for executing the function call, the plurality of candidate code modules complying with a plurality of calling conventions respectively; obtaining a specific calling convention used by a called function; according to the specific calling convention obtained, selecting from the plurality of candidate code modules a code module which complies with the specific calling convention to execute the function call. 2. The method according to claim 1, wherein obtaining a plurality of candidate code modules comprises, in response to the called function being a function from an external function library, obtaining the plurality of candidate code modules. 3. The method according to claim 1, wherein at least one of the plurality of candidate code modules comprises: a prologue for performing the preparatory work before the function call; a main body for executing the function call; and an epilogue for performing clean up after the function call. 4. The method according to claim 1, wherein obtaining the specific calling convention used by a called function comprises, querying load information of the called function in the program runtime to determine the specific calling convention. 5. The method according to claim 4, wherein querying load information of the called function in the program runtime to determine the specific calling convention comprises:
issuing a query request to the program runtime, which includes identification information of the called function; in response to the query request, obtaining a decorated name of the called function; and determining the specific calling convention corresponding to the called function based on the decorated name. 6. The method according to claim 5, wherein obtaining a decorated name of the called function comprises:
performing name demangling based on the identification information of the called function to obtain an original function name; and obtaining the decorated name of the called function in the function library based on the original function name. 7. The method according to claim 4, wherein obtaining the specific calling convention further comprises recording the determined specific calling convention, in order to directly obtain the specific calling convention when the called function is called again. 8. The method according to claim 7, wherein recording the determined specific calling convention comprises: recording an index corresponding to the specific calling convention, and modifying a first address, which points to a code segment for querying the load information, to a second address, which points to a code module corresponding to the index of the specific calling convention among the plurality of code modules. 9. An apparatus for function calling, comprising:
a code module obtaining unit configured to, in response to detection of a function call in a program, obtain a plurality of candidate code modules for executing the function call, the plurality of candidate code modules complying with a plurality of calling conventions respectively; a calling convention obtaining unit configured to obtain a specific calling convention used by a called function; and a code module selection unit configured to, according to the specific calling convention obtained, select from the plurality of candidate code modules a code module which complies with the specific calling convention to execute the function call. 10. The apparatus according to claim 9, wherein the code module obtaining unit is configured to, in response to the called function being a function from an external function library, obtain the plurality of candidate code modules. 11. The apparatus according to claim 9, wherein at least one of the plurality of candidate code modules comprises: a prologue for performing the preparatory work before the function call; a main body for executing the function call; and an epilogue for performing clean up after the function call. 12. The apparatus according to claim 9, wherein the calling convention obtaining unit comprises a calling convention determination sub-unit configured to determine the specific calling convention by querying load information of the called function in the program runtime. 13. The apparatus according to claim 12, wherein the calling convention determination sub-unit is configured to:
issue a query request to the program runtime, which includes identification information of the called function; in response to the query request, obtain a decorated name of the called function; and determine the specific calling convention corresponding to the called function based on the decorated name. 14. The apparatus according to claim 13, wherein the calling convention determination sub-unit is configured to:
perform name demangling based on the identification information of the called function to obtain an original function name; and obtain the decorated name of the called function in the function library based on the original function name. 15. The apparatus according to claim 12, wherein the calling convention obtaining unit further comprises a recording sub-unit configured to record the determined specific calling convention, in order to directly obtain the specific calling convention when the called function is called again. 16. The apparatus according to claim 15, wherein the recording sub-unit is configured to record an index corresponding to the specific calling convention, and modify a first address, which points to a code segment for querying the load information, to a second address, which points to code module corresponding to the index of the specific calling convention among the plurality of code modules. 17. A computer program product for calling functions, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a computer to perform a method comprising:
in response to detection of a function call in a program, obtaining a plurality of candidate code modules for executing the function call, the plurality of candidate code modules complying with a plurality of calling conventions respectively; obtaining a specific calling convention used by a called function; according to the specific calling convention obtained, selecting from the plurality of candidate code modules a code module which complies with the specific calling convention to execute the function call. 18. The computer program product according to claim 17, wherein obtaining a plurality of candidate code modules comprises, in response to the called function being a function from an external function library, obtaining the plurality of candidate code modules. 19. The computer program product according to claim 17, wherein at least one of the plurality of candidate code modules comprises: a prologue for performing the preparatory work before the function call; a main body for executing the function call; and an epilogue for performing clean up after the function call. 20. The computer program product according to claim 17, wherein obtaining the specific calling convention used by a called function comprises, querying load information of the called function in the program runtime to determine the specific calling convention. | 2,100 |
4,599 | 11,844,833 | 2,176 | Embodiments of the present invention address deficiencies of the art in respect to data visualization and provide a novel and non-obvious method, system and computer program product for doubly linked visual discussions for data visualization. In one embodiment of the invention, a method for doubly-linked data visualization can be provided. The method can include rendering a data visualization in a data visualization service user interface, identifying comments corresponding to the rendered data visualization, concurrently displaying the identified comments in the user interface, selecting a comment in the user interface, and replacing the rendered data visualization in the user interface with a different data visualization corresponding to the selected comment. | 1. A method for doubly-linked data visualization, the method comprising:
rendering a data visualization in a data visualization service user interface; identifying comments corresponding to the rendered data visualization; concurrently displaying the identified comments in the user interface; selecting a comment in the user interface; and, replacing the rendered data visualization in the user interface with a different data visualization corresponding to the selected comment. 2. The method of claim 1, wherein rendering a data visualization in a data visualization service user interface, comprises:
uploading a data subset from over a computer communications network; selecting a data visualization type for the uploaded data subset; generating a data visualization of the selected data visualization type for the uploaded data subset; and, displaying the generated data visualization in the user interface. 3. The method of claim 2, further comprising:
bookmarking different data visualizations for the uploaded data subset; displaying different bookmarks for the different data visualizations in the user interface; selecting one of the different bookmarks; and, replacing the rendered data visualization in the user interface with a different data visualization corresponding to the selected one of the different bookmarks. 4. The method of claim 1, wherein identifying comments corresponding to the rendered data visualization, comprises identifying comments corresponding to visible data in the rendered data visualization 5. The method of claim 1, wherein identifying comments corresponding to the rendered data visualization, comprises identifying comments corresponding to hash value computed for visible data in the rendered data visualization 6. The method of claim 2, wherein displaying the generated data visualization in the user interface, comprises displaying the generated data visualization in a Web page in a content browser. 7. The method of claim 1, further comprising:
composing a comment pertaining to the rendered data visualization in the user interface; associating the composed comment with the rendered data visualization in the user interface; and, displaying the composed comment responsive to a display of the rendered data visualization in the user interface. 8. A data visualization data processing system comprising:
a server; a data visualization processor executing in the server; a data visualization service coupled to the data visualization processor and executing in the server; and, doubly-linked visual discussions logic coupled to the data visualization service, the logic comprising program code enabled to identify comments in a user interface for the data visualization service corresponding to a rendered data visualization, to concurrently displaying the identified comments in the user interface, and to replace the rendered data visualization in the user interface with a different data visualization corresponding to a selected comment in the user interface. 9. The system of claim 8, wherein the user interface is a Web page. 10. The system of claim 8, further comprising a bookmark view comprising a plurality of selectable bookmarks each of the bookmarks corresponding to a different data visualization for an uploaded data set. 11. A computer program product comprising a computer usable medium embodying computer usable program code for doubly-linked data visualization, the computer program product comprising:
computer usable program code for rendering a data visualization in a data visualization service user interface; computer usable program code for identifying comments corresponding to the rendered data visualization; computer usable program code for concurrently displaying the identified comments in the user interface; computer usable program code for selecting a comment in the user interface; and, computer usable program code for replacing the rendered data visualization in the user interface with a different data visualization corresponding to the selected comment. 12. The computer program product of claim 11, wherein the computer usable program code for rendering a data visualization in a data visualization service user interface, comprises:
computer usable program code for uploading a data subset from over a computer communications network; computer usable program code for selecting a data visualization type for the uploaded data subset; computer usable program code for generating a data visualization of the selected data visualization type for the uploaded data subset; and, computer usable program code for displaying the generated data visualization in the user interface. 13. The computer program product of claim 12, further comprising:
computer usable program code for bookmarking different data visualizations for the uploaded data subset; computer usable program code for displaying different bookmarks for the different data visualizations in the user interface; computer usable program code for selecting one of the different bookmarks; and, computer usable program code for replacing the rendered data visualization in the user interface with a different data visualization corresponding to the selected one of the different bookmarks. 14. The computer program product of claim 11, wherein identifying comments corresponding to the rendered data visualization, comprises identifying comments corresponding to visible data in the rendered data visualization 15. The computer program product of claim 11, wherein identifying comments corresponding to the rendered data visualization, comprises identifying comments corresponding to hash value computed for visible data in the rendered data visualization 16. The computer program product of claim 12, wherein the computer usable program code for displaying the generated data visualization in the user interface, comprises computer usable program code for displaying the generated data visualization in a Web page in a content browser. 17. The computer program product of claim 11, further comprising:
computer usable program code for composing a comment pertaining to the rendered data visualization in the user interface; computer usable program code for associating the composed comment with the rendered data visualization in the user interface; and, computer usable program code for displaying the composed comment responsive to a display of the rendered data visualization in the user interface. | Embodiments of the present invention address deficiencies of the art in respect to data visualization and provide a novel and non-obvious method, system and computer program product for doubly linked visual discussions for data visualization. In one embodiment of the invention, a method for doubly-linked data visualization can be provided. The method can include rendering a data visualization in a data visualization service user interface, identifying comments corresponding to the rendered data visualization, concurrently displaying the identified comments in the user interface, selecting a comment in the user interface, and replacing the rendered data visualization in the user interface with a different data visualization corresponding to the selected comment.1. A method for doubly-linked data visualization, the method comprising:
rendering a data visualization in a data visualization service user interface; identifying comments corresponding to the rendered data visualization; concurrently displaying the identified comments in the user interface; selecting a comment in the user interface; and, replacing the rendered data visualization in the user interface with a different data visualization corresponding to the selected comment. 2. The method of claim 1, wherein rendering a data visualization in a data visualization service user interface, comprises:
uploading a data subset from over a computer communications network; selecting a data visualization type for the uploaded data subset; generating a data visualization of the selected data visualization type for the uploaded data subset; and, displaying the generated data visualization in the user interface. 3. The method of claim 2, further comprising:
bookmarking different data visualizations for the uploaded data subset; displaying different bookmarks for the different data visualizations in the user interface; selecting one of the different bookmarks; and, replacing the rendered data visualization in the user interface with a different data visualization corresponding to the selected one of the different bookmarks. 4. The method of claim 1, wherein identifying comments corresponding to the rendered data visualization, comprises identifying comments corresponding to visible data in the rendered data visualization 5. The method of claim 1, wherein identifying comments corresponding to the rendered data visualization, comprises identifying comments corresponding to hash value computed for visible data in the rendered data visualization 6. The method of claim 2, wherein displaying the generated data visualization in the user interface, comprises displaying the generated data visualization in a Web page in a content browser. 7. The method of claim 1, further comprising:
composing a comment pertaining to the rendered data visualization in the user interface; associating the composed comment with the rendered data visualization in the user interface; and, displaying the composed comment responsive to a display of the rendered data visualization in the user interface. 8. A data visualization data processing system comprising:
a server; a data visualization processor executing in the server; a data visualization service coupled to the data visualization processor and executing in the server; and, doubly-linked visual discussions logic coupled to the data visualization service, the logic comprising program code enabled to identify comments in a user interface for the data visualization service corresponding to a rendered data visualization, to concurrently displaying the identified comments in the user interface, and to replace the rendered data visualization in the user interface with a different data visualization corresponding to a selected comment in the user interface. 9. The system of claim 8, wherein the user interface is a Web page. 10. The system of claim 8, further comprising a bookmark view comprising a plurality of selectable bookmarks each of the bookmarks corresponding to a different data visualization for an uploaded data set. 11. A computer program product comprising a computer usable medium embodying computer usable program code for doubly-linked data visualization, the computer program product comprising:
computer usable program code for rendering a data visualization in a data visualization service user interface; computer usable program code for identifying comments corresponding to the rendered data visualization; computer usable program code for concurrently displaying the identified comments in the user interface; computer usable program code for selecting a comment in the user interface; and, computer usable program code for replacing the rendered data visualization in the user interface with a different data visualization corresponding to the selected comment. 12. The computer program product of claim 11, wherein the computer usable program code for rendering a data visualization in a data visualization service user interface, comprises:
computer usable program code for uploading a data subset from over a computer communications network; computer usable program code for selecting a data visualization type for the uploaded data subset; computer usable program code for generating a data visualization of the selected data visualization type for the uploaded data subset; and, computer usable program code for displaying the generated data visualization in the user interface. 13. The computer program product of claim 12, further comprising:
computer usable program code for bookmarking different data visualizations for the uploaded data subset; computer usable program code for displaying different bookmarks for the different data visualizations in the user interface; computer usable program code for selecting one of the different bookmarks; and, computer usable program code for replacing the rendered data visualization in the user interface with a different data visualization corresponding to the selected one of the different bookmarks. 14. The computer program product of claim 11, wherein identifying comments corresponding to the rendered data visualization, comprises identifying comments corresponding to visible data in the rendered data visualization 15. The computer program product of claim 11, wherein identifying comments corresponding to the rendered data visualization, comprises identifying comments corresponding to hash value computed for visible data in the rendered data visualization 16. The computer program product of claim 12, wherein the computer usable program code for displaying the generated data visualization in the user interface, comprises computer usable program code for displaying the generated data visualization in a Web page in a content browser. 17. The computer program product of claim 11, further comprising:
computer usable program code for composing a comment pertaining to the rendered data visualization in the user interface; computer usable program code for associating the composed comment with the rendered data visualization in the user interface; and, computer usable program code for displaying the composed comment responsive to a display of the rendered data visualization in the user interface. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.